提交时间:2024-03-02 10:04:59
运行 ID: 133864
#include <iostream> #define ll long long using namespace std; ll a[1100]; void f(ll n) { ll k = 0; for(ll i = 2; ; i++) { if(n < i) break; a[++k] = i; n -= i; } while(n > 0) { for(ll i = 0; i < n; i++) a[k - i]++; n -= k; } ll mul = 1; for(ll i = 1; i <= k; i++) mul *= a[i]; cout << mul << endl; } int main() { ll n; cin >> n; f(n); return 0; }