- 博客(48)
- 资源 (1)
- 问答 (3)
- 收藏
- 关注
原创 HDU 1997 汉诺塔VII
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1997汉诺塔VIITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1087
2014-12-28 22:50:36 836
原创 HDU 1996 汉诺塔VI
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1996汉诺塔VITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1671 Accepted Submission(s):
2014-12-28 22:48:57 516
原创 HDU 1995 汉诺塔V
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1995汉诺塔VTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2979 Accepted Submission(s): 1
2014-12-28 22:43:37 957
原创 HDU 1236 排名
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1236排名Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16233 Ac
2014-12-28 22:40:34 427
原创 HDU 1106 排序
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1106排序Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 36449 Accepted Submission(s): 10
2014-12-28 22:37:34 535
原创 HDU 1031 Design T-Shirt
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1031Design T-ShirtTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6257 Accepted Submis
2014-12-28 22:24:22 422
原创 HDU 1040 As Easy As A+B
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1040As Easy As A+BTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 40345 Accepted Submi
2014-12-28 22:18:41 526
原创 HDU 2077 汉诺塔IV
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2077汉诺塔IVTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4332 Accepted Submission(s):
2014-12-22 22:02:35 550
原创 HDU 2064 汉诺塔III
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2064汉诺塔IIITime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10408 Accepted Submission(s)
2014-12-22 21:57:29 420
原创 HDU 1207 汉诺塔II
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1207汉诺塔IITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5528 Accepted Submission(s):
2014-12-22 21:39:43 487
原创 汉诺塔问题
汉诺塔:汉诺塔(又称河内塔)问题是源于印度一个古老传说的益智玩具。大梵天创造世界的时候做了三根金刚石柱子,在一根柱子上从下往上按照大小顺序摞着64片黄金圆盘。大梵天命令婆罗门把圆盘从下面开始按大小顺序重新摆放在另一根柱子上。并且规定,在小圆盘上不能放大圆盘,在三根柱子之间一次只能移动一个圆盘。--摘自百度百科。那么现在的问题就是有n片圆盘,问你从第一根柱子搬到第三根柱子需要搬多少次?答案是
2014-12-21 11:26:39 848
原创 HDU 4841 圆桌问题
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4841圆桌问题Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 315 Accepted Submission(s): 11
2014-12-21 00:09:49 853
原创 HDU 1443 Joseph
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1443JosephTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1711 Accepted Submission(s):
2014-12-21 00:01:39 482
原创 HDU 2925 Musical Chairs
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2925Musical ChairsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1007 Accepted Submis
2014-12-20 23:35:13 551
原创 HDU 2211 杀人游戏
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2211【科普】什么是BestCoder?如何参加?杀人游戏Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submissi
2014-12-17 22:32:32 1112
原创 九度OJ 题目1208:10进制 VS 2进制
题目链接:http://ac.jobdu.com/problem.php?pid=1208题目1208:10进制 VS 2进制时间限制:1 秒内存限制:32 兆特殊判题:否提交:1571解决:469题目描述: 对于一个十进制数A,将A转换为二进制数,然后按位逆序排列,再转换为十进制数B,我们乘B为A的二进制逆
2014-12-15 22:36:29 532
原创 HDU 2057 A + B Again
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2057A + B AgainTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 16518 Accepted Submissi
2014-12-15 00:00:38 421
原创 HDU 2051 Bitset
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2051BitsetTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13647
2014-12-14 23:58:34 400
原创 HDU 2031 进制转换
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2031进制转换Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 27424 Accepted Submission(s):
2014-12-14 22:53:01 428
原创 HDU 1569 方格取数(2)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1569方格取数(2)Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4804 Accepted Submission(s
2014-12-12 18:32:18 444
原创 HDU 1565 方格取数(1)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1565方格取数(1)Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5932 Accepted Submission(s
2014-12-12 18:25:29 475
原创 POJ 1459 Power Network
题目链接:http://poj.org/problem?id=1459Power NetworkTime Limit: 2000MS Memory Limit: 32768KTotal Submissions: 23572 Accepted: 12344DescriptionA power network
2014-12-12 18:20:46 334
原创 HDU 1532 Drainage Ditches
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1532【科普】什么是BestCoder?如何参加?Drainage DitchesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
2014-12-12 18:16:07 404
原创 HDU 3549 Flow Problem
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3549Flow ProblemTime Limit: 5000/5000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 8621 Accepted Submissi
2014-12-12 18:12:54 348
原创 网络流之最大流-我的模板
以HDU 3549这道模板题来分别给出我的EK,DINIC,SAP算法,原题连接:http://acm.hdu.edu.cn/showproblem.php?pid=3549一般地,求解最大流问题存在EK,DINIC,SAP三种算法。EK算法是基于BFS寻找增广路的,SAP算法是利用距离标号,DINIC算法是利用分层网络来寻找增广路。具体原理和一些基本概念我这里就不再赘述了。相关书籍已经写得非
2014-12-12 18:04:32 494
原创 HDU 4608 I-number
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4608【科普】什么是BestCoder?如何参加?I-numberTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Tot
2014-12-12 17:53:59 617
原创 HDU 2117 Just a Numble
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2117Just a NumbleTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2381 Accepted Submiss
2014-12-07 13:10:11 478
原创 HDU 2054 A == B ?
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2054A == B ?Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 66431 Accepted Submissio
2014-12-07 12:19:52 380
原创 HDU 2100 Lovekey
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2100LovekeyTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6266 Accepted Submission(s)
2014-12-07 12:17:49 390
原创 我的素数筛法模板
用筛法求素数的基本思想是:把从1开始的、某一范围内的正整数从小到大顺序排列, 1不是素数,首先把它筛掉。剩下的数中选择最小的数是素数,然后去掉它的倍数。依次类推,直到筛子为空时结束。如有:1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 301不是素数,去掉。剩下的数中2最小,是素数,
2014-12-07 11:57:19 550
原创 HDU 1316 How Many Fibs?
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1316How Many Fibs?Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4539 Accepted Submis
2014-12-07 00:13:46 443
原创 HDU 1230 火星A+B
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1230火星A+BTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10843 Accepted Submission(s):
2014-12-06 23:33:19 453
原创 HDU 1753 大明A+B
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1753【科普】什么是BestCoder?如何参加?大明A+BTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submi
2014-12-06 23:27:14 534
原创 HDU 1715大菲波数
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1715大菲波数Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12206 Accepted Submission(s):
2014-12-06 23:07:58 477
原创 最小公倍数高精度模板
这可谓是大整数乘法,除法,加法,gcd的综合运用吧#include#includeusing namespace std;const int L=10005;string mul(string a,string b){ string s; int na[L],nb[L],nc[L],La=a.size(),Lb=b.size();//na存储被乘数,nb存储乘数,nc
2014-12-06 22:53:32 751
原创 压位高精度模板
原先是整型数组每个元素存1个数字,压位高精是每位存8个数字,这样可以加速8呗,空间也减小了。可谓是对整形数组的充分利用。#include#include#include#include#include#include#include#include#include#include#include#include#include#define LL long long
2014-12-06 22:52:20 1932
原创 我的高精度除法模板
光用减法模拟太慢了,可以先预估商的值高精度除法是高精度里面最难的了。自己用一个小一点的测试数据模拟下代码运行过程就一目了然了。多敲几遍也就那样。加油!#include#includeusing namespace std;const int L=10005;int sub(int *a,int *b,int La,int Lb){ if(La<Lb) return
2014-12-06 22:48:12 603
原创 我的高精度乘法模板
O(n^2)复杂度的算法,以后会发布O(n*log(n))的基于快速傅里叶变换的高精乘用字符串读取数据倒序存储模拟手工运算最好自己用个比较小的数字按算法走一遍,然后就一目了然了。#include#include#include#include#include#include#include#include#include#include#include#i
2014-12-06 22:44:30 796
原创 我的高精度加法模板
用字符串读取大整数。然后倒序存入整形数组里。最后还原成正序具体见代码#include#include#define maxn 10005char a[maxn],b[maxn];int na[maxn],nb[maxn];void add(){ memset(na,0,sizeof(na)); memset(nb,0,sizeof(nb)); i
2014-12-06 22:42:58 480
原创 POJ 2186 Popular Cows
POJ 2186 Popular CowsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 24076 Accepted: 9879DescriptionEvery cow's dream is to become the most popula
2014-12-05 23:46:30 396
TA创建的收藏夹 TA关注的收藏夹
TA关注的人