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
1930	think-cell Round 1	FINISHED	False	10800	31937116	Feb. 17, 2024, 2:35 p.m.

Problems

Solved	Index	Name	Type	Tags	Rating
( 19090 )	A	Maximise The Score	PROGRAMMING	greedy sortings
( 16098 )	B	Permutation Printing	PROGRAMMING	brute force constructive algorithms math
( 7412 )	C	Lexicographically Largest	PROGRAMMING	constructive algorithms data structures greedy sortings
( 4332 )	D1	Sum over all Substrings (Easy Version)	PROGRAMMING	brute force dp greedy strings
( 2765 )	D2	Sum over all Substrings (Hard Version)	PROGRAMMING	dp greedy strings
( 1237 )	E	2..3...4.... Wonderful! Wonderful!	PROGRAMMING	combinatorics math
( 773 )	F	Maximize the Difference	PROGRAMMING	bitmasks brute force dfs and similar
( 404 )	G	Prefix Max Set Counting	PROGRAMMING	data structures trees
( 265 )	H	Interactive Mex Tree	PROGRAMMING	interactive
( 76 )	I	Counting Is Fun	PROGRAMMING	combinatorics

Submissions

Submission Id	Author(s)	Index	Submitted	Verdict	Language	Test Set	Tests Passed	Time taken (ms)	Memory Consumed (bytes)	Tags	Rating
246943312	Chio	C	Feb. 18, 2024, 5:46 a.m.	OK	C# 10	TESTS	15	171	47718400
246929591	Elegia	B	Feb. 18, 2024, 1:55 a.m.	OK	Clang++17 Diagnostics	TESTS	9	342	16793600
247123130	sabbirahmadratul	A	Feb. 18, 2024, 5:20 p.m.	OK	C# 10	TESTS	3	77	3276800
246945406	bluemegane	A	Feb. 18, 2024, 6:10 a.m.	OK	C# 8	TESTS	3	140	3379200

remove filters

Back to search problems