文件名称: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.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
bestmul.h
fun.c
input.txt
main.c
outpt.txt