Problem Name Time Limit
A - Shortest Common Non-Subsequence(1) [Very Special Judge] 5s
B - Eulerian Flight Tour(1) [Very Special Judge] 3s
C - Fair Chocolate-Cutting(1) [Very Special Judge] 2s
D - Four-Coloring(1) [Very Special Judge] 2s
E - Ranks(1) [Very Special Judge] 10s
F - Colorful Tree(1) [Very Special Judge] 5s
G - Sixth Sense(1) [Very Special Judge] 5s
H - Flying Squirrel(1) [Very Special Judge] 1s
I - Grid Coloring (1) [Very Special Judge] 1s
J - How many groups(1) [Very Special Judge] 1s
K - Lucky Pascal Triangle(1) [Very Special Judge] 1s
L - As rich as Crassus(1) [Very Special Judge] 1s
M - Bowabowaukulipukuli(1) [Very Special Judge] 1s
N - Floating-Point Hazard(1) [Very Special Judge] 1s
O - The Stream of Corning 2(1) [Very Special Judge] 3s
P - Count on a tree II(1) [Very Special Judge] 10s
Q - Knights of the Round Table(1) 3s
R - Convex Hull Finding (1) 10s
S - Engaging with Loyal Customers(1) [Very Special Judge] 2s

Contest is over.
programmer: 劉邦鋒 pangfeng, 上官林傑 ericsk, 陳映睿 springgod, 王尹 cindylinz, 蕭俊宏 chhsiao.
Imager: 江昌鴻 senkousha.
modified by: 高紹航 denehs, 沈定 beephoenix, 馮俊菘 csferng, 黃上恩 tmt514