Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 27

Torebay Aisultan

IT1-2202
Lab Work 3
1)
#include <iostream>
#include <math.h>
using namespace std;
int main()
{
int n,i;
double x,k,sum1,sum2,sum3;
cin >> x >> n;
i=1;
sum1=0;
sum2=0;
sum3=0;
do
{
k=x/i;
sum1=sum1+k;
i++;
}
while(i<=n);
for(i=1;i<=n;i++)
{
k=x/i;
sum2=sum2+k;}
i=1;
while(i<=n)
{
k=x/i;
sum3=sum3+k;
i++;
}
cout << sum1;
cout << sum2;
cout << sum3;
return 0;
}

2)
#include <iostream>
#include <math.h>
using namespace std;
int main()
{
int n,i;
double x,k,sum1,sum2,sum3;
cin >> x >> n;
i=1;
sum1=0;
sum2=0;
sum3=0;
do
{
k=x+cos(i*x)/2;
sum1=sum1+k;
i++;
}
while(i<=n);
for(i=1;i<=n;i++)
{
k=x+cos(i*x)/2;
sum2=sum2+k;}
i=1;
while(i<=n)
{
k=x+cos(i*x)/2;
sum3=sum3+k;
i++;
}
cout << sum1;
cout << sum2;
cout << sum3;
return 0;
}

3)
#include <iostream>
#include <math.h>
using namespace std;
int main()
{
int n, k;
double i,x,product1,product2,product3;
cin>>x>>n;
product1=1;
product2=1;
product3=1;
k=1;
do{
i=1+sin(k*x)/k;
product1=product1*i;
k++;
}while(k<=n);
for(k=1; k<=n;k++){
i=1+sin(k*x)/k;
product2=product2*i;
}
k=1;
while(k<=n){
i=1+sin(k*x)/k;
product3=product3*i;
k++;
}

cout << product1;


cout << product2;
cout << product3;
return 0;
}

4)
#include <iostream>
#include <math.h>
using namespace std;
int main()
{
int n, k;
double i,x,product1,product2,product3;
cin>>x>>n;
product1=1;
product2=1;
product3=1;
k=1;
do{
i=k/k+1-cos(fabs(x));
product1=product1*i;
k++;
}while(k<=n);
for(k=1; k<=n;k++){
i=k/k+1-cos(fabs(x));
product2=product2*i;
}
k=1;
while(k<=n){
i=k/k+1-cos(fabs(x));
product3=product3*i;
k++;
}

cout << product1;


cout << product2;
cout << product3;
return 0;
}

5)
#include <iostream>
#include <math.h>
using namespace std;
int main()
{
int n, k;
double i,x,product1,product2,product3;
cin>>x>>n;
product1=1;
product2=1;
product3=1;
k=1;
do{
i=(1-x)+1/pow((k-1)+1,2);
product1=product1*i;
k++;
}while(k<=n);
for(k=1; k<=n;k++){
i=(1-x)+1/pow((k-1)+1,2);
product2=product2*i;
}
k=1;
while(k<=n){
i=(1-x)+1/pow((k-1)+1,2);
product3=product3*i;
k++;
}

cout << product1;


cout << product2;
cout << product3;
return 0;
}

6)
#include <iostream>
#include <math.h>
using namespace std;
int main()
{
int n,i;
double x,k,sum1,sum2,sum3;
cin >> x >> n;
i=1;
sum1=0;
sum2=0;
sum3=0;
do
{
k=1/i+sqrt(fabs(x));
sum1=sum1+k;
i++;
}
while(i<=n);
for(i=1;i<=n;i++)
{
k=1/i+sqrt(fabs(x));
sum2=sum2+k;}
i=1;
while(i<=n)
{
k=1/i+sqrt(fabs(x));
sum3=sum3+k;
i++;
}
cout << sum1;
cout << sum2;
cout << sum3;
return 0;
}

7)
#include <iostream>
#include <math.h>
using namespace std;
int main()
{
int n,i;
double x,k,sum1,sum2,sum3;
cin >> x >> n;
i=1;
sum1=0;
sum2=0;
sum3=0;
do
{
k=x+sin(i*x)/3;
sum1=sum1+k;
i++;
}
while(i<=n);
for(i=1;i<=n;i++)
{
k=x+sin(i*x)/3;
sum2=sum2+k;}
i=1;
while(i<=n)
{
k=x+sin(i*x)/3;
sum3=sum3+k;
i++;
}
cout << sum1;
cout << sum2;
cout << sum3;
return 0;
}

