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

建议使用的浏览器:

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

2757:Beautiful Numbers

题目描述
Now that you believe Jiajia & Wind's cute daughter, Autumn, is a genius. It's not surprising that such a clever little girl would have no interest on simple additions very soon. This time, she turned to divisions, since they're more fun. For example, she found herself that if the sum of digits of a decimal number is a multiple of 3, then the decimal number itself is also a multiple of 3. The argument is still true if she replaces the number 3 with 9.

Inspired by these, Autumn invented a special kind of number, called 'Beautiful Numbers'. A number k is said to be Beautiful in base b, if the sum of digits of k in base b is a multiple of b.

Autumn knows how to calculate the sum of first n beautiful numbers in base b, can you?
输入解释
The input contains a single test case with two lines. The first line is a single integer n(n < 101001), the second line is a single integer b(1 < b < 1001).
输出解释
The output contains a single integer, the sum of first n beautiful numbers in base b. You should output the sum in decimal, not in base b.
输入样例
2
3
输出样例
12

该题目是Virtual Judge题目,来自 北京大学POJ

源链接: POJ-2757

最后修改于 2020-10-29T06:42:08+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
1000 65536