Solved by do_solve

#	Title	# Solved	Avg. Tries
18210	Fast Forwarding	71	1.28
18211	Estimating the Flood Risk	59	1.29
18212	Wall Painting	30	1.87
18213	Twin Trees Bros.	16	2.06
18214	Reordering the Documents	55	2.02
18216	Ambiguous Encoding	39	1.36
18217	Parentheses Editor	46	1.63
18218	One-Way Conveyors	34	3.85
19405	Exclusive Training	35	3.69
21926	Three-Axis Views	69	1.29
21927	Secrets of Legendary Treasure	58	1.74
21928	Short Coding	27	1.70
21930	Jewelry Size	48	1.63
21932	To be Connected, or not to be, that is the Question	49	1.31
21933	LCM of GCDs	52	1.69
21934	High-Tech Detective	38	2.45
21935	Formica Sokobanica	63	1.17
21936	Suffixes may Contain Prefixes	27	1.56
23480	Count Modulo 2	16	2.88
23481	Robots	26	2.42
23483	Construct Points	49	3.47
23484	Amidakuji	19	1.89
23493	Back and Forth	14	1.50
23495	Longest Lyndon Prefix	22	1.82
23496	Program Optimization	7	2.14
23497	Determination	4	4.50
23498	Fraction Reduction	9	4.11
26449	Harvest	28	1.39
26450	Parse the Syntax Tree	26	1.38
26451	Permutation Magic	7	1.86
26452	MFP: Most Fluctuated Player	10	2.10
26455	Pizza delivery	21	1.33
26456	include	24	1.75
26457	(N+1)-legged race	15	1.33
26458	Isomorphic?	11	2.09
26461	Stop & Go	23	1.52
26462	1-Player Concentration	20	1.20
26463	Track Train Trail	8	1.63
26464	2-LIS	18	2.06
26465	Sharp 2-SAT	3	4.00
26466	Seimei Handan 999.0	8	1.88
26468	Sloppy city planning	26	1.77
26469	$N-1$ Truths and a Lie	10	3.20
26470	Most distant point from the stations	12	3.92
26472	Tree Automorphism	7	1.00
26850	XOR Pairs	47	1.47
26851	Bicycle Tour	32	1.75
26853	Uniform Maker	46	1.02
26854	Concerto de Pandemic	11	6.36
26855	Not One	38	2.32

12