Cod sursa(job #2152238)
| Utilizator | Data | 5 martie 2018 12:59:56 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
#include <bitset>
#define MAXN 2000005
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bitset <MAXN> dp;
inline void Read() {
int N, sol = 0;
fin >> N;
for (int i = 2; i <= N; i++) {
if (!dp[i]) {
for (int j = 2 * i; j <= N; j += i) {
dp[j] = 1;
}
sol++;
}
}
fout << sol << "\n";
}
int main () {
Read();
fin.close(); fout.close(); return 0;
}
