2013年8月20日
HDU 4690 EBCDIC
摘要： EBCDICTime Limit: 2000/2000 MS (Java/Others)Memory Limit: 102400/102400 K (Java/Others) Total Submission(s): 169Accepted Submission(s): 87 Problem DescriptionA mad scientist found an ancient message from an obsolete IBN System/360 mainframe. He believes that this message contains some very important 阅读全文
posted @ 2013-08-20 19:40 ~~Snail~~ 阅读(278) 评论(0) 推荐(0)
2013年8月19日
POJ 3176 Cow Bowling
摘要： Cow BowlingTime Limit:1000MSMemory Limit:65536KTotal Submissions:12121Accepted:7985DescriptionThe cows don't use actual bowling balls when they go bowling. They each take a number (in the range 0..99), though, and line up in a standard bowling-pin-like triangle like this: 7 3 8 ... 阅读全文
posted @ 2013-08-19 14:28 ~~Snail~~ 阅读(183) 评论(0) 推荐(0)
2013年8月9日
HDU 2044 一只小蜜蜂
摘要： 一只小蜜蜂...Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 29985Accepted Submission(s): 11066 Problem Description有一只经过训练的蜜蜂只能爬向右侧相邻的蜂房，不能反向爬行。请编程计算蜜蜂从蜂房a爬到蜂房b的可能路线数。 其中，蜂房的结构如下所示。 Input输入数据的第一行是一个整数N,表示测试实例的个数，然后是N 行数据，每行包含两个整数a和b(0 2 #include 3 #inc 阅读全文
posted @ 2013-08-09 08:04 ~~Snail~~ 阅读(283) 评论(0) 推荐(0)
2013年8月8日
HDU 4662 MU Puzzle
摘要： MU PuzzleTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 299Accepted Submission(s): 157 Problem DescriptionSuppose there are the symbols M, I, and U which can be combined to produce strings of symbols called "words". We start with one wo 阅读全文
posted @ 2013-08-08 21:52 ~~Snail~~ 阅读(459) 评论(0) 推荐(0)
POJ 3262 Protecting the Flowers
摘要： Protecting the FlowersTime Limit:2000MSMemory Limit:65536KTotal Submissions:3290Accepted:1332DescriptionFarmer John went to cut some wood and leftN(2 ≤N≤ 100,000) cows eating the grass, as usual. When he returned, he found to his horror that the cluster of cows was in his garden eating his beautiful 阅读全文
posted @ 2013-08-08 20:41 ~~Snail~~ 阅读(212) 评论(0) 推荐(0)
POJ 1862 Stripies
摘要： StripiesTime Limit:1000MSMemory Limit:30000KTotal Submissions:10373Accepted:5017DescriptionOur 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 an i 阅读全文
posted @ 2013-08-08 20:30 ~~Snail~~ 阅读(208) 评论(0) 推荐(0)
POJ 1017 Packets
摘要： PacketsTime Limit:1000MSMemory Limit:10000KTotal Submissions:39956Accepted:13361DescriptionA factory produces products packed in square packets of the same height h and of the sizes 1*1, 2*2, 3*3, 4*4, 5*5, 6*6. These products are always delivered to customers in the square parcels of the same heigh 阅读全文
posted @ 2013-08-08 20:18 ~~Snail~~ 阅读(218) 评论(0) 推荐(0)
POJ 2393 Yogurt factory
摘要： Yogurt factoryTime Limit:1000MSMemory Limit:65536KTotal Submissions:5472Accepted:2811DescriptionThe cows have purchased a yogurt factory that makes world-famous Yucky Yogurt. Over the next N (1 2 #include 3 4 using namespace std; 5 6 int n,s; 7 8 int main() 9 {10 int c,y,current;11 while... 阅读全文
posted @ 2013-08-08 20:06 ~~Snail~~ 阅读(307) 评论(0) 推荐(0)
POJ 2376 Cleaning Shifts
摘要： Cleaning ShiftsTime Limit:1000MSMemory Limit:65536KTotal Submissions:8457Accepted:2263DescriptionFarmer John is assigning some of his N (1 2 #include 3 #include 4 5 using namespace std; 6 7 typedef struct 8 { 9 int Start;10 int End;11 } COW;12 13 int n,t;14 COW cow[25010];15 16 bool cmp(C... 阅读全文
posted @ 2013-08-08 19:55 ~~Snail~~ 阅读(215) 评论(0) 推荐(0)
2013年8月6日
HDU 4648 Magic Pen 6
摘要： Magic Pen 6Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 217Accepted Submission(s): 108 Problem DescriptionIn HIT, many people have a magic pen. Lilu0355 has a magic pen, darkgt has a magic pen, discover has a magic pen. Recently, Timer also got 阅读全文
posted @ 2013-08-06 19:49 ~~Snail~~ 阅读(491) 评论(0) 推荐(0)
POJ 2718 Smallest Difference
摘要： Smallest DifferenceTime Limit:1000MSMemory Limit:65536KTotal Submissions:2669Accepted:763DescriptionGiven a number of distinct decimal digits, you can form one integer by choosing a non-empty subset of these digits and writing them in some order. The remaining digits can be written down in some orde 阅读全文
posted @ 2013-08-06 19:34 ~~Snail~~ 阅读(1002) 评论(1) 推荐(0)
POJ 1979 Red and Black
摘要： Red and BlackTime Limit:1000MSMemory Limit:30000KTotal Submissions:19254Accepted:10252DescriptionThere is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of four adjacent tiles. But he can' 阅读全文
posted @ 2013-08-06 19:15 ~~Snail~~ 阅读(213) 评论(0) 推荐(0)
2013年8月4日
UVa 10006 Carmichael Numbers
摘要： Carmichael NumbersAn important topic nowadays in computer science is cryptography. Some people even think that cryptography is the only important field in computer science, and that life would not matter at all without cryptography.  Alvaro is one of such persons, and is designing a set of cryptogr 阅读全文
posted @ 2013-08-04 04:45 ~~Snail~~ 阅读(215) 评论(0) 推荐(0)
2013年8月3日
POJ 2431 Expedition
摘要： ExpeditionTime Limit:1000MSMemory Limit:65536KTotal Submissions:4023Accepted:1309DescriptionA group of cows grabbed a truck and ventured on an expedition deep into the jungle. Being rather poor drivers, the cows unfortunately managed to run over a rock and puncture the truck's fuel tank. The tru 阅读全文
posted @ 2013-08-03 11:22 ~~Snail~~ 阅读(325) 评论(0) 推荐(0)
Codeforces 解题报告索引
摘要： Codeforces 266A: http://www.cnblogs.com/lzj-0218/p/3234138.html 阅读全文
posted @ 2013-08-03 08:06 ~~Snail~~ 阅读(106) 评论(0) 推荐(0)
Codeforces 266A Stones on the Table
摘要： Stones on the Tabletime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere arenstones on the table in a row, each of them can be red, green or blue. Count the minimum number of stones to take from the table so that any two neighboring stones had di 阅读全文
posted @ 2013-08-03 05:45 ~~Snail~~ 阅读(495) 评论(0) 推荐(0)
2013年8月2日
HDU 4632 Palindrome subsequence
摘要： Palindrome subsequenceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/65535 K (Java/Others) Total Submission(s): 613Accepted Submission(s): 232 Problem DescriptionIn mathematics, a subsequence is a sequence that can be derived from another sequence by deleting some elements without changi 阅读全文
posted @ 2013-08-02 09:02 ~~Snail~~ 阅读(175) 评论(0) 推荐(0)
2013年8月1日
HDU 4642 Fliping game
摘要： Fliping gameTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 123Accepted Submission(s): 89 Problem DescriptionAlice and Bob are playing a kind of special game on an N*M board (N rows, M columns). At the beginning, there are N*M coins in this board 阅读全文
posted @ 2013-08-01 18:49 ~~Snail~~ 阅读(247) 评论(0) 推荐(1)
HDU 4639 Hehe
摘要： HeheTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 57Accepted Submission(s): 43 Problem DescriptionAs we all know, Fat Brother likes MeiZi every much, he always find some topic to talk with her. But as Fat Brother is so low profile that no one kn 阅读全文
posted @ 2013-08-01 18:34 ~~Snail~~ 阅读(269) 评论(0) 推荐(0)
HDU 4628 Pieces
摘要： PiecesTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 743Accepted Submission(s): 441 Problem DescriptionYou heart broke into pieces.My string broke into pieces.But you will recover one day,and my string will never go back. Given a string s.We ca 阅读全文
posted @ 2013-08-01 10:19 ~~Snail~~ 阅读(315) 评论(0) 推荐(0)