Cod sursa(job #2980706)
| Utilizator | Data | 16 februarie 2023 19:08:53 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n, v[2000005];
int cnt;
void Ciur()
{
for(unsigned long long int i = 2; i <= n ; i++)
{
if(v[i] == 1)continue;
else
{
cnt++;
for(unsigned long long int j = i*i ; j<=n ; j+=i)
{
v[j] = 1;
}
}
}
}
int main()
{
fin >> n;
Ciur();
fout << cnt;
return 0;
}
