qdu_6.08个人训练

Begin: 1496917800000

End: 1496926800000

Elapsed:

Remaining:

#	Origin	Title
A	HDU 4858	项目管理
B	HDU 4857	逃生
C	HDU 4883	TIANKENG’s restaurant
D	HDU 4886	TIANKENG’s restaurant(Ⅱ)
E	HDU 4908	BestCoder Sequence
F	HDU 4907	Task schedule
G	HDU 4884	TIANKENG’s rice shop

Status

My Status

Translate

PDF

Select a statement for participants:

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

{"id":166700,"title":"qdu_6.08个人训练","type":0,"openness":0,"authStatus":1,"begin":1496917800000,"end":1496926800000,"createTime":1496912895000,"started":true,"ended":true,"managerId":126422,"managerName":"15admin","fav":false,"description":{"format":"HTML","content":""},"announcement":"","problems":[{"pid":51974,"title":"项目管理","oj":"HDU","probNum":"4858","num":"A","publicDescId":3192626832018633,"publicDescVersion":1714914607000,"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\u003dBestCoder+Round+%231\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e BestCoder Round #1 \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003eCLJ\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":51973,"title":"逃生","oj":"HDU","probNum":"4857","num":"B","publicDescId":3192632012314298,"publicDescVersion":1714905302000,"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\u003dBestCoder+Round+%231\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e BestCoder Round #1 \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003eCLJ\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":52239,"title":"TIANKENG’s restaurant","oj":"HDU","probNum":"4883","num":"C","publicDescId":3191851829707084,"publicDescVersion":1713694952000,"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\u003dBestCoder+Round+%232\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e BestCoder Round #2 \u003c/a\u003e \u003c/div\u003e","spoiler":true}],"weight":1,"submitTips":"The problem is unavailable for long time.","submitMethods":[true,true,true]},{"pid":52242,"title":"TIANKENG’s restaurant(Ⅱ)","oj":"HDU","probNum":"4886","num":"D","publicDescId":3191869777293941,"publicDescVersion":1714745830000,"properties":[{"title":"Time limit","content":"8000 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\u003dBestCoder+Round+%232\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e BestCoder Round #2 \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":52406,"title":"BestCoder Sequence","oj":"HDU","probNum":"4908","num":"E","publicDescId":3282563528500055,"publicDescVersion":1714739422000,"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\u003dBestCoder+Round+%233\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e BestCoder Round #3 \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":52405,"title":"Task schedule","oj":"HDU","probNum":"4907","num":"F","publicDescId":3282568977220872,"publicDescVersion":1714891940000,"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\u003dBestCoder+Round+%233\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e BestCoder Round #3 \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":52240,"title":"TIANKENG’s rice shop","oj":"HDU","probNum":"4884","num":"G","publicDescId":3191880405712795,"publicDescVersion":1714755611000,"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\u003dBestCoder+Round+%232\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e BestCoder Round #2 \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":"c9cd6d9b840256b0d9977d7d788f3d39","privatePeerContestIds":[],"enableTimeMachine":false,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":true,"clonedFromId":0}