Solutions are presented as using the least memory and the fastest execution time. It also takes the top 10 most recent solutions from each language. If you want to limit to a specific index, click the "Solved" button and go to that problem.

ContestId	Name	Phase	Frozen	Duration (Seconds)	Relative Time	Start Time
1374	Codeforces Round 653 (Div. 3)	FINISHED	False	7200	144775493	June 28, 2020, 2:35 p.m.

Problems

Solved	Index	Name	Type	Tags	Rating
( 55687 )	A	Required Remainder	PROGRAMMING	math
( 53451 )	B	Multiply by 2, divide by 6	PROGRAMMING	math
( 49237 )	C	Move Brackets	PROGRAMMING	greedy strings
( 24747 )	D	Zero Remainder Array	PROGRAMMING	math sortings two pointers
( 14209 )	E1	Reading Books (easy version)	PROGRAMMING	data structures greedy implementation sortings
( 953 )	E2	Reading Books (hard version)	PROGRAMMING	binary search data structures greedy sortings ternary search two pointers
( 1319 )	F	Cyclic Shifts Sorting	PROGRAMMING	brute force constructive algorithms implementation

Submissions

Submission Id	Author(s)	Index	Submitted	Verdict	Language	Test Set	Tests Passed	Time taken (ms)	Memory Consumed (bytes)	Tags	Rating
85381406	ruban	E1	June 28, 2020, 4:30 p.m.	OK	Delphi	TESTS	39	264	199680000
85386118	Gassa	D	June 28, 2020, 4:41 p.m.	OK	D	TESTS	19	124	28979200
85385076	Gassa	D	June 28, 2020, 4:37 p.m.	OK	D	TESTS	19	139	28979200
85376091	Gassa	D	June 28, 2020, 4:21 p.m.	OK	D	TESTS	19	140	10854400
85377133	Gassa	C	June 28, 2020, 4:23 p.m.	OK	D	TESTS	4	30	4710400
85378626	Gassa	B	June 28, 2020, 4:26 p.m.	OK	D	TESTS	28	46	4710400
85379834	Gassa	A	June 28, 2020, 4:28 p.m.	OK	D	TESTS	20	77	4812800

remove filters

Back to search problems