GalileiTN - Marathon

Problems

Name Solved / Tries Average tries Average tries to solve
A Ones 10/24 (42%) 2.00 1.70
B Convex Polygon Area 13/23 (57%) 1.77 1.77
C Longest Increasing Subsequence 6/21 (29%) 3.50 3.50
D Knapsack 7/28 (25%) 4.00 4.00
E Polynomial Multiplication 2 2/3 (67%) 1.00 1.00
F Union-Find 8/24 (33%) 2.40 2.75
G Minimum Spanning Tree 7/24 (29%) 3.00 3.14
H Eulerian Path 2/23 (9%) 11.50 11.50
I Chinese Remainder 2/11 (18%) 3.67 5.00
J String Hashing 2/40 (5%) 10.00 7.50
K Linear Recurrences 1/3 (33%) 3.00 3.00
L Convex Hull 4/20 (20%) 5.00 5.00
M Single source shortest path, non-negative weights 8/17 (47%) 2.12 2.12
N Single source shortest path, time table 6/34 (18%) 5.67 5.67
O Fenwick Tree 6/33 (18%) 5.50 5.50