Cod sursa(job #1807764)
Utilizator | Data | 16 noiembrie 2016 21:44:40 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool ciur[2000001];
int main()
{
int x, a, k=1, i;
fin>>x;
for(i=2; i<=x; i+=2)
ciur[i]=1;
for(a=3; a<=x; a+=2)
if(!ciur[a])
{
k++;
for(i=3*a; i<=x; i+=2*a)
ciur[i]=1;
}
fout<<k;
fout.close();
fin.close();
}