Cod sursa(job #2344569)
Utilizator | Data | 15 februarie 2019 11:29:14 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n, m, i, j, nr;
char ciur[2000005];
int main()
{
fin>>n;
ciur[0]=ciur[1]=1;
for(i=2;i*i<=2000000;i++)
if(ciur[i]==0)
for(j=2;j*i<=2000000;j++)
ciur[i*j]=1;
for(i=1;i<=n;i++)
if(ciur[i]==0)
nr++;
fout<<nr<<'\n';
return 0;
}