摘要：
Description杭州有N个景区，景区之间有一些双向的路来连接，现在8600想找一条旅游路线，这个路线从A点出发并且最后回到A点，假设经过的路线为V1,V2,....VK,V1,那么必须满足K>2,就是说至除了出发点以外至少要经过2个其他不同的景区，而且不能重复经过同一个景区。现在8600需要你... 阅读全文
摘要：
DescriptionDandelion's uncle is a boss of a factory. As the spring festival is coming , he wants to distribute rewards to his workers. Now he has a tr... 阅读全文
摘要：
Description有N个比赛队（1#include #include using namespace std;const int N=510;int i,j,k,m,n;int map[N][N],indegre[N];void topo(){ for(i=1;i<=n;i++) f... 阅读全文
摘要：
Problem DescriptionAs we all known , the Fibonacci series : F(0) = 1, F(1) = 1, F(N) = F(N - 1) + F(N - 2) (N >= 2).Now we define another kind of Fibo... 阅读全文
摘要：
Description我们定义斐波那契数列如下：f1=1f2=2f(n)=f(n-1)+f(n-2)(n>=3)现在，给定两个数a和b，计算有多少个斐波那契数列中的数在a和b之间（包含边界）。Input输入包含多组测试数据，每组测试数据都是两个非负整数a和b，当a和b都等于0时，程序结束。0#inc... 阅读全文
摘要：
DescriptionThe Fibonacci sequence is the sequence of numbers such that every element is equal to the sum of the two previous elements, except for the ... 阅读全文
摘要：
Description2007年到来了。经过2006年一年的修炼，数学神童zouyu终于把0到100000000的Fibonacci数列(f[0]=0,f[1]=1;f[i] = f[i-1]+f[i-2](i>=2))的值全部给背了下来。接下来，CodeStar决定要考考他，于是每问他一个数字，他... 阅读全文
摘要：
A Fibonacci sequence is calculated by adding the previous two members the sequence, with the first two members being both 1.F(1) = 1, F(2) = 1, F(3) =... 阅读全文
摘要：
As we know , the Fibonacci numbers are defined as follows:""""Given two numbers a and b , calculate. """"InputThe input contains several test cases. E... 阅读全文
摘要：
Maybe ACMers of HIT are always fond of fibonacci numbers, because it is so beautiful. Don't you think so? At the same time,fishcanflyalways likes to c... 阅读全文