水
文章平均质量分 70
键盘上的舞者
这个作者很懒,什么都没留下…
展开
-
HDU2503:a/b + c/d
Problem Description给你2个分数,求他们的和,并要求和为最简形式。 Input输入首先包含一个正整数T(T Output对于每组测试数据,输出两个整数e和f,表示a/b + c/d的最简化结果是e/f,每组输出占一行。 Sample Input2 1 2 1 3 4 3 2 3 Sample Ou原创 2012-12-29 22:32:59 · 1814 阅读 · 0 评论 -
HDU2504:又见GCD
Problem Description有三个正整数a,b,c(0 Input第一行输入一个n,表示有n组测试数据,接下来的n行,每行输入两个正整数a,b。 Output输出对应的c,每组测试数据占一行。 Sample Input2 6 2 12 4 Sample Output4原创 2012-12-29 22:33:41 · 1281 阅读 · 0 评论 -
HDU2520:我是菜鸟,我怕谁
Problem Descriptionlin2144是一只小菜鸟,都是笨鸟先飞,lin2144想来个菜鸟先飞,他从0点出发一开始的飞行速度为1m/s,每过一个单位时间lin2144的飞行速度比上一个单位时间的飞行速度快2m/s,问n (0 Input输入一个T表示为有几组数据每组数据输入一个n,表示lin2144飞行的时间. Output输出l原创 2012-12-30 13:08:57 · 1230 阅读 · 0 评论 -
HDU2734:Quicksum
Problem DescriptionA checksum is an algorithm that scans a packet of data and returns a single number. The idea is that if the packet is changed, the checksum will also change, so checksums are ofte原创 2013-01-03 10:58:33 · 970 阅读 · 0 评论 -
HDU3188:Just A Triangle
Problem Description This is an easy problem, just for you to warm up. Give you three edges of a triangle. Can you tell me which kind of triangle it stands for?If it’s a right triangle(直角三角形),原创 2013-01-04 15:17:09 · 1568 阅读 · 0 评论 -
HDU2550:百步穿杨
Problem Description时维九月,序属三秋,辽军大举进攻MCA山,战场上两军正交锋.辽军统帅是名噪一时的耶律-James,而MCA方则是派出了传统武将中草药123.双方经过协商,约定在十一月八日正午十分进行射箭对攻战.中草药123早早就开始准备,但是他是武将而不是铁匠,造弓箭的活就交给聪明能干的你了,现在告诉你每种弓箭规格,即箭身的长度,以及每种规格弓箭所需要的数目,要求你把需要原创 2013-01-11 20:53:45 · 988 阅读 · 0 评论 -
HDU1197:Specialized Four-Digit Numbers
Problem DescriptionFind and list all four-digit numbers in decimal notation that have the property that the sum of its four digits equals the sum of its digits when represented in hexadecimal (base原创 2013-01-14 10:27:37 · 3371 阅读 · 0 评论 -
HDU2054:A == B ?
Problem DescriptionGive you two numbers A and B, if A is equal to B, you should print "YES", or print "NO". Inputeach test case contains two numbers A and B. Outputfor ea原创 2013-01-14 17:27:18 · 6031 阅读 · 1 评论 -
HDU2568:前进
Problem Description轻松通过墓碑,进入古墓后,才发现里面别有洞天。突然,Yifenfei发现自己周围是黑压压的一群蝙蝠,个个扇动翅膀正准备一起向他发起进攻!形势十分危急!好在此时的yifenfei已经不是以前那个经常被lemon抢走MM的菜鸟了!面对众多蝙蝠的嗜血狂攻,只见yifenfei使出轻灵的剑法,刷,刷,刷,瞬间搞定……现已知yifenfei使用了2招原创 2013-01-25 16:33:20 · 1061 阅读 · 0 评论 -
HDU1205:吃糖果
Problem DescriptionHOHO,终于从Speakless手上赢走了所有的糖果,是Gardon吃糖果时有个特殊的癖好,就是不喜欢将一样的糖果放在一起吃,喜欢先吃一种,下一次吃另一种,这样;可是Gardon不知道是否存在一种吃糖果的顺序使得他能把所有糖果都吃完?请你写个程序帮忙计算一下。 Input第一行有一个整数T,接下来T组数据,每组数据占2行,第一行是一个原创 2013-02-26 17:18:08 · 1651 阅读 · 0 评论 -
HDU1408:盐水的故事
Problem Description挂盐水的时候,如果滴起来有规律,先是滴一滴,停一下;然后滴二滴,停一下;再滴三滴,停一下...,现在有一个问题:这瓶盐水一共有VUL毫升,每一滴是D毫升,每一滴的速度是一秒(假设最后一滴不到D毫升,则花费的时间也算一秒),停一下的时间也是一秒这瓶水什么时候能挂完呢? Input输入数据包含多个测试实例,每个实例占一行,由VUL和D组成,原创 2013-02-27 21:08:06 · 2435 阅读 · 1 评论 -
HDU1859:最小长方形
Problem Description给定一系列2维平面点的坐标(x, y),其中x和y均为整数,要求用一个最小的长方形框将所有点框在内。长方形框的边分别平行于x和y坐标轴,点落在边上也算是被框在内。 Input测试输入包含若干测试用例,每个测试用例由一系列坐标组成,每对坐标占一行,其中|x|和|y|小于 231;一对0 坐标标志着一个测试用例的结束。注意(0, 0)不作为任何原创 2013-02-28 17:40:09 · 2643 阅读 · 0 评论 -
HDU1228:A + B
Problem Description读入两个小于100的正整数A和B,计算A+B.需要注意的是:A和B的每一位数字由对应的英文单词给出. Input测试输入包含若干测试用例,每个测试用例占一行,格式为"A + B =",相邻两字符串有一个空格间隔.当A和B同时为0时输入结束,相应的结果不要输出. Output对每个测试用例输出1行,即A+B的值.原创 2013-03-04 13:36:54 · 2489 阅读 · 0 评论 -
POJ1218:THE DRUNK JAILER
DescriptionA certain prison contains a long hall of n cells, each right next to each other. Each cell has a prisoner in it, and each cell is locked.One night, the jailer gets bored and decides to原创 2013-03-10 22:12:14 · 2447 阅读 · 0 评论 -
POJ2538:WERTYU
DescriptionA common typing error is to place the hands on the keyboard one row to the right of the correct position. So "Q" is typed as "W" and "J" is typed as "K" and so on. You are to decode a m原创 2013-03-11 21:27:26 · 1898 阅读 · 0 评论 -
POJ2262:Goldbach's Conjecture
DescriptionIn 1742, Christian Goldbach, a German amateur mathematician, sent a letter to Leonhard Euler in which he made the following conjecture:Every even number greater than 4 can be written原创 2013-03-12 21:08:53 · 2977 阅读 · 1 评论 -
POJ1306:Combinations
DescriptionComputing the exact number of ways that N things can be taken M at a time can be a great challenge when N and/or M become very large. Challenges are the stuff of contests. Therefore, you原创 2013-03-12 21:56:45 · 1613 阅读 · 0 评论 -
POJ2590:Steps
DescriptionOne steps through integer points of the straight line. The length of a step must be nonnegative and can be by one bigger than, equal to, or by one smaller than the length of the previous原创 2013-03-20 16:46:26 · 830 阅读 · 0 评论 -
HDU4505:小Q系列故事——电梯里的爱情
Problem Description 细心的同事发现,小Q最近喜欢乘电梯上上下下,究其原因,也许只有小Q自己知道:在电梯里经常可以遇到他心中的女神HR。 电梯其实是个很暧昧的地方,只有在电梯里,小Q才有勇气如此近距离接近女神,虽然觉得有点不自在,但次数多了,女神也习惯了小Q的存在,甚至熟悉到仿佛不说上句话自己也都觉得不合适了。可是,他们的谈话也仅仅限于今天天气不错啊或是你吃了吗之类的原创 2013-03-21 23:03:55 · 2198 阅读 · 0 评论 -
HDU4519:郑厂长系列故事——体检
Problem Description 郑厂长不是正厂长 也不是副厂长 他根本就不是厂长 只是公司的一个码农 郑厂长所在的腾讯公司每一年都要组织员工体检,比如量身高体重、测血压之类的,今年也不例外。 这次总共有N位员工接受体检,并且每个员工都需要做K个项目的检查才算完成整个体检的流程。现在来了M个医生为员工做身体检查,并且每一位医生都带齐了检查这K个项目原创 2013-03-24 14:06:20 · 1774 阅读 · 0 评论 -
POJ2305:Basic remains
DescriptionGiven a base b and two non-negative base b integers p and m, compute p mod m and print the result as a base b integer. p mod m is defined as the smallest non-negative integer k such that原创 2013-03-24 20:49:24 · 1084 阅读 · 0 评论 -
HDU1397:Goldbach's Conjecture
Problem DescriptionGoldbach's Conjecture: For any even number n greater than or equal to 4, there exists at least one pair of prime numbers p1 and p2 such that n = p1 + p2. This conjecture has not原创 2013-04-01 20:18:34 · 1524 阅读 · 0 评论 -
HDU1405:The Last Practice
Problem DescriptionTomorrow is contest day, Are you all ready?We have been training for 45 days, and all guys must be tired.But , you are so lucky comparing with many excellent boys who have no ch原创 2013-04-01 21:09:18 · 1498 阅读 · 0 评论 -
HDU1303:Doubles
Problem DescriptionAs part of an arithmetic competency program, your students will be given randomly generated lists of from 2 to 15 unique positive integers and asked to determine how many items in原创 2013-04-02 15:41:22 · 1161 阅读 · 0 评论 -
HDU1163:Eddy's digital Roots
Problem DescriptionThe digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the digital root. If the resultin原创 2013-04-04 20:34:54 · 837 阅读 · 0 评论 -
HDU1164:Eddy's research I
Problem DescriptionEddy's interest is very extensive, recently he is interested in prime number. Eddy discover the all number owned can be divided into the multiply of prime number, but he can't wri原创 2013-04-04 20:54:23 · 732 阅读 · 0 评论 -
HDU2133:What day is it
Problem DescriptionToday is Saturday, 17th Nov,2007. Now, if i tell you a date, can you tell me what day it is ? InputThere are multiply cases.One line is one case.There are three inte原创 2013-04-08 21:59:10 · 1860 阅读 · 0 评论 -
HDU1202:The calculation of GPA
Problem Description每学期的期末,大家都会忙于计算自己的平均成绩,这个成绩对于评奖学金是直接有关的。国外大学都是计算GPA(grade point average) 又称GPR(grade point ratio),即成绩点数与学分的加权平均值来代表一个学生的成绩的。那么如何来计算GPA呢? 一般大学采用之计分法 A90 - 100 4 点 B80 - 8原创 2013-04-13 22:05:19 · 2487 阅读 · 1 评论 -
HDU1985:Conversions
Problem DescriptionConversion between the metric and English measurement systems is relatively simple. Often, it involves either multiplying or dividing by a constant. You must write a program that原创 2013-04-17 10:43:58 · 1314 阅读 · 0 评论 -
HDU1976:Software Version
Problem Description相信大家一定有过在网上下载软件而碰到多个不同版本的情况。一般来说,软件的版本号由三个部分组成,主版本号(Major Version Number),子版本号(Minor Version Number)和修订号(Revision_Number)。当软件进行了重大的修改时,主版本号加一;当软件在原有基础上增加部分功能时,主版本号不变,子版本号加一;当软原创 2013-04-17 20:28:38 · 1159 阅读 · 0 评论 -
HDU1390:Binary Numbers
Problem DescriptionGiven a positive integer n, find the positions of all 1's in its binary representation. The position of the least significant bit is 0.ExampleThe positions of 1's in the原创 2013-04-25 16:25:34 · 1637 阅读 · 0 评论 -
HDU1335:Basically Speaking
Problem DescriptionThe Really Neato Calculator Company, Inc. has recently hired your team to help design their Super Neato Model I calculator. As a computer scientist you suggested to the company th原创 2013-04-25 20:36:21 · 1298 阅读 · 0 评论 -
HDU1673:Optimal Parking
Problem DescriptionWhen shopping on Long Street, Michael usually parks his car at some random location, and then walks to the stores he needs.Can you help Michael choose a place to park which mini原创 2013-04-27 21:18:23 · 1393 阅读 · 0 评论 -
HDU1898:Sempr == The Best Problem Solver?
Problem DescriptionAs is known to all, Sempr(Liangjing Wang) had solved more than 1400 problems on POJ, but nobody know the days and nights he had spent on solving problems. Xiangsanzi(Chen Zhou)原创 2013-05-02 13:19:10 · 1093 阅读 · 0 评论 -
HDU2072:单词数
Problem Description lily的好朋友xiaoou333最近很空,他想了一件没有什么意义的事情,就是统计一篇文章里不同单词的总数。下面你的任务是帮助xiaoou333解决这个问题。 Input 有多组数据,每组一行,每组就是一篇小文章。每篇小文章都是由小写字母和空格组成,没有标点符号,遇到#时表示输入结束。 Output原创 2013-05-05 20:44:37 · 1690 阅读 · 0 评论 -
HDU1229:还是A+B
Problem Description读入两个小于10000的正整数A和B,计算A+B。需要注意的是:如果A和B的末尾K(不超过8)位数字相同,请直接输出-1。 Input测试输入包含若干测试用例,每个测试用例占一行,格式为"A B K",相邻两数字有一个空格间隔。当A和B同时为0时输入结束,相应的结果不要输出。 Output原创 2013-05-08 19:47:41 · 1201 阅读 · 0 评论 -
HDU1259:ZJUTACM
Problem Description欢迎参加浙江工业大学第四届程序设计竞赛!但是,请稍等!裁判Joe说了,必须正确回答他的问题,才可以看到PIPI的气球MM,KUKU的气球GG.Joe手上有7张卡片,每张卡片上有一个大写字母,分别是Z,J,U,T,A,C,M.现在他开始表演魔术,每次只交换其中的两张卡片.等表演结束后,请你指出含有字母J的那张卡片. Input第一原创 2013-05-19 19:39:34 · 1704 阅读 · 0 评论 -
HDU4548:美素数
Problem Description 小明对数的研究比较热爱,一谈到数,脑子里就涌现出好多数的问题,今天,小明想考考你对素数的认识。 问题是这样的:一个十进制数,如果是素数,而且它的各位数字和也是素数,则称之为“美素数”,如29,本身是素数,而且2+9 = 11也是素数,所以它是美素数。 给定一个区间,你能计算出这个区间内有多少个美素数吗? Input第一行输入原创 2013-05-21 14:58:55 · 3510 阅读 · 0 评论 -
HDU2134:Cuts the cake
Problem DescriptionIce cream took a bronze medal in the Beijing match. Liu sir is very very happy. So he buys a cake for them. kiki is a child who likes eating, so the task of cuting cake was given原创 2013-05-21 15:12:49 · 2276 阅读 · 0 评论 -
LA3708:Graveyard
地址:https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&category=20&page=show_problem&problem=1709这道题是看了大白书才写得出的,不得不说这思路真是碉堡了! #include #include int main(){原创 2013-05-23 20:47:39 · 2286 阅读 · 0 评论