#include<iostream> #include<algorithm> #include<cmath> #include<string> #include<cstring> #include<iomanip> using namespace std; typedef long long ll; const int maxn = 100001; ll b[maxn], c[maxn]; #define p 9 #define m 1000000000 int main() { int n; cin >> n; int k = 0; b[k] = 1; for (int i = 1; i <= n; i++) { memset(c, 0, sizeof(c)); for (int j = 0; j <= k; j++) { c[j] += b[j] * i; if (c[j] / m > 0) k++; c[j + 1] = c[j] / m; c[j] %= m; } while (!c[k]) k--; for (int j = 0; j <= k; j++) b[j] = c[j]; } for (int j = k; j >= 0; j--) { if (j == k) cout << b[j]; else cout << setw(p) << setfill('0') << b[j]; } cout << endl; return 0; }
0.0分
2 人评分