摘要：
Problem DescriptionA lock you use has a code system to be opened instead of a key. The lock contains a sequence of wheels. Each wheel has the 26 lette... 阅读全文
摘要：
Problem DescriptionTT and FF are ... friends. Uh... very very good friends -________-bFF is a bad boy, he is always wooing TT to play the following ga... 阅读全文
摘要：
Problem Description Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7 阅读全文
摘要：
Problem DescriptionEzio Auditore is a great master as an assassin. Now he has prowled in the enemies’ base successfully. He finds that the only weapon... 阅读全文