Cod sursa(job #2404452)
Utilizator | Data | 12 aprilie 2019 19:59:22 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool v[2000001];
int main()
{
int n;
f>>n;
for(int i=2;i<=n;++i)
if(v[i]==0)
for(int j=2;i*j<=n;j++)
v[i*j]=-1;
int nr=0;
for(int i=2;i<=n;++i)
if(v[i]==0)
nr++;
g<<nr;
g.close();
return 0;
}