Cod sursa(job #2114962)
Utilizator | Data | 26 ianuarie 2018 09:37:01 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,i,j,cont;
bool p[2000005];
int main()
{
fin>>n;
for(i=2;i<=n;i++)
{
if(p[i]==0)
{
cont++;
for(j=1;j<=n/i;j++)
{
p[i*j]=1;
}
}
}
fout<<cont;
return 0;
}