Cod sursa(job #1316203)
Utilizator | Data | 13 ianuarie 2015 17:14:18 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
#include <bitset>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bitset <2000005> v;
int main()
{
int c=0,i,j,N;
f>>N;
for(i=2;i<=N;i++)
if(v[i]==0)
{
for(j=i+i;j<=N;j=j+i)
v[j]=1;
c++;
}
g<<c;
f.close(); g.close();
return 0;
}