Description: Problem Description: Let a machine composed by the n-components, each component can be different from m suppliers purchased. Set wij is purchased from suppliers of parts i j Department of weight, cij is the corresponding price. Trial design an algorithm, given the total price no more than c of the minimum weight design of the machine. Data input: the input data given by the file 1.txt. The first line has three positive integers n, m, d. The next 2n rows, n the number of each line. Before the line is n c, n, after the output line is w. The results: the calculation of the minimum weight and supplier of each component output to a file 2.txt.
To Search:
File list (Check if you may need any files):
minrobot_huisu\1.txt
..............\main.cpp
..............\minrobot_huisu.dsp
..............\minrobot_huisu.dsw
..............\minrobot_huisu.ncb
..............\minrobot_huisu.opt
..............\问题描述.doc
..............\Debug\main.obj
..............\.....\minrobot_huisu.exe
..............\.....\minrobot_huisu.ilk
..............\.....\minrobot_huisu.pch
..............\.....\minrobot_huisu.pdb
..............\.....\vc60.idb
..............\.....\vc60.pdb
..............\2.txt
..............\minrobot_huisu.plg
..............\Debug
minrobot_huisu
Download