This is the problem. Here we can't change child order. But how you would solve this problem if we could change child order? Thanks.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 166 |
2 | maomao90 | 163 |
2 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | nor | 153 |
9 | Dominater069 | 153 |
This is the problem. Here we can't change child order. But how you would solve this problem if we could change child order? Thanks.
I'm trying to solve this problem in csacademy. I solved it in C++ but translating the same code in python 3 gets "Non zero exit code = 1" verdict. What does it mean? I have experienced this verdict first time & got no explanation anywhere C++_code: Python_3_code:
upd: got it. it was caused due to "by default recursion limit in python". so a simple line "sys.setrecursionlimit(100000)" solve the problem.
problem: https://toph.co/p/problem-number-nine-and-three-quarter solution: http://ideone.com/RYkF3m
though I solved it in two different ways. but I can't understand this solution. I tried but couldn't make a communication with the actual writer of the solution. Please help me.
Name |
---|