Cod sursa(job #2363655)
Utilizator | Data | 3 martie 2019 14:39:38 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
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, c[2000000], i, j, nr;
int main()
{
fin>>n;
c[0]=1;
c[1]=1;
for(i=2; i<=n; i++)
{
if(c[i]==0)
{
for(j=2; j<=n/i; j++)
c[j*i]=1;
}
}
for(i=1; i<=n; i++)
{
if(c[i]==0)
nr++;
}
fout<<nr;
return 0;
}