Cod sursa(job #1824981)
Utilizator | Data | 8 decembrie 2016 17:21:00 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <stdio.h>
#include <stdlib.h>
int v[10000001];
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int n,k=0,j,i;
scanf("%d",&n);
for(i=2;i<=n;i++)
{
if(v[i]==0)
{
j=1;
k++;
while(i*j<=n)
{
v[i*j]=1;
j++;
}
}
}
printf("%d ",k);
return 0;
}