版权声明: https://blog.csdn.net/blackneed/article/details/82016387
大菲波数Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 23618 Accepted Submission(s): 8467 Problem Description Fibonacci数列,定义如下: Input 输入第一行为一个整数N,接下来N行为整数Pi(1<=Pi<=1000)。 Output 输出为N行,每行为对应的f(Pi)。 Sample Input 5 1 2 3 4 5 Sample Output 1 1 2 3 5 Ac代码: |