随笔分类 -  ACM

上一页 1 2
hdu 1272 小希的迷宫
摘要：小希的迷宫 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 22224 Accepted Submission(s): 6801 Problem Description上次Gardon的迷宫城堡小希玩了很久（见Problem B），现在她也想设计... 阅读全文
posted @ 2014-02-23 19:21 姜楠 阅读(369) 评论(0) 推荐(0)
hdu acmsteps 2.1.8 Leftmost Digit
摘要：Leftmost Digit Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 1982 Accepted Submission(s): 884 Problem Description Given a positive integer N, y... 阅读全文
posted @ 2013-10-10 17:06 姜楠 阅读(260) 评论(0) 推荐(0)
hdu acmsteps 2.2.1 Fibonacci
摘要：Fibonacci Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2087 Accepted Submission(s): 999 Problem Description 2007年到来了。经过2006年一年的修炼，数学神童zouyu终于把0... 阅读全文
posted @ 2013-07-18 16:20 姜楠 阅读(223) 评论(0) 推荐(0)
实验四 动态规划算法--最长公共子序列问题
摘要：动态规划算法解LCS问题 1 最长公共子序列的结构 最长公共子序列的结构有如下表示： 设序列X=和Y=的一个最长公共子序列Z=，则： 1> 若 xm=yn，则 zk=xm=yn，且Zk-1是Xm-1和Yn-1的最长公共子序列； 2> 若 xm≠yn且 zk≠xm ，则 Z是 Xm-1和 Y的最长公共子序列； 3> 若 xm≠yn且 zk≠yn ，则 Z是 X和 Yn-1的最长公共子序... 阅读全文
posted @ 2013-05-31 11:13 姜楠 阅读(1456) 评论(0) 推荐(0)
hdu acmsteps 2.1.2 How many prime numbers
摘要：How many prime numbers Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5139 Accepted Submission(s): 1684 Problem Description Give you a lot of... 阅读全文
posted @ 2013-04-06 00:44 姜楠 阅读(206) 评论(0) 推荐(0)
hdu acmsteps 2.1.1 最小公倍数(GCD)
摘要：最小公倍数 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2010 Accepted Submission(s): 1543 Problem Description 给定两个正整数，计算这两个数的最小公倍数。 I... 阅读全文
posted @ 2013-04-06 00:17 姜楠 阅读(300) 评论(0) 推荐(0)
hdu 2614 Beat(DFS)
摘要：Beat Time Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 304 Accepted Submission(s): 199 Problem Description Zty is a man that ... 阅读全文
posted @ 2013-04-05 23:12 姜楠 阅读(209) 评论(0) 推荐(0)
HDU 1232 畅通工程
摘要：并查集系列题目：http://acm.hdu.edu.cn/problemclass.php?id=721 畅通工程 Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 20380 Accepted Submission(s): 105... 阅读全文
posted @ 2013-04-05 00:59 姜楠 阅读(175) 评论(0) 推荐(0)
hdu 2544 最短路(Dijkstra实现)
摘要：最短路Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 18542 Accepted Submission(s): 7897 Proble... 阅读全文
posted @ 2013-04-04 00:28 姜楠 阅读(161) 评论(0) 推荐(0)
hdu 1874 畅通工程续（dijkstra）
摘要：畅通工程续Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 17034Accepted Submission(s): 5832Problem Desc... 阅读全文
posted @ 2013-04-03 23:58 姜楠 阅读(295) 评论(0) 推荐(0)
伯努利数（Bernoulli number）
摘要：设B0＝1，当k＞0时，定义这些Bi(i＝0, 1,…, k)被称为伯努利数。按定义，自然得出：B1＝－，B2＝，B3＝0，B4＝－，B5＝0，B6＝，B7＝0，B8＝－，…。伯努利数是瑞士数学家雅各布·伯努利引入的数，出自于他的著作《猜度术》(1713)。除了B1外，当k为奇数时，Bk＝0；当k为偶数时，B2, B6, B10,…是正分数；B4, B8, B12,…是负分数。雅各布·伯努利引入伯努利数的目的是解决所谓“等幂和”的问题：求Sk(n)＝1k＋2k＋…＋nk对于S1(n)＝1＋2＋3＋…＋n＝n(n＋1)S2(n)＝12＋22＋32＋…＋n2＝n(n＋1)(2n 阅读全文
posted @ 2013-03-30 23:55 姜楠 阅读(8888) 评论(0) 推荐(0)
UVA - 10249 The Grand Dinner
摘要：The Grand DinnerTime Limit:5000MSMemory Limit:Unknown64bit IO Format:%lld & %llu[Submit] [Go Back] [Status]DescriptionProblem D The Grand DinnerInput... 阅读全文
posted @ 2013-03-23 00:38 姜楠 阅读(559) 评论(0) 推荐(0)
ZJUT Practice 3.10 MAYBE JIANDAN! G - Add Again（uva 11107）
摘要：Problem C Add Again Input:Standard InputOutput:Standard OutputSummation of sequence of integers is always a common problem in Computer Science. Rather than computing blindly, some intelligent techniques make the task simpler. Here you have to find the summation of a sequence of integers. The sequenc 阅读全文
posted @ 2013-03-16 00:40 姜楠 阅读(275) 评论(0) 推荐(0)
ZJUT Practice 3.3 F - Sum of Cubes(HDU - 3113)
摘要：Sum of Cubes Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 815 Accepted Submission(s): 182 Problem Description According to Goldbach’s conjecture... 阅读全文
posted @ 2013-03-15 00:02 姜楠 阅读(281) 评论(0) 推荐(0)
ZJUT Practice 3.3 K - K Problem B.Last Digit
摘要：Problem B.Last Digit Background Give you a integer number N (1 2: #include 3: using namespace std; 4: const int maxn=101; 5: int sum[maxn]; 6: int myFun(int n){ 7: int ans=1; ... 阅读全文
posted @ 2013-03-03 18:31 姜楠 阅读(232) 评论(0) 推荐(0)
hdu 1008 - Elevator
摘要：Elevator Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 38423 Accepted Submission(s): 20967 Problem Description The highest building in our city h... 阅读全文
posted @ 2012-11-24 00:27 姜楠 阅读(297) 评论(0) 推荐(0)
hdu 1004 Let the Balloon Rise
摘要：Let the Balloon Rise Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 65028 Accepted Submission(s) 阅读全文
posted @ 2012-11-17 23:10 姜楠 阅读(319) 评论(0) 推荐(0)

上一页 1 2