Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|
46499 | yuzhengxun | 求和比较 | C++ | Wrong Answer | 0 MS | 244 KB | 264 | 2024-05-04 10:01:51 |
#include<bits/stdc++.h> using namespace std; int n,m,c; void dfs(int n,int m){ if(n==0){ c++; }if(m>n){ return; }for(int i=m;i<=n;i++){ dfs(n-i,i+1); } } int main() { cin>>n>>m; m=(n*(n+1)/2-m)/2; dfs(m,1); cout<<c; return 0; }