Cod sursa(job #1087458)
Utilizator | Data | 19 ianuarie 2014 14:12:25 | |
---|---|---|---|
Problema | Factorial | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.39 kb |
#include <stdio.h>
#include <math.h>
int x,n,i;
void n_pasi()
{
x=0;
for(i=1;i<=n;i++)
{
x+=floor(log10(i));
}
x++;
printf("\n%d",x);
}
void stirling()
{
x=0.5*log10(2*3.14*n) + n*log10(n/2.71828)+1; //x=0.5*log10(2*pi*n)+n*log10(n/e)+1;
printf("\n%d",x);
}
int main()
{
scanf("%d",&n);
stirling();
return 0;
}
//2.253