https://acs.jxnu.edu.cn/problem/HDU1331
We all love recursion! Don't we?
Consider a three-parameter recursive function w(a, b, c):
if a <= 0 or b <= 0 or c <= 0, then w(a, b, c) returns:1
if a > 20 or b > 20 or c > 20, then w(a, b, c) returns:
w(20, 20, 20)
if a < b and b < c, then w(a, b, c) returns:
w(a, b, c-1) + w(a, b-1, c-1) - w(a, b-1, c)
otherwise it returns:
w(a-1, b, c) + w(a-1, b-1, c) + w(a-1, b, c-1) - w(a-1, b-1, c-1)
This is an easy function to implement. The problem is, if implemented directly, for moderate values of a, b and c (for example, a = 15, b = 15, c = 15), the program takes hours to run because of the massive recursion.
输入:
The input for your program will be a series of integer triples, one per line, until the end-of-file flag of -1 -1 -1. Using the above technique, you are to calculate w(a, b, c) efficiently and print the result.
输出:
Print the value for w(a,b,c) for each triple.
我们都喜欢递归!不是吗?考虑一个三参数递归函数w(a,b,c):如果a<=0或b<=0或c<=0,那么w(a,b,c)返回:1,如果a>20或b>20或c>20,那么w(a,b,c)返回w(20,20,20),如果a<b<c, w(a, b, c) 返回w(a, b, c-1) + w(a, b-1, c-1) - w(a, b-1, c),否则返回:w(a-1、b、c)+w(a-1、b-1、c)+w(a-1、b、<-1)-w(a-1、b-1、c-1)这是一个易于实现的函数。问题是,如果直接实现,对于a、b和c的中等值(例如,a=15,b=15,c=15),由于质量问题,程序需要数小时才能运行递归。
输入:
程序的输入将是一系列整数三元组,每行一个,直到文件结束标志为-1-1-1。使用上述方法,可以有效地计算w(a、b、c)并进行打印结果。
输出:
打印每个三重的w(a、b、c)的值。