XI Open Cup. Stage 2: Grand Prix of Ukraine

Begin: 1330156800000

XI Open Cup. Stage 2: Grand Prix of Ukraine

End: 1330174800000

Elapsed:

Remaining:

#	Origin	Title
A	EOlymp 2845	Aaa
B	EOlymp 2846	Bachelor pursuing
C	EOlymp 2847	Concatenation of credits
D	EOlymp 2848	DeviantArt
E	EOlymp 2849	Exam
F	EOlymp 2850	Fate to hate
G	EOlymp 2851	Genealogic tree
H	EOlymp 2852	Happy Birthday
I	EOlymp 2853	I love Ira
J	EOlymp 2854	Justice
K	EOlymp 2855	Knife to me
L	EOlymp 2856	Lie to me
M	EOlymp 2857	MySpace
N	EOlymp 2858	Now

Status

My Status

Translate

PDF

{"id":406813,"title":"XI Open Cup. Stage 2: Grand Prix of Ukraine","type":2,"openness":0,"authStatus":1,"begin":1330156800000,"end":1330174800000,"createTime":1604900622000,"started":true,"ended":true,"managerId":28978,"managerName":"zimpha","fav":false,"description":{"format":"MD","content":""},"announcement":"","problems":[{"pid":3849797,"title":"Aaa","oj":"EOlymp","probNum":"2845","num":"A","enabledDescKeys":[2956944116125153],"descBriefs":[{"key":2956944116125153,"updateDate":"2024-07-20","version":1721418022000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Tags","content":"Combinatorics","spoiler":true},{"title":"Difficulty","content":"4","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,false]},{"pid":3849809,"title":"Bachelor pursuing","oj":"EOlymp","probNum":"2846","num":"B","enabledDescKeys":[2956947526036012],"descBriefs":[{"key":2956947526036012,"updateDate":"2024-07-24","version":1721830597000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"Tags","content":"Dynamic programming; Math","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":3849811,"title":"Concatenation of credits","oj":"EOlymp","probNum":"2847","num":"C","enabledDescKeys":[2956942077837435],"descBriefs":[{"key":2956942077837435,"updateDate":"2024-07-21","version":1721574378000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"Tags","content":"Combinatorics; Number theory","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":3849812,"title":"DeviantArt","oj":"EOlymp","probNum":"2848","num":"D","enabledDescKeys":[2956955143476308],"descBriefs":[{"key":2956955143476308,"updateDate":"2024-07-11","version":1720711307000,"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":"5","spoiler":true}],"weight":1,"submitTips":"The problem is unavailable for long time.","submitMethods":[true,true,false]},{"pid":3849813,"title":"Exam","oj":"EOlymp","probNum":"2849","num":"E","enabledDescKeys":[2956962966219695],"descBriefs":[{"key":2956962966219695,"updateDate":"2024-07-25","version":1721838926000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"Tags","content":"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":3849814,"title":"Fate to hate","oj":"EOlymp","probNum":"2850","num":"F","enabledDescKeys":[2956952270372361],"descBriefs":[{"key":2956952270372361,"updateDate":"2024-07-12","version":1720746011000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"2000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"Tags","content":"Bitwise Operations; Brute force","spoiler":true},{"title":"Difficulty","content":"1","spoiler":true}],"weight":1,"submitTips":"The problem is unavailable for long time.","submitMethods":[true,true,false]},{"pid":3849815,"title":"Genealogic tree","oj":"EOlymp","probNum":"2851","num":"G","enabledDescKeys":[2956936293842566],"descBriefs":[{"key":2956936293842566,"updateDate":"2024-07-21","version":1721547578000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"Tags","content":"Dynamic programming","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":3849816,"title":"Happy Birthday","oj":"EOlymp","probNum":"2852","num":"H","enabledDescKeys":[2956931114538197],"descBriefs":[{"key":2956931114538197,"updateDate":"2024-07-22","version":1721646231000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"Tags","content":"Graphs; Dynamic programming; Probabilities","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":3849818,"title":"I love Ira","oj":"EOlymp","probNum":"2853","num":"I","enabledDescKeys":[2956934323113312],"descBriefs":[{"key":2956934323113312,"updateDate":"2024-07-21","version":1721565422000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"3000 ms","spoiler":false},{"title":"Mem limit","content":"262144 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":3849819,"title":"Justice","oj":"EOlymp","probNum":"2854","num":"J","enabledDescKeys":[2956957517758970],"descBriefs":[{"key":2956957517758970,"updateDate":"2024-07-21","version":1721572120000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"Tags","content":"Math; 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":3849823,"title":"Knife to me","oj":"EOlymp","probNum":"2855","num":"K","enabledDescKeys":[2956949695017699],"descBriefs":[{"key":2956949695017699,"updateDate":"2024-07-25","version":1721838548000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"Tags","content":"Geometry","spoiler":true},{"title":"Difficulty","content":"0","spoiler":true}],"weight":1,"submitTips":"The contest is too ancient. New submissions will be considered out of the contest.","submitMethods":[true,true,false]},{"pid":3849827,"title":"Lie to me","oj":"EOlymp","probNum":"2856","num":"L","enabledDescKeys":[2956978942094126],"descBriefs":[{"key":2956978942094126,"updateDate":"2024-07-12","version":1720722550000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"Tags","content":"Geometry; Math","spoiler":true},{"title":"Difficulty","content":"1","spoiler":true}],"weight":1,"submitTips":"The problem is unavailable for long time.","submitMethods":[true,true,false]},{"pid":3849830,"title":"MySpace","oj":"EOlymp","probNum":"2857","num":"M","enabledDescKeys":[2956973493633405],"descBriefs":[{"key":2956973493633405,"updateDate":"2024-07-21","version":1721516124000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"262144 kB","spoiler":false},{"title":"Tags","content":"Trees","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":3849831,"title":"Now","oj":"EOlymp","probNum":"2858","num":"N","enabledDescKeys":[2956976300359560],"descBriefs":[{"key":2956976300359560,"updateDate":"2024-07-20","version":1721405340000,"author":"0","remarks":"Initialization."}],"properties":[{"title":"Time limit","content":"1000 ms","spoiler":false},{"title":"Mem limit","content":"65536 kB","spoiler":false},{"title":"Tags","content":"Graph matchings","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]}],"problemsHash":"1ff5839fbf47e03ec3d2b50718b0e4e7","privatePeerContestIds":[],"enableTimeMachine":true,"sumTime":true,"penalty":1200,"partialScore":false,"customizedWeight":false,"showPeers":false,"clonedFromId":0}