摘要:Query on A Tree HDU - 6191 Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 132768/132768 K (Java/Others)Total Submission(s): 1732 Accepted Subm
阅读全文
摘要:A Dangerous Maze LightOJ - 1027 You are in a maze; seeing n doors in front of you in beginning. You can choose any door you like. The probability for
阅读全文
摘要:Dice (III) LightOJ - 1248 Given a dice with n sides, you have to find the expected number of times you have to throw that dice to see all its faces at
阅读全文
摘要:The Dominant Color 链接:https://www.nowcoder.com/questionTerminal/0495013675774f008541ea371eb5af17来源:牛客网Behind the scenes in the computer's memory, colo
阅读全文
摘要:CS Course HDU - 6186 Little A has come to college and majored in Computer and Science. Today he has learned bit-operations in Algorithm Lessons, and h
阅读全文
摘要:Ilya Muromets Gym - 100513F Силачом слыву недаром — семерых одним ударом! From the Russian cartoon on the German fairy tale. Силачом слыву недаром — с
阅读全文
摘要:Election of a Mayor Gym - 100513E The Berland capital is preparing for mayoral election. There are two candidates for the position: the current mayor
阅读全文
摘要:Beauty of Array ZOJ - 3872 Edward has an array A with N integers. He defines the beauty of an array as the summation of all distinct integers in the a
阅读全文
摘要:Team Formation ZOJ - 3870 For an upcoming programming contest, Edward, the headmaster of Marjar University, is forming a two-man team from N students
阅读全文
摘要:Polo the Penguin and XOR operation CodeForces - 288C Little penguin Polo likes permutations. But most of all he likes permutations of integers from 0
阅读全文