deff(m,n):if m ==0or n ==1:return1if m < n:return f(m, m)else:return(f(m, n-1)+f(m-n, n))whileTrue:try:
m,n =map(int,input().split())print(f(m,n))except:break
题目描述把m个同样的苹果放在n个同样的盘子里,允许有的盘子空着不放,问共有多少种不同的分法?(用K表示)5,1,1和1,5,1 是同一种分法。数据范围:0<=m<=10,1<=n<=10。本题含有多组样例输入。代码def f(m,n): if m == 0 or n == 1: return 1 if m < n: return f(m, m) else: return (f(m, n-1)+f(