mejustdoit的专栏

MultiplyTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 5042 Accepted: 2688Description6*9 = 42" is not true for base 10, but is true for base 13. That is,

9192. Three Lines限制条件时间限制: 1 秒, 内存限制: 256 兆 题目描述Farmer John wants to monitor his N cows (1 <= N <= 50,000) using a new surveillance system he has purchased. The ith cow is located at positio

对于学习动态规划的新手这两道题很合适

动态规划的简单题，新手锻炼思维很合适

动态规划简单题

对于初学者很好的解释了钱币兑换问题

Cash MachineTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 24656 Accepted: 8641DescriptionA Bank plans to install a machine for cash withdrawal. The mach

The Cow LexiconTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 7451 Accepted: 3483DescriptionFew know that the cows have their own dictionary with W (1

队列，二叉树，广搜的同学可以试一下

Problem C Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 14   Accepted Submission(s) : 3Problem DescriptionI have a very simple problem f

Problem D Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 8   Accepted Submission(s) : 1Problem Description给定一个日期，输出这个日期是该年的第几天。 Inp

Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 58940    Accepted Submission(s): 16038Problem DescriptionThe dogg

A + B ProblemTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 370602    Accepted Submission(s): 116455Problem DescriptionCalculate A

The Tower of BabylonPerhaps you have heard of the legend of the Tower of Babylon. Nowadays many details of this talehave been forgotten. So now, in line with the educational nature of this contest

9095. Islands 限制条件时间限制: 2 秒, 内存限制: 256 兆 题目描述Whenever it rains, Farmer John's field always ends up flooding. However, since the field isn't perfectly level, it fills up with water in a non-u

玛雅历Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 60961 Accepted: 18802Description上周末，M.A. Ya教授对古老的玛雅有了一个重大发现。从一个古老的节绳（玛雅人用于记事的工具）中，教授发现玛雅人使用了一个一年有365天的叫

Charm Bracelet Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 23   Accepted Submission(s) : 9Problem DescriptionBessie has gone to the

Big Event in HDUTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19403    Accepted Submission(s): 6785Problem DescriptionNowaday

Gary's CalculatorTime Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 857    Accepted Submission(s): 188Problem DescriptionGary has f

HerdingTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1052    Accepted Submission(s): 303Problem DescriptionLittle John is herding

Dogs Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 16   Accepted Submission(s) : 11Font: Times New Roman | Verdana | GeorgiaFont Size:

滑雪Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 69216 Accepted: 25536DescriptionMichael喜欢滑雪百这并不奇怪， 因为滑雪的确很刺激。可是为了获得速度，滑的区域必须向下倾斜，而且当你滑到坡底，你不得不再次走上坡或者等待升

Sum of FactorialsTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 12723 Accepted: 4185DescriptionJohn von Neumann, b. Dec. 28, 1903, d. Feb. 8, 1957, was a

Bottles ArrangementTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 295    Accepted Submission(s): 230Problem Description　　Hunan cuis

ZOJ Problem Set - 1622SwitchTime Limit: 2 Seconds      Memory Limit: 65536 KB There are N lights in a line. Given the states (on/off) of the lights, your task is to determine at least how

ZOJ Problem Set - 3725Painting StoragesTime Limit: 2 Seconds      Memory Limit: 65536 KB There is a straight highway with N storages alongside it labeled by1,2,3,...,N. Bob asks you to p

****J题：看了大神的总结来自http://blog.youkuaiyun.com/fanfank/article/details/8923215http://www.cnblogs.com/IT-BOY/archive/2013/05/13/3076442.html给定N和K，整数序列S如果同时满足下面3个条件，那么就称之为沉闷序列：1. 数列有N个整数2. 每个整数要么是0，要么

算法