搜索资源列表
fib
- 定义：f0=f1=1, fn=fn-1+fn-2(n>=2)。{fi}称为Fibonacci数列。 输入n，求fn mod q。其中1<=q<=30000。 Input format： 第一行一个数T(1<=T<=10000)。 以下T行，每行两个数，n，q(n<=109, 1<=q<=30000)、 Output format： 文件包含T行，每行对应一个答案。
fib
- 此文件夹有两种代码 一为普通方法叠加 得出第n个斐波那契数 另一个用递归的方式得出-This folder there are two kinds of code to a draw for the general method of superposition of the first n-Fibonacci another way to draw recursive
Fib
- 斐波那契数列的测试驱动开发实例，包含测试代码和源代码-The Fibonacci series of test-driven development.
Fibonachi
- console application for solving fibunatsi. set number to check the corresponded fib number!!! nice to have tool in c#
fib
- Write a recursive function to obtain the first 25 numbers of a Fibonacci sequence. In a Fibonacci sequence the sum of two successive terms gives the third term. Following are the first few terms of the Fibonacci sequence: 1 1 2 3 5 8 13 21 34 5