Cod sursa(job #1188594)
Utilizator | Serban Cercelescu abanu10000 | Data | 19 mai 2014 23:39:21 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <cstdio>
#include <cmath>
using namespace std;
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
register int n,i,j,l,e;
e=0;
scanf("%d",&n);
bool ciur[n];
ciur[1]=false;
for(i=2;i<=n;i++){
ciur[i]=true;
}
l=sqrt(n)+1;
for(i=2;i<=l;i++){
for(j=i;j+i<=n;j+=i){
ciur[j]=false;
}
}
for(i=1;i<=n;i++){
if(ciur[i]==true)
e++;
}
printf("%d %d",e,l);
return 0;
}