Cod sursa(job #260222)
Utilizator | Data | 16 februarie 2009 20:22:12 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<stdio.h>
int v[2000001];
long long int i,j,n,k;
int main(){
FILE *f=fopen("ciur.in","r");
FILE *g=fopen("ciur.out","w");
fscanf(f,"%lld",&n);
for(i=2;i<=n;i++)
{if(!v[i])
{k++;
for(j=i*i;j<=n;j+=i)
v[j]=1;
}
}
fprintf(g,"%lld",k);
fclose(g);
fclose(f);
return 0;}