Cod sursa(job #674654)
Utilizator | Data | 6 februarie 2012 16:34:37 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <stdio.h>
FILE *c = fopen("ciur.in","r"),*s = fopen("ciur.out","w");
int n,prime=0,i,h;
char v[2000002];
int main()
{
fscanf(c,"%d",&n);
for(i=2;i<=n;i++)
if(v[i]==0)
{
prime++;
for(h=i+i;h<=n;h+=i)
v[h] = 1;
}
fprintf(s,"%d",prime);
fclose(c);
fclose(s);
return 0;
}