VIII Open Cup. Stage 1: Grand Prix of Ukraine

Begin: 1284280200000

VIII Open Cup. Stage 1: Grand Prix of Ukraine

End: 1284298200000

Elapsed:

Remaining:

#	Origin	Title
A	EOlymp 1231	Lucky Controller
B	EOlymp 1232	Bukazoids
C	EOlymp 1233	Collisions
D	EOlymp 1234	Dancers
E	EOlymp 1235	Embassy
F	EOlymp 1236	Dictionary of Obscene Words
G	EOlymp 1237	Greatest Product
H	EOlymp 1238	Fractal Cake
I	EOlymp 1239	Hexaroman Numbers
J	EOlymp 1240	Beam in Tunnel
K	EOlymp 1241	Key
L	EOlymp 1242	Game on Chessboard

Status

My Status

Translate

PDF

{"id":406821,"title":"VIII Open Cup. Stage 1: Grand Prix of Ukraine","type":2,"openness":0,"authStatus":1,"begin":1284280200000,"end":1284298200000,"createTime":1604901656000,"started":true,"ended":true,"managerId":28978,"managerName":"zimpha","fav":false,"description":{"format":"MD","content":""},"announcement":"","problems":[{"pid":1869380,"title":"Lucky Controller","oj":"EOlymp","probNum":"1231","num":"A","enabledDescKeys":[2820071295363069],"descBriefs":[{"key":2820071295363069,"updateDate":"2024-07-25","version":1721915379000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Tags","content":"Math; Implementation","spoiler":true},{"title":"Difficulty","content":"3","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,false]},{"pid":1613329,"title":"Bukazoids","oj":"EOlymp","probNum":"1232","num":"B","enabledDescKeys":[2876058776615708],"descBriefs":[{"key":2876058776615708,"updateDate":"2024-07-25","version":1721915392000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Tags","content":"Dynamic programming","spoiler":true},{"title":"Difficulty","content":"3","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,false]},{"pid":3707100,"title":"Collisions","oj":"EOlymp","probNum":"1233","num":"C","enabledDescKeys":[3016914952040752],"descBriefs":[{"key":3016914952040752,"updateDate":"2024-07-24","version":1721814735000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Tags","content":"Sorting; Greedy algorithms","spoiler":true},{"title":"Difficulty","content":"1","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,false]},{"pid":1702489,"title":"Dancers","oj":"EOlymp","probNum":"1234","num":"D","enabledDescKeys":[2826636428298815],"descBriefs":[{"key":2826636428298815,"updateDate":"2024-07-25","version":1721915046000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Tags","content":"Greedy algorithms; Sorting","spoiler":true},{"title":"Difficulty","content":"2","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,false]},{"pid":3112983,"title":"Embassy","oj":"EOlymp","probNum":"1235","num":"E","enabledDescKeys":[2901063347901145],"descBriefs":[{"key":2901063347901145,"updateDate":"2024-07-25","version":1721915070000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Tags","content":"Greedy algorithms","spoiler":true},{"title":"Difficulty","content":"2","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,false]},{"pid":3849865,"title":"Dictionary of Obscene Words","oj":"EOlymp","probNum":"1236","num":"F","enabledDescKeys":[2957021112611047],"descBriefs":[{"key":2957021112611047,"updateDate":"2024-07-25","version":1721915396000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Tags","content":"Brute force; Strings","spoiler":true},{"title":"Difficulty","content":"3","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,false]},{"pid":3849866,"title":"Greatest Product","oj":"EOlymp","probNum":"1237","num":"G","enabledDescKeys":[2957024523299122],"descBriefs":[{"key":2957024523299122,"updateDate":"2024-07-25","version":1721915403000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Tags","content":"Math; Dynamic programming","spoiler":true},{"title":"Difficulty","content":"1","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,false]},{"pid":3849867,"title":"Fractal Cake","oj":"EOlymp","probNum":"1238","num":"H","enabledDescKeys":[2957019141949249],"descBriefs":[{"key":2957019141949249,"updateDate":"2024-07-25","version":1721914500000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Tags","content":"Implementation","spoiler":true},{"title":"Difficulty","content":"1","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,false]},{"pid":3004061,"title":"Hexaroman Numbers","oj":"EOlymp","probNum":"1239","num":"I","enabledDescKeys":[2896526869457440],"descBriefs":[{"key":2896526869457440,"updateDate":"2024-07-25","version":1721847336000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Tags","content":"Implementation","spoiler":true},{"title":"Difficulty","content":"1","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,false]},{"pid":3849868,"title":"Beam in Tunnel","oj":"EOlymp","probNum":"1240","num":"J","enabledDescKeys":[2957047785061772],"descBriefs":[{"key":2957047785061772,"updateDate":"2024-07-18","version":1721278916000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Tags","content":"Dynamic programming","spoiler":true},{"title":"Difficulty","content":"3","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,false]},{"pid":3849869,"title":"Key","oj":"EOlymp","probNum":"1241","num":"K","enabledDescKeys":[2957042336537563],"descBriefs":[{"key":2957042336537563,"updateDate":"2024-07-25","version":1721850883000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Tags","content":"Prime factorization","spoiler":true},{"title":"Difficulty","content":"3","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,false]},{"pid":3849870,"title":"Game on Chessboard","oj":"EOlymp","probNum":"1242","num":"L","enabledDescKeys":[2957045679075430],"descBriefs":[{"key":2957045679075430,"updateDate":"2024-07-18","version":1721278917000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Tags","content":"Games","spoiler":true},{"title":"Difficulty","content":"5","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,false]}],"problemsHash":"37f8b52c1778b1d5c78b194bde0b5fc5","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":false,"clonedFromId":0}