Cod sursa(job #1266263)
Utilizator | Data | 18 noiembrie 2014 15:50:25 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
bool ok[100000000];
int n, nr = 1;
void ciur()
{
long i, j;
for(i = 3; i <= n; i+=2)
if(!ok[i])
{
nr ++;
for(j = i* i ; j<=n; j+= 2 * i)
ok[j] = 1;
}
}
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
f >> n;
ciur();
g << nr;
}