GO Solution For UVa 10359 - Tiling. In this post we will see how we can solve this challenge in GoLang for UVa Online Judge.

Problem Description

In how many ways can you tile a 2× n rectangle by 2× 1 or 2× 2 tiles?

Here is a sample tiling of a 2× 17 rectangle.

Input Input is a sequence of lines, each line containing an integer number 0 ≤ n ≤ 250.

Output For each line of input, output one integer number in a separate line giving the number

...

You can find the full details of the problem Tiling at UVa Online Judge

Sample Input

2
8
12
100
200

Sample Output

3
171
2731
845100400152152934331135470251
1071292029505993517027974728227441735014801995855195223534251

Solution: Please check the main.go snippet for the solution.

Solution originally posted at: Github by @codingsince1985