摘要： How many Knight Placing?Time Limit:3000MSMemory Limit:Unknown64bit IO Format:%lld & %llu[Submit] [Go Back] [Status]DescriptionIIUPC2006Problem H: How ... 阅读全文

摘要： Free GoodiesTime Limit:3000MSMemory Limit:Unknown64bit IO Format:%lld & %llu[Submit] [Go Back] [Status]DescriptionBFree GoodiesPetra and Jan have just... 阅读全文

摘要： Training little catsTime Limit:2000MSMemory Limit:65536KTotal Submissions:9299Accepted:2230DescriptionFacer's pet cat just gave birth to a brood of li... 阅读全文

摘要： The Nerd FactorTime Limit:1000MSMemory Limit:Unknown64bit IO Format:%lld & %llu[Submit] [Go Back] [Status]DescriptionProf.Venky handles Advanced Topic... 阅读全文

摘要： Max Sum of Max-K-sub-sequenceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5569Accepted Submission(s): 2003Problem DescriptionGiven a circle sequence A[1],A[2],A[3]......A[n]. Circle sequence means the left neighbour of A[1] is A[n] , and the rig 阅读全文

摘要： Beautiful DreamTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 629Accepted Submission(s): 224Problem DescriptionWhen we were a child, we all had a beautiful dream, time flies, where is your colorful dream living in now?Get it? If not, it doesn’t ma 阅读全文

摘要： Another Easy ProblemTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64u[Submit] [Go Back] [Status]Descriptionxtt最近学习了高斯消元法解方程组,现在他的问题来了，如果是以下的方程，那么应该如何解呢?C(n1,m1)==0 (mod M)C(n2,m2)==0 (mod M)C(n3,m3)==0 (mod M)................C(nk,mk)==0 (mod M)xtt希望你告诉他满足条件的最大的M其中C(i,j)表示组合数,例如C 阅读全文

摘要： DivisorsTime Limit:1000MSMemory Limit:65536KTotal Submissions:9940Accepted:2924DescriptionYour task in this problem is to determine the number of divisors ofCnk. Just for fun -- or do you need any special reason for such a useful computation?InputThe input consists of several instances. Each instanc 阅读全文

摘要： Happy 2006Time Limit:3000MSMemory Limit:65536KTotal Submissions:9049Accepted:3031DescriptionTwo positive integers are said to be relatively prime to each other if the Great Common Divisor (GCD) is 1. For instance, 1, 3, 5, 7, 9...are all relatively prime to 2006.Now your job is easy: for the given i 阅读全文

摘要： Racing Car ComputerInput:Standard InputOutput:Standard OutputThe racing cars of today are equipped with so many sophisticated equipment. Introduction of a new visual transducer which is interfaced with the on-board computer can tell you on the fly how many cars are ahead of you while how many are tr 阅读全文