Cod sursa(job #2382588)
Utilizator | Data | 18 martie 2019 15:13:01 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
#define ll long long
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
ll n,v[2000001], sol;
void ciur()
{
for(int i = 2 ; i * i<= n; ++i)
if(v[i] == 0)
for( int j = i*2; j<=n ; j += i)
v[i] = 1,sol++;
}
int main()
{
f>>n;
ciur();
g << n - sol;
return 0;
}