Cod sursa(job #2539551)
Utilizator | Data | 5 februarie 2020 22:48:46 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n, i, j, cnt;
bool ciur[2000001];
int main()
{
fin>>n;
ciur[0]=1; ciur[1]=1;
for(i=2;i*i<=n;i++)
if( !(ciur[i]) )
for(j=2;j<=n/i;j++) ciur[j*i]=1;
for(i=2;i<=n;i++) if( !(ciur[i]) ) cnt++;
fout<<cnt;
return 0;
}