【Codeforces Round #629 (Div. 3) / 1328B 】- K-th Beautiful String - 暴力

B. K-th Beautiful String

time limit per test ：1 seconds                                memory limit per test ：256 megabytes

input ：standard input                                           output ：standard output
 

For the given integer n (n>2) let's write down all the strings of length n which contain n−2 letters 'a' and two letters 'b' in lexicographical (alphabetical) order.

Recall that the string s of length n is lexicographically less than string t of length n, if there exists such i (1≤i≤n), that si<ti, and for any j (1≤j<i) sj=tj. The lexicographic comparison of strings is implemented by the operator < in modern programming languages.

For example, if n=5 the strings are (the order does