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