Cod sursa(job #2461441)
Utilizator | Data | 25 septembrie 2019 18:21:03 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool ciur[2000005];
int nr,n;
int main()
{
f>>n;
for (int i=2; i*i<=n;i++)
if(ciur[i]==false)
for (int j=i*i;j<=n;j+=i)
ciur[j]=true;
for (int i=2;i<=n;i++)
if(ciur[i]==false)nr++;
g<<nr;
return 0;
}