topcoder SRM500 div1 Level3

最新推荐文章于 2019-10-16 14:59:33 发布

ascii991

最新推荐文章于 2019-10-16 14:59:33 发布

阅读量996

点赞数

分类专栏： acm_数学 acm_杂题文章标签： div constraints integer class each c

本文链接：https://blog.csdn.net/ascii991/article/details/7582395

版权

该博客主要介绍了TopCoder SRM500比赛中一个关于整数约束的问题。博主通过设立变量di表示每个数字i的出现次数，并通过公式计算总和s和特定位数之和p2、p3。提出通过枚举d6、d8、d9、d4的值来简化计算，从而解决该问题，总计需要枚举8000000次。提供了问题解析和代码实现链接。

摘要由CSDN通过智能技术生成

Problem Statement

NOTE: This problem statement contains superscripts that may not display properly if viewed outside of the applet.

A positive integer is called nice if the sum of its digits is equal to S and the product of its digits is equal to 2^p2 * 3^p3 * 5^p5 * 7^p7. Return the sum of all nice integers, modulo 500,500,573.

Definition

Class:	ProductAndSum
Method:	getSum
Parameters:	int, int, int, int, int
Returns:	int
Method signature:	int getSum(int p2, int p3, int p5, int p7, int S)
(be sure your method is public)

Constraints

p2, p3, p5 and p7 will each be between 0 and 100, inclusive.

S will be between 1 and 2,500, inclusive.

Examples

最低0.47元/天解锁文章

ascii991

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
topcoder SRM500 div1 Level3

Problem Statement NOTE: This problem statement contains superscripts that may not display properly if viewed outside of the applet.A positive integer is called nice if the sum of its di
复制链接

扫一扫

专栏目录