搜索
zhenggy_
爱生活,爱编程
展开
-
A - 棋盘问题
A - 棋盘问题Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1321Description在一个给定形状的棋盘(形状可能是不规则的)上面摆放棋子,棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中原创 2015-03-30 14:25:11 · 1097 阅读 · 0 评论 -
Meteor Shower 广搜
#include #include #include using namespace std;#define MAX 310#define Inf 0x7ffffffftypedef struct pot{ int x, y; int t;}pot;int dre[5][2]={ {0,0},{0,1},{0,-1},{1,0},{-1,0} };int t原创 2015-05-05 14:24:48 · 504 阅读 · 0 评论 -
福州大学第十二届程序设计竞赛 Problem G Escape
Problem G EscapeAccept: 57 Submit: 429Time Limit: 1000 mSec Memory Limit : 32768 KB Problem Description小明进入地下迷宫寻找宝藏,找到宝藏后却发生地震,迷宫各处产生岩浆,小明急忙向出口处逃跑。如果丢下宝藏,小明就能迅速离开迷宫,但小明并不想轻易放弃自己的辛苦原创 2015-05-04 16:17:43 · 760 阅读 · 0 评论 -
非常可乐
非常可乐Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1495Description大家一定觉的运动以后喝可乐是一件很惬意的事情,但是seeyou却不这么认为。因为每次当seeyou买了可乐以后,阿牛原创 2015-03-30 14:32:53 · 521 阅读 · 0 评论 -
Find a way
Find a wayTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 2612DescriptionPass a year learning in Hangzhou, yifenfei arrival h原创 2015-03-30 14:31:58 · 508 阅读 · 0 评论 -
Prime Path
Prime PathTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 3126DescriptionThe ministers of the cabinet were quite upset by the原创 2015-03-30 14:32:42 · 482 阅读 · 0 评论 -
B - Dungeon Master
B - Dungeon MasterTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 2251DescriptionYou are trapped in a 3D dungeon and need to原创 2015-03-30 14:26:54 · 630 阅读 · 0 评论 -
K - 迷宫问题
K - 迷宫问题Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 3984Description定义一个二维数组: int maze[5][5] = { 0, 1, 0, 0, 0原创 2015-03-30 14:28:14 · 564 阅读 · 0 评论 -
Find The Multiple
Find The MultipleTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1426DescriptionGiven a positive integer n, write a program t原创 2015-03-30 14:29:28 · 503 阅读 · 0 评论 -
Catch That Cow
Catch That CowTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 52614 Accepted: 16499DescriptionFarmer John has been informed of the location of a fugitive cow and wants to catch h原创 2015-03-30 14:28:00 · 416 阅读 · 0 评论 -
poj 3297 Fliptile 深搜
#include using namespace std;#define MAX 16int a[MAX], b[MAX], now[MAX], minb[MAX];int m, n;int dis[5][2]={ {0,1},{0,-1},{-1,0},{1,0},{0,0} };void copy(int a[], int b[]){ for(int i=0; i<20;原创 2015-05-05 14:22:25 · 660 阅读 · 0 评论