HDU 2046 bone plate shop Square

Problem description in a rectangle square of 2 × N, fill the square with a 1 × 2 bone card, input N, and output the total number of layout solutions.
For example, if n = 3, it is a 2 × 3 square. There are three methods for laying the bone card, for example:

The input data is composed of multiple rows. Each row contains an integer N, indicating that the rectangular square of the test instance is 2 x n (0 <n <= 50 ).

Output for each test instance, please output the total number of the layout scheme, each instance output occupies one line.

Sample Input

132

Sample output

132f (1) = 1; F (2) = 2; F (n) = f (n-1) + f (n-2); Code:
# Include <stdio. h> int main () {_ int64 f [51] = {0, 1, 2}, I; int test; for (I = 3; I <51; I ++) f [I] = f [I-1] + F [I-2]; while (scanf ("% d", & Test )! = EOF) {printf ("% i64d \ n", F [test]);} return 0 ;}