![](https://img-blog.csdnimg.cn/20201014180756919.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
二分
文章平均质量分 59
ninesun127
有一个目标,总能让我们欢欣鼓舞~
展开
-
hdu 3763 CD
Problem DescriptionJack and Jill have decided to sell some of their Compact Discs, while they still have some value. They have decided to sell one of each of the CD titles that they both own. How原创 2016-09-14 09:05:44 · 315 阅读 · 0 评论 -
hdu 2578:Dating with girls(1)
Problem DescriptionEveryone in the HDU knows that the number of boys is larger than the number of girls. But now, every boy wants to date with pretty girls. The girls like to date with the boys wi原创 2016-09-14 12:40:03 · 261 阅读 · 0 评论 -
hdu 2141 Can you find it?(二分)
Can you find it?Time Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/10000 K (Java/Others)Total Submission(s): 24883 Accepted Submission(s): 6302Problem DescriptionGive you three sequence原创 2016-10-25 19:30:58 · 248 阅读 · 0 评论 -
pat 甲1010. Radix(二分)
pat 甲1010. Radix(二分)iven a pair of positive integers, for example, 6 and 110, can this equation 6 = 110 be true? The answer is "yes", if 6 is a decimal number and 110 is a binary number.Now for any pair of positive integers N1 and N2, your task is to fi原创 2016-11-19 19:45:34 · 1110 阅读 · 1 评论 -
POJ 2456 Aggressive cows(二分+贪心验证)
Aggressive cowsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 13562 Accepted: 6617DescriptionFarmer John has built a new long barn, with N (2 His C原创 2017-04-12 18:06:29 · 235 阅读 · 0 评论 -
POJ 3258 River Hopscotch(二分)
River HopscotchTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 13218 Accepted: 5636DescriptionEvery year the cows hold an event featuring a peculiar ver原创 2017-04-12 21:55:25 · 204 阅读 · 0 评论 -
poj 3061 Subsequence(二分,尺取法)
SubsequenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 14339 Accepted: 6020DescriptionA sequence of N positive integers (10 < N < 100 000), each of原创 2017-04-14 11:53:37 · 211 阅读 · 0 评论 -
蓝桥杯 分巧克力(二分)
标题: 分巧克力 儿童节那天有K位小朋友到小明家做客。小明拿出了珍藏的巧克力招待小朋友们。 小明一共有N块巧克力,其中第i块是Hi x Wi的方格组成的长方形。 为了公平起见,小明需要从这 N 块巧克力中切出K块巧克力分给小朋友们。切出的巧克力需要满足: 1. 形状是正方形,边长是整数 2. 大小相同 例如一块6x5的巧克力可以切出6块2x2原创 2017-04-14 20:07:48 · 1534 阅读 · 0 评论 -
hdu 1003 MaxSum
tips: 最大子序列和问题.算法经典例题.....当初学数据结构和算法分析的时候没有实现过,今天被实验室的学弟问到这个题,特意做了一遍。算法书上和杭电的这道题的最大区别在于:1.如果数据全部是负数,算法书上认为序列长度为0(最大和自然也为0),而杭电的这道题认为最大的和为最大的那一个负数。2.比书上稍微复杂一点,要求输出开始和结束序列的位置先贴杭电的题目以及代码(简单DP原创 2016-09-21 21:29:19 · 213 阅读 · 0 评论