Cod sursa(job #2522349)
Utilizator | Data | 12 ianuarie 2020 13:43:32 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int n, nr=0;
bool ciur[2000000];
int main()
{
in>>n;
for(int i=2; i*i<=n; i++)
if(!ciur[i])
for(int j=i+i; j<=n; j+=i)
ciur[j]=1;
for(int i=2; i<=n; i++)
if(!ciur[i])
nr++;
out<<nr;
in.close();
out.close();
return 0;
}