Cod sursa(job #243221)
| Utilizator | Data | 12 ianuarie 2009 14:32:14 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include<stdio.h>
#include<math.h>
int n,i,j,ok,nr;
char v[2000002];
int main (){
FILE *f = fopen("ciur.in","r");
fscanf(f,"%d",&n);
fclose(f);
// for(i=1;i<=n;i++)
// scanf("%d",&v[i]);
for(i=2;i<=n;i++) {
if (v[i]==0) {
nr++;
for (j = i+i; j<=n; j+=i)
v[j] = 1;
}
// ok=1;
// for(j=2;j<=n;j++){
// if(i%j==0)
// ok=0;
// nr=0;
// if(ok==1)
// v[k++]=i;
// nr++;
}
FILE *g = fopen("ciur.out","w");
fprintf(g,"%d",nr);
fclose(g);
return 0;
}
