小猴打架
Time Limit: 5 Sec Memory Limit: 162 MBSubmit: 709 Solved: 512
[Submit][Status][Discuss]
Description
Input
Output
Sample Input
Sample Output
HINT
50%的数据N<=10^3。
100%的数据N<=10^6。
1 #include<cstring> 2 #include<cmath> 3 #include<algorithm> 4 #include<iostream> 5 #include<cstdio> 6 7 using namespace std; 8 const int MOD=9999991; 9 10 int n; 11 long long ans=1; 12 13 int main() 14 { 15 scanf("%d",&n); 16 for(int i=1;i<=n-2; i++) 17 ans=ans*n%MOD; 18 for(int i=1;i<=n-1;i++) 19 ans=ans*i%MOD; 20 printf("%lld",ans); 21 }