查看会员资料
- Email：用户隐藏
- Icq/MSN：qq
- 电话号码：
- Homepage：
- 会员简介：这家伙很懒,什么都没留下!
最新会员发布资源
bestmul
- 设n（1≤n≤80）是一个正整数，将n分解成若干个互不相同的自然数的和，且使这些数的乘积最大. 贪心算法-Let n (1≤n≤80) be a positive integer, decompose n into the sum of several natural numbers that are different each other, and make the product of these numbers the largest.