Cod sursa(job #388455)
Utilizator | Data | 30 ianuarie 2010 11:13:08 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include <stdio.h>
int n, i, j, v[2000001],nr;
int main (){
FILE *f, *g;
f=fopen("ciur.in","r");
g=fopen("ciur.out","w");
fscanf(f,"%d",&n);
for(i=2;i<=n;i++)
if(v[i]==0){
nr++;
for(j=2*i;j<=n;j=j+i)
v[j]=1;
}
fprintf(g,"%d",nr);
return 0;
}