提交时间:2024-06-10 10:01:11

运行 ID: 150950

#include<bits/stdc++.h> typedef long long ll; using namespace std; int main(){ int n;cin>>n; if(n<=4){ if(n==2) cout<<0<<endl; else cout<<max(n-1,0)<<endl; return 0; } vector<int>v; int sum=0; for(int i=2;i<=n;i++){ if(sum+i<=n) v.push_back(i),sum+=i; else break; } int tmp=n-sum; ll res=1; /// cout<<tmp<<endl; /// cout<<v.size()<<endl; for(int i=v.size()-1;i>=0;i--){ if(tmp>0) v[i]++,tmp--; else break; } int ans=0; for(auto tt:v){ ///cout<<tt<<" "; res*=tt; ans+=tt; } cout<<res<<endl; /// cout<<ans<<endl; return 0; }