WHUST 2017 Day 17 [2017-08-09][Div. 1][RATED Contest 02]

Begin: 1502253000000

WHUST 2017 Day 17 [2017-08-09][Div. 1][RATED Contest 02]

End: 1502271000000

Elapsed:

Remaining:

#	Origin	Title
A	Aizu 1367	Rearranging a Sequence
B	Aizu 1368	Quality of Check Digits
C	Aizu 1369	Distribution Center
D	Aizu 1370	Hidden Anagrams
E	Aizu 1371	Infallibly Crack Perplexing Cryptarithm
F	Aizu 1372	Three Kingdoms of Bourdelot
G	Aizu 1373	Placing Medals on a Binary Tree
H	Aizu 1374	Animal Companion in Maze
I	Aizu 1375	Skinny Polygon
J	Aizu 1376	Cover the Polygon with Your Disk
K	Aizu 1377	Black and White Boxes

Status

My Status

Translate

PDF

Select a statement for participants:

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

{"id":170500,"title":"WHUST 2017 Day 17 [2017-08-09][Div. 1][RATED Contest 02]","type":0,"openness":0,"authStatus":1,"begin":1502253000000,"end":1502271000000,"createTime":1499857844000,"started":true,"ended":true,"managerId":73842,"managerName":"CPPC","fav":false,"description":{"format":"HTML","content":""},"announcement":"[试题 PDF](http://acm.whu.edu.cn/training/problem/2017-08-09-Japan.Tsukuba.Regional.2017.pdf), [数据包](http://acm.whu.edu.cn/training/judge_data/2017-08-09-Japan.Tsukuba.Regional.2017.5f57d93.tar.gz), [题解 PDF](http://acm.whu.edu.cn/training/solution/2017-08-09-Japan.Tsukuba.Regional.2017.a3d2dac.pdf)","problems":[{"pid":700302,"title":"Rearranging a Sequence","oj":"Aizu","probNum":"1367","num":"A","publicDescId":3365585619807090,"publicDescVersion":1713121807000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"OS","content":"Linux","spoiler":false},{"title":"Source","content":"ACM International Collegiate Programming Contest, Asia Regional 2016, Japan","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":595115,"title":"Quality of Check Digits","oj":"Aizu","probNum":"1368","num":"B","publicDescId":3375058327031186,"publicDescVersion":1713624656000,"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"OS","content":"Linux","spoiler":false},{"title":"Source","content":"ACM International Collegiate Programming Contest, Asia Regional 2016, Japan","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":595124,"title":"Distribution Center","oj":"Aizu","probNum":"1369","num":"C","publicDescId":3375056355786860,"publicDescVersion":1713681788000,"properties":[{"title":"Time limit","content":"3000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"OS","content":"Linux","spoiler":false},{"title":"Source","content":"ACM International Collegiate Programming Contest, Asia Regional 2016, Japan","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":595125,"title":"Hidden Anagrams","oj":"Aizu","probNum":"1370","num":"D","publicDescId":3375084998639291,"publicDescVersion":1714046916000,"properties":[{"title":"Time limit","content":"10000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"OS","content":"Linux","spoiler":false},{"title":"Source","content":"ACM International Collegiate Programming Contest, Asia Regional 2016, Japan","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":700303,"title":"Infallibly Crack Perplexing Cryptarithm","oj":"Aizu","probNum":"1371","num":"E","publicDescId":3365580171411841,"publicDescVersion":1713508785000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"OS","content":"Linux","spoiler":false},{"title":"Source","content":"ACM International Collegiate Programming Contest, Asia Regional 2016, Japan","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":700304,"title":"Three Kingdoms of Bourdelot","oj":"Aizu","probNum":"1372","num":"F","publicDescId":3365583514484684,"publicDescVersion":1713681785000,"properties":[{"title":"Time limit","content":"4000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"OS","content":"Linux","spoiler":false},{"title":"Source","content":"ACM International Collegiate Programming Contest, Asia Regional 2016, Japan","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":700305,"title":"Placing Medals on a Binary Tree","oj":"Aizu","probNum":"1373","num":"G","publicDescId":3365577797587995,"publicDescVersion":1713942314000,"properties":[{"title":"Time limit","content":"4000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"OS","content":"Linux","spoiler":false},{"title":"Source","content":"ACM International Collegiate Programming Contest, Asia Regional 2016, Japan","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":700306,"title":"Animal Companion in Maze","oj":"Aizu","probNum":"1374","num":"H","publicDescId":3365572348867238,"publicDescVersion":1713681781000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"OS","content":"Linux","spoiler":false},{"title":"Source","content":"ACM International Collegiate Programming Contest, Asia Regional 2016, Japan","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":700307,"title":"Skinny Polygon","oj":"Aizu","probNum":"1375","num":"I","publicDescId":3365601595681013,"publicDescVersion":1713582803000,"properties":[{"title":"Time limit","content":"3000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"OS","content":"Linux","spoiler":false},{"title":"Source","content":"ACM International Collegiate Programming Contest, Asia Regional 2016, Japan","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":700308,"title":"Cover the Polygon with Your Disk","oj":"Aizu","probNum":"1376","num":"J","publicDescId":3365604737351936,"publicDescVersion":1713681772000,"properties":[{"title":"Time limit","content":"5000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"OS","content":"Linux","spoiler":false},{"title":"Source","content":"ACM International Collegiate Programming Contest, Asia Regional 2016, Japan","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]},{"pid":700309,"title":"Black and White Boxes","oj":"Aizu","probNum":"1377","num":"K","publicDescId":3365599020465999,"publicDescVersion":1713681769000,"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"OS","content":"Linux","spoiler":false},{"title":"Source","content":"ACM International Collegiate Programming Contest, Asia Regional 2016, Japan","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,false,false]}],"problemsHash":"5a8d1795ad311a8d046f04c65ab1c35b","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":false,"clonedFromId":0}