Cod sursa(job #2163308)
Utilizator | Data | 12 martie 2018 17:42:37 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,i,d,s,nr;
char ciur[2000001];
int main()
{
ciur[0]=1;
ciur[1]=1;
for(i=2;i*i<=2000000;i++)
{
if(ciur[i]==0)
{
for(d=i*i;d<=2000000;d=d+i)
{
ciur[d]=1;
}
}
}
fin>>n;i=0;nr=0;
while(n>=i){if(ciur[i]==0)nr++;i++;}
fout<<nr;
return 0;
}