Cod sursa(job #2381652)
Utilizator | Data | 17 martie 2019 11:44:51 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,nr;
bool b[2000001];
void ciurul()
{
for(int i=2;i*i<=n;i++)
if(!b[i])
for(int j=i*i;j<=n;j+=i) b[j]=1;
}
int main()
{
f>>n;
ciurul();
for(int i=2;i<=n;i++)
if(!b[i]) nr++;
g<<nr<<'\n';
return 0;
}