信息学奥赛一本通 1192：放苹果 洛谷 P2386 放苹果 递推 (耙耙)

https://blog.csdn.net/qq_42815188/article/details/100185141

洛谷题解集说明 https://www.luogu.com.cn/problemnew/solution/P2386?page=1

#include<bits/stdc++.h>
using namespace std;
int n,m,t;
long long a[25][25];
void print(){
	for(int i=0;i<=m;i++){
		for(int j=0;j<=n;j++){
			cout<<a[i][j]<<" "; 
		}
		cout<<endl;
	}
	cout<<"-------------------------"<<endl;
}
int main(){
	freopen("cpp.in","r",stdin);
	freopen("cpp.out","w",stdout);
	cin>>t;
	a[0][0] = 0;
//	print();
	while(t--){	
		cin>>m>>n;	
		for(int j=0;j<=n;j++){
			a[0][j] = 1;
			a[1][j] = 1;
		}
		for(int i=0;i<=m;i++){ 
			a[i][0] = 0;
			a[i][1] = 1;
		}	
		for(int i=2;i<=m;i++){
			for(int j=2;j<=n;j++){
				if(i>=j){
					a[i][j] = a[i-j][j] + a[i][j-1];
				}else{
					a[i][j] = a[i][i];
				}
	//			print();
			}
		}
		cout<<a[m][n]<<endl;
	}
//	print();
	
	
	return 0;
}