Cod sursa(job #2517929)
Utilizator | Data | 4 ianuarie 2020 15:28:35 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
//#include <iostream>
#include <bits/stdc++.h>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
const int Max=2000005;
bool viz[Max]; int n,nr;
int main()
{
in>>n;
for(int i=3;i*i<=n;i++)
if(!viz[i])
for(int d=3*i;d<=n;d+=2*i)
viz[d]=1;
if(n>=2) nr++;
for(int i=3;i<=n;i+=2)
if(!viz[i]) nr++;
out<<nr;
return 0;
}