HDU OJ - 随笔分类 - ~~Snail~~

HDU 5178 Pairs

摘要：pairsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 96Accepted Submission(s): 38Problem Descripti... 阅读全文

posted @ 2015-02-28 22:08 ~~Snail~~ 阅读(763) 评论(1) 推荐(1)

HDU 4740 The Donkey of Gui Zhou

摘要：The Donkey of Gui ZhouTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 308Accepted Submission(s): 118 Problem DescriptionThere was no donkey in the province of Gui Zhou, China. A trouble maker shipped one and put it in the forest which could be con 阅读全文

posted @ 2013-09-16 07:50 ~~Snail~~ 阅读(315) 评论(0) 推荐(0)

HDU 4705 Y

摘要：YTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 209Accepted Submission(s): 69 Problem DescriptionSample Input41 21 31 4Sample Output1Hint1. The only set is {2,3,4}.2. Please use #pragma comment(linker, "/STACK:16777216")Source2013 Mul 阅读全文

posted @ 2013-08-22 21:47 ~~Snail~~ 阅读(534) 评论(0) 推荐(0)

HDU 4678 Mine

摘要：MineTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 855Accepted Submission(s): 259 Problem DescriptionHave you ever played a game in Windows: Mine? This game is played on a n*m board, just like the Pic(1) On the board, Under some grids there are.. 阅读全文

posted @ 2013-08-20 20:01 ~~Snail~~ 阅读(182) 评论(0) 推荐(0)

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~~ 阅读(285) 评论(0) 推荐(0)

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~~ 阅读(292) 评论(0) 推荐(0)

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~~ 阅读(482) 评论(0) 推荐(0)

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~~ 阅读(500) 评论(0) 推荐(0)

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~~ 阅读(183) 评论(0) 推荐(0)

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~~ 阅读(254) 评论(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~~ 阅读(275) 评论(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~~ 阅读(321) 评论(0) 推荐(0)

HDU 4027 The Unsolvable Problem

摘要：The Unsolvable ProblemTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 486Accepted Submission(s): 280 Problem DescriptionThere are many unsolvable problem in the world.It could be about one or about zero.But this time it is about bigger number. Giv 阅读全文

posted @ 2013-07-31 16:00 ~~Snail~~ 阅读(187) 评论(0) 推荐(0)

HDU 4570 Multi-bit Trie

摘要：Multi-bit TrieTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 180Accepted Submission(s): 56 Problem Description IP lookup is one of the key functions of routers for packets forwarding and classifying. Generally, IP lookup can be simplified as a L. 阅读全文

posted @ 2013-07-27 17:34 ~~Snail~~ 阅读(350) 评论(0) 推荐(0)

HDU 4611 Balls Rearrangement

摘要：Balls RearrangementTime Limit: 9000/3000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 1079Accepted Submission(s): 416 Problem Description Bob has N balls and A boxes. He numbers the balls from 0 to N-1, and numbers the boxes from 0 to A-1. To find the balls easily,. 阅读全文

posted @ 2013-07-27 17:07 ~~Snail~~ 阅读(366) 评论(0) 推荐(0)

HDU 2035 人见人爱A^B

摘要：人见人爱A^BTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 16211 Accepted Submission(s): 11450 Problem Description求A^B的最后三位数表示的整数。说明：A^B的含义是“A的B次方”Input输入数据包含多个测试实例，每个实例占一行，由两个正整数A和B组成（1<=A,B<=10000），如果A=0, B=0，则表示输入数据的结束，不做处理。Output对于每个测试实例，请阅读全文

posted @ 2013-05-14 21:11 ~~Snail~~ 阅读(119) 评论(0) 推荐(0)

HDU 2098 分拆素数和

摘要：分拆素数和Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 15712Accepted Submission(s): 6789 Problem Description把一个偶数拆成两个不同素数的和，有几种拆法呢？Input输入包含一些正的偶数，其值不会超过10000，个数不会超过500，若遇0，则结束。Output对应每个偶数，输出其拆成不同素数的个数，每个结果占一行。Sample Input30260Sample Output32类似于NEF 阅读全文

posted @ 2013-05-09 14:51 ~~Snail~~ 阅读(133) 评论(0) 推荐(0)

HDU 解题报告索引

摘要：HDU 1021: http://www.cnblogs.com/lzj-0218/archive/2013/05/14/3078581.htmlHDU 2035: http://www.cnblogs.com/lzj-0218/archive/2013/05/14/3078609.htmlHDU ... 阅读全文

posted @ 2013-05-04 17:29 ~~Snail~~ 阅读(160) 评论(0) 推荐(0)

HDU 2089 不要62

摘要：不要62Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 11823 Accepted Submission(s): 3686 Problem Description杭州人称那些傻乎乎粘嗒嗒的人为62（音：laoer）。杭州交通管理局经常会扩充一些的士车牌照，新近出来一个好消息，以后上牌照，不再含有不吉利的数字了，这样一来，就可以消除个别的士司机和乘客的心理障碍，更安全地服务大众。不吉利的数字为所有含有4或62的号码。例如： 62315 阅读全文

posted @ 2013-04-30 08:40 ~~Snail~~ 阅读(181) 评论(0) 推荐(0)

HDU 3555 Bomb

摘要：BombTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others) Total Submission(s): 3338 Accepted Submission(s): 1177 Problem DescriptionThe counter-terrorists found a time bomb in the dust. But this time the terrorists improve on the time bomb. The number sequence of the time 阅读全文

posted @ 2013-04-30 08:22 ~~Snail~~ 阅读(246) 评论(0) 推荐(0)

码农小站

随笔分类 - HDU OJ

公告