Cod sursa(job #2244549)
Utilizator | Data | 23 septembrie 2018 00:34:44 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
///Ciurul lui Eratosthenes
bool v[2000001];
int main()
{
int x, i=3, j, nr=1;
fin >> x;
for (i; i<=x; i+=2)
{
if (v[i] == 0)
{
nr++;
for (j=i+i+i; j<=x; j+=i+i+i)
v[j]=1;
}
}
fout << nr;
return 0;
}