台州学院基础算法学习之背包

Begin: 1528984800000

台州学院基础算法学习之背包

End: 1531576800000

Elapsed:

Remaining:

#	Origin	Title
A	HDU 1114	完全背包基础
B	HDU 2159	二维费用背包基础
C	HDU 2191	部分背包基础
D	HDU 1712	分组背包基础
E	HDU 2955	01背包基础
F	HDU 2602	01背包
G	POJ 2063	完全背包
H	POJ 1787	多重背包记录方案
I	POJ 3624	01背包（就地滚动）
J	HDU 2546	饭卡
K	HDU 2639	Bone Collector II
L	POJ 2184	Cow Exhibition
M	POJ 2923	Relocation
N	UVA 624	CD
O	UVA 562	Dividing coins

Status

My Status

Translate

PDF

Select a statement for participants:

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

{"id":234806,"title":"台州学院基础算法学习之背包","type":0,"openness":0,"authStatus":1,"begin":1528984800000,"end":1531576800000,"createTime":1528983700000,"started":true,"ended":true,"managerId":139108,"managerName":"BobHuang","fav":false,"description":{"format":"HTML","content":""},"announcement":"","problems":[{"pid":17679,"title":"完全背包  基础","oj":"HDU","probNum":"1114","num":"A","publicDescId":3154597295954424,"publicDescVersion":1713625873000,"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\u003dCentral+Europe+1999\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e Central Europe 1999 \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":"二维费用背包  基础","oj":"HDU","probNum":"2159","num":"B","publicDescId":3107469408984338,"publicDescVersion":1713665094000,"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":20468,"title":"部分背包  基础","oj":"HDU","probNum":"2191","num":"C","publicDescId":3107474860844231,"publicDescVersion":1713639190000,"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-06-18%A1%B6+ACM%B3%CC%D0%F2%C9%E8%BC%C6%A1%B7%C6%DA%C4%A9%BF%BC%CA%D4%A1%AA%A1%AA%CB%C4%B4%A8%BC%D3%D3%CD%A3%A1%D6%D0%B9%FA%BC%D3%D3%CD%A3%A1\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 2008-06-18《 ACM程序设计》期末考试——四川加油！中国加油！ \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003elcy\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":17676,"title":"分组背包  基础","oj":"HDU","probNum":"1712","num":"D","publicDescId":3154570355387603,"publicDescVersion":1713683337000,"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+2007-Spring+Programming+Contest\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e HDU 2007-Spring Programming Contest \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":17681,"title":"01背包  基础","oj":"HDU","probNum":"2955","num":"E","publicDescId":3154586332179538,"publicDescVersion":1713691778000,"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":17434,"title":"01背包","oj":"HDU","probNum":"2602","num":"F","publicDescId":3152227433566768,"publicDescVersion":1713626788000,"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":26349,"title":"完全背包","oj":"POJ","probNum":"2063","num":"G","publicDescId":3126969163581142,"publicDescVersion":1713940115000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"30000 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\u003dNorthwestern+Europe+2004\"\u003eNorthwestern Europe 2004\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":37155,"title":"多重背包记录方案","oj":"POJ","probNum":"1787","num":"H","publicDescId":3232369807561435,"publicDescVersion":1713684747000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"30000 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\u003dCTU+Open+2003\"\u003eCTU Open 2003\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":17547,"title":"01背包（就地滚动）","oj":"POJ","probNum":"3624","num":"I","publicDescId":3151977794434643,"publicDescVersion":1713398682000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 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\u003dUSACO+2007+December+Silver\"\u003eUSACO 2007 December Silver\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":18374,"title":"饭卡","oj":"HDU","probNum":"2546","num":"J","publicDescId":3157131066077011,"publicDescVersion":1713665094000,"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\u003dUESTC+6th+Programming+Contest+Online\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e UESTC 6th Programming Contest Online \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":20470,"title":"Bone Collector II","oj":"HDU","probNum":"2639","num":"K","publicDescId":3107472214916001,"publicDescVersion":1713641630000,"properties":[{"title":"Time limit","content":"2000 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%B0%D9%CD%F2%C7%D8%B9%D8%D6%D5%CA%F4%B3%FE\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 百万秦关终属楚 \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":16386,"title":"Cow Exhibition","oj":"POJ","probNum":"2184","num":"L","publicDescId":3151003286483775,"publicDescVersion":1713705828000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 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\u003dUSACO+2003+Fall\"\u003eUSACO 2003 Fall\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":17573,"title":"Relocation","oj":"POJ","probNum":"2923","num":"M","publicDescId":3154822360430038,"publicDescVersion":1713455487000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 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\u003dTUD+Programming+Contest+2006\"\u003eTUD Programming Contest 2006\u003c/a\u003e, Darmstadt, Germany\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":19209,"title":"CD","oj":"UVA","probNum":"624","num":"N","publicDescId":3106353716327873,"publicDescVersion":1713413720000,"properties":[{"title":"Time limit","content":"3000 ms","spoiler":false},{"title":"OS","content":"Linux","spoiler":false}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":19207,"title":"Dividing coins","oj":"UVA","probNum":"562","num":"O","publicDescId":3106330320347495,"publicDescVersion":1713624672000,"properties":[{"title":"Time limit","content":"3000 ms","spoiler":false},{"title":"OS","content":"Linux","spoiler":false}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]}],"problemsHash":"8fc2f7c06b615658a4f0d2d86312098d","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":true,"clonedFromId":0}