- 博客(61)
- 资源 (3)
- 收藏
- 关注
原创 poj1604Just the Facts(数论)
Just the FactsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8478 Accepted: 4483DescriptionThe expression N!, read as "N factorial," denotes the pr
2013-12-31 14:03:06 966
转载 poj1220(高精度模版,进制转换)
NUMBER BASE CONVERSIONTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4050 Accepted: 1810DescriptionWrite a program to convert numbers in one base to
2013-12-31 12:20:43 1851
原创 fzuProblem 1901 Period II
Problem 1901 Period IIAccept: 107 Submit: 297Time Limit: 1000 mSec Memory Limit : 32768 KB Problem DescriptionFor each prefix with length P of a given string S,ifS[i]=S[i+P] for
2013-12-30 22:59:37 976
转载 hdu2609(最小表示法+set)
How manyTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1113 Accepted Submission(s): 442Problem DescriptionGive you n ( n H
2013-12-30 19:56:57 898
转载 STL-set
转自:http://www.cnblogs.com/BeyondAnyTime/archive/2012/08/13/2636375.html1.关于setC++ STL 之所以得到广泛的赞誉,也被很多人使用,不只是提供了像vector, string, list等方便的容器,更重要的是STL封装了许多复杂的数据结构算法和大量常用数据结构操作。vector封装数组,list封装
2013-12-30 19:55:10 757
原创 hdu3374String Problem(kmp+最小表示+next数组理解)
String ProblemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1382 Accepted Submission(s): 618Problem DescriptionGive you a s
2013-12-30 17:34:48 841
原创 hdu2328CorporateIdentity(kmp)
Corporate IdentityTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 227 Accepted Submission(s): 109Problem DescriptionBeside ot
2013-12-30 15:39:24 1154
原创 hdu1238Substrings(kmp)
SubstringsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6551 Accepted Submission(s): 2926Problem DescriptionYou are given a
2013-12-30 15:37:15 881
原创 hdu 4300 Clairewd’s message
Clairewd’s messageTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2901 Accepted Submission(s): 1116Problem DescriptionClairew
2013-12-29 18:51:18 846
原创 hdu3336CountTheString
Count the stringTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3635 Accepted Submission(s): 1687Problem DescriptionIt is wel
2013-12-29 11:46:39 765
原创 hdu2594Simpsons’ Hidden Talents(kmp,next)
Simpsons’ Hidden TalentsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2203 Accepted Submission(s): 827Problem DescriptionHo
2013-12-29 10:45:40 857
原创 poj3080Blue Jeans(kmp + 枚举)
Blue JeansTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10776 Accepted: 4618DescriptionThe Genographic Project is a research partnership between IBM
2013-12-29 09:35:43 861
原创 poj2752Seek the Name, Seek the Fame(kmp简单变形,next数组)
Seek the Name, Seek the FameTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 10593 Accepted: 5140DescriptionThe little cat is so famous, that many coup
2013-12-29 00:16:28 919
原创 poj2406PowerString(kmp求循环节)
Power StringsTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 28940 Accepted: 12080DescriptionGiven two strings a and b we define a*b to be their conca
2013-12-28 23:03:57 779
原创 hust1010TheMinimumLength(kmp,循环节)
The Minimum LengthTime Limit: 1000MS Memory Limit: 131072KB 64bit IO Format: %lld & %llu[Submit] [Go Back] [Status] DescriptionThere is a string A. The l
2013-12-28 22:34:13 908
原创 hdu2203亲和串(kmp)
亲和串Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6610 Accepted Submission(s): 2988Problem Description人随着岁数的增长是越大越聪明还是越大越笨,这
2013-12-28 21:53:39 829
原创 hdu1358Period(kmp)
PeriodTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2314 Accepted Submission(s): 1143Problem DescriptionFor each prefix of
2013-12-28 21:26:19 832
转载 hdu3746Cyclic Nacklace
Cyclic NacklaceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2107 Accepted Submission(s): 932Problem DescriptionCC always b
2013-12-28 20:38:01 769
原创 hdu2087剪花布条(kmp)
剪花布条Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7036 Accepted Submission(s): 4678Problem Description一块花布条,里面有些图案,另有一块直接可用
2013-12-28 19:34:34 830
原创 hdu1686Oulipo(kmp模版)
OulipoTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3770 Accepted Submission(s): 1485Problem DescriptionThe French author G
2013-12-28 19:17:55 712
原创 hdu1711Number Sequence
Number SequenceTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9148 Accepted Submission(s): 4180Problem DescriptionGiven two
2013-12-28 18:52:54 648
转载 最短路专题【完结】
转自 陈国林:http://blog.csdn.net/chenguolinblog/article/details/16870163第一题 hdu 1317 XYZZY点击打开hdu 1317思路:1 题目的图是一个有向图,并且可能存在环。第一个点的能量值为100,边的权值利用能量大小,例如2点为-60,如果1->2那么value[1][2
2013-12-28 14:49:59 820
转载 KMP专题【完结】
转自:http://blog.csdn.net/chenguolinblog/article/details/16857765第一题 hdu 1711 Number Sequence点击打开hdu 1711思路:1 kmp是用来匹配字符串,只能够匹配单一的字符串2 kmp的算法的过程: 1:假设文本串的长度为n,模式串的长度为m;
2013-12-28 14:45:50 663
原创 poj1028Web Navigation(stack)
Web NavigationTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 27368 Accepted: 12255DescriptionStandard web browsers contain features to move backward an
2013-12-28 09:22:41 751
原创 hdu1710-BinaryTreeTraversals
Binary Tree TraversalsTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2808 Accepted Submission(s): 1245Problem DescriptionA b
2013-12-27 23:30:23 671
原创 poj1577FallingTree(二叉树,构建是难点)
Falling LeavesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 3771 Accepted: 2089Description Figure 1Figure 1 shows a graphical representation o
2013-12-27 21:25:20 794
原创 poj2245Lotto(dfs)
LottoTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6065 Accepted: 3857DescriptionIn the German Lotto you have to select 6 numbers from the set {1,2,
2013-12-27 18:51:47 699
原创 poj3984迷宫问题(bfs带路径)
迷宫问题Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6576 Accepted: 3844Description定义一个二维数组: int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0
2013-12-27 15:21:55 837
转载 二叉树——(先序序列+中序序列)=后序序列 poi2255
转自:http://blog.csdn.net/niushuai666/article/details/6413024已知二叉树的先序遍历序列和中序遍历序列,求后序遍历序列。 先递归构造二叉树,然后递归得到后序序列。 思路: 先序序列的第一个结点为要构造二叉树的根结点,在中序序列中查找二叉树的根结点,则中序列根结点左边为根结点的左子树的中
2013-12-27 14:28:58 849
原创 poj2157Maze(bfs,有门,需要先找钥匙)
MazeTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 3245 Accepted: 1022DescriptionAcm, a treasure-explorer, is exploring again. This time he is in a spe
2013-12-26 23:11:14 1256
原创 toj2194Mine(dfs)
2194. MineTime Limit: 1.0 Seconds Memory Limit: 65536KTotal Runs: 1734 Accepted Runs: 624You must be very familiar with the game "Minesweeper". It is played on an N*N grid, and
2013-12-26 20:49:49 752
原创 hdu1372Knight Moves(基本bfs)
Knight MovesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5341 Accepted Submission(s): 3262Problem DescriptionA friend of y
2013-12-26 18:56:28 748
原创 hdu3345War Chess(bfs,条件很多)
War ChessTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1609 Accepted Submission(s): 378Problem DescriptionWar chess is hh's
2013-12-26 18:53:01 849
原创 hdu1728逃离迷宫(bfs)
逃离迷宫Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12253 Accepted Submission(s): 2960Problem Description 给定一个m × n (m行, n列)
2013-12-26 18:50:15 688
原创 hdu1551Cable master(二分,精度)
Cable masterTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1488 Accepted Submission(s): 541Problem DescriptionInhabitants of
2013-12-26 18:36:47 839
转载 广度/宽度优先搜索(BFS)
raphealguo’blog:http://rapheal.sinaapp.com/2012/08/30/bfs/【算法入门】广度/宽度优先搜索(BFS)发表于 30 八月, 2012 由 raphealguo1.前言广度优先搜索(也称宽度优先搜索,缩写BFS,以下采用广度来描述)是连通图的一种遍历策略。因为它的思想是从一个顶点V0开始,辐射状
2013-12-26 00:22:04 3560
原创 hdu-3345-War Chess(bfd,条件众多)
War ChessTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1609 Accepted Submission(s): 378Problem DescriptionWar chess is hh's
2013-12-25 19:42:07 941
原创 toj-1959-OilDeposits(dfs)
1959. -Time Limit: 1.0 Seconds Memory Limit: 65536KTotal Runs: 1039 Accepted Runs: 666The GeoSurvComp geologic survey company is responsible for detecting underground oil deposit
2013-12-25 10:09:37 735
原创 poj-2251-Dungeon Master(bfs)
Dungeon MasterTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 14820 Accepted: 5752DescriptionYou are trapped in a 3D dungeon and need to find the quic
2013-12-24 23:57:20 747
转载 C++八进制十六进制
1、数的进制默认进制:默认状态下,数据按十进制输入输出。如果要求按八进制或十六进制输入输出,在cin或cout中必须指明相应的数据形式,oct为八进制,hex为十六进制,dec为十进制。int i, j, k, l;cout<<”Input i(oct), j(hex), k(hex), l(dec):”<<endl;cin>>oct>>i; //输入为八进制数cin
2013-12-19 21:18:18 1246
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人