#include <stdio.h>
int main()
{
    int n,i,j,m,k,a,w[100000];
    int b,c,d,e;
        scanf("%d",&e);
        for(d=1;d<=e;d++){
        scanf("%d %d %d",&n,&b,&c);
        w[0]=1;
        k=0;
        for(i=1;i<=n;i++)
        {
            m=0;
            for(j=0;j<=k;j++)
            {
                a=w[j]*i+m;
                m=a/10;
                w[j]=a%10;
            }
            while(m>0)
            {
                k++;
                w[k]=m%10;
                m=m/10;
            }
        }for(i=k;i>=k-b+1;i--)
            printf("%d",w[i]);
            printf(" ");
        for(i=c-1;i>=0;i--)
            printf("%d",w[i]);
        printf("\n");
   }
}
网站上就给了5000MS，要求求n！的前b位和后c位，如何优化

顶顶顶

你这速度已经很快了呀

[此贴子已经被作者于2020-12-2 02:57编辑过]