Cod sursa(job #1033403)
Utilizator | Data | 16 noiembrie 2013 21:16:18 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<stdio.h>
bool poz[2500000];
long long n,k;
int main(){
int player_unu=0;
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%lld",&n);
for(long long i=2;i<=n;i++)
{
if(poz[i]==0)
{
for(long long j=2*i;j<2500000;j=j+i)
poz[j]=1;
k++;
}
}
printf("%lld",k);
return player_unu;
}