|
|
back to boardAll with WA #1 I got WA1 so I made some debug and discovered that test 1 has N = 136 (with lines like if (N == 136) while(1); The problem with code was that I was using char instead of unsigned char :) Check this test: 136 6 130 132 136 135 135 130 130 133 133 134 133 135 One good answer should be 1 3 130 133 135 Re: All with WA #1 Won't help Re: All with WA #1 4 5 1 2 2 3 3 4 4 1 2 4 My wa #1: 3 4 1 2 3 4 3 2 1 4 3 4 3 2 Each of these T tours has at least a road that does not belong to (T−1) other tours. Edited by author 16.03.2012 04:22 Edited by author 17.03.2012 02:34 Edited by author 17.03.2012 02:35 |
|
|