Cod sursa(job #2618361)
Utilizator | Data | 24 mai 2020 18:41:28 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
//#include <iostream>
#include <fstream>
using namespace std;
char prim[2000005];
int main()
{
ifstream cin("ciur.in");
ofstream cout("ciur.out");
int i, n, nr=0;
cin >> n;
for(i=2; i<=n; i++)
prim[i] = 1;
for(i = 2; i<=n; i++)
{
if(prim[i]==true)
{
nr++;
for(int j=i+i; j<=n; j+=i)
prim[j]= 0;
}
}
cout << nr;
cin.close();
cout.close();
return 0;
}