解题思路:预处理一下阶乘即可
C++代码
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 25;
int fac[N];
int t, n;
void init()
{
fac[0] = 1;
for (int i = 1; i < N; i ++ ) fac[i] = fac[i - 1] * i;
}
signed main()
{
init();
cin >> t;
while (t -- )
{
cin >> n;
cout << fac[n] << endl;
}
return 0;
}