1、#include int main() double x; cinx; double sum = 1; double t = x; int i = 2; while (abs(t) 1e-8) sum += t; t *= (-1)*x/i; i +; cout.precision(8);fixedx=x, sum=sum 1e-8;i +) double x,sum = 1,t; t = x;t *= (-1)*x/i+)iomanip double sum = 1,item = -1; for (int i = 1;abs(item) item *= (-1)*x/i; sum += it
2、em;setprecision(8)1e-8;n+,sign *= -1) po= pow(x,n); item=sign*po/(fact(n);js=setiosflags(ios:fixed)int fact(int n) if(n=1) return(1); else return(fact(n-1)*n);/练习二第02题。/1!+2!+3!+.+12! int sum = 0; for(int i=1;i = 12; int t = 1; for (int j = 1;j = i; + j) t = t * j; sum = sum + t;1!= for(int i = 1,t
3、= 1;t *= + i)+.+n! int n,s,i,t;please input a integer n: n; s=0; t=1; for(i=1;i=n;i+) t *= i; s += t;+.+n!s/练习二第03题。/求“水仙花数”。 int n,a,b,c; for(n = 100;n 1000;n +) a = n/100; b = n%100/10; c = n%10; if(a*a*a + b*b*b + c*c*c = n) cout is a narcissus number. for(int i = 1;= 9; for (int j =0;j +) for (i
4、nt k = 0;k k +) int a = 100*i + 10*j + k; if (i*i*i + j*j*j + k*k*k = a) couta /练习二第04题。/求1000“完数”。 int n,a,sum; for(n = 1;= 1000; for(a = 1,sum = 0;a = n/2;a +) if(!(n%a) sum += a; if(sum = n) cout is a wanshu. int sum = 1; for (int j = 2;= i/2; if (i % j = 0) sum += j; if (sum = i)/=/练习二第05题。/求3位对
5、称素数。/-bool isPrime(int n) n;+ i) if (n % i = 0) return false; return true;/- for (int i = 100; if (i/100 = i%10) & isPrime(i)是一个对称的素数!/= int m = sqrt(double(n); for (int i = 3;= m;i += 2) for (int j = 0;+ j) int k = 101*i + 10*j; if (isPrime(k)k /包含数学运算的函数头文件 /使用标准的命名空间int isPrime(int a);/判断是否为素数的函数
6、声明 int num; int i,j,k; /i,j,k分别代表百位、十位、个位的位数 for(num = 100;num num +) i = num/100; j = (num - i*100)/10; k = (num - i*100 - j*10)/1; /当然这里可以不用除以1 if(i = k)&isPrime(num)num= 1;day -) former = (beh + 1)*2; beh = former;猴子共摘下桃子:former int peachs = 1; 10; peachs = (peachs + 1)*2;peachs= 10; coutj -)string(10 -j,string(2*j - 1, for(int i = 1,j = 1;= 19;+ i,j = (i 10) ? i:20-i)string(10 - j,
copyright@ 2008-2022 冰豆网网站版权所有
经营许可证编号:鄂ICP备2022015515号-1