Cod sursa(job #2373968)
Utilizator | Data | 7 martie 2019 16:16:53 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <bits/stdc++.h>
using namespace std;
char vaz[2000010];
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int n,ans=0;
scanf("%d",&n);
for(int i=2;i<=n;i++)
if(!vaz[i])
{
ans++;
for(long long j=1LL*i*i;j<=n;j+=i) vaz[j]=1;
}
printf("%d",ans);
return 0;
}