当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

5936:Difference

题目描述
Little Ruins is playing a number game, first he chooses two positive integers $y$ and $K$ and calculates $f(y, K)$, here

$$f(y, K) = \sum_{z\text{ in every digits of }y} z^K (f(233, 2) = 2^2 + 3^2 + 3^2 = 22)$$

then he gets the result

$$x = f(y, K) - y$$

As Ruins is forgetful, a few seconds later, he only remembers $K$, $x$ and forgets $y$. please help him find how many $y$ satisfy $x = f(y, K) - y$.
输入解释
First line contains an integer $T$, which indicates the number of test cases.

Every test case contains one line with two integers $x$, $K$.

Limits
$1 \leq T \leq 100$
$0 \leq x \leq 10^9$
$1 \leq K \leq 9$
输出解释
For every test case, you should output 'Case #x: y', where x indicates the case number and counts from 1 and y is the result.
输入样例
2
2 2
3 2
输出样例
Case #1: 1
Case #2: 2
来自杭电HDUOJ的附加信息
Recommend liuyiding

该题目是Virtual Judge题目,来自 杭电HDUOJ

源链接: HDU-5936

最后修改于 2020-10-25T23:26:53+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
6000/3000MS(Java/Others) 65536/65536K(Java/Others)