Cod sursa(job #387666)
Utilizator | Data | 28 ianuarie 2010 09:47:55 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<stdio.h>
FILE*f=fopen("ciur.in","r");
FILE*g=fopen("ciur.out","w");
char v[2000002];
int j,i,n,prime;
int main () {
fscanf(f,"%d",&n);
for(i=2;i<=n;i++){
if(v[i]==0){
for(j=i+i;j<=n;j+=i)
v[j]=1;
prime++;
}
}
fprintf(g,"%d",prime);
fclose(f);
fclose(g);
return 0;
}