Cod sursa(job #2265887)
Utilizator | Data | 21 octombrie 2018 20:43:10 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,i,j,nr,k;
bool p[2000005];
int main()
{
fin>>n;
for(i=2;i<=n;i++)
{
p[i]++;
}
for(j=2;j<=n;j++)
{
if(p[j]==1)
{
nr++;
for(k=2*j;k<=n;k=k+j)
{
p[k]=0;
}
}
}
fout<<nr;
return 0;
}