Description: Description of the problem: Given n-stones, its weight, respectively a1, a2, a3 ... an, asked that it be divided into m copies, each of the division of costs defined as the weight of the stone of the largest and the smallest weight difference the square. Small m the total costs were divided into the sum of the cost. Programming tasks for a given n-stones, seek a kind of division, making the total cost of the smallest division.
To Search:
- [2] - This is the one written using vc++ sourc
- [test6-2] - Description of the problem description:
File list (Check if you may need any files):
test5-2\Debug\test5-2.exe
.......\.....\test5-2.ilk
.......\.....\test5-2.pdb
.......\test5-2\Debug\BuildLog.htm
.......\.......\.....\mt.dep
.......\.......\.....\stdafx.obj
.......\.......\.....\test5-2.exe.embed.manifest
.......\.......\.....\test5-2.exe.embed.manifest.res
.......\.......\.....\test5-2.exe.intermediate.manifest
.......\.......\.....\test5-2.obj
.......\.......\.....\test5-2.pch
.......\.......\.....\vc90.idb
.......\.......\.....\vc90.pdb
.......\.......\ReadMe.txt
.......\.......\stdafx.cpp
.......\.......\stdafx.h
.......\.......\targetver.h
.......\.......\test5-2.cpp
.......\.......\test5-2.vcproj
.......\.......\test5-2.vcproj.B9F12BE2664840F.Administrator.user
.......\test5-2.ncb
.......\test5-2.sln
.......\test5-2.suo
.......\.......\Debug
.......\Debug
.......\test5-2
test5-2
Download