Dominoes Shop SquaresTime
limit:2000/1000 MS (java/others) Memory limit:65536/32768 K (java/others)
Total submission (s): 30887 Accepted Submission (s): 14949
Problem description in a rectangular square of 2xn, fill the squares with a 1x2 domino, enter N, and output the total number of paving schemes.
For example, when n=3, for 2x3 squares, the Domino placement scheme has three kinds, such as:
Input data consists of multiple lines, each containing an integer n, indicating that the size of the rectangular square of the test instance is 2xn (0<n<=50).
Output for each test instance, export the total number of tiling schemes, one row for each instance.
Sample Input
132
Sample Output
132
Authorlcy
Source Recursive Solution topic exercise (for beginner)
#include <stdio.h>__int64 a[55];int Main () {int i,j,n;a[1]=1,a[2]=2;for (i=3;i<=50;i++) {a[i]=a[i-1]+a[i-2];} while (scanf ("%d", &n)!=eof) {printf ("%i64d\n", A[n]);} return 0;}
Domino Shop (Hangzhou Electric 2046)
