Jack Ge for ACM

摘要： Problem AChess QueenInput:Standard InputOutput:Standard OutputYou probably know how the game of chess is played and how chess queen operates. Two chess queens are in attacking position when they are on same row, column or diagonal of a chess board. Suppose two such chess queens (one black and the ot 阅读全文

摘要： Matrix Swapping IITime Limit: 9000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 793Accepted Submission(s): 537 Problem DescriptionGiven an N * M matrix with each entry equal to 0 or 1. We can find some rectangles in the matrix whose entries are all 1, and we de 阅读全文

摘要： Largest SubmatrixTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 839Accepted Submission(s): 407 Problem DescriptionNow here is a matrix with letter 'a','b','c','w','x','y','z' and you can cha 阅读全文

摘要： BeansTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1819Accepted Submission(s): 921 Problem DescriptionBean-eating is an interesting game, everyone owns an M*N matrix, which is filled with different qualities beans. Meantime, there is only one be 阅读全文

摘要： CoinsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4071Accepted Submission(s): 1629 Problem DescriptionWhuacmers use coins.They have coins of value A1,A2,A3...An Silverland dollar. One day Hibix opened purse and found there were some coins. He d 阅读全文

摘要： The Number of setTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 889Accepted Submission(s): 550 Problem DescriptionGiven you n sets.All positive integers in sets are not less than 1 and not greater than m.If use these sets to combinate the new set 阅读全文

摘要： Goldbach's ConjectureTime Limit:1000MSMemory Limit:65536KTotal Submissions:9192Accepted:5357DescriptionFor any even number n greater than or equal to 4, there exists at least one pair of prime numbersp1andp2such thatn=p1+p2This conjecture has not been proved nor refused yet. No one is sure wheth 阅读全文

摘要： 最大报销额Time Limit : 1000/1000ms (Java/Other)Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 29Accepted Submission(s) : 11Problem Description现有一笔经费可以报销一定额度的发票。允许报销的发票类型包括买图书（A类）、文具（B类）、差旅（C类），要求每张发票的总额不得超过1000元，每张发票上，单项物品的价值不得超过600元。现请你编写程序，在给出的一堆发票中找出可以报销的、不超过给定额度的最大报销额。Input测试输入包含若干测试用例 阅读全文

摘要： X mod f(x)Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1014Accepted Submission(s): 453 Problem DescriptionHere is a function f(x): int f ( int x ) { if ( x == 0 ) return 0; return f ( x / 10 ) + x % 10; } Now, you want to ... 阅读全文

摘要： 威威猫系列故事——篮球梦Time Limit: 300/100 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 774Accepted Submission(s): 200 Problem Description 威威猫十分迷恋篮球比赛，是忠实的NBA球迷，他常常幻想自己那肥硕的身躯也能飞起扣篮。另外，他对篮球教练工作也情有独钟，特别是对比赛的战术，投篮选择方面也是很有研究，下面就是威威猫研究过的一个问题： 一场NBA篮球比赛总共48分钟，假如我们现在已经知道当前比分 A:B，... 阅读全文