Cod sursa(job #2690875)
Utilizator | Data | 26 decembrie 2020 12:35:08 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include<cstdio>
int n,c,i,j;
char p[2000001];
int main()
{
freopen("ciur.in","r",stdin),freopen("ciur.out","w",stdout),scanf("%d",&n);
for(i=2;i<=n;++i)
if(!p[i])
for(c++,j=i+i;j<=n;j+=i)
p[j]=1;
printf("%d",c);
}