算法爱好者

摘要： Pseudoprime numbersTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 4864Accepted: 1872DescriptionFermat's theorem states that for any prime number p and for any integer a > 1, ap = a (mod p). That is, if we raise a to the pth power and divide by p, the remainder is a. Some (but not ve 阅读全文

摘要： Balanced LineupTime Limit: 5000MSMemory Limit: 65536KTotal Submissions: 22573Accepted: 10499Case 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 阅读全文

摘要： Ubiquitous ReligionsTime Limit: 5000MSMemory Limit: 65536KTotal Submissions: 17089Accepted: 8283DescriptionThere are so many different religions in the world today that it is difficult to keep track of them all. You are interested in finding out how many different religions students in your universi 阅读全文

摘要： Prime CutsTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 8245Accepted: 3151DescriptionA prime number is a counting number (1, 2, 3, ...) that is evenly divisible only by 1 and itself. In this problem you are to write a program that will cut some number of prime numbers from the list of pri 阅读全文

摘要： Prime GapTime Limit: 5000MSMemory Limit: 65536KTotal Submissions: 6597Accepted: 3775DescriptionThe sequence of n − 1 consecutive composite numbers (positive integers that are not prime and not equal to 1) lying between two successive prime numbers p and p + n is called a prime gap of length n. For e 阅读全文

摘要： Graph’s Cycle ComponentTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 1275Accepted Submission(s): 499Problem DescriptionIn graph theory, a cycle graph is an undirected graph that consists of a single cycle, or in other words, some number of verti 阅读全文

摘要： A strange liftTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5644Accepted Submission(s): 2073Problem DescriptionThere is a strange lift.The lift can stop can at every floor as you want, and there is a number Ki(0 <= Ki <= N) on every floor.T 阅读全文

摘要： The SuspectsTime Limit: 1000MSMemory Limit: 20000KTotal Submissions: 14589Accepted: 6957DescriptionSevere acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology, was recognized as a global threat in mid-March 2003. To minimize transmission to others, the best strategy is to se 阅读全文

摘要： Bad Hair DayTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 10202Accepted: 3412DescriptionSome of Farmer John's N cows (1 ≤ N ≤ 80,000) are having a bad hair day! Since each cow is self-conscious about her messy hairstyle, FJ wants to count the number of other cows that can see the top 阅读全文

摘要： Moving TablesTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 20479Accepted: 6717DescriptionThe famous ACM (Advanced Computer Maker) Company has rented a floor of a building whose shape is in the following figure. The floor has 200 rooms each on the north side and south side along the corrid 阅读全文