Cod sursa(job #1552142)
Utilizator | Data | 17 decembrie 2015 11:59:19 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool q[2000000];
int i,j,n,nr;
int main()
{
fin>>n;
for(i=2;i<=n;++i)
{
if(q[i]==0)
{
for(j=i;j+i<=n;j=j+i)
q[j]=1;
}
}
for(i=1;i<=n;++i)
{
if(q[i]==0)
nr++;
}
fout<<nr;
return 0;
}