Problem Description Fibonacci numbers are nice simple integers. All of you are familiar with it, aren’t you? The Fibonacci sequence <F[n]> are defined by the recurrence: F[0]=0; F[1]=1; F[n]=F[n

B. Madoka nd the Elegant Gift time limit per test 1 second memory limit per test 256 megabytes Madoka’s father just reached 11 million subscribers on Mathub! So the website decided to send him a