注意不能只保留每次的最后一位,会失真,要多保留几位
#include<cstdio>
#include<iostream>
#include<vector>
#include<queue>
#include<algorithm>
#include<string>
#include<cstdlib>
#include<map>
#include<set>
#include<cmath>
#include<cstring>
#include<cctype>
#include<climits>
#include<memory>
#include<climits>
#include<cstdlib>
using namespace std;
#define LL long long
#define INT (1<<31)-1;
LL a[10010];
int mod=10000000;
int main()
{
a[0]=1;
for(int i=1;i<=10000;i++)
{
a[i]=i*a[i-1];
while(a[i]%10==0)
a[i]/=10;
a[i]%=mod;
}
int n;
while(cin>>n)
{
printf("%5d -> %d\n",n,a[n]%10);
}
return 0;
}