Solved by whyrano

#	Title	# Solved	Avg. Tries
11689	GCD(n, k) = 1	4,720	2.50
11003	최솟값 찾기	9,481	3.22
8112	Ones And Zeros 2	343	3.06
8111	Ones And Zeros	1,150	1.75
4994	Find The Multiple	231	2.01

1