hdu
even_zhan
这个作者很懒,什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
hdu 1001 sum problem
hdu 1001 sum problemhdu 1001 sum problemproblem Description:Hey, welcome to HDOJ(Hangzhou Dianzi University Online Judge).In this problem, your task is to calculate SUM(n) = 1 + 2 + 3 + … + n.Inp...原创 2018-10-18 20:18:49 · 331 阅读 · 0 评论 -
hdu1106 排序(把5当成空格 字符串 处理)
题目:Problem Description输入一行数字,如果我们把这行数字中的‘5’都看成空格,那么就得到一行用空格分割的若干非负整数(可能有些整数以‘0’开头,这些头部的‘0’应该被忽略掉,除非这个整数就是由若干个‘0’组成的,这时这个整数就是0)。你的任务是:对这些分割得到的整数,依从小到大的顺序排序输出。Input输入包含多组测试用例,每组输入数据只有一行数字(数字之间没有空格)...原创 2018-11-04 20:14:17 · 444 阅读 · 0 评论 -
hdu1196 Lowest Bit(二进制)
题目:Problem DescriptionGiven an positive integer A (1 <= A <= 100), output the lowest bit of A.For example, given A = 26, we can write A in binary form as 11010, so the lowest bit of A is 10, ...原创 2018-11-04 20:35:33 · 230 阅读 · 0 评论 -
hdu1201 18岁生日
题目:Problem DescriptionGardon的18岁生日就要到了,他当然很开心,可是他突然想到一个问题,是不是每个人从出生开始,到达18岁生日时所经过的天数都是一样的呢?似乎并不全都是这样,所以他想请你帮忙计算一下他和他的几个朋友从出生到达18岁生日所经过的总天数,让他好来比较一下。Input一个数T,后面T行每行有一个日期,格式是YYYY-MM-DD。如我的生日是1988-0...原创 2018-11-04 20:43:34 · 312 阅读 · 0 评论 -
hdu1234 开门人和关门人(struct排序)
题目:Problem Description每天第一个到机房的人要把门打开,最后一个离开的人要把门关好。现有一堆杂乱的机房签到、签离记录,请根据记录找出当天开门和关门的人。Input测试输入的第一行给出记录的总天数N ( &amp;gt; 0 )。下面列出了N天的记录。每天的记录在第一行给出记录的条目数M ( &amp;gt; 0 ),下面是M行,每行的格式为证件号码 签到时间 签离时间其中时间按...原创 2018-11-05 09:01:32 · 221 阅读 · 0 评论 -
hdu 1236 排名
题目:Problem Description今天的上机考试虽然有实时的Ranklist,但上面的排名只是根据完成的题数排序,没有考虑 每题的分值,所以并不是最后的排名。给定录取分数线,请你写程序找出最后通过分数线的 考生,并将他们的成绩按降序打印。 Input测试输入包含若干场考试的信息。每场考试信息的第1行给出考生人数N ( 0 < N < 1000 )、考题数...原创 2018-11-05 09:01:14 · 246 阅读 · 0 评论 -
hdu 2609 How many (最小表示法)
题目:Problem DescriptionGive you n ( n < 10000) necklaces ,the length of necklace will not large than 100,tell meHow many kinds of necklaces total have.(if two necklaces can equal by rotating ,w...原创 2018-11-19 08:53:40 · 147 阅读 · 0 评论 -
bfs练习 hdu1253胜利大逃亡
Problem DescriptionIgnatius被魔王抓走了,有一天魔王出差去了,这可是Ignatius逃亡的好机会.魔王住在一个城堡里,城堡是一个ABC的立方体,可以被表示成A个B*C的矩阵,刚开始Ignatius被关在(0,0,0)的位置,离开城堡的门在(A-1,B-1,C-1)的位置,现在知道魔王将在T分钟后回到城堡,Ignatius每分钟能从一个坐标走到相邻的六个坐标中的其中一个...原创 2018-11-24 21:59:09 · 639 阅读 · 0 评论 -
n皇后问题(dfs练习)hdu2553
题目:Problem Description在N*N的方格棋盘放置了N个皇后,使得它们不相互攻击(即任意2个皇后不允许处在同一排,同一列,也不允许处在与棋盘边框成45角的斜线上。你的任务是,对于给定的N,求出有多少种合法的放置方法。Input共有若干行,每行一个正整数N≤10,表示棋盘和皇后的数量;如果N=0,表示结束。Output共有若干行,每行一个正整数,表示对应输入行的皇后的不...原创 2018-11-24 22:02:53 · 280 阅读 · 0 评论 -
hdu1426 数独(dfs输出有毒)
题目Sudoku KillerTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7061 Accepted Submission(s): 2185Problem Description自从2006年3月10日至11日的首届数独...原创 2018-12-02 12:32:57 · 240 阅读 · 0 评论 -
hdu 1098 Ignatius's puzzle
题目:Problem DescriptionIgnatius is poor at math,he falls across a puzzle problem,so he has no choice but to appeal to Eddy. this problem describes that:f(x)=5x13+13*x5+ka*x,input a nonegative integer...原创 2018-11-04 20:02:39 · 224 阅读 · 0 评论 -
hdu1070 MIlk
Problem DescriptionIgnatius drinks milk everyday, now he is in the supermarket and he wants to choose a bottle of milk. There are many kinds of milk in the supermarket, so Ignatius wants to know whic...原创 2018-11-04 19:30:52 · 236 阅读 · 0 评论 -
hdu 1004 (Let the balloon rise) c、c++
hdu 1004(Let the balloon rise)题目:http://acm.hdu.edu.cn/showproblem.php?pid=1004Problem DescriptionContest time again! How excited it is to see balloons floating around. But to tell you a secret, ...原创 2018-10-19 10:51:24 · 737 阅读 · 2 评论 -
hdu 1005 (number Sequence) 找规律,算出循环周期
hdu 1005(number sequence)题目:http://acm.hdu.edu.cn/showproblem.php?pid=1005Problem DescriptionA number sequence is defined as follows:f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod ...原创 2018-10-19 17:23:24 · 827 阅读 · 0 评论 -
hdu 1014 +hdu 1019 (求最小公倍数或者排序)
题目:Problem DescriptionComputer simulations often require random numbers. One way to generate pseudo-random numbers is via a function of the formseed(x+1) = [seed(x) + STEP] % MODwhere ‘%’ is the m...原创 2018-10-20 16:32:40 · 244 阅读 · 0 评论 -
hdu1097A hard puzzle(快速幂算法)
A hard puzzle题目:Problem Descriptionlcy gives a hard puzzle to feng5166,lwg,JGShining and Ignatius: gave a and b,how to know the a^b.everybody objects to this BT problem,so lcy makes the problem ...原创 2018-10-31 14:23:07 · 265 阅读 · 0 评论 -
hdu1163 Eddy's digital Roots(合九法+同余定理)
Digital RootsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 84156 Accepted Submission(s): 26272Problem DescriptionThe digital root of ...原创 2018-10-31 23:46:11 · 256 阅读 · 0 评论 -
hdu 1021 Fibonacci Again(找规律)
题目:Problem DescriptionThere are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2).InputInput consists of a sequence of lines, each containing an integer ...原创 2018-11-04 17:47:45 · 263 阅读 · 0 评论 -
hdu 1048 The Hardest Problem Ever(字符串处理gets.getline....)
题目:Problem DescriptionJulius Caesar lived in a time of danger and intrigue. The hardest situation Caesar ever faced was keeping himself alive. In order for him to survive, he decided to create one o...原创 2018-11-04 18:40:20 · 258 阅读 · 0 评论 -
hdu1058 Humble Numbers(最简单的)
题目:Problem DescriptionA number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 24, 25, 27, … shows the firs...原创 2018-11-04 18:55:37 · 127 阅读 · 0 评论 -
hdu1061 Rightmost Digit(找规律+快速幂)
题目:Problem DescriptionGiven a positive integer N, you should output the most right digit of N^N.InputThe input contains several test cases. The first line of the input is a single integer T which ...原创 2018-11-04 19:17:16 · 253 阅读 · 0 评论 -
hdu 1175连连看(dfs + 剪枝)
题目连连看Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 43134 Accepted Submission(s): 10739Problem Description“连连看”相信很多人都玩过。没玩过也没关系,下面我给大...原创 2018-12-03 21:38:55 · 202 阅读 · 1 评论
分享