寻找&星空の孩子

摘要： The areaTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7066 Accepted Submission(s): 4959Probl... 阅读全文

摘要： FibonacciTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3105 Accepted Submission(s): 1439Prob... 阅读全文

摘要： 推箱子Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4593 Accepted Submission(s): 1298Problem De... 阅读全文

摘要： hdu 1568 (log取对数 / Fib数通项公式)2007年到来了。经过2006年一年的修炼，数学神童zouyu终于把0到100000000的Fibonacci数列(f[0]=0,f[1]=1;f[i] = f[i-1]+f[i-2](i>=2))的值全部给背了下来。接下来，CodeStar决... 阅读全文

摘要： 整数对Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2127 Accepted Submission(s): 844Problem Descri... 阅读全文

摘要： PupuTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 913 Accepted Submission(s): 385 Problem DescriptionThere is an island called PiLiPaLa.In the island there is a wild animal living in it, and you can call them PuPu. PuPu is a kind of special ani 阅读全文

摘要： 哈密顿绕行世界问题Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 996 Accepted Submission(s): 606 Problem... 阅读全文

摘要： Saving HDUTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4638 Accepted Submission(s): 2111 Prob... 阅读全文

摘要： 素数回文Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 9266 Accepted Submission(s): 2167 Problem De... 阅读全文

摘要： Problem AHashmat the brave warriorInput:standard inputOutput:standard outputHashmat is a brave warrior who with his group of young soldiers moves from... 阅读全文

摘要： Problem 2148 Moon GameAccept: 24 Submit: 61 Time Limit: 1000 mSec Memory Limit : 32768 KBProblem DescriptionFat brother and Maze are playing a kind of... 阅读全文

摘要： ZipperTime Limit:1000MSMemory Limit:65536KTotal Submissions:15277Accepted:5393DescriptionGiven three strings, you are to determine whether the third s... 阅读全文

摘要： 不要62Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 15344 Accepted Submission(s): 4948Problem Des... 阅读全文

摘要： Dijkstra和Prim算法的区别1.先说说prim算法的思想：众所周知，prim算法是一个最小生成树算法，它运用的是贪心原理（在这里不再证明），设置两个点集合，一个集合为要求的生成树的点集合A，另一个集合为未加入生成树的点B,它的具体实现过程是：第1步：所有的点都在集合B中，A集合为空。第2步：... 阅读全文

摘要： 盐水的故事Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 11672 Accepted Submission(s): 2809 Problem ... 阅读全文

摘要： 最短路Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 24283 Accepted Submission(s): 10465 Problem D... 阅读全文

摘要： 一个人的旅行Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 15473 Accepted Submission(s): 5266 Problem... 阅读全文

摘要： 错排问题错排问题就是一种递推式，不过它比较著名且常用，所以要熟记！方法一： n各有序的元素应有n！种不同的排列。如若一个排列式的所有的元素都不在原来的位置上，则称这个排列为错排。任给一个n，求出1,2,……,n的错排个数Dn共有多少个。 递归关系式为：D(n)=(n-1)(D(n-1)+D(n-2)... 阅读全文

摘要： Crossing RiverTime Limit:1000MSMemory Limit:10000KTotal Submissions:9919Accepted:3752DescriptionA group of N people wishes to go across a river with o... 阅读全文

摘要： ti放苹果Time Limit:1000MSMemory Limit:10000KTotal Submissions:24392Accepted:15513Description把M个同样的苹果放在N个同样的盘子里，允许有的盘子空着不放，问共有多少种不同的分法？（用K表示）5，1，1和1，5，1 是... 阅读全文

摘要： SORT AGAINTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3483 Accepted Submission(s): 1110 Prob... 阅读全文

摘要： Can you find it?Time Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/10000 K (Java/Others) Total Submission(s): 8575 Accepted Submission(s): 22... 阅读全文

摘要： Magic Number (zoj3622)Time Limit : 4000/2000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 21 Accepted Submission(s) : ... 阅读全文

摘要： 产生冠军Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 7011 Accepted Submission(s): 3310 Problem De... 阅读全文

摘要： Hamming ProblemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 595 Accepted Submission(s): 247 P... 阅读全文

摘要： Humble NumbersTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 14047 Accepted Submission(s): 6108... 阅读全文

摘要： A + B Problem（1000）Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 355051 Accepted Submission(s)... 阅读全文

摘要： 树状数组是对一个数组改变某个元素和求和比较实用的数据结构。两中操作都是O(logn)。在解题过程中，我们有时需要维护一个数组的前缀和S[i]=A[1]+A[2]+...+A[i]。 但是不难发现，如果我们修改了任意一个A[i],S[i]、S[i+1]...S[n]都会发生变化。 可以说，每次修改A... 阅读全文

摘要： Buy TicketsTime Limit:4000MSMemory Limit:65536KTotal Submissions:11102Accepted:5417DescriptionRailway tickets were difficult to buy around the Lunar N... 阅读全文

摘要： Tunnel WarfareTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3412 Accepted Submission(s): 1323 ... 阅读全文