Cod sursa(job #2925686)
Utilizator | Data | 15 octombrie 2022 21:24:10 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n;
map<long long, bool>m;
inline void solve()
{
m[0] = m[1] = 1;
int ans = 0;
for(int i=2;i<=n;++i)
{
if(!m[i])
{
ans++;
for(int j=2*i;j<=n;j+=i)
{
m[j] = 1;
}
}
}
fout << ans;
}
int main()
{
fin >> n;
solve();
}