
-------kuangbin搜索----
文章平均质量分 54
chen_zan_yu
一生所爱
展开
-
N - Find a way HDU - 2612 (18,9,15)
Pass a year learning in Hangzhou, yifenfei arrival hometown Ningbo at finally. Leave Ningbo one year, yifenfei have many people to meet. Especially a good friend Merceki. Yifenfei’s home is at the co...原创 2018-09-15 20:21:26 · 136 阅读 · 0 评论 -
H - Guilty Prince
Once there was a king named Akbar. He had a son named Shahjahan. For an unforgivable reason the king wanted him to leave the kingdom. Since he loved his son he decided his son would be banished in a n...原创 2018-09-18 07:33:14 · 366 阅读 · 0 评论 -
D - Fliptile(DFS)(18.9.13)
D - FliptileTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionFarmer John knows that an intellectually satisfied cow is a happy cow who wi...原创 2018-09-13 20:34:36 · 110 阅读 · 0 评论 -
E - Find The Multiple(DFS)(18.9.13)
E - Find The MultipleTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionGiven a positive integer n, write a program to find out a nonzero m...原创 2018-09-13 21:02:12 · 162 阅读 · 1 评论 -
F - Prime Path (DFS)(18.9.13)
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 numbers on their offices. — It is a matter of se...原创 2018-09-13 21:11:50 · 341 阅读 · 1 评论 -
A - 棋盘问题 (DAF)
在一个给定形状的棋盘(形状可能是不规则的)上面摆放棋子,棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列,请编程求解对于给定形状和大小的棋盘,摆放k个棋子的所有可行的摆放方案C。Input输入含有多组测试数据。 每组数据的第一行是两个正整数,n k,用一个空格隔开,表示了将在一个n*n的矩阵内描述棋盘,以及摆放棋子的数目。 n <= 8 , k <= n...原创 2018-09-13 21:14:33 · 222 阅读 · 0 评论 -
B - Dungeon Master (DFS)
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. It takes one minute to move one unit north, south...原创 2018-09-13 21:17:15 · 295 阅读 · 1 评论 -
C - Catch That Cow(DFS)
C - Catch That CowTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionFarmer John has been informed of the location of a fugitive cow and wa...原创 2018-09-13 21:20:20 · 666 阅读 · 0 评论 -
K - 迷宫问题(DFS)(18.9.13)
int maze[5][5] = {0, 1, 0, 0, 0,0, 1, 0, 1, 0,0, 0, 0, 0, 0,0, 1, 1, 1, 0,0, 0, 0, 1, 0,1 2 3 4 5 6 7 8 9};它表示一个迷宫,其中的1表示墙壁,0表示可以走的路,只能横着走或竖着走,不能斜着走,要求编程序找出从左上角到右下角的最短路线。 Inp...原创 2018-09-13 21:26:05 · 227 阅读 · 0 评论