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

Problem Description

Given is an alphabet {0, 1, . . . , k}, 0 ≤ k ≤ 9. We say that a word of length n over this alphabet is tight if any two neighbour digits in the word do not differ by more than 1.

Input Input is a sequence of lines, each line contains two integer numbers k and n, 1 ≤ n ≤ 100.

Output For each line

...

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

Sample Input

4 1
2 5
3 5
8 7

Sample Output

100.00000
40.74074
17.38281
0.10130

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

Solution originally posted at: Github by @codingsince1985