Search
关注
分享
扫一扫
文章平均质量分 80
SixDayy
渣校的渣渣
展开
-
杭电1016————素数环之DFS
Prime Ring ProblemTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14061 Accepted Submission(s): 6390Problem DescriptionA ring原创 2014-07-28 16:40:57 · 409 阅读 · 0 评论 -
杭电1372————搜索之初讲广度优先搜索
Knight MovesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6571 Accepted Submission(s): 3961Problem DescriptionA friend of y原创 2014-08-01 09:31:11 · 557 阅读 · 0 评论 -
杭电1239————缩小数据范围的暴力搜索（水题）
Calling Extraterrestrial Intelligence AgainTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4447 Accepted Submission(s): 2319Probl原创 2014-08-01 15:23:34 · 378 阅读 · 0 评论 -
杭电1072————搜索之广搜+结构体的前驱应用
NightmareTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7058 Accepted Submission(s): 3390Problem DescriptionIgnatius had a n原创 2014-07-30 20:48:27 · 360 阅读 · 0 评论 -
杭电1242————搜索之优先队列
RescueTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15823 Accepted Submission(s): 5731Problem DescriptionAngel was caught b原创 2014-07-28 21:25:47 · 416 阅读 · 0 评论 -
杭电1045————DFS简单难度题目
Fire NetTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6292 Accepted Submission(s): 3558Problem DescriptionSuppose that we h原创 2014-08-05 10:48:47 · 440 阅读 · 0 评论 -
杭电1026————搜索之优先队列
Ignatius and the Princess ITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11828 Accepted Submission(s): 3705Special JudgeProblem原创 2014-07-29 15:10:02 · 441 阅读 · 0 评论 -
杭电1015————DFS+字符串
SafecrackerTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8377 Accepted Submission(s): 4226Problem Description=== Op tech br原创 2014-08-03 16:25:13 · 323 阅读 · 0 评论 -
杭电1238————简单枚举
SubstringsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7186 Accepted Submission(s): 3242Problem DescriptionYou are given a原创 2014-08-02 20:00:09 · 442 阅读 · 0 评论 -
杭电1728————一直WA的BFS（有思维惯性带来的陷阱）
#include #include #include #define maxn 105using namespace std;/*到达的时候转弯数小于maxturn就行*/ struct point{int x,y;int turn;/*转弯个数*/ int dir;};int dir[4][2] = {{0,1},{-1,0},{1,0},{0,-1}原创 2014-08-08 11:17:56 · 541 阅读 · 0 评论