主算法就是费波纳西数列，即Fib[j]=Fib[j-1]+Fib[j-2] 由于从地第0阶到第N阶的总共方法就是服从费波纳西数列的，故可以用该算法求出总共的方法数。用一个数组Redr[]接收输入数据，即用while循环实现数据输入，用for循环实现费波纳西数列即Fib[]数组，用Fib[]数组对Redr[]数组中的每个数据成员进行求总的方法数，然后用remember[]数组存储每组输入数据的总方法数，最后用for循环输出-Main algorithm is Feibonaxi series that Fib [j] = Fib [j-1]+ Fib [j-2]　the order from to 0 to N is to obey the order of the total Feibonaxi series, so The algorithm can be obtained by total number of methods. With an array Redr [] to receive input data, ie data input with a while loop with a for loop to achieve Feibonaxi series that Fib [] array, with Fib [] array to Redr [] array is evaluated for each data member the total number of ways, and then remember [] array of input data stored in each of the total number of ways, with the final output for loop