SOMPO HD プログラミングコンテスト2021(AtCoder Beginner Contest 192)
C
Kaprekar Number
AtCoder
⌀ 0
原题
← BD →
翻译中…

Problem Statement

翻译中…

For an integer $x$ not less than $0$, we define $g_1(x), g_2(x), f(x)$ as follows:

翻译中…
  • $g_1(x)=$ the integer obtained by rearranging the digits in the decimal notation of $x$ in descending order
  • $g_2(x)=$ the integer obtained by rearranging the digits in the decimal notation of $x$ in ascending order
  • $f(x)=g_1(x)-g_2(x)$
翻译中…

For example, we have $g_1(314)=431$, $g_2(3021)=123$, $f(271)=721-127=594$. Note that the leading zeros are ignored.

翻译中…

Given integers $N, K$, find $a_K$ in the sequence defined by $a_0=N$, $a_{i+1}=f(a_i)\ (i\geq 0)$.

翻译中…

Constraints

翻译中…
  • $0 \leq N \leq 10^9$
  • $0 \leq K \leq 10^5$
  • All values in input are integers.
翻译中…

Input

翻译中…

Input is given from Standard Input in the following format:

翻译中…

N K

翻译中…

Output

翻译中…

Print $a_K$.

翻译中…

样例

Input #1
314 2
Output #1
693
We have: - $a_0=314$ - $a_1=f(314)=431-134=297$ - $a_2=f(297)=972-279=693$
Input #2
1000000000 100
Output #2
0
We have: - $a_0=1000000000$ - $a_1=f(1000000000)=1000000000-1=999999999$ - $a_2=f(999999999)=999999999-999999999=0$ - $a_3=f(0)=0-0=0$ - $\vdots$
Input #3
6174 100000
Output #3
6174
题目信息
题号
abc192_c
时间限制
2 s
内存限制
1024 MB

题面与样例版权归 AtCoder 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。