- 博客(15)
- 资源 (2)
- 收藏
- 关注
原创 poj1942 Paths on a Grid(组合数)
Paths on a GridTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 23307 Accepted: 5740DescriptionImagine you are attending your math lesson at school. Once
2015-09-28 18:26:21 394
原创 hdu1847Good Luck in CET-4 Everybody!(周练-规律)
Good Luck in CET-4 Everybody!Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7017 Accepted Submission(s): 4516Problem Description
2015-09-26 22:45:34 339
原创 hdu2824(欧拉函数+打表)
The Euler functionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4624 Accepted Submission(s): 1935Problem DescriptionThe Euler f
2015-09-24 22:04:58 459
原创 hdu1286找新朋友(欧拉函数)
找新朋友Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9460 Accepted Submission(s): 5014Problem Description新年快到了,“猪头帮协会”准备搞一个聚会,已经知道
2015-09-22 21:54:29 372
原创 hdu1042N!(大数)
N! Time Limit : 10000/5000ms (Java/Other) Memory Limit : 262144/262144K (Java/Other)Total Submission(s) : 2 Accepted Submission(s) : 1Problem DescriptionGiven an integer N(0 ≤ N ≤ 10000),
2015-09-22 16:26:20 390
原创 poj1611The Suspects(并查集)
The SuspectsTime Limit: 1000MS Memory Limit: 20000KTotal Submissions: 28165 Accepted: 13719DescriptionSevere acute respiratory syndrome (SARS), an atypical pneumo
2015-09-19 22:27:08 403
原创 hdu3782xxx定律(位运算)
xxx定律Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3423 Accepted Submission(s): 2559Problem Description对于一个数n,如果是偶数,就把n砍掉一半;如果是
2015-09-19 00:06:01 532
原创 hdu1290(规律)
献给杭电五十周年校庆的礼物Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8996 Accepted Submission(s): 5036Problem Description或许你曾经牢骚满腹或许你依然
2015-09-18 22:59:14 434
原创 切西瓜
一个西瓜切N刀,问最多能将其切多少块?其实就是空间划分问题;(1)首先,让我们先看一下一维下的情况(N个点最多能将直线分成多少块);一个直线切N次,N=1时,直线最多被分为两块,N=2时,最多被分为三块;N=3时,最多被分为4块,依次类推,当切N次时,最多被分为N+1块;递推证明:一个点最多能将一个直线分成两部分,所以有 a[n] - a[n-1] = 1;且a[1] =
2015-09-18 22:00:10 949
原创 hdu1003MAX sum(动态规划)
Max SumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 183149 Accepted Submission(s): 42725Problem DescriptionGiven a sequence a[
2015-09-17 23:24:41 359
转载 最大子数组之和(动态规划)
题目:输入一个整型数组,数组里有正数也有负数。数组中一个或连续的多个整数组成一个子数组。求所有子数组的和的最大值。要求时间负责度为O(n)。看到这个题目,我们首先想到的是求出这个整型数组所有连续子数组的和,长度为n的数组一共有 n(n+2)/2个子数组,因此要求出这些连续子数组的和最快也需要O(n^2)的时间复杂度。但是题目要求的O(n)的时间复杂度,因此上述思路不能解决问题。
2015-09-17 17:58:18 3847
原创 hdu2100(大数)
LovekeyTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7026 Accepted Submission(s): 2288Problem DescriptionXYZ-26进制数是一个每位都是大写字母的数
2015-09-16 22:32:07 468
转载 矩阵快速幂
本文转自http://www.cnblogs.com/yan-boy/archive/2012/11/29/2795294.html矩阵 快速幂矩阵的快速幂是用来高效地计算矩阵的高次方的。将朴素的o(n)的时间复杂度,降到log(n)。这里先对原理(主要运用了矩阵乘法的结合律)做下简单形象的介绍:一般一个矩阵的n次方,我们会通过连乘n-1次来得到它的
2015-09-09 23:08:49 324
原创 hdu2102-A计划(dfs)
A计划Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13616 Accepted Submission(s): 3382Problem Description可怜的公主在一次次被魔王掳走一次次被骑士们救回来之
2015-09-06 15:54:50 423
原创 poj3253Fence Repair(贪心)
Fence RepairTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 32802 Accepted: 10581DescriptionFarmer John wants to repair a small length of the fence arou
2015-09-02 10:58:05 412
svn_site-1.8.11-1.rar
2017-09-15
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人