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