Cod sursa(job #157359)
Utilizator | Data | 12 martie 2008 23:15:21 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<stdio.h>
short int pr[2000000];
int main()
{
long int n,p,np,m;
FILE *f=fopen("ciur.in","r"),*g=fopen("ciur.out","w");
fscanf(f,"%ld",&n);
for(p=2;p<=n/2;)
{
for(m=2;p*m<=n;m++)
pr[m*n]=1;
while(pr[p]) p++;
}
for(p=2;p<=n;p++)
if(!pr[p]) np++;
fprintf(g,"%ld",np);
return 0;
}