public class Main{ public static void main(String[] args) { Scanner sc = new Scanner(System.in); while(sc.hasNext()){ int m = sc.nextInt(); int n = sc.nextInt(); int[][] f = new int[m+1][n+1]; /* * 设f[m][n]为m个苹果,n个盘子时,有几种放法。 * f[m][n]分情况讨论: * 一、当m<n,苹果少于盘子,则一定有空的盘子,所以f...