/*
* 阶乘最后非零位 复杂度O(nlongn)
* 返回改为,n以字符串方式传入
*/
#define MAXN 10000constint mod[20] = {1, 1, 2, 6, 4, 2, 2, 4, 2, 8, 4, 4, 8, 4, 6, 8, 8, 6, 8, 2};
int lastDigit(char *buf)
{
intlen = (int)strlen(buf);
int a[MAXN], i, c, ret = 1;
if (len == 1)
{
return mod[buf[0] - '0'];
}
for (i = 0; i < len; i++)
{
a[i] = buf[len - 1 - i] - '0';
}
for (; len; len -= !a[len - 1])
{
ret = ret * mod[a[1] % 2 * 10 + a[0]] % 5;
for (c = 0, i = len - 1; i >= 0; i--)
{
c = c * 10 + a[i];
a[i] = c / 5;
c %= 5;
}
}
return ret + ret % 2 * 5;
}
n的阶乘的长度
#define PI 3.1415926int main()
{
int n, a;
while (~scanf(“%d", &n))
{
a = (int)((0.5 * log(2 * PI * n) + n * log(n) - n) / log(10));
printf("%d\n", a + 1);
}
return 0;
}