Cod sursa(job #1551907)
Utilizator | Data | 16 decembrie 2015 21:08:54 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<fstream>
#include<bitset>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int nr,n,i,j;
bitset<2000001>v;
int main()
{ fin>>n;
nr=0;
for(i=2;i<=n;i++)
{
if (v[i]==0)
{
nr++;
for(j=i*2;j<=n;j=j+i)
v[j]=1;
}
}
fout<<nr;
}