|
|
вернуться в форумI have WA for Test #11.
Any test case ? 2 40
1 2 3 6 4 5 9 12 7 8 11 15 18 10 13 19 14 21 24 25 17 16 20 22 30 26 32 38 23 27 28 31 35 29 34 36 39 33 37 40
10 40
1 2 3 4 8 7 5 9 15 6 13 12 10 19 11 14 22 30 18 25 26 21 28 17 29 16 20 40 24 36 23 27 32 31 33 35 37 34 39 38 Both from them are passed, but I still have WA 11. Please, give another test cases. Fibonachi digits grow very fast. Even UInt64 is incefficient for fibonachi digit with number 93. Test 11 beats unstable sorting algorithms like QuickSort. Test "10 40" shows it too. |
|
|
