刷题----hdoj - 随笔分类 - 浅忆~

hdoj 1049

摘要：Ignatius and the Princess IV Problem Description "OK, you are not too bad, em... But you can never pass the next test." feng5166 says."I will tell you 阅读全文

posted @ 2021-07-26 14:49 浅忆~ 阅读(31) 评论(0) 推荐(0)

hdu2083 暴力水

摘要：简易版之最短距离 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 22206 Accepted Submission(s): 9984 Probl 阅读全文

posted @ 2018-03-25 14:04 浅忆~ 阅读(186) 评论(0) 推荐(0)

母函数

摘要：Ignatius and the Princess III Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 23902 Accepted Subm 阅读全文

posted @ 2018-03-20 21:06 浅忆~ 阅读(168) 评论(0) 推荐(0)

双基contest

摘要：Problem Description 有两个球在长度为L的直线跑道上运动，两端为墙。0时刻小球a以1m/s的速度从起点向终点运动，t时刻小球b以相同的速度从终点向起点运动。问T时刻两球的距离。这里小球与小球、小球与墙的碰撞均为弹性碰撞，所有过程没有能量损失。 Input 先输入一个q，代表q组数据阅读全文

posted @ 2017-11-30 13:35 浅忆~ 阅读(155) 评论(0) 推荐(0)

hdoj 6024 Building Shops

摘要：Problem Description HDU’s n classrooms are on a line ,which can be considered as a number line. Each classroom has a coordinate. Now Little Q wants to 阅读全文

posted @ 2017-08-12 09:40 浅忆~ 阅读(169) 评论(0) 推荐(0)

hdoj 6023 Automatic Judge

摘要：Problem Description Welcome to HDU to take part in the second CCPC girls’ competition! A new automatic judge system is used for this competition. Duri 阅读全文

posted @ 2017-08-11 10:58 浅忆~ 阅读(315) 评论(0) 推荐(1)

hdoj 1170 Balloon Comes!

摘要：Problem Description The contest starts now! How excited it is to see balloons floating around. You, one of the best programmers in HDU, can get a very 阅读全文

posted @ 2017-08-10 21:14 浅忆~ 阅读(193) 评论(0) 推荐(0)

hdoj 5976 Detachment(逆元)

摘要：In a highly developed alien society, the habitats are almost infinite dimensional space. In the history of this planet,there is an old puzzle. You hav 阅读全文

posted @ 2017-08-09 11:48 浅忆~ 阅读(137) 评论(0) 推荐(0)

hdoj 2333 Assemble

摘要：Recently your team noticed that the computer you use to practice for programming contests is not good enough anymore. Therefore, you decide to buy a n 阅读全文

posted @ 2017-08-09 11:46 浅忆~ 阅读(142) 评论(0) 推荐(0)

hdoj 4544 B - 湫湫系列故事——消灭兔子

摘要：湫湫减肥越减越肥！最近，减肥失败的湫湫为发泄心中郁闷，在玩一个消灭免子的游戏。游戏规则很简单，用箭杀死免子即可。箭是一种消耗品，已知有M种不同类型的箭可以选择，并且每种箭都会对兔子造成伤害，对应的伤害值分别为Di（1 <= i <= M），每种箭需要一定的QQ币购买。假设每种箭只能使用一次阅读全文

posted @ 2017-08-09 11:40 浅忆~ 阅读(146) 评论(0) 推荐(0)

hdoj 1159 Common Subsequence

摘要：A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = <x1, x2, ..., xm> another se 阅读全文

posted @ 2017-08-09 11:21 浅忆~ 阅读(114) 评论(0) 推荐(0)

hdoj 5752

摘要：Let's define the function f(n)=⌊n−−√⌋f(n)=⌊n⌋. Bo wanted to know the minimum number yy which satisfies fy(n)=1fy(n)=1. note:f1(n)=f(n),fy(n)=f(fy−1(n) 阅读全文

posted @ 2017-08-09 11:06 浅忆~ 阅读(144) 评论(0) 推荐(0)

hdoj 1873 看病要排队

摘要：Problem Description 看病要排队这个是地球人都知道的常识。不过经过细心的0068的观察，他发现了医院里排队还是有讲究的。0068所去的医院有三个医生（汗，这么少）同时看病。而看病的人病情有轻重，所以不能根据简单的先来先服务的原则。所以医院对每种病情规定了10种不同的优先级。级别为1 阅读全文

posted @ 2017-08-09 10:33 浅忆~ 阅读(143) 评论(0) 推荐(0)

hdoj 2289 Cup

摘要：Problem Description The WHU ACM Team has a big cup, with which every member drinks water. Now, we know the volume of the water in the cup, can you tel 阅读全文

posted @ 2017-08-09 10:09 浅忆~ 阅读(103) 评论(0) 推荐(0)

hdoj 2504 又见GCD

摘要：Problem Description 有三个正整数a,b,c(0<a,b,c<10^6)，其中c不等于b。若a和c的最大公约数为b，现已知a和b，求满足条件的最小的c。 Input 第一行输入一个n，表示有n组测试数据，接下来的n行，每行输入两个正整数a,b。 Output 输出对应的c，每组测试阅读全文

posted @ 2017-08-09 10:05 浅忆~ 阅读(158) 评论(0) 推荐(0)

hdoj 2689 Sort it

摘要：Problem Description You want to processe a sequence of n distinct integers by swapping two adjacent sequence elements until the sequence is sorted in 阅读全文

posted @ 2017-08-09 10:03 浅忆~ 阅读(113) 评论(0) 推荐(0)

hdoj 1150 Machine Schedule

摘要：Problem Description As we all know, machine scheduling is a very classical problem in computer science and has been studied for a very long history. S 阅读全文

posted @ 2017-08-09 09:52 浅忆~ 阅读(146) 评论(0) 推荐(0)

hdoj 1159 Common Subsequence(最长公共子序列)

摘要：Problem Description A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = <x1, x2, 阅读全文

posted @ 2017-08-08 15:01 浅忆~ 阅读(177) 评论(0) 推荐(0)

随笔分类 - 刷题----hdoj