Cod sursa(job #675850)
Utilizator | Data | 8 februarie 2012 12:55:27 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<cstdio>
FILE *f = fopen("ciur.in", "r");
FILE *g = fopen("ciur.out", "w");
bool a[2000001];
int main() {
int n;
fscanf(f, "%d", &n);
int s = 0;
for(int i = 2; i<=n; i++) {
if(a[i]) continue;
int x = i*2;
s++;
while(x <= n) {
a[x] = true;
x+=i;
}
}
fprintf(g,"%d", s);
}