hdu
萧瑟1
这个作者很懒,什么都没留下…
展开
-
Hdu 2028 Lowest Common Multiple Plus
Problem Description求n个数的最小公倍数。 Input输入包含多个测试实例,每个测试实例的开始是一个正整数n,然后是n个正整数。 Output为每组测试数据输出它们的最小公倍数,每个测试实例的输出占一行。你可以假设最后的输出是一个32位的整数。 Sample Input 24 63 2 5 7 ...原创 2018-10-15 21:37:59 · 132 阅读 · 0 评论 -
HDU 1711 Number Sequence KMP模板题
题目:传送门思路:KMP模板题目代码如下:#include <cstdio>#include <cstring>#include <algorithm>#include <iostream>using namespace std;const int maxn=1e6+5;const int maxm=1e4+5;i...原创 2019-01-19 16:05:35 · 175 阅读 · 0 评论 -
HDU 2203 亲和串 KMP变式
题目:传送门思路:因为此题后面的字符与前缀字符串组成的字符串也可以进行判断,所以首先想到的最简单的方法是将要判断的字符串*2,这样就可以套用KMP算法了。代码如下:#include <cstdio>#include <cstring>#include <algorithm>#include <iostream>using...原创 2019-01-19 16:57:47 · 175 阅读 · 0 评论 -
HDU 1358 Period
题目:传送门题意:给出一个字符串,求出前缀字符串中是周期串的长度和周期数(周期数大于1)。思路:利用KMP求出前缀表p[],看看每个前缀串的长度减去前缀表是否可以被前缀串的长度整除,即len%(len-p[len])==0?,即len-p[len]就为周期串的周期长度,len/(len-p[len])即为周期数。代码如下:#include <cstdio>...原创 2019-01-20 14:15:52 · 129 阅读 · 0 评论 -
HDU 3746 Cyclic Nacklace KMP应用
题目:CC always becomes very depressed at the end of this month, he has checked his credit card yesterday, without any surprise, there are only 99.9 yuan left. he is too distressed and thinking about h...原创 2019-01-21 12:21:52 · 125 阅读 · 0 评论 -
HDU 2594 Simpsons’ Hidden Talents KMP
题目:Homer: Marge, I just figured out a way to discover some of the talents we weren’t aware we had.Marge: Yeah, what is it?Homer: Take me for example. I want to find out if I have a talent in polit...原创 2019-01-21 16:30:30 · 153 阅读 · 0 评论 -
HDU - 1495 非常可乐
大家一定觉的运动以后喝可乐是一件很惬意的事情,但是seeyou却不这么认为。因为每次当seeyou买了可乐以后,阿牛就要求和seeyou一起分享这一瓶可乐,而且一定要喝的和seeyou一样多。但seeyou的手中只有两个杯子,它们的容量分别是N 毫升和M 毫升 可乐的体积为S (S<101)毫升 (正好装满一瓶) ,它们三个之间可以相互倒可乐 (都是没有刻度的,且 S==N+M,101>S>...原创 2019-02-15 11:34:51 · 127 阅读 · 0 评论 -
HDU - 2181 哈密顿绕行世界问题 dfs
一个规则的实心十二面体,它的 20个顶点标出世界著名的20个城市,你从一个城市出发经过每个城市刚好一次后回到出发的城市。Input前20行的第i行有3个数,表示与第i个城市相邻的3个城市.第20行以后每行有1个数m,m<=20,m>=1.m=0退出.Output输出从第m个城市出发经过每个城市1次又回到m的所有路线,如有多条路线,按字典序输出,每行1条路线.每行首先输出...原创 2019-02-15 13:40:29 · 139 阅读 · 0 评论 -
HDU - 2102 A计划
可怜的公主在一次次被魔王掳走一次次被骑士们救回来之后,而今,不幸的她再一次面临生命的考验。魔王已经发出消息说将在T时刻吃掉公主,因为他听信谣言说吃公主的肉也能长生不老。年迈的国王正是心急如焚,告招天下勇士来拯救公主。不过公主早已习以为常,她深信智勇的骑士LJ肯定能将她救出。现据密探所报,公主被关在一个两层的迷宫里,迷宫的入口是S(0,0,0),公主的位置用P表示,时空传输机用#表示,墙用*表示,...原创 2019-02-18 10:44:12 · 124 阅读 · 0 评论 -
HDU - 3085 Nightmare Ⅱ 双向bfs
Last night, little erriyue had a horrible nightmare. He dreamed that he and his girl friend were trapped in a big maze separately. More terribly, there are two ghosts in the maze. They will kill the p...原创 2019-02-18 16:28:55 · 150 阅读 · 0 评论 -
HDU 1003 Max Sum
题目:Problem DescriptionGiven a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) ...原创 2019-01-17 21:28:16 · 129 阅读 · 0 评论 -
HDU 6383 p1m2
题目传送门思路:二分查找,l为数组的最小值,r为数组的最大值。代码如下:#include <cstdio>#include <cstring>#include <algorithm>#include <iostream>using namespace std;typedef long long ll;const int m...原创 2018-11-22 09:29:09 · 143 阅读 · 0 评论 -
HDU 2046 骨牌铺方格 斐波那契数列
Problem Description在2×n的一个长方形方格中,用一个1× 2的骨牌铺满方格,输入n ,输出铺放方案的总数.例如n=3时,为2× 3方格,骨牌的铺放方案有三种,如下图: Input输入数据由多行组成,每行包含一个整数n,表示该测试实例的长方形方格的规格是2×n (0<n<=50)。 Output对于每个测试实例,请输出铺放方案...原创 2018-09-30 16:24:46 · 248 阅读 · 0 评论 -
HDU 2136 Largest prime factor
Problem DescriptionEverybody knows any number can be combined by the prime number.Now, your task is telling me what position of the largest prime factor.The position of prime 2 is 1, prime 3 is 2,...原创 2018-09-30 18:29:04 · 135 阅读 · 0 评论 -
HDU 1492 The number of divisors(约数) about 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 first...原创 2018-09-30 19:24:29 · 228 阅读 · 0 评论 -
HDU 3524 Perfect Squares 循环节+快速幂取模+找规律
Problem DescriptionA number x is called a perfect square if there exists an integer bsatisfying x=b^2. There are many beautiful theorems about perfect squares in mathematics. Among which, Pythagora...原创 2018-10-09 20:52:37 · 184 阅读 · 0 评论 -
Hdu 1788 Chinese remainder theorem again 求LCM
Problem Description我知道部分同学最近在看中国剩余定理,就这个定理本身,还是比较简单的:假设m1,m2,…,mk两两互素,则下面同余方程组:x≡a1(mod m1)x≡a2(mod m2)…x≡ak(mod mk)在0<=<m1m2…mk内有唯一解。记Mi=M/mi(1<=i<=k),因为(Mi,mi)=1,故有二个整数pi,qi满足Mi...原创 2018-10-17 13:15:21 · 117 阅读 · 0 评论 -
Hdu 2669 Romantic 扩展欧几里得
Problem DescriptionThe Sky is Sprite.The Birds is Fly in the Sky.The Wind is Wonderful.Blew Throw the TreesTrees are Shaking, Leaves are Falling.Lovers Walk passing, and so are You...............原创 2018-10-11 08:10:54 · 158 阅读 · 0 评论 -
Hdu 3575 Hello Kiki 中国剩余定理模板
Problem DescriptionOne day I was shopping in the supermarket. There was a cashier counting coins seriously when a little kid running and singing "门前大桥下游过一群鸭,快来快来 数一数,二四六七八". And then the cashier put...原创 2018-10-17 18:26:25 · 174 阅读 · 0 评论 -
Hdu 1573 X问题 中国剩余定理模板
Problem Description求在小于等于N的正整数中有多少个X满足:X mod a[0] = b[0], X mod a[1] = b[1], X mod a[2] = b[2], …, X mod a[i] = b[i], … (0 < a[i] <= 10)。 Input输入数据的第一行为一个正整数T,表示有T组测试数据。每组测试数据的第一行为...原创 2018-10-17 19:56:32 · 155 阅读 · 0 评论 -
作业2 参考程序
A:#include <cstdio>#include <cstring>#include <algorithm>#include <iostream>using namespace std;int score;int main(){ while (scanf("%d",&score)!=EOF) { ...原创 2018-11-03 13:01:44 · 369 阅读 · 0 评论 -
HDU - 1029 Ignatius and the Princess IV
"OK, you are not too bad, em... But you can never pass the next test." feng5166 says."I will tell you an odd number N, and then N integers. There will be a special integer among them, you have to tel...原创 2019-02-19 11:15:48 · 113 阅读 · 0 评论 -
HDU - 2612 Find a way 两遍bfs
Pass a year learning in Hangzhou, yifenfei arrival hometown Ningbo at finally. Leave Ningbo one year, yifenfei have many people to meet. Especially a good friend Merceki.Yifenfei’s home is at the cou...原创 2019-02-14 12:04:58 · 134 阅读 · 0 评论 -
Hdu 2819 Swap 匈牙利算法
题目:Given an N*N matrix with each entry equal to 0 or 1. You can swap any two rows or any two columns. Can you find a way to make all the diagonal entries equal to 1?InputThere are several test c...原创 2019-03-07 17:27:08 · 133 阅读 · 0 评论 -
Hdu 2389 Rain on your Parade hk算法
题目:You’re giving a party in the garden of your villa by the sea. The party is a huge success, and everyone is here. It’s a warm, sunny evening, and a soothing wind sends fresh, salty air from the se...原创 2019-03-07 21:23:46 · 298 阅读 · 0 评论 -
HDU - 1698 Just a Hook 线段树+区间更新
题目:In the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. The hook is made up of several consecutive metallic sticks which are of the same length.Now...原创 2019-03-16 11:34:48 · 140 阅读 · 0 评论 -
HDU - 4027 Can you answer these queries? 线段树
题目:A lot of battleships of evil are arranged in a line before the battle. Our commander decides to use our secret weapon to eliminate the battleships. Each of the battleships can be marked a value o...原创 2019-03-16 19:19:33 · 147 阅读 · 0 评论 -
HDU - 1540 Tunnel Warfare 线段树+最值更新
题目:During the War of Resistance Against Japan, tunnel warfare was carried out extensively in the vast areas of north China Plain. Generally speaking, villages connected by tunnels lay in a line. Exc...原创 2019-03-17 10:11:56 · 131 阅读 · 0 评论 -
hdu 1281 棋盘游戏
题目:小希和Gardon在玩一个游戏:对一个N*M的棋盘,在格子里放尽量多的一些国际象棋里面的“车”,并且使得他们不能互相攻击,这当然很简单,但是Gardon限制了只有某些格子才可以放,小希还是很轻松的解决了这个问题(见下图)注意不能放车的地方不影响车的互相攻击。所以现在Gardon想让小希来解决一个更难的问题,在保证尽量多的“车”的前提下,棋盘里有些格子是可以避开的,也就是说,不在这些格子...原创 2019-03-08 11:51:05 · 159 阅读 · 0 评论 -
HDU - 3974 Assign the task dfs确定区间+线段树
题目:There is a company that has N employees(numbered from 1 to N),every employee in the company has a immediate boss (except for the leader of whole company).If you are the immediate boss of someone,...原创 2019-03-17 14:47:19 · 146 阅读 · 0 评论 -
HDU - 5090 Game with Pearls
题目:Tom and Jerry are playing a game with tubes and pearls. The rule of the game is:1) Tom and Jerry come up together with a number K.2) Tom provides N tubes. Within each tube, there are several pe...原创 2019-03-18 09:43:26 · 124 阅读 · 0 评论 -
HDU - 4791 Alice's Print Service 二分+后缀数组最小值
题目:Alice is providing print service, while the pricing doesn't seem to be reasonable, so people using her print service found some tricks to save money.For example, the price when printing less tha...原创 2019-04-05 15:55:39 · 206 阅读 · 0 评论 -
Hdu 1669 Jamie's Contact Groups 二分图多重匹配+二分
题目:Jamie is a very popular girl and has quite a lot of friends, so she always keeps a very long contact list in her cell phone. The contact list has become so long that it often takes a long time fo...原创 2019-03-10 15:48:32 · 861 阅读 · 0 评论 -
Hdu 3829 Cat VS Dog
题目:The zoo have N cats and M dogs, today there are P children visiting the zoo, each child has a like-animal and a dislike-animal, if the child's like-animal is a cat, then his/hers dislike-animal m...原创 2019-03-10 10:13:12 · 152 阅读 · 0 评论 -
HDU - 1043 Eight 打表+bfs+康托扩展
题目:The 15-puzzle has been around for over 100 years; even if you don't know it by that name, you've seen it. It is constructed with 15 sliding tiles, each with a number from 1 to 15 on it, and all p...原创 2019-03-04 21:36:13 · 184 阅读 · 0 评论 -
HDU - 1024 Max Sum Plus Plus
Now I think you have got an AC in Ignatius.L's "Max Sum" problem. To be a brave ACMer, we always challenge ourselves to more difficult problems. Now you are faced with a more difficult problem.Given ...原创 2019-02-20 11:41:15 · 127 阅读 · 0 评论 -
HDU - 1087 Super Jumping! Jumping! Jumping!
Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and know little about this game, so I introduce it to you now.The game c...原创 2019-02-20 20:47:12 · 316 阅读 · 0 评论 -
HDU - 1257 最少拦截系统
某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统.但是这种导弹拦截系统有一个缺陷:虽然它的第一发炮弹能够到达任意的高度,但是以后每一发炮弹都不能超过前一发的高度.某天,雷达捕捉到敌国的导弹来袭.由于该系统还在试用阶段,所以只有一套系统,因此有可能不能拦截所有的导弹.怎么办呢?多搞几套系统呗!你说说倒蛮容易,成本呢?成本是个大问题啊.所以俺就到这里来求救了,请帮助计算一下最少需要多少套拦截系统....原创 2019-02-20 21:23:33 · 157 阅读 · 0 评论 -
Hdu 1401 Solitaire 双向bfs
题目:Solitaire is a game played on a chessboard 8x8. The rows and columns of the chessboard are numbered from 1 to 8, from the top to the bottom and from left to right respectively.There are four ide...原创 2019-03-05 19:51:13 · 400 阅读 · 0 评论 -
Hdu 1401 Fire Net
题目:Suppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each representing a street or a piece of wall.A blockhouse is a small castl...原创 2019-03-06 08:42:01 · 170 阅读 · 0 评论