摘要：
Gold CoinsTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 16569Accepted: 10398DescriptionThe king pays his loyal knight in gold coins. On the first day of his service, the knight receives one gold coin. On each of the next two days (the second and third days of service), the knight receives 阅读全文
posted @ 2011-11-21 23:28
w0w0
阅读(158)
评论(0)
推荐(0)
摘要：
Count on CantonTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 8107Accepted: 4733DescriptionOne of the famous proofs of modern mathematics is Georg Cantor's demonstration that the set of rational numbers is enumerable. The proof works by using an explicit enumeration of rational numbers 阅读全文
posted @ 2011-11-21 23:27
w0w0
阅读(185)
评论(0)
推荐(0)
摘要：
DartsTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 1028Accepted: 573DescriptionBackground Many nations (including Germany) have a strange tradition of throwing small arrows at round flat targets (usually, these small arrows are called darts and so is the game). In a darts game, the target 阅读全文
posted @ 2011-11-21 23:26
w0w0
阅读(296)
评论(0)
推荐(0)
摘要：
World Cup NoiseTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 12396Accepted: 6100DescriptionBackground "KO-RE-A, KO-RE-A" shout 54.000 happy football fans after their team has reached the semifinals of the FIFA World Cup in their home country. But although their excitement is rea 阅读全文
posted @ 2011-11-21 23:25
w0w0
阅读(266)
评论(0)
推荐(0)
摘要：
Ride to SchoolTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 15152Accepted: 6081DescriptionMany graduate students of Peking University are living in Wanliu Campus, which is 4.5 kilometers from the main campus – Yanyuan. Students in Wanliu have to either take a bus or ride a bike to go to s 阅读全文
posted @ 2011-11-21 23:24
w0w0
阅读(184)
评论(0)
推荐(0)
摘要：
All in AllTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 21170Accepted: 8374DescriptionYou have devised a new encryption technique which encodes a message by inserting between its characters randomly generated strings in a clever way. Because of pending patent issues we will not discuss in 阅读全文
posted @ 2011-11-21 23:24
w0w0
阅读(248)
评论(0)
推荐(0)
摘要：
StripiesTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 8715Accepted: 4287DescriptionOur chemical biologists have invented a new very useful form of life called stripies (in fact, they were first called in Russian - polosatiki, but the scientists had to invent an English name to apply for a 阅读全文
posted @ 2011-11-21 23:23
w0w0
阅读(143)
评论(0)
推荐(0)
摘要：
CodeTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 5387Accepted: 2487DescriptionTransmitting and memorizing information is a task that requires different coding systems for the best use of the available space. A well known system is that one where a number is associated to a character sequ 阅读全文
posted @ 2011-11-21 22:41
w0w0
阅读(122)
评论(0)
推荐(0)
摘要：
AlignmentTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 7394Accepted: 2343DescriptionIn the army, a platoon is composed by n soldiers. During the morning inspection, the soldiers are aligned in a straight line in front of the captain. The captain is not satisfied with the way his soldiers 阅读全文
posted @ 2011-11-21 22:40
w0w0
阅读(134)
评论(0)
推荐(0)
摘要：
SumTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 8859Accepted: 5756DescriptionConsider the natural numbers from 1 to N. By associating to each number a sign (+ or -) and calculating the value of this expression we obtain a sum S. The problem is to determine for a given sum S the minimum n 阅读全文
posted @ 2011-11-21 22:40
w0w0
阅读(157)
评论(0)
推荐(0)
摘要：
#include<iostream>#include<algorithm>using namespace std;int main(){ int flag; int m,n,k; int i; int num[1024]; scanf("%d",&m); while(m--) { scanf("%d%d",&n,&k); for(i=0;i<n;i++) { scanf("%d",&num[i]); } for(i=0;i<k;i++) { ... 阅读全文
posted @ 2011-11-21 22:39
w0w0
阅读(121)
评论(0)
推荐(0)
摘要：
BrainmanTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 6739Accepted: 3711DescriptionBackground Raymond Babbitt drives his brother Charlie mad. Recently Raymond counted 246 toothpicks spilled all over the floor in an instant just by glancing at them. And he can even count Poker cards. Charl 阅读全文
posted @ 2011-11-21 22:38
w0w0
阅读(172)
评论(0)
推荐(0)
摘要：
Yeehaa!Time Limit: 1000MSMemory Limit: 30000KTotal Submissions: 9195Accepted: 4706DescriptionBackground George B. wants to be more than just a good American. He wants to make his daddy proud and become a western hero. You know, like John Wayne. But sneaky as he is, he wants a special revolver that w 阅读全文
posted @ 2011-11-21 22:37
w0w0
阅读(194)
评论(0)
推荐(0)
摘要：
In DangerTime Limit: 1000MSMemory Limit:30000KTotal Submissions: 3001Accepted:1582DescriptionFlavius Josephus and 40 fellow rebels were trapped by the Romans. His companions preferred suicide to surrender, so they decided to form a circle and to kill every third person and to proceed around the circ 阅读全文
posted @ 2011-11-21 22:35
w0w0
阅读(157)
评论(0)
推荐(0)
摘要：
OrdersTime Limit: 1000MSMemory Limit:10000KTotal Submissions: 7274Accepted:4573DescriptionThe stores manager has sorted all kinds of goods in an alphabetical order of their labels. All the kinds having labels starting with the same letter are stored in the same warehouse (i.e. in the same building) 阅读全文
posted @ 2011-11-21 22:34
w0w0
阅读(155)
评论(0)
推荐(0)
浙公网安备 33010602011771号