湖南省计算机二级试题 程序题（新）.doc

#include #include #include int prime(int n) int yes, i; if(n=1) return 0; yes=1; for(i=2; i=sqrt(n); i+) if(n%i=0) yes=0; break; /*下行有错*/ return 0;（return yes;）main() int count=0, i; for(i=1;i=760; i+) if(prime(i) /*下行有错*/ count+=i;(count+=1;) printf(%dn, count);#include #include #include main() int sum; int n,m,s,k; sum=0; for (n=3;n=1000;n+) s=1; k=n/2+1; for (m=2;mk;m+) if (fmod(n,m)=0) s=s+m; if (s=n) sum+=n; printf(%d,sum);#include #include #include main() float s=0,n;for(n=1;n=50;n+)s=s+n/(2*n-1);printf(%7.2f,s);#include #include main() double f1,f2; int i; f1=1;f2=1; for (i=1;i=24;i+) f1=f1+f2; f2=f2+f1; /*下行有错*/ printf(%12.0lf,f1); printf(%12.0lf,f2);#include #include #include main()int i;int count;count=0;for ( i=1;i=600;i+) if ( i%5=0 |i%6=0 )count=count+1; printf(%d,count);#include #include #include int prime(int n) int yes, i; if(n=1) return 1; yes=1; for(i=2; i=sqrt(n); i+) if(n%i=0) yes=0; break; return yes; main() int count=0, i; for(i=200;i=1000-2; i+) if(prime(i)& prime(i+2) count+; printf(%d, count);#include #include #include int prime(int n) int yes, i; if(n=1) return 1; yes=1; for(i=2; i=sqrt(n); i+) if(n%i=0) yes=0; break; return yes;main() int count=0, i; for(i=2;i=500; i+) if(prime(i) count+; printf(%d, count);#include #include #include main() float s=0, n; for(n=1;n=100; n+) s=s+(1/(2*n-1)-1/(2*n); printf(%7.3f, s);#include #include #include int fun(int high) int sum=0, n=0, j, yes; /*下行有错*/ while(high=2) | (n=2) & (n40) yes=1 ; for(j=2; j=sqrt(high); j+) if(high%j=0) yes=0; /*下行有错*/ continue; break; if(yes) sum+=high;n+; high-; return sum; main() printf(%d n,fun(1500); #include stdio.hmain()int n; float t,a=2,b=1,s=0; for(n=1;n10000) break; printf(%dn,sum);#include #include #include main() int sum; int i; sum=0; for (i=1;i=550;i+) if (fmod(i,3)=2 & fmod(i,5)=3) /*下行有错*/ sum+=1; sum+=i; printf(%dn,sum); #include #include #include main() int n,f=1;float s=0; for(n=1;n=30; n+) s=s+f*1.0/n; f=-f; printf(%7.2f, s);#include #include #include int fun(int high) int sum=0, n=0, j, yes; /*下行有错*/ while(high=2) | (n=2) & (n20) yes=1 ; for(j=2; j=sqrt(high); j+) if(high%j=0) yes=0; /*下行有错*/ continue; break; if(yes) sum+=high;n+; high-; return sum; main() printf(%d n,fun(1000); #include #include #include double fun(int n) double s=0.0;int i; for(i=1;i=n;i+) s+=log(1.0*i); s=sqrt(s); return s;main() clrscr(); printf(“%10.6f”,fun(40);#include #include #include int fun(int high) int sum=0, n=0, j, yes; /*下行有错*/ while(high=2) | (n40) yes=1 ; for(j=2; j=sqrt(high); j+) if(high%j=0) yes=0; /*下行有错*/ continue; if(yes) sum+=high;n+; high-; return sum; main() printf(%d n,fun(