Cod sursa(job #2035369)
| Utilizator | Data | 9 octombrie 2017 11:44:37 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
std::ifstream fi("ciur.in");
std::ofstream fo("ciur.out");
bool prime[2000000];
int main()
{
int n, number = 0;
fi>>n;
for(int i = 2; i<=n; ++i)
{
if(!prime[i])
{
++number;
for(int j = 2; i*j<=n; ++j)
{
prime[i*j] = 1;
}
}
}
fo<<number;
}
