| Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|
| 3486 | OscarWLY | 最大价值 | C++ | Runtime Error | 0 MS | 324 KB | 444 | 2023-01-08 15:41:45 |
#include<bits/stdc++.h> using namespace std; int main() { int n,m; int sum; int v; int dp[35][630]; cin>>n>>m; sum=(1+n)*n/2; v=(sum-m)/2; for(int i=0;i<=35;i++) dp[i][0]=1; if(m>sum||(sum-m)%2!=0) { cout<<0; return 0; } for(int i=1;i<=n;i++) { for(int j=1;j<=v;j++) { if(j>=i) dp[i][j]=dp[i-1][j-i]+dp[i-1][j]; if(j<i) dp[i][j]=dp[i-1][j]; } } cout<<dp[n][v]; return 0; }