Cod sursa(job #2276777)
Utilizator | Data | 5 noiembrie 2018 12:29:11 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
bool sir[2000005];
int main()
{
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int n,nr=0;
fin>>n;
for (int i=2; i<=n; i++)
sir[i]=true;
for (int i=2; i<=n; i++)
if (sir[i]==true)
{
nr++;
for (int j=i+i; j<=n; j+=i)
sir[j]=false;
}
fout<<nr;
return 0;
}