hpulw

Wilbur and Swimming PoolCrawling in process...Crawling failedTime Limit:1000MS    Memory Limit:262144KB     64bit IO Format:%I64d & %I64u SubmitStatus Practice CodeForces 596A

UESTC 1012(找规律)Description有一天人诹Lee在随手帮女神做题，突然女神发现了自己演算纸上的一个式子，但是式子只有两个加数却没有结果，最近在学不同进制加减法的女神忘了这个两个数字是多少进制了（只记得是小于等于$10$），但是她很好奇在可能的多少进制下这个式子得到的答案长度最长，为了从人赢Lee手中抢走女神，你需要快速计算出这个答案，例如$78+87

Infinite SequenceCrawling in process...Crawling failedTime Limit:1000MS    Memory Limit:262144KB     64bit IO Format:%I64d & %I64u SubmitStatus Practice CodeForces 622A Des

Tricky SumCrawling in process...Crawling failedTime Limit:1000MS    Memory Limit:262144KB     64bit IO Format:%I64d & %I64u SubmitStatus Practice CodeForces 598A Descriptio

UESTC 1012  （进制转换）（思维）Description有一天人诹Lee在随手帮女神做题，突然女神发现了自己演算纸上的一个式子，但是式子只有两个加数却没有结果，最近在学不同进制加减法的女神忘了这个两个数字是多少进制了（只记得是小于等于10），但是她很好奇在可能的多少进制下这个式子得到的答案长度最长，为了从人赢Lee手中抢走女神，你需要快速计算出这个答案，例如78+87

UESTC 1271（dp动态规划） DescriptionDreams of finding lost treasure almost came true recently. A new machine called 'The Revealer' has been invented and it has been used to detect gold which h

NBUT 1647  Description输入一个四个数字组成的整数 n,你的任务是数一数有多少种方法,恰好修改一个数字,把它 变成一个完全平方数(不能把首位修改成0)。比如n=7844,有两种方法:3844=62^2和7744=88^2。Input输入第一行为整数 T (1<=T<=1000),即测试数据的组数

modeCrawling in process...Crawling failedTime Limit:1000MS    Memory Limit:1024KB     64bit IO Format:%lld & %lluSubmitStatus Description给你一个n个数的数列，其中某个数出现了超过n div 2次即众数，

