T_T

题目连接：http://acm.hdu.edu.cn/showproblem.php?pid=3853LOOPSTime Limit: 15000/5000 MS (Java/Others)    Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 2512    Accepted Submission(s)

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4405Aeroplane chessTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1535    Accepted Submi

题目链接：http://poj.org/problem?id=3071

题目链接：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3329One Person GameTime Limit: 1 Second      Memory Limit: 32768 KB      Special JudgeThere is a very simple and interes

题意：D - Name That TuneTime Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 499DAppoint description: System Crawler  (2015

题目连接：http://poj.org/problem?id=2151Check the difficulty of problemsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 5173 Accepted: 2289Descript

DominationTime Limit: 8 Seconds Memory Limit: 131072 KB Special Judge Edward is the headmaster of Marjar University. He is enthusiastic about chess and often plays chess with his friends. Wha

题目连接：http://poj.org/problem?id=2096Collecting BugsTime Limit: 10000MS Memory Limit: 64000KTotal Submissions: 2623 Accepted: 1275Case Time Limit: 2000MS Special

CircleTime Limit: 2000ms   Memory limit: 65536K  有疑问？点这里^_^题目描述You have been given a circle from 0 to n - 1. If you are currently at x, you will move to (x - 1) mod n or (x + 1) mod n wi