fores_t的博客

Tick and TickTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 26114 Accepted Submission(s): 7122Problem DescriptionThe three hands of the ...

Number SequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 232904 Accepted Submission(s): 59123Problem DescriptionA number sequence i...

Let the Balloon RiseTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 173125 Accepted Submission(s): 68950Problem DescriptionContest time a...

A + B Problem IITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 507925 Accepted Submission(s): 97540Problem DescriptionI have a very simp...

Sum ProblemTime Limit: 1000/500 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 672390 Accepted Submission(s): 169576Problem DescriptionHey, welcome to HDOJ(Ha...

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

Max SumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 342688 Accepted Submission(s): 81477Problem DescriptionGiven a sequence a[1],a[2],...

题目描述:请判断一个数是不是水仙花数。其中水仙花数定义各个位数立方和等于它本身的三位数。输入描述:有多组测试数据，每组测试数据以包含一个整数n(100<=n<1000)输入0表示程序输入结束。输出描述:如果n是水仙花数就输出Yes否则输出No样例输入:复制1531540样例输出:YesNo提示:没有提示哦来源:...

NYOJ 28-大数阶乘内存限制:64MB 时间限制:3000ms 特判: No通过数:295 提交数:625 难度:3题目描述:我们都知道如何计算一个数的阶乘，可是，如果这个数很大呢，我们该如何去计算它并输出它？输入描述:输入一个整数m(0<m<=5000)输出描述:输出m的阶乘，并在输出结束之后输入一个换行符样例输入:复制50样例输出:3041409...

http://acm.hnucm.edu.cn/JudgeOnline/problem.php?id=1401题目描述:使用递归编写一个程序，求以下数列的前n项：s=1−1/2+1/3−1/4+1/5−1/6+…+1/n输入多组数据输入，每组输入一个正整数n输出输出前n项的结果（精确到小数点后六位）样例输入 Copy1样例输出 Copy1.000000来源/分类算法分析与...

Do you know stack and queue? They’re both important data structures. A stack is a “first in last out” (FILO) data structure and a queue is a “first in first out” (FIFO) one.Here comes the problem: give

Big Number In many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data, encryption, etc. In this problem you are given a n

Description You have two empty jugs and tap that may be used to fill a jug. When filling a jug from the tap, you can only fill it completely (i.e., you cannot partially fill it to a desired level, sin

在讲述DP算法的时候，一个经典的例子就是数塔问题，它是这样描述的： 有如下所示的数塔，要求从顶层走到底层，若每一步只能走到相邻的结点，则经过的结点的数字之和最大是多少？ 动态规划问题 显然动态转移方程为：dp[i][j]=max(dp[i+1][j],dp[i+1][j+1]);dp[i][j]+=a[i][j]; 个人理解就是分配空间，为空间置零，我的方法是从最后一行开始查询。具体看我