Cod sursa(job #2594496)
Utilizator | Data | 6 aprilie 2020 09:45:33 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n, nr, i, j;
bool c[2000001];
int main()
{
fin>>n;
c[1]=1;
for(i=2; i*i<=n; i++)
if(c[i]==0)
{
for(j=i*i; j<=n; j=j+i)
c[j]=1;
}
for(i=1; i<=n; i++)
if(c[i]==0) nr++;
fout<<nr;
return 0;
}