Cod sursa(job #1904449)
Utilizator | Data | 5 martie 2017 15:55:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
#include <bitset>
using namespace std;
ifstream f ("ciur.in");
ofstream g ("ciur.out");
bitset <2000001> v;
int n,i,nr,j;
int main()
{
f>>n;
for(i=2;i<=n;++i)
{
if(!v[i])
{
++nr;
for(j=i+i;j<=n;j+=i) v[j]=1;
}
}
g<<nr;
return 0;
}