Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|
20408 | dulingxi | 放苹果 | C++ | Wrong Answer | 0 MS | 256 KB | 453 | 2023-06-17 11:14:55 |
#include<bits/stdc++.h> using namespace std; int a[20][20]; int f(int m,int n){ int i,j; for(i=1;i<=n;i++){ a[0][i]=1; } for(i=1;i<=m;i++){ a[i][1]=1; } for(i=1;i<=m;i++){ for(j=2;j<=n;j++){ if(i<j){ a[i][j]=a[i][i]; } else{ a[i][j]=a[i][j-1]+a[i-j][j]; } } } } int main(){ int m,n,i,j,k; cin>>k; for(i=1;i<=k;i++){ cin>>m>>n; f(m,n); cout<<a[m][n]; } return 0; }