ENG
RUS
Timus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
Discussion of Problem
1596
. Knight Mare
Shen Yang
is there any effient algo to solve n<=11,m<=11??
[1] // Problem
1596. Knight Mare
27 Oct 2017 06:16
I know how to construct larger cases when knowing solution n<=11&&m<=11,but brute_force for small tests is tooooooooo slow..
Shen Yang
Re: is there any effient algo to solve n<=11,m<=11??
// Problem
1596. Knight Mare
28 Oct 2017 12:27
AC....
xurshid_n
Urra
[3] // Problem
1596. Knight Mare
24 Jul 2012 17:38
Ac!!!! 0.031 s.
Neofit
Re: Urra
// Problem
1596. Knight Mare
25 Jul 2012 09:42
How to solve it? What idea?
Neofit
Re: Urra
[1] // Problem
1596. Knight Mare
25 Jul 2012 10:19
http://www.mimuw.edu.pl/~rytter/TEACHING/ALCOMB/efficient%20algorithm%20recursion%20knight.pdf
Edited by author 25.07.2012 10:19
xurshid_n
Re: Urra
// Problem
1596. Knight Mare
16 Aug 2012 12:40
my be need to delete this link :))
xurshid_n
When No Solution??
[2] // Problem
1596. Knight Mare
11 Mar 2012 22:45
N and M both are odd numbers > No solution ???
Zurg
Re: When No Solution??
[1] // Problem
1596. Knight Mare
18 Mar 2012 17:43
Try to find out it yourself. It shouldn't be hard.
xurshid_n
Re: When No Solution??
// Problem
1596. Knight Mare
23 Jul 2012 18:02
I was right! for n and m are odd > no solution!
But, solution is backtrasing or not?
New topic
Style:
flat

tree

nested
Thread Order:
bubble

fixed
© 2000–2019
Timus Online Judge Team
. All rights reserved.