背包九讲 [Cloned]

Begin: 1522753200000

End: 1523617200000

Elapsed:

Remaining:

#	Origin	Title
A	HDU 2955	Robberies 01背包
B	HDU 1864	最大报销额 01背包
C	HDU 2602	Bone Collector 01背包
D	HDU 2844	Coins 多重背包
E	HDU 2159	FATE 完全背包
F	POJ 1170	Shopping Offers 状压+背包
G	ZOJ 3769	Diablo III 带限制条件的背包
H	ZOJ 3638	Fruit Ninja 背包的转化成组合数学
I	HDU 3092	Least common multiple 转化成完全背包问题
J	POJ 1015	Jury Compromise 扩大区间+输出路径

Status

My Status

Translate

PDF

Select a statement for participants:

Run ID	Username	Prob	Result	Time (ms)	Mem (MB)	Length	Lang	Submit Time

{"id":220248,"title":"背包九讲 [Cloned]","type":0,"openness":0,"authStatus":1,"begin":1522753200000,"end":1523617200000,"createTime":1522752019000,"started":true,"ended":true,"managerId":132375,"managerName":"hnust_dongshenpo","fav":false,"description":{"format":"HTML","content":"[Cloned from \u003ca href\u003d\u0027https://vjudge.net/contest/171794\u0027 target\u003d\u0027_blank\u0027\u003e背包九讲 [Cloned]\u003c/a\u003e]"},"announcement":"","problems":[{"pid":17681,"title":"Robberies 01背包","oj":"HDU","probNum":"2955","num":"A","publicDescId":3154586332179538,"publicDescVersion":1715050056000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003dIDI+Open+2009\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e IDI Open 2009 \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":25196,"title":"最大报销额 01背包","oj":"HDU","probNum":"1864","num":"B","publicDescId":3102949960565126,"publicDescVersion":1714919498000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003d%D5%E3%B4%F3%BC%C6%CB%E3%BB%FA%D1%D0%BE%BF%C9%FA%B8%B4%CA%D4%C9%CF%BB%FA%BF%BC%CA%D4-2007%C4%EA\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 浙大计算机研究生复试上机考试-2007年 \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":17434,"title":"Bone Collector 01背包","oj":"HDU","probNum":"2602","num":"C","publicDescId":3152227433566768,"publicDescVersion":1715263973000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003dHDU+1st+%A1%B0Vegetable-Birds+Cup%A1%B1+Programming+Open+Contest\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e HDU 1st “Vegetable-Birds Cup” Programming Open Contest \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003eTeddy\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":17442,"title":"Coins 多重背包","oj":"HDU","probNum":"2844","num":"D","publicDescId":3152235452865624,"publicDescVersion":1714968441000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003d2009+Multi-University+Training+Contest+3+-+Host+by+WHU+\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2009 Multi-University Training Contest 3 - Host by WHU  \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":20469,"title":"FATE 完全背包","oj":"HDU","probNum":"2159","num":"E","publicDescId":3107469408984338,"publicDescVersion":1714993214000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"32768 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003d2008%D0%C5%CF%A2%B9%A4%B3%CC%D1%A7%D4%BA%BC%AF%D1%B5%B6%D3%A1%AA%A1%AA%D1%A1%B0%CE%C8%FC\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2008信息工程学院集训队——选拔赛 \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003eXhd\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":14561,"title":"Shopping Offers 状压+背包","oj":"POJ","probNum":"1170","num":"F","publicDescId":3165530903986654,"publicDescVersion":1714916375000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"10000 kB","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dIOI+1995\"\u003eIOI 1995\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":49837,"title":"Diablo III 带限制条件的背包","oj":"ZOJ","probNum":"3769","num":"G","publicDescId":3186215384835942,"publicDescVersion":1715060608000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"OS","content":"Linux","spoiler":false},{"title":"Author","content":"YU, Zhi; JIANG, Kai","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[false,true,true]},{"pid":31634,"title":"Fruit Ninja 背包的转化成组合数学","oj":"ZOJ","probNum":"3638","num":"H","publicDescId":3214388728195389,"publicDescVersion":1715250288000,"properties":[{"title":"Time limit","content":"4000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"OS","content":"Linux","spoiler":false},{"title":"Author","content":"LI, Dinghua","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[false,true,true]},{"pid":16973,"title":"Least common multiple 转化成完全背包问题","oj":"HDU","probNum":"3092","num":"I","publicDescId":3152450480848802,"publicDescVersion":1714890648000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"OS","content":"Windows","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"panel_content\"\u003e \u003ca href\u003d\"https://acm.hdu.edu.cn/search.php?field\u003dproblem\u0026amp;key\u003d2009+Multi-University+Training+Contest+18+-+Host+by+ECNU+\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2009 Multi-University Training Contest 18 - Host by ECNU  \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]},{"pid":10482,"title":"Jury Compromise 扩大区间+输出路径","oj":"POJ","probNum":"1015","num":"J","publicDescId":3159663683296899,"publicDescVersion":1715059173000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Special judge","content":"\u003cspan style\u003d\u0027color:red\u0027\u003eYes\u003c/span\u003e","spoiler":false},{"title":"Source","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003ca href\u003d\"http://poj.org/searchproblem?field\u003dsource\u0026amp;key\u003dSouthwestern+European+Regional+Contest+1996\"\u003eSouthwestern European Regional Contest 1996\u003c/a\u003e\u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,true]}],"problemsHash":"f7a5727bcfcae28b911a83c8241b065b","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":true,"clonedFromId":0}