A:Avalon
A可以把边长和角度记下来,用kmp做,时间复杂度O(n);
B:ElGamal Decryption
C:The Least Palindromic Number
D:GCD depth
E:DIY Necklace
F:Distinct Numbers
显然这是可以O(1)的,二分毫无必要。
G:Election
H:Repeating Characters
I:Largest Submatrix