Codeforces Round #643 (Div. 2)“日常训练”

A. Sequence with Digits

time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
Let’s define the following recurrence:
an+1=an+minDigit(an)⋅maxDigit(an).
Here minDigit(x) and maxDigit(x) are the minimal and maximal digits in the decimal representation of x without leading zeroes. For examples refer to notes.

Your task is calculate aK for given a1 and K.

Input
The first line contains one integer t (1≤t≤1000) — the number of independent test cases.

Each test case consists of a single line containing two integers a1 and K (1≤a1≤1018, 1≤K≤1016) separated by a space.

Output
For each test case print one integer aK on a separate line.

Example
inputCopy
8
1 4
487 1
487 2
487 3
487 4
487 5
487 6
487 7
outputCopy
42
487
519
528
544
564
588
628
Note
a1=487

a2=a1+minDigit(a1)⋅maxDigit(a1)=487+min(4,8,7)⋅max(4,8,7)=487+4⋅8=519

a3=a2+minDigit(a2)⋅maxDigit(a2)=519+min(5,1,9)⋅max(5,1,9)=519+1⋅9=528

a4=a3+minDigit(a3)⋅maxDigit(a3)=528+min(5,2,8)⋅max(5,2,8)=528+2⋅8=544

a5=a4+minDigit(a4)⋅maxDigit(a4)=544+min(5,4,4)⋅max(5,4,4)=544+4⋅5=564

a6=a5+minDigit(a5)⋅maxDigit(a5)=564+min(5,6,4)⋅max(5,6,4)=564+4⋅6=588

a7=a6+minDigit(a6)⋅maxDigit(a6)=588+min(5,8,8)⋅max(5,8,8)=588+5⋅8=628

for s in[*open(0)][1:]:
	a,k=s.split();k=int(k)
	while k>1and'0'not in a:a=str(int(a)+int(min(a))*int(max(a)));k-=1
	print(a)

思（翻）路（车）

这是个Python水题，Python代码量和C++就不是一个数量级。Python3有着巨大的优势，好多函数都更为简洁，国际上用Python正在成为主流。

本来是想开一个CF练一下算法，结果发现这场比赛就是Python专场，还有一个交互题。。。
纯粹成了欣（划）赏（水）Python的一个半小时。。。