BDIOI -2013/7

For students of class 9-10 (age 14-16)
User avatar
Fatin Farhan
Posts:75
Joined:Sun Mar 17, 2013 5:19 pm
Location:Kushtia,Bangladesh.
Contact:
BDIOI -2013/7

Unread post by Fatin Farhan » Tue Feb 25, 2014 5:06 pm

Find of the value of $$F(n,k)$$
$$F(n,k) = 2F(n-1,k) + F(n-1,k-1)$$ where, $$F(0,k) = 1$$, $$F(n,0) = 1$$
"The box said 'Requires Windows XP or better'. So I installed L$$i$$nux...:p"

User avatar
Labib
Posts:411
Joined:Thu Dec 09, 2010 10:58 pm
Location:Dhaka, Bangladesh.

Re: BDIOI -2013/7

Unread post by Labib » Wed Feb 26, 2014 12:33 am

Hi Fatin.
Could you clarify which competition you are referring to by BDIOI? Is it BdOI?
If I guessed right, then, just so that you know, there's a sub-forum in this very forum for Informatics Olympiad problems.
(Look for IOI and Computer Science subforums in the home page)

In any case, memorization (Dynamic programming) is a good approach to this problem.
You can either write the pseudocode or just simulate the whole process in your answer script to get the answer of this problem.
Any of the two will secure you full marks.

For dynamic programming basics, see this article.

Brute force, though time consuming, are also useful techniques to solve this problem.
Please Install $L^AT_EX$ fonts in your PC for better looking equations,
Learn how to write equations, and don't forget to read Forum Guide and Rules.


"When you have eliminated the impossible, whatever remains, however improbable, must be the truth." - Sherlock Holmes

Post Reply