摘要：
Problem DescriptionGiven two sequences of numbers : a[1], a[2], ...... , a[N], and b[1], b[2], ...... , b[M] (1 #include#include#include#include#inclu... 阅读全文
摘要：
You are given a non-negative integern, its decimal representation consists of at most100digits and doesn't contain leading zeroes.Your task is to dete... 阅读全文
摘要：
Bus SystemTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7295Accepted Submission(s): 1903Problem ... 阅读全文
摘要：
Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6608Accepted Submission(s): 2848Problem Descriptio... 阅读全文
摘要：
2015 4 7作者：来自华东交大的不知名的小渣渣从大一入学后，acm学长的扫班之下让我知道了有ACM这个东西，听说参加ACM之后年薪会很高加上喜欢这个专业就选择想参加ACM，还记得那是一个下午，我一个人跑到ACM基地，买了本小白书加入了ACM14级的群就算ACM之路开始了，从那之后没个星期都有1次... 阅读全文
摘要：
2^x mod n = 1Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13749Accepted Submission(s): 4239Prob... 阅读全文
摘要：
Problem Description=== Op tech briefing, 2002/11/02 06:42 CST ==="The item is locked in a Klein safe behind a painting in the second-floor library. Kl... 阅读全文
摘要：
ArbitrageTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5047Accepted Submission(s): 2314Problem D... 阅读全文
摘要：
Problem DescriptionThese are N cities in Spring country. Between each pair of cities there may be one transportation track or none. Now there is some ... 阅读全文
摘要：
Problem DescriptionRPG girls今天和大家一起去游乐场玩，终于可以坐上梦寐以求的过山车了。可是，过山车的每一排只有两个座位，而且还有条不成文的规矩，就是每个女生必须找个个男生做partner和她同坐。但是，每个女孩都有各自的想法，举个例子把，Rabbit只愿意和XHD或PQK... 阅读全文