hdu
MAR_Alviss
脚着AJ屐,身着品如衣
展开
-
hdu 3662
题意:三维里一堆点里面找一个多边形包括所有点思路:裸的三维凸包模板。网上的模板都是一样的,我把上交的ACM国际大学生程序设计竞赛上的三维凸包敲了一下,因为缺少必要的函数,所以一开始迟迟不过,后来套用了一些函数,就能过了,总得来说,上交写的模板不会是错的,这么厉害的学校不会犯这种错误的。附上代码#include#include#include#include#include#inclu原创 2016-08-19 11:21:15 · 382 阅读 · 1 评论 -
HDU 4195
一道计算几何,表示一开始一点思路都没有,看了别人的思路以后才下手写的,但是圆心角都不会求了,这就相当尴尬了。。。然后去普及了一下。。。//思路:三个点,三角形–>外接圆–>必定也是该凸多边形的外接圆-//我们可以把三个点当做一个三角形放在它的外接圆上,然后求出每个角的度(即三角形分的三个弧度所对应的圆周角)//三角形的圆心角可以整除(2*pi)/n//,设顶点数为n,我们只需计算,三角形原创 2016-04-26 14:26:24 · 331 阅读 · 0 评论 -
HDU 1272
小希的迷宫Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 43011 Accepted Submission(s): 13240Problem Description上次Gardon的迷宫城堡小希玩了很久(见P原创 2016-07-24 10:13:13 · 271 阅读 · 0 评论 -
HDU 1325
Is It A Tree?Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21246 Accepted Submission(s): 4808Problem DescriptionA tree is a wel原创 2016-07-24 12:11:27 · 375 阅读 · 0 评论 -
HDU 1856
More is betterTime Limit: 1000MS Memory Limit: 102400KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionMr Wang wants some boys to help him with a project原创 2016-07-24 14:24:31 · 224 阅读 · 0 评论 -
hdu 3368
Problem DescriptionReversi, also called Othello, is a two-sided game.Each of the two sides corresponds to one player; they are referred to here as light and dark after the sides of Othello piece原创 2016-07-26 20:13:00 · 391 阅读 · 0 评论 -
hdu 3363
Ice-sugar gourd, “bing tang hu lu”, is a popular snack in Beijing of China. It is made of some fruits threaded by a stick. The complicated feeling will be like a both sour and sweet ice when you taste原创 2016-07-26 20:03:33 · 705 阅读 · 0 评论 -
HDU 3366
Problem DescriptionBill is a millionaire. But unfortunately he was trapped in a castle. There are only n passages to go out. For any passage i (1<=i<=n), Pi (0<=Pi<=1) denotes the probability that原创 2016-07-26 20:16:54 · 521 阅读 · 0 评论 -
HDU 3367
PseudoforestTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2663 Accepted Submission(s): 1047Problem DescriptionIn graph the原创 2016-07-27 10:16:46 · 431 阅读 · 0 评论 -
HDU 4586
Play the DiceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1328 Accepted Submission(s): 429Special JudgeProblem Description原创 2016-07-27 18:49:57 · 306 阅读 · 0 评论 -
HDU 4588
Count The CarriesTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1538 Accepted Submission(s): 540Problem DescriptionOne day,原创 2016-07-27 19:07:46 · 481 阅读 · 0 评论 -
HDU 4596
Yet another end of the worldTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1084 Accepted Submission(s): 451Problem Description原创 2016-07-27 20:23:31 · 509 阅读 · 0 评论 -
HDU 3364
LanternsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1472 Accepted Submission(s): 581Problem DescriptionAlice has received原创 2016-07-28 11:03:35 · 802 阅读 · 1 评论 -
hdu 5705
ClockTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 500 Accepted Submission(s): 176Problem DescriptionGiven a time HH:MM:SS原创 2016-07-30 10:08:35 · 954 阅读 · 0 评论 -
hdu 4499
CannonTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 1006 Accepted Submission(s): 577Problem DescriptionIn Chinese Chess, th原创 2016-08-02 20:20:20 · 345 阅读 · 0 评论 -
HDU 4496
D-CityTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 3274 Accepted Submission(s): 1172Problem DescriptionLuxer is a really b原创 2016-08-02 20:26:19 · 285 阅读 · 0 评论 -
HDU 4497
GCD and LCMTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 2261 Accepted Submission(s): 999Problem DescriptionGiven two posit原创 2016-08-02 20:30:26 · 392 阅读 · 0 评论 -
hdu 5002
长了长见识,学到了一个新的模板——动态树#include#include#include#include#includeusing namespace std;const int INF = 0x3f3f3f3f;const int N = 111111;int m,n;class LCT{private: struct node { in原创 2016-03-11 16:50:50 · 342 阅读 · 0 评论