hdu2717

hdu2717(裸bfs广搜)

CatchThatCowTimeLimit:5000/2000MS(Java/Others)MemoryLimit:32768/32768K(Java/Others)TotalSubmission(s):7304AcceptedSubmission(s):2308题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2717ProblemDescriptio
DoubleQ_·2020-08-14 08:39

HDU2717:Catch That Cow(BFS)

ProblemDescriptionFarmerJohnhasbeeninformedofthelocationofafugitivecowandwantstocatchherimmediately.HestartsatapointN(0≤N≤100,000)onanumberlineandthecowisatapointK(0≤K≤100,000)onthesamenumberline.Farm
键盘上的舞者·2020-07-07 13:47

Hdu2717 Catch That Cow(BFS) ---Java版

CatchThatCowTimeLimit:5000/2000MS(Java/Others)MemoryLimit:32768/32768K(Java/Others)TotalSubmission(s):13472AcceptedSubmission(s):4143ProblemDescriptionFarmerJohnhasbeeninformedofthelocationofafugitive
cjm727649353·2017-01-25 20:06

HDU2717 Catch That Cow (BFS)

DescriptionFarmerJohnhasbeeninformedofthelocationofafugitivecowandwantstocatchherimmediately.Hestartsatapoint N (0≤ N ≤100,000)onanumberlineandthecowisatapoint K (0≤ K ≤100,000)onthesamenumberline.Far
Hoaresky1998·2016-02-17 17:00

HDU 2717 Catch That Cow --- BFS

HDU2717题目大意：在x坐标上，农夫在n，牛在k。农夫每次可以移动到n-1,n+1,n*2的点。求最少到达k的步数。
TommyChok·2016-02-07 12:00

hdu 1548 A strange lift

pid=1548解题思路：和hdu2717很相似，也是按题意来，直接搜就行了。。。
piaocoder·2015-08-10 15:00

hdu2717 Catch That Cow BFS简单题

CatchThatCowTimeLimit:5000/2000MS(Java/Others)    MemoryLimit:32768/32768K(Java/Others)TotalSubmission(s):7994    AcceptedSubmission(s):2529ProblemDescriptionFarmerJohnhasbeeninformedofthelocationofaf
Lionel_D·2015-03-06 19:00

hdu1372 Knight Moves(BFS)

pid=1372）（其实hdu2717和这一题也是十分相似的：http://acm.hdu.edu.cn/showproblem.php?pid=2717）代码+
luomingjun12315·2015-01-23 19:00

HDU2717 Catch That Cow 【广搜】

CatchThatCowTimeLimit:5000/2000MS(Java/Others)    MemoryLimit:32768/32768K(Java/Others)TotalSubmission(s):7147    AcceptedSubmission(s):2254ProblemDescriptionFarmerJohnhasbeeninformedofthelocationofaf
u012846486·2014-08-09 17:00

ACM-BFS之Catch That Cow——hdu2717

CatchThatCow题目：http://acm.hdu.edu.cn/showproblem.php?pid=2717ProblemDescriptionFarmerJohnhasbeeninformedofthelocationofafugitivecowandwantstocatchherimmediately.HestartsatapointN(0≤N≤100,000)onanumber
lx417147512·2014-04-05 21:00

CSUST2013:专题训练[下半学年]

点击标题以打开比赛链接，点击题目以打开题解链接（灰色表示暂无此题解）一、搜索专题ProblemA   HDU1372   KnightMovesProblemB   HDU1728   逃离迷宫ProblemC   HDU2717
l383137093·2013-07-26 15:00

HDU2717 Catch That Cow

                                                        CatchThatCowTimeLimit:5000/2000MS(Java/Others)    MemoryLimit:32768/32768K(Java/Others)TotalSubmission(s):4945    AcceptedSubmission(s):1567Prob
lsh670660992·2013-07-18 11:00

HDU2717 Catch That Cow

CatchThatCowTimeLimit:5000/2000MS(Java/Others)MemoryLimit:32768/32768K(Java/Others)TotalSubmission(s):4945AcceptedSubmission(s):1567ProblemDescriptionFarmerJohnhasbeeninformedofthelocationofafugitivec
lsh670660992·2013-07-18 11:00

HDU2717:Catch That Cow(BFS)

ProblemDescriptionFarmerJohnhasbeeninformedofthelocationofafugitivecowandwantstocatchherimmediately.HestartsatapointN(0≤N≤100,000)onanumberlineandthecowisatapointK(0≤K≤100,000)onthesamenumberline.Farm
libin56842·2013-06-03 21:00

HDU2717:Catch That Cow

点击打开题目链接CatchThatCowTimeLimit:5000/2000MS(Java/Others)    MemoryLimit:32768/32768K(Java/Others)TotalSubmission(s):4293    AcceptedSubmission(s):1382ProblemDescriptionFarmerJohnhasbeeninformedoftheloca
l383137093·2013-04-21 21:00

hdu2717 简单广搜

step[],记录到目标位置的层数；#include #include #include #include #include #include #include #include usingnamespacestd; intN,K; intans; intvisit[200010]; intstep[200010]; voidbfs(){ queueq; q.push(N); inttmp; v
vegetable_bird_001·2013-03-25 17:00

hdu2717&&hdu1548-再练BFS

hdu2717题目中，n属于[1-100000],不能走出100000，开始的时候一直写可以多走出一半。在这错了两次。另外，题意是求最少步数，依然是BFS。这个题纯粹是练习。题意：给出起点，终点。
hss871838309·2012-04-09 13:00

【HDU2717】-Catch that cow

题目地址：http://acm.hdu.edu.cn/showproblem.php?pid=2717这点需要特别注意的是HDU特别坑爹，POJ上是单组数据，多点测试，HDU是一点测试，多组数据！所以在POJ上把while(cin>>N>>K)去掉也是AC的，简单的BFS#include #include #include #include #include //#defineDBG usingn
c0de4fun·2012-02-16 20:00
上一页 1 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他