Cod sursa(job #2065769)
| Utilizator | Data | 14 noiembrie 2017 10:25:40 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
#include <cstring>
using namespace std;
const int lim = 2000001;
bool prime[lim];
int ciur(int N)
{
int ans = 0;
for(int i = 2;i <= N;++i)
{
if(prime[i] == true)
{
++ans;
for(int j = i + i;j <= N;j += i)
{
prime[j] = false;
}
}
}
return ans;
}
int main()
{
ifstream in("ciur.in");
ofstream out("ciur.out");
int N;
in >> N;
out<<ciur(N)<<"\n";
in.close();
out.close();
}
