- 博客(36)
- 问答 (1)
- 收藏
- 关注
原创 HDU 2717 Catch That Cow (BFS)
Catch That CowTime Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11784 Accepted Submission(s): 3676Problem DescriptionFarmer John
2016-06-30 15:10:00 589
原创 HDU 2614 Beat (DFS)
BeatTime Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1346 Accepted Submission(s): 793Problem DescriptionZty is a man that always f
2016-06-28 23:39:54 512
原创 HDU 2612 Find a way (BFS+dp)
Find a wayTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9689 Accepted Submission(s): 3160Problem DescriptionPass a year learnin
2016-06-28 01:10:28 948
原创 HDU 2563 统计问题 (DFS)
统计问题Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7734 Accepted Submission(s): 4543Problem Description在一无限大的二维平面中,我们做如下假设:1、
2016-06-27 00:40:50 582
原创 HDU 2553 N皇后问题 (回溯DFS)
N皇后问题Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 17312 Accepted Submission(s): 7859Problem Description在N*N的方格棋盘放置了N个皇后,使得它们不相互攻
2016-06-26 22:52:47 506
原创 HDU 2141 Can you find it? (二分)
Can you find it?Time Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/10000 K (Java/Others)Total Submission(s): 22628 Accepted Submission(s): 5724Problem DescriptionGive you th
2016-06-26 22:05:16 677
原创 高斯消元(模板)
高斯消元 :用来为线性方程组求解,求出矩阵的秩以及逆方阵的逆矩阵原理:先写出线性方程组的增广矩阵,然后利用初等变换把增广矩阵化为行阶梯矩阵 ,然后从尾到头回带。#includeusing namespace std;const int N=105;int x[N];int free_x[N];int free_num;int a[N][N];int equ,var;in
2016-06-24 23:22:31 639
原创 HDU 2102 A计划 (DFS)
A计划Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 16220 Accepted Submission(s): 4084Problem Description可怜的公主在一次次被魔王掳走一次次被骑士们救回来之
2016-06-24 23:02:58 454
原创 HDU 1983 Kaitou Kid - The Phantom Thief (2)(DFS+BFS)
Kaitou Kid - The Phantom Thief (2)Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1291 Accepted Submission(s): 463Problem Descript
2016-06-23 14:37:49 685
原创 ios::sync_with_stdio(false);(读入优化)
在竞赛中,遇到大数据时,往往读文件成了程序运行速度的瓶颈,需要更快的读取方式。相信几乎所有的C++学习者都在cin机器缓慢的速度上栽过跟头,于是从此以后发誓不用cin读数据。还有人说Pascal的read语句的速度是C/C++中scanf比不上的,C++选手只能干着急。难道C++真的低Pascal一等吗?答案是不言而喻的。一个进阶的方法是把数据一下子读进来,然后再转化字符串,这种方法传说中很不错,
2016-06-23 10:56:57 1116
原创 HDU 1728 逃离迷宫 (BFS)
逃离迷宫Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 22263 Accepted Submission(s): 5421Problem Description 给定一个m × n (m行, n列)的迷宫,
2016-06-23 10:43:04 1141
原创 HDU 1677 Nested Dolls (贪心)
Nested DollsTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3495 Accepted Submission(s): 1051Problem DescriptionDilworth is the w
2016-06-21 14:12:11 747
原创 汇编指令总结
一、常用指令二、算术运算指令 三、逻辑运算指令四、串指令 五、程序跳转指令------------------------------------------ 计算机寄存器分类简介: 32位CPU所含有的寄存器有:4个数据寄存器(EAX、EBX、ECX和EDX)2个变址和指针寄存器(ESI和EDI) 2个指针寄存器(ESP和EBP) 6个段寄存器(ES、CS
2016-06-19 15:47:56 2444 1
原创 来自全球的14个编码社区
1. [topcoder]2. HackerEarth 3. Coderbyte 4. Project Euler5. Daily Programmer 6. Codility Train7. SPOJ 8. CodeChef9. CodeEv
2016-06-14 14:01:00 971
原创 HDU 1671 Phone List (字典树)
Phone ListTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 16978 Accepted Submission(s): 5713Problem DescriptionGiven a list of ph
2016-06-12 19:00:07 477
原创 HDU 1597 find the nth digit (数学题)
find the nth digitTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11282 Accepted Submission(s): 3372Problem Description假设:S1 =
2016-06-12 18:23:57 726
原创 HDU 1548 A strange lift (BFS)
A strange liftTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20099 Accepted Submission(s): 7399Problem DescriptionThere is a str
2016-06-09 13:37:35 770
原创 HDU 1372 Knight Moves (BFS)
Knight MovesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9859 Accepted Submission(s): 5812Problem DescriptionA friend of you i
2016-06-09 12:32:41 1620
原创 HDU 1254 推箱子 (BFS套BFS)
推箱子Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7052 Accepted Submission(s): 2008Problem Description推箱子是一个很经典的游戏.今天我们来玩一个简单版本.
2016-06-09 10:57:47 931
原创 HDU 1253 胜利大逃亡( BFS )
胜利大逃亡Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 32301 Accepted Submission(s): 11971Problem DescriptionIgnatius被魔王抓走了,有一天魔王出差
2016-06-09 00:23:22 736
原创 HDU 1242 Rescue (BFS+优先队列)
RescueTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25076 Accepted Submission(s): 8883Problem DescriptionAngel was caught by the
2016-06-07 18:34:18 531
原创 怎么证明权重不相同的加权无向图的最小生成树是唯一的 (图论)
设G是所有边权均不相同的无向联通图。证明一:首先,易证图G中权值最小的边一定是最小生成树中的边。(否则最小生成树加上权值最小的边后构成一个环,去掉环中任意一条非此边则形成了另一个权值更小的生成树)。之后用反证法,假设G存在俩个不同的最小生成树①.设G的俩个不同的最小生成树T1 T2,设这俩颗生成树的并集为子图G1,G1为连通图且T1 T2显然为G1的最小生成树,由首
2016-06-07 12:56:23 8667
原创 求无向连通图的割点(图论)
1. 割点与连通度在无向连通图中,删除一个顶点v及其相连的边后,原图从一个连通分量变成了两个或多个连通分量,则称顶点v为割点,同时也称关节点(Articulation Point)。一个没有关节点的连通图称为重连通图(biconnected graph)。若在连通图上至少删去k 个顶点才能破坏图的连通性,则称此图的连通度为k。关节点和重连通图在实际中较多应用。显然,一个表示通信
2016-06-06 19:29:41 2133 2
原创 HDU 1241 Oil Deposits (基础DFS 或者 BFS)
Oil DepositsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 23051 Accepted Submission(s): 13296Problem DescriptionThe GeoSurvComp
2016-06-04 10:06:07 1236
原创 HDU 1240 Asteroids! (三维BFS)
Asteroids!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4704 Accepted Submission(s): 3030Problem DescriptionYou're in space.You w
2016-06-04 00:26:11 765 1
原创 HDU 1239 Calling Extraterrestrial Intelligence Again (素数)
Calling Extraterrestrial Intelligence AgainTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5340 Accepted Submission(s): 2820Problem D
2016-06-03 23:33:22 846
原创 全排列(next_permutation)
全排列。。。。#includeusing namespace std;int main(){ int n,p[10]; cin>>n; for(int i=0;i<n;i++) { cin>>p[i]; } sort(p,p+n); do { for(int i=0;i<n;i++) printf("%d ",p[i]); printf("\n");
2016-06-03 22:19:28 936
转载 程序员有趣的面试智力题
偶然间在网上看到几个原来没见过的面试智力题,有几个题目在国内流传相当广,什么n个人怎么分饼最公平,屋里的三个灯泡分别由哪个开关控制,三架飞机环游世界,用火柴和两根绳子测量45分钟之类的题目,火星得已经可以考古了,这里就不再说了。 1、考虑一个双人游戏。游戏在一个圆桌上进行。每个游戏者都有足够多的硬币。他们需要在桌子上轮流放置硬币,每次必需且只能放置一枚硬币,要求硬币完全置于桌面内(不能
2016-06-03 13:37:45 604
原创 HDU 1238 Substrings (最长公共子串+DFS)
SubstringsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9246 Accepted Submission(s): 4388Problem DescriptionYou are given a numbe
2016-06-03 13:04:16 1166
原创 完美正方形(DFS)
链接:https://www.zhihu.com/question/46321335/answer/101377372标题:完美正方形如果一些边长互不相同的正方形,可以恰好拼出一个更大的正方形,则称其为完美正方形。历史上,人们花了很久才找到了若干完美正方形。比如:如下边长的22个正方形2 3 4 6 7 8 12 13 14 15 16 17 18 21
2016-06-02 23:21:21 5270 2
原创 HDU 1181 变形课(DFS)
变形课Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 20691 Accepted Submission(s): 7469Problem Description呃......变形课上Harry碰到了一点小麻烦,因
2016-06-02 22:58:06 825 1
原创 Codeforces Round #355 (Div. 2) C. Vanya and Label (打表+字符串)
C. Vanya and Labeltime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputWhile walking down the street Vanya saw a
2016-06-02 20:49:38 844
原创 Codeforces Round #355 (Div. 2) B. Vanya and Food Processor(贪心)
B. Vanya and Food Processortime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVanya smashes potato in a vertic
2016-06-02 19:31:36 756
原创 Codeforces Round #355 (Div. 2) A. Vanya and Fence (水题)
A. Vanya and Fencetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVanya and his friends are walking along t
2016-06-02 19:02:15 868
原创 HDU 1180 诡异的楼梯 (BFS)
诡异的楼梯Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 12446 Accepted Submission(s): 3109Problem DescriptionHogwarts正式开学以后,Harry发现在H
2016-06-02 09:29:58 597
原创 堆 (数据结构)
堆是什么?是一种特殊的完全二叉树,就像下面这棵树一样。有没有发现这棵二叉树有一个特点,就是所有父结点都比子结点要小(注意:圆圈里面的数是值,圆圈上面的数是这个结点的编号,此规定仅适用于本节)。符合这样特点的完全二叉树我们称为最小堆。反之,如果所有父结点都比子结点要大,这样的完全二叉树称为最大堆。那这一特性究竟有什么用呢?假如有14个数分别是99、5、36、7、22、17、4
2016-06-01 13:27:19 3029 1
空空如也
VR(Virtual Realty)所要面对的挑战有哪些? VR在未来的发展将会如何?
2016-08-03
TA创建的收藏夹 TA关注的收藏夹
TA关注的人