Cod sursa(job #2263397)
Utilizator | Data | 18 octombrie 2018 17:39:56 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
bool a[2000001];
int main()
{
int n,i,j,nrp=1,k=1,x,y,z,cont=0;
in >> n;
for(i=2;i<=n;i++)
{
a[i]=1;
}
for(i=2;i<=n;i++)
{
for(j=2;j*j<=n;j++)
{
a[i*j]=0;
}
}
for(i=2;i<=n;i++)
{
if(a[i]==1)
{
cont++;
}
}
out << cont;
return 0;
}