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

建议使用的浏览器:

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

5085:Counting problem

题目描述
Supose that n has L digits, we used $d_0, d_1, d_2, \ldots, d_{L-1}$ to indicate every digit of n from least significant digit to most significant one.
$f(n, k) = \sum\limits_{i=0}^{L-1}d_i^k$, for example $f(305, 2) = 5^2 + 3^2 + 0^2 = 34$
We are curious about that for each x ranged from a to b($a \leq b$), how many integers make $S=f(x, k)$ (here S is a constant) true.
输入解释
Multi test cases (about 100), every case gives four integers a, b, k, S in a single line.
Please process to the end of file.

[Technical Specification]
$1 \leq a \leq b \leq 999999999$
$1 \leq k \leq 15$
$1 \leq S \leq 10^{16}$
输出解释
For each case,output a number in a single line indicates how many x ranged from a to b makes $S=f(x, k)$ true.
输入样例
1 1 1 1
1 10 2 1
输出样例
1
2
来自杭电HDUOJ的附加信息
Recommend heyang

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

题目来源 BestCoder Round #15

源链接: HDU-5085

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

共提交 0

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