Cod sursa(job #2357078)
| Utilizator | Data | 27 februarie 2019 09:25:55 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
const int VM = 2000001;
bool c[VM];
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{
int n;
in>>n;
for(int i=2; i*i<VM; i++)
{
if(!c[i])
{
for(int j=i*i; j<VM; j+=i)
{
c[j]=true;
}
}
}
int nr=0;
for(int i=2; i<=n; i++)
{
if(!c[i])
{
nr++;
}
}
out<<nr;
in.close();
out.close();
return 0;
}
