Cod sursa(job #1412467)
Utilizator | Data | 1 aprilie 2015 12:13:32 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
#include <bitset>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int N, sol;
bitset < 2000005 > viz;
void ciur()
{
++sol;
for (int i=3; i<=N; i+=2)
if (!viz.test(i))
{
++sol;
for (int j=i+i; j<=N; j+=i)
viz.set(j);
}
}
int main()
{
f>>N; ciur();
g<<sol<<'\n';
return 0;
}