Cod sursa(job #1569192)
| Utilizator | Data | 15 ianuarie 2016 08:22:49 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
#include <bitset>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bitset <2000005> t;
int main()
{
int n,cnt=0,i,j;
fin>>n;
fin.close();
t[1]=t[0]=1;
for(i=4;i<=n;i+=2) t[i]=1;
for(i=3;i*i<=n;i+=2)
if(t[i]==0)
for(j=i*i;j<=n;j=j+2*i)
t[j]=1;
for(i=1;i<=n;i++)
if(t[i]==0) cnt++;
fout<<cnt<<"\n";
fout.close();
return 0;
}
