摘要： Problem Description“Well, it seems the first problem is too easy. I will let you know how foolish you are later.” feng5166 says. “The second problem i 阅读全文

摘要： 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 阅读全文

摘要： Problem DescriptionEverybody knows Fibonacci numbers, now we are talking about the Tribonacci numbers:T[0] = T[1] = T[2] = 1;T[n] = T[n - 1] + T[n - 2 阅读全文