文件名称:01beibaowenti
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:1.24kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
给定n种物品和一前包.物品i的重量是Wi,其价值是Vi,背包的容量是C.
问:应该如何选择装入背包的物品,使得背包中的物品的总价值最大?
输入:
第一行两个数,n c.n是整数且小于11,c是实数,n和c之间空格
以下是n行,每行是两个实数,分别是各个物品的重量和价值
输出:两行
背包剩余重量 所装物品价值和(均保留两位小数)
所选择物品的编号,由空格间隔-Given n kinds of goods and a pre-pack. Item i of the weight of Wi, its value is Vi, the capacity of backpack C. Q: How should I choose the items into backpacks, making the items in the backpack of the total value of the largest? Input: the first line of two numbers, n cn is an integer and less than 11, c is a real number, n, c The following is n spaces between the lines, each line are two real numbers, respectively, the weight and value of each output: the remaining two lines of the weight of the loaded backpack, and the value of goods (both retain two decimal places) numbers selected items from the space interval
问:应该如何选择装入背包的物品,使得背包中的物品的总价值最大?
输入:
第一行两个数,n c.n是整数且小于11,c是实数,n和c之间空格
以下是n行,每行是两个实数,分别是各个物品的重量和价值
输出:两行
背包剩余重量 所装物品价值和(均保留两位小数)
所选择物品的编号,由空格间隔-Given n kinds of goods and a pre-pack. Item i of the weight of Wi, its value is Vi, the capacity of backpack C. Q: How should I choose the items into backpacks, making the items in the backpack of the total value of the largest? Input: the first line of two numbers, n cn is an integer and less than 11, c is a real number, n, c The following is n spaces between the lines, each line are two real numbers, respectively, the weight and value of each output: the remaining two lines of the weight of the loaded backpack, and the value of goods (both retain two decimal places) numbers selected items from the space interval
(系统自动生成,下载前可以参看下载内容)
下载文件列表
新建文本文档.txt
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.