Cod sursa(job #2211173)
Utilizator | Runcan Alexandru Alex03 | Data | 9 iunie 2018 14:44:42 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int n,prime[2000001],nr = 0;
int main ()
{
fin >> n;
for (int i = 2; i <= n; i++)
{
prime[i] = 1;
}
for (int i = 2; i <= n; i++)
{
if (prime[i] > 0)
{
nr++;
for (int j = i + i; j <= n; j += i)
{
prime[j] = 0;
}
}
}
fout << nr;
return 0;
}