Cod sursa(job #1075248)
Utilizator | Data | 8 ianuarie 2014 19:30:30 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
#include <bitset>
#define Nmax 2000099
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int N,nr;
bitset < Nmax > v;
int main()
{
f>>N;
for(int i=2;i<=N;++i)
if(!v[i])
{
++nr;// prim[nr]=i;
for(long long j=i; j<=N; j+=i )v[j]=1;
}
g<<nr<<'\n';
return 0;
}