| Time Limit: 1000MS | Memory Limit: 10000K | |
| Total Submissions: 25785 | Accepted: 16403 |
Description
Input
Output
Sample Input
1 7 3
Sample Output
8
Source
import java.util.*;
public class Main {
public static int f(int m,int n){
if(m<0) return 0;
if(m==0||n==1) return 1;//m=0每一个放一个正好放完,n=1最后仅仅剩一个盘子
return f(m-n,n)+f(m,n-1);
}
public static void main(String[] args) {
Scanner scan=new Scanner(System.in);
int t=scan.nextInt();
for(int i=0;i<t;i++){
int m=scan.nextInt();
int n=scan.nextInt();
System.out.println(f(m,n));
}
}
}
版权声明:本文博主原创文章。博客,未经同意不得转载。
原文:http://www.cnblogs.com/bhlsheji/p/4803223.html