| # | Problem | Pass Rate (passed user / total user) |
|---|---|---|
| 12511 | Pointer Sorting |
|
| 13024 | Domino Tiling 2 |
|
Description
You will need to write a function to solve sorting problem.
ptr is a pointer, len is the length of ptr and is a complete square number, after we allocate it space according by the input.
After sorting ptr in non-descending order, you need to put it in a 2D array in row-major order, then return it in int** type.
Input
you don't need to worry it
Output
A 2D matrix
Remember to change line each row.
Sample Input Download
Sample Output Download
Partial Judge Code
12511.cPartial Judge Header
12511.hTags
Discuss
Description
We have a lot of tiles with 2x1 domino shapes, these shapes may be rotated. Given N and M, please write a function to calculate how many ways are there to tile a NxM board.
For example, given a 3x2 board, there are 3 ways to tile the board:
Input
The input contains two integers N, M (2 <= NxM <= 50). It is guaranteed that at least one of them is even.
Output
Please output the possible tile counts, followed by a newline.