|
|
I know how to construct larger cases when knowing solution n<=11&&m<=11,but brute_force for small tests is tooooooooo slow.. Ac!!!! 0.031 s. How to solve it? What idea? my be need to delete this link :)) N and M both are odd numbers --> No solution ??? Try to find out it yourself. It shouldn't be hard. I was right! for n and m are odd -> no solution!
But, solution is backtrasing or not? |
|
|
