2017年8月10日
POJ 2251 Dungeon Master（三维BFS）
摘要： You are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be filled with rock. 阅读全文
posted @ 2017-08-10 14:32 Zireael 阅读(144) 评论(0) 推荐(0) 编辑
Codeforces 675C Money Transfers （思维题）
摘要： There are n banks in the city where Vasya lives, they are located in a circle, such that any two banks are neighbouring if their indices differ by no 阅读全文
posted @ 2017-08-10 10:52 Zireael 阅读(191) 评论(0) 推荐(0) 编辑
HDU 1195 Open the Lock（BFS）
摘要： Now an emergent task for you is to open a password lock. The password is consisted of four digits. Each digit is numbered from 1 to 9. Each time, you 阅读全文
posted @ 2017-08-10 09:59 Zireael 阅读(186) 评论(0) 推荐(0) 编辑
2017年8月9日
HDU 1010 Tempter of the Bone（DFS+剪枝）
摘要： The doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie could f 阅读全文
posted @ 2017-08-09 16:40 Zireael 阅读(180) 评论(0) 推荐(0) 编辑
POJ 1426 Find The Multiple（DFS，BFS）
摘要： Given a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains only the digits 0 and 1. You m 阅读全文
posted @ 2017-08-09 10:35 Zireael 阅读(226) 评论(0) 推荐(0) 编辑
2017年8月8日
POJ 3216 Prime Path （BFS）
摘要： The ministers of the cabinet were quite upset by the message from the Chief of Security stating that they would all have to change the four-digit room 阅读全文
posted @ 2017-08-08 17:02 Zireael 阅读(162) 评论(0) 推荐(0) 编辑
POJ 3278 Catch that cow（BFS）
摘要： Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,000) on a numb 阅读全文
posted @ 2017-08-08 15:12 Zireael 阅读(139) 评论(0) 推荐(0) 编辑
UVa 572 Oil Deposits（简单DFS）
摘要： 题意： 给出油田的数量，八连通的“@”认为是一个油田。和POJ 2386 Lake Counting这个题几乎一样。 直接上代码： 阅读全文
posted @ 2017-08-08 11:09 Zireael 阅读(168) 评论(0) 推荐(0) 编辑
HDU 1016 Prime Ring Problem （DFS回溯）
摘要： A ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n into each circle separately, and the sum of numbers in two adjacen 阅读全文
posted @ 2017-08-08 10:27 Zireael 阅读(147) 评论(0) 推荐(0) 编辑
大数运算模板（高精度）
摘要： /*大数加法*/ # include # include # include void add(char* a,char* b,char* c) { int i,j,k,max,min,n,temp; char *s,*pmax,*pmin; max=strlen(a); min=strlen(b); if (max=0;i--,j--,k--) ... 阅读全文
posted @ 2017-08-08 09:26 Zireael 阅读(247) 评论(0) 推荐(0) 编辑