Cod sursa(job #2498641)
Utilizator | Data | 24 noiembrie 2019 09:57:24 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
#include <fstream>
int a[2000005];
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
int n, num=0;
f >> n;
for (int i = 2; i <= n; ++i)
{
if (a[i] == 0)
{
num++;
for (int j = i * i; j <= n; j += i)
{
a[j] = 1;
} } }
g << num << "\n";
return 0;
}