摘要： FroggerTime Limit: 1000MSMemory Limit: 65536KTotal Submits: 23Accepted: 5DescriptionPhilip J. Frog just wanted to go for a mid-afternoon swim, but in typical frog fashion he's ended up in the middle of a busy street. Help Phil figure out how long he\'ll be hopping on hot asphalt before he finds his 阅读全文

摘要： Electronic Document SecurityTime Limit: 1000MSMemory Limit: 65536KTotal Submits: 25Accepted: 19DescriptionThe Tyrell corporation uses a state-of-the-art electronic document system that controls all aspects of document creation, viewing, editing, and distribution. Document security is handled viaacce 阅读全文

摘要： The Stable Marriage ProblemTime Limit: 1000MSMemory Limit: 65536KTotal Submits: 40Accepted: 11DescriptionThe stable marriage problem consists of matching members of two different sets according to the member’s preferences for the other set’s members. The input for our problem consists of:a set M of 阅读全文

摘要： 跳蚤Time Limit:1000MSMemory Limit:10000KTotal Submissions:4783Accepted:1241DescriptionZ城市居住着很多只跳蚤。在Z城市周六生活频道有一个娱乐节目。一只跳蚤将被请上一个高空钢丝的正中央。钢丝很长，可以看作是无限长。节目主持人会给该跳蚤发一张卡片。卡片上写有N+1个自然数。其中最后一个是M，而前N个数都不超过M，卡片上允许有相同的数字。跳蚤每次可以从卡片上任意选择一个自然数S，然后向左，或向右跳S个单位长度。而他最终的任务是跳到距离他左边一个单位长度的地方，并捡起位于那里的礼物。比如当N=2，M=18时，持有卡片(1 阅读全文

摘要： CipherTime Limit:1000MSMemory Limit:10000KTotal Submissions:13623Accepted:3434DescriptionBob and Alice started to use a brand-new encoding scheme. Surprisingly it is not a Public Key Cryptosystem, but their encoding and decoding is based on secret keys. They chose the secret key at their last meetin 阅读全文

摘要： EXPO JourneyTime Limit: 1000MS Memory Limit: 65536KDescriptionziRoy would like to visit the EXPO tomorrow and now he wants to make a plan in advance. China pavilion is absolutely a terrific place whic... 阅读全文

摘要： YO!Time Limit: 1000MS Memory Limit: 65536KDescriptionWhile sitting in traffic on I-35 one day, you look up at the pickup in front of you and notice the word "YO" staring back at you from the tailgate.... 阅读全文

摘要： ClickomaniaTime Limit: 5000MS Memory Limit: 65536KDescriptionClickomania is a puzzle in which one starts with a rectangular grid of cells of different colours. In each step, a player selects ("clicks"... 阅读全文

摘要： The Ninja WayTime Limit: 3000MS Memory Limit: 65536KDescriptionAs we all know, Ninjas travel by jumping from treetop to treetop. A clan of Ninjas plans to use N trees to hone their tree hopping skills. They will start at the shortest tree and make N-1 jumps, with each jump taking them to a taller tr 阅读全文

摘要： Museum GuardsTime Limit: 5000MS Memory Limit: 65536KTotal Submits: 38 Accepted: 17DescriptionA museum has hired some guards and is trying to build a schedule for them. The museum would like to build a... 阅读全文