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 2p2 * 3p3 * 5p5 * 7p7. Return the sum of all nice integers, modulo 500,500,573. |
|||||||||||||
Definition |
|||||||||||||
|
|||||||||||||
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) | |||||||||||||
|
topcoder SRM500 div1 Level3
最新推荐文章于 2019-10-16 14:59:33 发布
![](https://img-home.csdnimg.cn/images/20240711042549.png)