poj-3461(Oulipo)(kmp())OulipoTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 32911 Accepted: 13321DescriptionThe French author Georges Perec (

poj1700(ny47)(过河问题)（贪心）Crossing RiverTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 12680 Accepted: 4828DescriptionA group of N people wishes t

POJ-2752()(KMP)(Seek the Name, Seek the Fame)Seek the Name, Seek the FameTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 15833 Accepted: 8039Descrip

Apples and IdeasTime Limit: 2 Seconds      Memory Limit: 65536 KB "If you have an apple and I have an apple and we exchange these apples then you and I will still each have one apple. But

HDUOJ-1052（poj-2287）（田忌赛马）(贪心)Tian Ji -- The Horse RacingTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24864    Accepted Submission(s)

bailian--oj--2757(最长上升子序列)最长上升子序列Crawling in process...Crawling failedTime Limit:2000MS    Memory Limit:65536KB     64bit IO Format:%I64d & %I64uSubmitStatus Practice OpenJ_B

POJ-2406(Power Strings)(KMP())DescriptionGiven two strings a and b we define a*b to be their concatenation. For example, if a = "abc" and b = "def" then a*b = "abcdef". If we think of conc

POJ-1961(Period)(kmp())DescriptionFor each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know whether the prefix

BZOJ-2190（仪仗队）（欧拉函数）Crawling in process...Crawling failedTime Limit:10000MS    Memory Limit:265216KB     64bit IO Format:%lld & %llu SubmitStatus Description　　作为体育委员，C君负责

Indivisibility（最大公约数+最小公倍数+排列组合）Crawling in process...Crawling failedTime Limit:500MS    Memory Limit:65536KB     64bit IO Format:%I64d & %I64uSubmitStatus DescriptionI

Benches（排列组合）Time Limit:500MS    Memory Limit:65536KB     64bit IO Format:%I64d & %I64uSubmitStatusDescriptionThe city park of IT City contains n east to west paths and n north

openjudge27052705:跳绳游戏总时间限制: 1000ms 内存限制: 65536kB描述小朋友玩跳绳比赛,要计算在一分钟内跳了多少下.假设每秒钟跳一下,如果中途失败了,则要花三秒钟后才能开始重跳.一般小朋友跳绳一分钟要跳坏好几次.现在给出小朋友每次跳坏时已经跳的总数,求小朋友在一分钟内跳了多少下.(请注意分析示例数据.)

lightoj1297(二分查找，或求导)Submit Status Practice LightOJ 1297DescriptionIn the following figure you can see a rectangular card. The width of the card is W and length of the card is L

zoj1610( 线段树)（Count the Colors）Count the ColorsTime Limit: 2 Seconds      Memory Limit: 65536 KB Painting some colored segments on a line, some previously painted segments may be cover

POJ-1852(Ants)                                                                                                                               AntsTime Limit: 1000MS Memory Limit: 30

NOJ 1064快速排序 时间限制(普通/Java) : 1000 MS/ 3000 MS          运行内存限制 : 65536 KByte总提交 : 1195            测试通过 : 442 比赛描述 给定输入排序元素数目n和相应的n个元素，写出程序，利用内排序算法中快速排序算法进行排序，并输出排序最后结果的相应序列。输入

zoj1048Financial ManagementTime Limit: 2 Seconds      Memory Limit: 65536 KB Larry graduated this year and finally has a job. He's making a lot of money, but somehow never seems to

ZOJ  1241Geometry Made SimpleTime Limit: 2 Seconds      Memory Limit: 65536 KB Mathematics can be so easy when you have a computer. Consider the following example. You probab

百练oj27032703:骑车与走路总时间限制: 1000ms 内存限制: 65536kB描述在北大校园里,没有自行车,上课办事会很不方便.但实际上,并非去办任何事情都是骑车快,因为骑车总要找车、开锁、停车、锁车等,这要耽误一些时间.假设找到自行车,开锁并车上自行车的时间为27秒;停车锁车的时间为23秒;步行每秒行走1.2米,

百练oj1192题目描述：给出一个长度不超过1000的字符串，判断它是不是回文(顺读，逆读均相同)的。输入：输入包括一行字符串，其长度不超过1000。输出：可能有多组测试数据，对于每组数据，如果是回文字符串则输出"Yes!”，否则输出"No!"。样例输入：hellollehhelloworld样例输出：Y

POJ_1789(Truck History ) (最小生成树（普里姆prim算法）（从点入手）)（用克鲁斯卡尔算法（从边入手）） Truck History Time Limit : 4000/2000ms (Java/Other)   Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 114   A

并查集（求树的节点的总个数）题目描述CZY总是遇到这样或那样的问题，现在他又遇到了一个，CZY接到一个大的工程，想想这是走上人生巅峰的第一步啊，CZY想想就高兴，可是这个工程太大了，他需要很多人的帮助才可以，但是为了方便工作，CZY希望他的团队两人两人之间都是朋友关系，或者间接是朋友关系。毕竟是大油水的工程啊，来了一群小伙伴报名，CYZ想请聪明的你帮忙算一算，他可以招到的最大的人数是多

ZOJ 1671(广度搜索bfs)Walking Ant Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 20   Accepted Submission(s) : 15Problem DescriptionAn

Time Limit:2000MS    Memory Limit:32768KB     64bit IO Format:%lld & %lluSubmit Status Practice LightOJ 1138DescriptionYou task is to find minimal natural number N, so that N! co

FOJ-2214 Knapsack problemProblem DescriptionGiven a set of n items, each with a weight w[i] and a value v[i],determine a way to choose the items into a knapsack so that the total weight isless t

CodeForces 626B DescriptionCatherine has a deck of n cards, each of which is either red, green, or blue. As long as there are at least two cards left, she can do one of two actions:take an

Lucky Numbers（排列问题）（数学）（n个数排列且可重复用，元素个数不定）Lucky NumbersCrawling in process...Crawling failedTime Limit:500MS    Memory Limit:65536KB     64bit IO Format:%I64d & %I64uSubmitStatus

Hexagons!Crawling in process...Crawling failedTime Limit:500MS    Memory Limit:65536KB     64bit IO Format:%I64d & %I64uSubmitStatus DescriptionAfter a probationary period

Highway ProjectTime Limit: 2 Seconds      Memory Limit: 65536 KBEdward, the emperor of the Marjar Empire, wants to build some bidirectional highways so that he can reach other cities fro