- 博客(8)
- 收藏
- 关注
RSS订阅原创 HDOJ 1040 As Easy As A+B 快排
Problem DescriptionThese days, I am thinking about a question, how can I get a problem as easy as A+B? It is fairly difficulty to do such a thing. Of course, I got it after many waking nights.Give
2012-03-29 20:41:48
842
原创 HDOJ 1072 Nightmare (bfs)
Problem DescriptionIgnatius had a nightmare last night. He found himself in a labyrinth with a time bomb on him. The labyrinth has an exit, Ignatius should get out of the labyrinth before the bomb
2012-03-24 20:08:13
661
原创 HDOJ 2181 哈密顿绕行世界问题 (dfs)
一个规则的实心十二面体，它的 20个顶点标出世界著名的20个城市，你从一个城市出发经过每个城市刚好一次后回到出发的城市。 Input前20行的第i行有3个数,表示与第i个城市相邻的3个城市.第20行以后每行有1个数m,m=1.m=0退出. Output输出从第m个城市出发经过每个城市1次又回到m的所有路线,如有多条路线,按字典序输出,每行1条路线.每行首先输出是第几条路线.然后个一个: 后列出经过
2012-03-24 10:59:15
1205
原创 HDOJ 1728 逃离迷宫 (bfs)
Problem Description 给定一个m × n (m行, n列)的迷宫，迷宫中有两个位置，gloria想从迷宫的一个位置走到另外一个位置，当然迷宫中有些地方是空地，gloria可以穿越，有些地方是障碍，她必须绕行，从迷宫的一个位置，只能走到与它相邻的4个位置中,当然在行走过程中，gloria不能走到迷宫外面去。令人头痛的是，gloria是个没什么方向感的人，因此，她在行走过程中，
2012-03-22 13:08:22
539
原创 hdoj 1035 Robot Motion
题目链接：～(￣▽￣～)(～￣▽￣)～code：#include int count1 = 0, count2 = 0, m = 0, n = 0;typedef struct{ char ch; int used, count;}node;node map[12][12];void mo(int x, int y){ if(xm || yn)//找到出口；
2012-03-20 19:43:20
426
原创 HDOJ 1548 A strange lift （bfs）
Problem DescriptionThere is a strange lift.The lift can stop can at every floor as you want, and there is a number Ki(0 <= Ki <= N) on every floor.The lift have just two buttons: up and down.When yo
2012-03-20 15:34:18
558
原创 HDOJ 1213 How Many Tables
Problem DescriptionToday is Ignatius' birthday. He invites a lot of friends. Now it's dinner time. Ignatius wants to know how many tables he needs at least. You have to notice that not all the frien
2012-03-10 11:04:41
613
原创 POJ 1611 The Suspects
The SuspectsTime Limit: 1000MS Memory Limit: 20000KTotal Submissions: 13789 Accepted: 6543DescriptionSevere acute respiratory syndrome (SARS), an atypical pneumonia
2012-03-10 10:41:40
436
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人