Cod sursa(job #2253332)
Utilizator | Data | 3 octombrie 2018 21:25:29 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int n; cin>>n;
vector<bool>p(n+1);
for(int i=2;i<=n;i++)
p[i]=1;
for(int i=1;i*i<=n;i++)
if(p[i])
for(int j=i*i;j<=n;j+=i)
p[j]=0;
int ans=0;
for(int i=1;i<=n;i++) ans+=p[i];
cout<<ans<<"\n";
return 0;
}