[P1134]阶乘问题

原题链接

这个题
有点玄学

但是想想又有点道理
就是需要取模防炸
但是又不能让取模的数太小
不然会在进位时出现错误

#include<iostream>#include<cstring>#include<algorithm>#include<cstdio>#include<cmath>#include<queue>#include<vector>#include<climits>#include<string>#include<cstdlib>#include<ctime>#define LL long long#define MOD 1000000007#define pi 3.141592653589using namespace std;LL ans=1;int i,n;int main(){    scanf("%d",&n);    for(i=2;i<=n;i++)    {        ans=1ll*ans*i;        while(ans%10==0) ans/=10;        ans=ans%100000000;    }    ans=ans%10;    printf("%lld",ans);    return 0;}