Cod sursa(job #2566756)
Utilizator | Data | 3 martie 2020 02:06:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <bits/stdc++.h>
const int inf=2e9+3;
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int n;
cin>>n;
vector<bool>f(n+3,0);
int ans=0;
for(int i=2;i<=n;i++)
if(!f[i])
{
ans++;
for(int j=i*2;j<=n;j+=i) f[j]=1;
}
cout<<ans;
}