Обсуждение @ 1133. Последовательность Фибоначчи @ Timus Online Judge

Please help me Wa15, in c++ with BINARY SEARCH

Послано Fibo 24 июн 2010 19:14

Re: Please help me Wa15, in c++ with BINARY SEARCH

Послано Vladimir Yakovlev (USU) 24 июн 2010 20:05

Try this test:
1 1 3 2 2

Re: Please help me Wa15, in c++ with BINARY SEARCH

Послано Qafqaz_Ferhad Cebiyev 24 июн 2010 23:10

Oqromnaya Spasibo Vladimir Yakovlev. You are GREAT.

Re: Please help me Wa15, in c++ with BINARY SEARCH

Послано Marian Darius 30 окт 2012 01:34

What should it give you?

Re: Please help me Wa15, in c++ with BINARY SEARCH

Послано Eugene Gubernatorov 8 дек 2012 04:17

Regarding 1 1 3 2 2, it means that first element is 1, and third element is 2.
Since first+second=third, second is obviously 1. And that is the answer.
Howevewer, mine solution is okay with this test and still WA15 for now.

Re: Please help me Wa15, in c++ with BINARY SEARCH

Послано Aman 15 сен 2016 04:39

fibonacci(N) = Nth term in fibonacci series
fibonacci(N) = fibonacci(N - 1) + fibonacci(N - 2);
whereas, fibonacci(0) = 0 and fibonacci(1) = 1
http://www.techcrashcourse.com/2014/10/c-program-to-generate-fibonacci-series.html
http://www.techcrashcourse.com/2015/03/c-program-fibonacci-series-using-recursion.html

Обсуждение задачи 1133. Последовательность Фибоначчи