Cod sursa(job #1698779)
Utilizator | Data | 5 mai 2016 12:57:26 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<fstream>
#include<algorithm>
#include<queue>
#include<vector>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool D[2000010];
int main()
{
unsigned long long i,j, nr = 0, N;
in >> N;
for (i = 2;i <= N;++i)
{
if (!D[i])
{
++nr;
for (j = i*i;j <= N;j+=i)
D[j] = 1;
}
}
out << nr;
}