Ever_glow的博客

杭电 1005 hdu 1005

ParityTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4802 Accepted Submission(s): 3609Problem DescriptionA bit string has odd parity if the number of 1's is odd. A bit string has even pari

SumsetsTime Limit: 6000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2814    Accepted Submission(s): 1124Problem DescriptionFarmer J

Max FactorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8635 Accepted Submission(s): 2817Problem DescriptionTo improve the organization of his farm, Farmer John labels each of his N (1 <=

悼念512汶川大地震遇难同胞——选拔志愿者Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9779    Accepted Submission(s): 6196Problem Descrip

Common SubsequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 40565 Accepted Submission(s): 18717Problem DescriptionA subsequence of a given sequence is the given sequence with some elem

Pick The SticksTime Limit: 15000/10000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 2063 Accepted Submission(s): 657Problem DescriptionThe story happened long long ago. One day, Cao Cao made a special order ca

Super Jumping! Jumping! Jumping!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 40087 Accepted Submission(s): 18464Problem DescriptionNowadays, a kind of chess game called “Super Jumping! Ju

Special TetrahedronTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 843 Accepted Submission(s): 348Problem DescriptionGiven n points which are in three-dimensional space(without repetition).

Max Sum Plus PlusTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 30716 Accepted Submission(s): 10846Problem DescriptionNow I think you have got an AC in Ignatius.L's "Max Sum" problem. To be

Doing HomeworkTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9864 Accepted Submission(s): 4716Problem DescriptionIgnatius has just come back school from the 30th ACM/ICPC. Now he has a lot

In ActionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6487 Accepted Submission(s): 2191Problem DescriptionSince 1945, when the first nuclear bomb was exploded by the Manhattan Project te

Leapin' LizardsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3015 Accepted Submission(s): 1234Problem DescriptionYour platoon of wandering lizards has entered a strange room in the labyrin

ControlTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3561 Accepted Submission(s): 1494Problem Description　　You, the head of Department of Security, recently received a top-secret informati

一个人的旅行Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 40079 Accepted Submission(s): 13619Problem Description虽然草儿是个路痴（就是在杭电待了一年多，居然还会在校园里迷路的人，汗~),但是草儿仍然很喜欢旅行，因为在旅途中 会遇见很多人（白马王子，^0^），很多事，还能丰富自

Cow SortingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3599 Accepted Submission(s): 1256Problem DescriptionSherlock's N (1 ≤ N ≤ 100,000) cows are lined up to be milked in the evening. E

敌兵布阵Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 94731 Accepted Submission(s): 39972Problem DescriptionC国的死对头A国这段时间正在进行军事演习，所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,Derek和Tidy的任务就是要

FrogsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2810 Accepted Submission(s): 904Problem DescriptionThere are m stones lying on a circle, and n frogs are jumping over them.The stones ar

Repair the WallTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4473 Accepted Submission(s): 2208Problem DescriptionLong time ago , Kitty lived in a small village. The air was fresh and the

龟兔赛跑Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 18101    Accepted Submission(s): 6759Problem Description据说在很久很久以前，可怜的兔子经历了人生中最大的

题目地址：点击打开链接一道典型的分治法求最小点对的问题，很难搞懂，请参考大神的博客：点击打开链接以下是代码实现，耗时889ms，已经相当快了，注意如果用cin输入的话会超时。/*分治法求最小点对*/ #include#include#include#include#includeusing namespace std;struct point { double

题目链接：点击打开链接好不容易碰到的水题呀。你在电梯上，电梯上去6s，电梯下去4s，电梯不动5s，不存在优先等级，电梯就这么简简单单的走，问最后的总时间是多少。。这种水题我都不敢写，题目越水越不会。还有 能用long long 为什么要写int，所以我的代码都是long long.代码实现：#include#include#include#includeu

HDU 1009 FatMouse' Trade

题目链接：点击打开链接放张图片吧……心态最重要开始以为简单的dfs模板题，用c++写，方向数组名为next，然后n次编译错误，我也是很绝望啊。然后c写，就出现了超时，后来一搜才知道奇偶剪枝，也是醉了。而且，根据题意step必须等于t，而不会小于。题意属于看示例

题目地址：点击打开链接又是水题，好兴奋。直接放代码，不解释。代码实现：#include#include#include#includeusing namespace std;int main(){ double e; long long int i,temp; e=temp=1; cout<<"n e"<<endl; cout<<"- ------

题目链接：点击打开链接这题也是可以，没告诉n多大，那你让我怎么猜呢？只好用字符串吸收，随便开的字符串，幸好过了。线性时间，当sum>9时，就可以把sum拆分，形成新的sum，最后输出。线性时间，我还能超时。。。n[0]=='0',写成了n[0]=0...花样  !AC代码实现：#include#include#include#includeusing names

题目地址：点击打开链接经过了前几个题的折磨后，迎来了几个愉悦身心的水题。题目意思是 给你两个数，利用公式求出从0到n-1的数是不是都在求出的数组内。不得已用c输出，话说这输出格式也是恶心。代码实现：#include#include#includeusing namespace std;int main(){ long long int m,n,i; i

http://acm.hdu.edu.cn/showproblem.php?pid=1506Problem DescriptionA histogram is a polygon composed of a sequence of rectangles aligned at a common base line. The rectangles have equal widths b

Oil DepositsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 29700    Accepted Submission(s): 17169Problem DescriptionThe GeoSurvComp

题目链接：点击打开链接这真不是一道水题，真的，真的，我WA五次，是因为case后面的那个数，还有，要不停的输入m，n，两层while循环看好我的分类，这题并不会在水题里面，他一点不水，如果是比赛，提交时间要120分钟左右了。记录个数的sum=0在第二层循环内，记录个数的在第一层循环内。还有，格式，最后有空行。我能怎么样，我也是很绝望啊。现在看，这题还水吗？#in

题目链接：点击打开链接题目要求求n个数的最小公约数，可以依次求出每个数的最大公倍数，然后两数相乘再除以gcd。开始是数组接受后遍历，莫名其秒WA两次，又放在输入中直接求的，就过了，可能有小细节没处理好。有用到欧几里得算法。下面是大神对欧几里得算法以及扩展欧几里得的解释。点击打开链接代码实现：#include#include#includeusing name

题目链接：点击打开链接开始以为这题给出的字符没有顺序，WA几次，又用set写，还是错，最后用最简单的方法写，就这么A到，生活处处充满惊喜。思路是求出连续相同字符个数，输出个数加字符，1不用输出。做了这些题之后，慢慢学会了在示例输入时进行操作，这样会使某些题目变得很简单，但也会碰到超时的情况，看人品吧。代码实现：#include#include#includeus

Train Problem ITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 36011 Accepted Submission(s): 13576Problem DescriptionAs the new term comes, the Ignatius Train Station is very busy nowadays.

Moving TablesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 35472 Accepted Submission(s): 11681Problem DescriptionThe famous ACM (Advanced Computer Maker) Company has rented a floor of a b

Wooden SticksTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21402 Accepted Submission(s): 8636Problem DescriptionThere is a pile of n wooden sticks. The length and weight of each stick are

TaskTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7206 Accepted Submission(s): 1897Problem DescriptionToday the company has m tasks to complete. The ith task need xi minutes to complete.

Problem DescriptionA ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n into each circle separately, and the sum of numbers in two adjacent circles should be a prime.

Dire WolfTime Limit: 5000/5000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 2761 Accepted Submission(s): 1632Problem DescriptionDire wolves, also known as Dark wolves, are extraordinarily large and powerful