Solved by gennadykorotkevich

#	Title	# Solved	Avg. Tries
17468	N! mod P (3)	33	3.67
18168	Game with Polynomials 2	50	3.10
18607	Domino Covering	18	20.44
18661	The One Polynomial Man	12	2.00
21269	Edge Subsets	7	2.71
31500	N진수 곱셈 (tiny)	47	3.83
31505	N진수 곱셈 (HUGE)	24	7.46

1