#include <stdio.h>
int main()
{
//main:calculate 1/1+1/2+1/3+....+1/n
printf("main:calculate 1/1+1/2+1/3+....+1/n\n");
printf("Input n(n must be a integer):\n");
int n;
scanf("%d",&n);
double i=1;double sum=0;
while(i<=n)
{
sum=sum+1.0/i;
i++;
}
printf("summary is %f\n",sum);
return 0;
}
#include <stdio.h>
int main()
{
//main:calculate 1^2+2^2+3^2+4^2+...+n^2
printf("calculate 1^2+2^2+3^2+4^2+...+n^2\n");
int n;
printf("Input an integer:\n");
scanf("%d",&n);
int i=1,sum=0;
while(i<=n)
{
sum=i*i+sum;
i++;
}
printf("summary is %d\n",sum);
return 0;
}
#include <stdio.h>
int main()
{
//main:calculate 1+3+5+..+m
printf("main:calculate 1+3+5+..+m\n");
printf("Input an odd integer\n");
int n;
scanf("%d",&n);
int i=1,sum=0;
while(i<=n)
{
sum=sum+i;
i=i+2;
}
printf("summary is %d",sum);
return 0;
}
#include <stdio.h>
int main()
{
//main:calculate 1-1/2+1/3-1/4+...+(-1)^m*(1/m)
printf("main:calculate 1-1/2+1/3-1/4+...+(-1)^m*(1/m)\n");
int n;
printf("Input an integer\n");
scanf("%d",&n);
int i=1,signal=1;
double sum=0;
while(i<=n)
{
sum=signal*1.0/i+sum;
i++;
signal=-signal;
}
printf("summary is %f\n",sum);
return 0;
}
#include <stdio.h>
int main()
{
//main:calculate 1*2*3*4*...*m
printf("main:calculate 1*2*3*4*...*m\n");
int n;
printf("Input an integer:\n");
scanf("%d",&n);
int i=1,product=1;
while(i<=n)
{
product=product*i;
i++;
}
printf("product is %d\n",product);
return 0;
}
#include <stdio.h>
#define eps 0.00001
int main()
{
//main:calculate approximation of pi/4
//pi/4=1-1/3+1/5-1/7... till the abs of last term is less than 0.00001
printf("main:calculate approximation of pi/4\n");
int i=1,signal=1;
double sum=0;
while(1.0/i>=eps)
{
sum=sum+1.0/i*signal;
i=i+2;
signal=-signal;
}
printf("summary is %f\n",sum);
return 0;
}
#include <stdio.h>
int main()
{
//main:print Fibonacci array from 1 to 10000
int s1=1,s2=1;
do
{
printf("%d\n",s1);
printf("%d\n",s2);
s1=s1+s2;
s2=s1+s2;
}
while(s2<=10000);
printf("%d\n",s1);
printf("%d\n",s2);
return 0;
}
#include <stdio.h>
int n_product(int n)
{
//n_product:calculate 1*2*3*4*...*n
int i=1;
int product=1;
while(i<=n)
{
product=product*i;
i++;
}
return product;
}
int main()
{
//main:calculate 1!+2!+3!+...+10!
int n=10;
int sum=0;
int i=1;
while(i<=n)
{
sum=sum+n_product(i);
i++;
}
printf("summary is %d\n",sum);
return 0;
}
#include <stdio.h>
int n_npower(int n)
{
//n_npower:calculate n^n
int i=1;
int product=1;
while(i<=n)
{
product=product*n;
i++;
}
return product;
}
int main()
{
//main:calculate 1^1+2^2+...+6^6;
int n=6;
int i;
int sum=0;
for(i=1;i<=n;i++)
{
sum=sum+n_npower(i);
}
printf("%d\n",sum);
return 0;
}