摘要:A very hard Aoshu problemTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 110Accepted Submission(s): 82Problem DescriptionAoshu is very popular among primary school students. It is mathematics, but much harder than ordinary mathematics for primary s
阅读全文
摘要:Accept: 77Submit: 136Time Limit: 1000 mSecMemory Limit : 32768 KB Problem DescriptionGiven the value of N, you will have to find the value of G. The meaning of G is given in the following code G=0; for(i=1;i<N;i++) for(j=i+1;j<=N;j++) G+=gcd(i,j); /*Here gcd() is a function that finds the...
阅读全文
摘要:A Short problemTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 779Accepted Submission(s): 296Problem Description According to a research, VIM users tend to have shorter fingers, compared with Emacs users. Hence they prefer problems short, too. He..
阅读全文
摘要:CoderTime Limit: 20000/10000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1260Accepted Submission(s): 551Problem Description In mathematics and computer science, an algorithm describes a set of procedures or instructions that define a procedure. The term has become..
阅读全文
摘要:Balanced LineupTime Limit: 5000MSMemory Limit: 65536KTotal Submissions: 24349Accepted: 11348Case Time Limit: 2000MSDescriptionFor the daily milking, Farmer John's N cows (1 ≤ N ≤ 50,000) always line up in the same order. One day Farmer John decides to organize a game of Ultimate Frisbee with som
阅读全文
摘要:连连看Time Limit: 20000/10000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10237Accepted Submission(s): 2695Problem Description“连 连看”相信很多人都玩过。没玩过也没关系,下面我给大家介绍一下游戏规则:在一个棋盘中,放了很多的棋子。如果某两个相同的棋子,可以通过一条线连起来 (这条线不能经过其它棋子),而且线的转折次数不超过两次,那么这两个棋子就可以在棋盘上消去。不好意思,由于我以前没有玩过连连看,咨询了同学
阅读全文
摘要:Sticks ProblemTime Limit: 6000MSMemory Limit: 65536KTotal Submissions: 8623Accepted: 2222DescriptionXuanxuan has n sticks of different length. One day, she puts all her sticks in a line, represented by S1, S2, S3, ...Sn. After measuring the length of each stick Sk (1 <= k <= n), she finds that
阅读全文
摘要:A Simple Problem with IntegersTime Limit: 5000/1500 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1038Accepted Submission(s): 371Problem DescriptionLet A1, A2, ... , AN be N elements. You need to deal with two kinds of operations. One type of operation is to add a giv
阅读全文