摘要：
ShopaholicTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 4217Accepted: 2443DescriptionLindsay is a shopaholic. Whenever there is a discount of the kind where you can buy three items and only pay for two, she goes completely mad and feels a need to buy all items in the store. You have given 阅读全文
摘要：
Phone ListTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 13726Accepted: 4408DescriptionGiven a list of phone numbers, determine if it is consistent in the sense that no number is the prefix of another. Let's say the phone catalogue listed these numbers:Emergency 911Alice 97 625 999Bob 阅读全文
摘要：
Charm BraceletTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 10693Accepted: 4830DescriptionBessie has gone to the mall's jewelry store and spies a charm bracelet. Of course, she'd like to fill it with the best charms possible from the N (1 ≤ N ≤ 3,402) available charms. Each charm 阅读全文
摘要：
BookshelfTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 5281Accepted: 2620DescriptionFarmer John recently bought a bookshelf for cow library, but the shelf is getting filled up quite quickly, and now the only available space is at the top.Each of the N cows (1 ≤ N ≤ 20,000) has some height 阅读全文
摘要：
iChessTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 2225Accepted: 979DescriptionThe Jury of NEERC’07 quarterfinals is proud to present you a new game — chess patience. This patience is played not with cards, but with black and white square tiles. The goal of the game is to place these til 阅读全文
摘要：
Number-guessing GameTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 5279Accepted: 3858DescriptionLarry likes playing the number-guessing game.Two players are needed in a game. Suppose they are X and Y, and X presents a number for Y to guess. Firstly, X chooses a number with four different d 阅读全文
摘要：
Beer RefrigeratorTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 3351Accepted: 1308Special JudgeDescriptionBeer Lovers Club makes regular parties. They hate warm beer, but club’s refrigerator is too small to store enough beer for the whole company. So they decided to order a special super-b 阅读全文
摘要：
Prime GapTime Limit: 5000MSMemory Limit: 65536KTotal Submissions: 6120Accepted: 3480DescriptionThe 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 阅读全文
摘要：
Judging OlympiaTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 5900Accepted: 2831DescriptionFor years, a group of Regional Contest Directors (RCDs) of the ACM International Collegiate Programming Contest (ICPC) have been unsatisfied with the way contest submissions get ranked. The group see 阅读全文
摘要：
Wavelet CompressionTime Limit: 5000MSMemory Limit: 65536KTotal Submissions: 1942Accepted: 1268DescriptionThe discrete wavelet transform is a popular tool for signal compression. In this problem, your job is to write a program to decompress a one-dimensional signal (a list of integers) that has been 阅读全文
摘要：
Tower ParkingTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 1210Accepted: 758DescriptionThere is a new revolution in the parking lot business: the parking tower. The concept is simple: you drive your car into the elevator at the entrance of the tower, and the elevator and conveyor belts dr 阅读全文
摘要：
Halloween HolidaysTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 2736Accepted: 1095DescriptionPlanet Cucurbita is inhabited with intelligent pumpkins. These pumpkins are not only extremely clever, they also are fond of tourism. One of their main routes is the Earth during Halloween.As you 阅读全文
摘要：
Look and SayTime Limit: 5000MSMemory Limit: 65536KTotal Submissions: 7551Accepted: 4557DescriptionThe look and say sequence is defined as follows. Start with any string of digits as the first element in the sequence. Each subsequent element is defined from the previous one by "verbally" de 阅读全文
摘要：
Candy DistributionTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 4814Accepted: 2595DescriptionN children standing in circle who are numbered 1 through N clockwise are waiting their candies. Their teacher distributes the candies by in the following way:First the teacher gives child No.1 and 阅读全文
摘要：
Black and white paintingTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 2326Accepted: 1574DescriptionYou are visiting the Centre Pompidou which contains a lot of modern paintings. In particular you notice one painting which consists solely of black and white squares, arranged in rows and co 阅读全文