8)
#include <iostream>
#include <math.h>
using namespace std;
int main()
{
int n,i;
double x,k,sum1,sum2,sum3;
cin >> x >> n;
i=1;
sum1=0;
sum2=0;
sum3=0;
do
{
k=1+sqrt(fabs(x)+pow(x,3))/i;
sum1=sum1+k;
i++;
}
while(i<=n);
for(i=1;i<=n;i++)
{
k=1+sqrt(fabs(x)+pow(x,3))/i;
sum2=sum2+k;}
i=1;
while(i<=n)
{
k=1+sqrt(fabs(x)+pow(x,3))/i;
sum3=sum3+k;
i++;
}
cout << sum1;
cout << sum2;
cout << sum3;
return 0;
}
9)
#include <iostream>
#include <math.h>
using namespace std;
int main()
{
int n, k;
double i,x,product1,product2,product3;
cin>>x>>n;
product1=1;
product2=1;
product3=1;
k=1;
do{
i=2*k/3*k+1-pow(cos(fabs(x)),2);
product1=product1*i;
k++;
}while(k<=n);
for(k=1; k<=n;k++){
i=2*k/3*k+1-pow(cos(fabs(x)),2);
product2=product2*i;
}
k=1;
while(k<=n){
i=2*k/3*k+1-pow(cos(fabs(x)),2);
product3=product3*i;
k++;
}
cout << product1;
cout << product2;
cout << product3;
return 0;
}

10)
#include <iostream>
#include <math.h>
using namespace std;
int main()
{
int n, k;
double i,x,product1,product2,product3;
cin>>x>>n;
product1=1;
product2=1;
product3=1;
k=1;
do{
i=1+(x+1)/pow((k-1)+3,2);
product1=product1*i;
k++;
}while(k<=n);
for(k=1; k<=n;k++){
i=1+(x+1)/pow((k-1)+3,2);
product2=product2*i;
}
k=1;
while(k<=n){
i=1+(x+1)/pow((k-1)+3,2);
product3=product3*i;
k++;
}

cout << product1;


cout << product2;
cout << product3;
return 0;
}

11)
#include <iostream>
#include <math.h>
using namespace std;
int main()
{
int n,i;
double x,k,sum1,sum2,sum3;
cin >> x >> n;
i=1;
sum1=0;
sum2=0;
sum3=0;
do
{
k=2*x/i;
sum1=sum1+k;
i++;
}
while(i<=n);
for(i=1;i<=n;i++)
{
k=2*x/i;
sum2=sum2+k;}
i=1;
while(i<=n)
{
k=2*x/i;
sum3=sum3+k;
i++;
}
cout << sum1;
cout << sum2;
cout << sum3;
return 0;
}

12)
#include <iostream>
#include <math.h>
using namespace std;
int main()
{
int n,i;
double x,k,sum1,sum2,sum3;
cin >> x >> n;
i=1;
sum1=0;
sum2=0;
sum3=0;
do
{
k=(3*x+sin(i*x))/3;
sum1=sum1+k;
i++;
}
while(i<=n);
for(i=1;i<=n;i++)
{
k=(3*x+sin(i*x))/3;
sum2=sum2+k;}
i=1;
while(i<=n)
{
k=(3*x+sin(i*x))/3;
sum3=sum3+k;
i++;
}
cout << sum1;
cout << sum2;
cout << sum3;
return 0;
}

13)
#include <iostream>
#include <math.h>
using namespace std;
int main()
{
int n, k;
double i,x,product1,product2,product3;
cin>>x>>n;
product1=1;
product2=1;
product3=1;
k=1;
do{
i=1+(cos(k*x))/(2*k);
product1=product1*i;
k++;
}while(k<=n);
for(k=1; k<=n;k++){
i=1+(cos(k*x))/(2*k);
product2=product2*i;
}
k=1;
while(k<=n){
i=1+(cos(k*x))/(2*k);
product3=product3*i;
k++;
}

cout << product1;


cout << product2;
cout << product3;
return 0;
}

14)
#include <iostream>
#include <math.h>
using namespace std;
int main()
{
int n, k;
double i,x,product1,product2,product3;
cin>>x>>n;
product1=1;
product2=1;
product3=1;
k=1;
do{
i=(2*k)/(k+8)-sin(fabs(x));
product1=product1*i;
k++;
}while(k<=n);
for(k=1; k<=n;k++){
i=(2*k)/(k+8)-sin(fabs(x));
product2=product2*i;
}
k=1;
while(k<=n){
i=(2*k)/(k+8)-sin(fabs(x));
product3=product3*i;
k++;
}

cout << product1;


cout << product2;
cout << product3;
return 0;
}

