Cod sursa(job #1086229)
Utilizator | Data | 17 ianuarie 2014 21:25:13 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <cstdio>
using namespace std;
int n, i, j, nr;
bool v[2000001];
int main(){
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf ("%d ", &n);
for(i = 2; i <= n; ++i)
if(!v[i]){
for(j = 2 * i; j <= n; j += i)
v[j] = 1;
++nr;
}
printf("%d\n", nr);
}