| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 133819 | mairuisheng | 最优分解 | C++ | Accepted | 100 | 0 MS | 244 KB | 359 | 2024-03-02 09:34:53 |
#include<bits/stdc++.h> using namespace std; typedef long long LL; int a[100]; LL unpack(int n) { int k=0; for(int i=2;n>a[k];i++) { a[++k]=i; n-=i; } if(n==a[k])a[k]++; for(int i=0;i<n;i++)a[k-i]++; LL sum=1; for(int i=1;i<=k;i++)sum*=a[i]; return sum; } int main() { int n; cin>>n; cout<<unpack(n)<<endl; return 0; }