Cod sursa(job #911263)
Utilizator | Data | 11 martie 2013 14:35:57 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <cstdio>
using namespace std;
int n;
int nr;
int a[2000010];
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d", &n);
for(int i = 2; i <= n; ++ i){
if(a[i] == 0){
nr ++;
int j = i + i;
while(j <= n){
a[j] = 1;
j += i;
}
}
}
printf("%d\n", nr);
return 0;
}