Cod sursa(job #2432565)
Utilizator | Data | 24 iunie 2019 12:59:42 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,i,j,x,v[2000010],c;
int main()
{f>>n;
for(i=3;i<=n;i++)
{if(v[i]==0 && i%2!=0)
for(j=2*i;j<=n;j=j+i)
{v[j]=1;}
if(v[i]==0 && i%2!=0) {c++;}
}
g<<c+1;
return 0;
}