Cod sursa(job #994725)
| Utilizator | Data | 6 septembrie 2013 10:05:29 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
# include <iostream># include <fstream># include <bitset>using namespace std; # define MAXN 2000003 ifstream f("ciur.in");ofstream g("ciur.out"); bitset<MAXN> prim; int main(){ int n, s = 0; f >> n; prim.set(); for (int i = 2; i <= n; i++) { if (prim[i] == true) { s++; for (int j = i + i; j <= n; j += i) { prim[j] = false; } } } g << s; return 0;}
