NYOJ - 601：math

最新推荐文章于 2021-05-22 00:13:29 发布

wingrez

最新推荐文章于 2021-05-22 00:13:29 发布

阅读量300

点赞数

CC 4.0 BY-SA版权

分类专栏：【记录】算法题解

本文为博主原创文章，未经博主允许不得转载。

本文链接：https://blog.youkuaiyun.com/wingrez/article/details/89525931

【记录】算法题解专栏收录该内容

229 篇文章 ¥19.90 ¥99.00

订阅专栏

超级会员免费看

这是一道编程题，来源于NYOJ，要求解决的问题是在给定基数m的情况下，计算所有不超过n的正整数的除数的数字平方和。例如，当n=10，基数m=2时，其除数的平方和为6（在二进制下表示为110）。输入包含多个测试用例，每个用例包含两个整数n和m，1≤n≤10^9，2≤m≤16。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

NYOJ - 601：math

来源：NYOJ

标签：基础

参考资料：

相似题目：

题目

mmm is learning division, she’s so proud of herself that she can figure out the sum of all the divisors of numbers no larger than 100 within one day!
But her teacher said “What if I ask you to give not only the sum but the square-sums of all the divisors of numbers within hexadecimal number 100?” mmm get stuck and she’s asking for your help.
Attention, because mmm has misunderstood teacher’s words, you have to solve a problem that is a little bit different.
Here’s the problem, given n, you are to calculate the square sums of the digits of all the divisors of n, under the base m.
For exa