KMP

Begin: 1534554420000

End: 1534727220000

Elapsed:

Remaining:

#	Origin	Title
A	HDU 1711	Number Sequence
B	HDU 1686	Oulipo
C	HDU 2087	剪花布条
D	HDU 3746	Cyclic Nacklace
E	POJ 1961	Period
F	POJ 2406	Power Strings
G	POJ 2752	Seek the Name, Seek the Fame

Status

My Status

Translate

PDF

Select a statement for participants:

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

{"id":248066,"title":"KMP","type":0,"openness":0,"authStatus":1,"begin":1534554420000,"end":1534727220000,"createTime":1534552117000,"started":true,"ended":true,"managerId":181271,"managerName":"mengzhao","fav":false,"description":{"format":"MD","content":""},"announcement":"","problems":[{"pid":18357,"title":"Number Sequence","oj":"HDU","probNum":"1711","num":"A","publicDescId":3157083040201769,"publicDescVersion":1714230524000,"properties":[{"title":"Time limit","content":"5000 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":25191,"title":"Oulipo","oj":"HDU","probNum":"1686","num":"B","publicDescId":3102925859274759,"publicDescVersion":1714792216000,"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%BB%AA%B6%AB%C7%F8%B4%F3%D1%A7%C9%FA%B3%CC%D0%F2%C9%E8%BC%C6%D1%FB%C7%EB%C8%FC_%C8%C8%C9%ED%C8%FC\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 华东区大学生程序设计邀请赛_热身赛 \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":23623,"title":"剪花布条","oj":"HDU","probNum":"2087","num":"C","publicDescId":3098971275362893,"publicDescVersion":1714791076000,"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%B6%AC%C1%B7%C8%FD%BE%C5%D6%AE%B6%FE\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e 冬练三九之二 \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003eqianneng\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":17942,"title":"Cyclic Nacklace","oj":"HDU","probNum":"3746","num":"D","publicDescId":3153738803714207,"publicDescVersion":1714794881000,"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+3rd+%A1%B0Vegetable-Birds+Cup%A1%B1+Programming+Open+Contest\u0026amp;source\u003d1\u0026amp;searchmode\u003dsource\"\u003e HDU 3rd “Vegetable-Birds Cup” Programming Open Contest \u003c/a\u003e \u003c/div\u003e","spoiler":true},{"title":"Author","content":"\u003cdiv class\u003d\"panel_content\"\u003epossessor WC\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":10934,"title":"Period","oj":"POJ","probNum":"1961","num":"E","publicDescId":3158883366406485,"publicDescVersion":1714332327000,"properties":[{"title":"Time limit","content":"3000 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\u003dSoutheastern+Europe+2004\"\u003eSoutheastern 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":10758,"title":"Power Strings","oj":"POJ","probNum":"2406","num":"F","publicDescId":3158006947887117,"publicDescVersion":1714250345000,"properties":[{"title":"Time limit","content":"3000 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\u003dWaterloo+local+2002.07.01\"\u003eWaterloo local 2002.07.01\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":10055,"title":"Seek the Name, Seek the Fame","oj":"POJ","probNum":"2752","num":"G","publicDescId":3158983829196554,"publicDescVersion":1714720022000,"properties":[{"title":"Time limit","content":"2000 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\u003dPOJ+Monthly--2006.01.22\"\u003ePOJ Monthly--2006.01.22\u003c/a\u003e,Zeyuan Zhu\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":"cb0459220b05ee07008452e120ea0098","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":false,"clonedFromId":0}