Cod sursa(job #2723424)
Utilizator | Data | 14 martie 2021 00:39:06 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,a[2000005],nr=1;
void cit()
{
f>>n;
}
void ciur()
{
for(int i=3;i*i<=n;i+=2)
if(!a[i])
for(int j=i+i;j<=n;j+=i)
a[j]=1;
}
void nrprime()
{
for(int i=3;i<=n;i+=2)
if(!a[i])
nr++;
}
int main()
{
cit();
ciur();
nrprime();
g<<nr;
return 0;
}