Cod sursa(job #1845674)
Utilizator | Data | 11 ianuarie 2017 19:37:21 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool v[100000000];
int main()
{
int i, n, nr=2, cont=1;
f>>n;
for(nr=2; nr<=n/2; nr++)
{
if(v[nr]==false)
{
cont++;
for(i=nr*2; i<=n; i+=nr)
{
v[i]=true;
}
}
}
g<<cont;
return 0;
}