Cod sursa(job #2302285)
Utilizator | Data | 14 decembrie 2018 07:25:37 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 70 |
Compilator | c-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include<stdio.h>
int n,i,j,k,p[2000001];
int main()
{
freopen("ciur.in","r",stdin),freopen("ciur.out","w",stdout),scanf("%d",&n);
for(i=2;i*i<=n;i++)
if(!p[i])
for(j=2*i;j<=n;j+=i)
p[j]=1;
for(i=2;i<=n;i++)
if(!p[i])
k++;
printf("%d",k);
}