15)
#include <iostream>
#include <math.h>
using namespace std;
int main()
{
int n, k;
double i,x,product1,product2,product3;
cin>>x>>n;
product1=1;
product2=1;
product3=1;
k=1;
do{
i=((2-x)+8)/pow(((k-1)+3),2);
product1=product1*i;
k++;
}while(k<=n);
for(k=1; k<=n;k++){
i=((2-x)+8)/pow(((k-1)+3),2);
product2=product2*i;
}
k=1;
while(k<=n){
i=((2-x)+8)/pow(((k-1)+3),2);
product3=product3*i;
k++;
}
cout << product1;
cout << product2;
cout << product3;
return 0;
}

16)
#include <iostream>
#include <math.h>
using namespace std;
int main()
{
int n,i;
double x,k,sum1,sum2,sum3;
cin >> x >> n;
i=1;
sum1=0;
sum2=0;
sum3=0;
do
{
k=2/3*i+sqrt(fabs(x));
sum1=sum1+k;
i++;
}
while(i<=n);
for(i=1;i<=n;i++)
{
k=2/3*i+sqrt(fabs(x));
sum2=sum2+k;}
i=1;
while(i<=n)
{
k=2/3*i+sqrt(fabs(x));
sum3=sum3+k;
i++;
}
cout << sum1;
cout << sum2;
cout << sum3;
return 0;
}

17)
#include <iostream>
#include <math.h>
using namespace std;
int main()
{
int n,i;
double x,k,sum1,sum2,sum3;
cin >> x >> n;
i=1;
sum1=0;
sum2=0;
sum3=0;
do
{
k=(2*x+sin(i*x))/5;
sum1=sum1+k;
i++;
}
while(i<=n);
for(i=1;i<=n;i++)
{
k=(2*x+sin(i*x))/5;
sum2=sum2+k;}
i=1;
while(i<=n)
{
k=(2*x+sin(i*x))/5;
sum3=sum3+k;
i++;
}
cout << sum1;
cout << sum2;
cout << sum3;
return 0;
}
18)
#include <iostream>
#include <math.h>
using namespace std;
int main()
{
int n,i;
double x,k,sum1,sum2,sum3;
cin >> x >> n;
i=1;
sum1=0;
sum2=0;
sum3=0;
do
{
k=(8+sqrt(fabs(x)+pow(x,3)))/i;
sum1=sum1+k;
i++;
}
while(i<=n);
for(i=1;i<=n;i++)
{
k=(8+sqrt(fabs(x)+pow(x,3)))/i;
sum2=sum2+k;}
i=1;
while(i<=n)
{
k=(8+sqrt(fabs(x)+pow(x,3)))/i;
sum3=sum3+k;
i++;
}
cout << sum1;
cout << sum2;
cout << sum3;
return 0;
}

19)
#include <iostream>
#include <math.h>
using namespace std;
int main()
{
int n, k;
double i,x,product1,product2,product3;
cin>>x>>n;
product1=1;
product2=1;
product3=1;
k=1;
do{
i=1+(cos(k*x))/(2*k);
product1=product1*i;
k++;
}while(k<=n);
for(k=1; k<=n;k++){
i=1+(cos(k*x))/(2*k);
product2=product2*i;
}
k=1;
while(k<=n){
i=1+(cos(k*x))/(2*k);
product3=product3*i;
k++;
}

cout << product1;


cout << product2;
cout << product3;
return 0;
}
20)
#include <iostream>
#include <math.h>
using namespace std;
int main()
{
int n, k;
double i,x,product1,product2,product3;
cin>>x>>n;
product1=1;
product2=1;
product3=1;
k=1;
do{
i=(2*k)/(k+8)-sin(fabs(x));
product1=product1*i;
k++;
}while(k<=n);
for(k=1; k<=n;k++){
i=(2*k)/(k+8)-sin(fabs(x));
product2=product2*i;
}
k=1;
while(k<=n){
i=(2*k)/(k+8)-sin(fabs(x));
product3=product3*i;
k++;
}

cout << product1;


cout << product2;
cout << product3;
return 0;
}

You might also like