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