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