Cod sursa(job #1934603)
Utilizator | Data | 21 martie 2017 17:50:25 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
bool c[2000005];
int main()
{
ifstream f("ciur.in"); ofstream g("ciur.out");
int nr,n,i,j;
f>>n;
nr = 1;
for(i = 3; i <= n; i+= 2)
{
c[i] = 1;
}
for(i = 3; i * i <= n; i += 2)
{
if(c[i])
{
++nr;
for(j = i * i; j <= n; j += i)
{
c[j] = 0;
}
}
}
g<<nr;
return 0;
}