![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
贪心
文章平均质量分 77
旧林墨烟
惠州学院大四学生,热爱算法竞赛,获得蓝桥杯、天梯赛、ccpc、icpc等多项奖项,熟悉c++、java语言,目前处于求职状态
展开
-
M - Buy Sticks (贪心)
Imyourgod need 3 kinds of sticks which have different sizes: 20cm, 28cm and 32cm. However the shop only sell 75-centimeter-long sticks. So he have to cut off the long stick. How many sticks he must buy at least.InputThe first line of input contains a num原创 2021-10-04 17:15:02 · 82 阅读 · 0 评论 -
L - Fishing Master (贪心)
Heard that eom is a fishing MASTER, you want to acknowledge him as your mentor. As everybody knows, if you want to be a MASTER’s apprentice, you should pass the trial. So when you find fishing MASTER eom, the trial is as follow:There are n fish in the poo原创 2021-10-04 12:42:44 · 93 阅读 · 0 评论 -
K - Doing Homework again (贪心)
Ignatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline of handing in the homework. If Ignatius hands in the homework after the deadline, the teacher will reduce his score of the fin原创 2021-10-03 21:31:40 · 85 阅读 · 0 评论 -
I - Cleaning Shifts (贪心)
Farmer John is assigning some of his N (1 <= N <= 25,000) cows to do some cleaning chores around the barn. He always wants to have one cow working on cleaning things up and has divided the day into T shifts (1 <= T <= 1,000,000), the first bein原创 2021-10-03 17:48:56 · 94 阅读 · 0 评论 -
H - Packets (贪心)
A factory produces products packed in square packets of the same height h and of the sizes 11, 22, 33, 44, 55, 66. These products are always delivered to customers in the square parcels of the same height h as the products have and of the size 6*6. Because原创 2021-10-03 17:37:57 · 103 阅读 · 0 评论 -
G - Best Cow Line (贪心)
FJ is about to take his N (1 ≤ N ≤ 2,000) cows to the annual"Farmer of the Year" competition. In this contest every farmer arranges his cows in a line and herds them past the judges.The contest organizers adopted a new registration scheme this year: simpl原创 2021-10-02 00:38:06 · 112 阅读 · 0 评论 -
F - Bin Packing (贪心)
A set of n 1-dimensional items have to be packed in identical bins. All bins have exactly the same length l and each item i has length li<=l . We look for a minimal number of bins q such thateach bin contains at most 2 items,each item is packed in one原创 2021-10-01 23:45:23 · 123 阅读 · 0 评论