摘要：
题目链接：http://codeforces.com/problemset/problem/831/C 题意：有一位参赛选手，我们不知道他初始或最后的成绩，但是知道k次评审所加（减）的分数，以及n个在这过程中的他的分数。问这名选手初始分有几种情况。 思路：一开始考虑先求出评审分的前缀和，对过程分减去 阅读全文
摘要：
Hacker, pack your bags! time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Hacker, pack you 阅读全文
摘要：
HazelFan wants to build a rooted tree. The tree has nn nodes labeled 0 to n−1, and the father of the node labeled i is the node labeled . HazelFan won 阅读全文
摘要：
给出N个正整数，找出N个数两两之间最大公约数的最大值。例如：N = 4，4个数为：9 15 25 16，两两之间最大公约数的最大值是15同25的最大公约数5。 给出N个正整数，找出N个数两两之间最大公约数的最大值。例如：N = 4，4个数为：9 15 25 16，两两之间最大公约数的最大值是15同2 阅读全文
摘要：
Rikka with Graph Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Problem Description As we know, Rikka is poor at mat 阅读全文
摘要：
Matching In Multiplication Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 1389 Accepted Submis 阅读全文
摘要：
Counting Divisors Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 2599 Accepted Submission(s): 阅读全文
摘要：
Kanade's sum Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2512 Accepted Submission(s): 1045 Pr 阅读全文
摘要：
Regular polygon Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2219 Accepted Submission(s): 880 阅读全文
摘要：
TrickGCD Time Limit: 5000/2500 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 2523 Accepted Submission(s): 965 Probl 阅读全文