Cod sursa(job #1863991)
Utilizator | Data | 31 ianuarie 2017 13:15:48 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int ciur[2000001];
int main()
{
int n,nr = 0;
in>>n;
for (int i = 2; i * i <= n; ++i)
{
if (!ciur[i])
for (int j = i * i; j <= n; j += i)
ciur[j] = true;
}
for (int i = 2;i <= n;++i)
if (!ciur[i])
++nr;
out<<nr;
return 0;
}