Cod sursa(job #2252011)
Utilizator | Data | 2 octombrie 2018 11:32:56 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | musai_must | Marime | 0.45 kb |
#include <fstream>
#define nr 2000001
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
unsigned int N, cont;
bool car[nr];
int main()
{
in >> N;
for(unsigned int i = 2; i <= N; ++i)
if(!car[i])
{
++cont;
unsigned int p = 1;
do{
car[p * i] = 1;
++p;
}while(i * p <= N);
}
out << cont;
return 0;
}