算法
文章平均质量分 70
孤独灬旅人
这个作者很懒,什么都没留下…
展开
-
快速幂
整数快速幂 int qpow(int a, int b) { int ans = 1, base = a; while (b) { if (b & 1)//判断b的二进制最后一位是否为1,如果为1,ans*base,如果不是,base*base ans *= base; base *= base; b >>= 1;//b向右移1位,相当于除以二 ...原创 2018-07-30 10:05:31 · 136 阅读 · 0 评论 -
HDU1003 Max Sum
Problem Description Given 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) + 5 +...原创 2018-10-29 19:48:51 · 134 阅读 · 0 评论 -
HDU 1465 不容易系列之一(错排公式)
Problem Description 大家常常感慨,要做好一件事情真的不容易,确实,失败比成功容易多了! 做好“一件”事情尚且不易,若想永远成功而总从不失败,那更是难上加难了,就像花钱总是比挣钱容易的道理一样。 话虽这样说,我还是要告诉大家,要想失败到一定程度也是不容易的。比如,我高中的时候,就有一个神奇的女生,在英语考试的时候,竟然把40个单项选择题全部做错了!大家都学过概率论,应该知道出现...原创 2018-10-15 19:59:57 · 130 阅读 · 0 评论 -
HDU 3038 How Many Answers Are Wrong (带权并查集)
Problem Description TT and FF are ... friends. Uh... very very good friends -________-b FF is a bad boy, he is always wooing TT to play the following game with him. This is a very humdrum game. To be...原创 2018-10-15 19:40:38 · 150 阅读 · 0 评论 -
HDU 1072 Nightmare(广搜BFS)
Problem Description Ignatius had a nightmare last night. He found himself in a labyrinth with a time bomb on him. The labyrinth has an exit, Ignatius should get out of the labyrinth before the bomb e...原创 2018-10-02 15:36:13 · 123 阅读 · 0 评论 -
HDU 1164 Eddy's research I
Problem Description Eddy'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...原创 2018-09-13 19:38:09 · 91 阅读 · 0 评论 -
HDU 1009 FatMouse' Trade
Problem Description FatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite food, JavaBean. The warehouse has N rooms. The i-th room contai...原创 2018-09-13 19:32:10 · 132 阅读 · 0 评论 -
HDU1232 畅通工程(并查集)
Problem Description 某省调查城镇交通状况,得到现有城镇道路统计表,表中列出了每条道路直接连通的城镇。省政府“畅通工程”的目标是使全省任何两个城镇间都可以实现交通(但不一定有直接的道路相连,只要互相间接通过道路可达即可)。问最少还需要建设多少条道路? Input 测试输入包含若干测试用例。每个测试用例的第1行给出两个正整数,分别是城镇数目N ( < 1000 ...原创 2018-08-07 20:32:38 · 177 阅读 · 0 评论 -
HDU6319 Problem A. Ascending Rating
Problem Description Before the start of contest, there are n ICPC contestants waiting in a long queue. They are labeled by 1 to n from left to right. It can be easily found that the i-th contestant's...原创 2018-08-05 16:14:18 · 107 阅读 · 0 评论 -
HDU 6333 Problem B. Harvest of Apples
Problem Description There are n apples on a tree, numbered from 1 to n. Count the number of ways to pick at most m apples. Input The first line of the input contains an integer T (1≤T≤105) de...原创 2018-08-03 16:59:38 · 162 阅读 · 0 评论 -
HDU 1272 小希的迷宫
Problem Description 上次Gardon的迷宫城堡小希玩了很久(见Problem B),现在她也想设计一个迷宫让Gardon来走。但是她设计迷宫的思路不一样,首先她认为所有的通道都应该是双向连通的,就是说如果有一个通道连通了房间A和B,那么既可以通过它从房间A走到房间B,也可以通过它从房间B走到房间A,为了提高难度,小希希望任意两个房间有且仅有一条路径可以相通(除非走了回头路)。...原创 2019-03-10 20:32:35 · 87 阅读 · 0 评论