1 solutions
-
0
C :
#include<stdio.h> #include<math.h> int isprime(int); int main() { int i,sum=0,count=0; for (i=2;i<=1000;i++) if (isprime(i)) { count++; sum=sum+i; } printf("%d\n%d\n",count,sum); } int isprime(int a) { int j; for(j=2;j<=sqrt(a);j++) if(a%j==0) return 0; return 1; }C++ :
#include<stdio.h> #include<math.h> int isprime(int); int main() { int i,sum=0,count=0; for (i=2;i<=1000;i++) if (isprime(i)) { count++; sum=sum+i; } printf("%d\n%d\n",count,sum); } int isprime(int a) { int j; for(j=2;j<=sqrt(a);j++) if(a%j==0) return 0; return 1; }
- 1
Information
- ID
- 17262
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By