[UVA][DP] 10081 - Tight Words
Problem B: Tight words
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 is a sequence of lines, each line contains two intege...