7th_F
这道题目的解题思路是动态规划，通过N和K进行状态转移#include <cstdio>#include <cmath>int a;int n,k;void work(){a=1;for(int i=2;i<=n;i++){for(int j=0;j<=(i+1)*i/2;j++){a=0;if((i+j)<=(i-1)*i/2){a+=a;}if(j!=0){if(i>=j)a+=a;if(i<=j)a+=a;}//printf("%d %d %d\n",i,j,a);}}}int main(){scanf("%d%d",&n,&k);if(k>(n+1)*n/2){printf("0\n");}else{work();printf("%d\n",a);}return 0;}
页:
[1]