Cod sursa(job #155094)
Utilizator | Data | 11 martie 2008 18:43:45 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include<stdio.h>
char ciur[2000002];
long int n,i,sol,j,prim[1002];
int main()
{ FILE *f,*g;f=fopen("ciur.in","r");g=fopen("ciur.out","w");fscanf(f,"%ld",&n);
for(i=2;i<=n;i++)if(!ciur[i]){sol++;for(j=2*i;j<=n;j=j+i)ciur[j]=1;}
fprintf(g,"%ld\n",sol);
fcloseall();return 0;
}