I am pretty sure that the logic (find the pairs that are occuring the most) I have used is correct but I am getting a wrong answer. Can some tell me what's wrong with my code or provide a counter test case . Any help is appreciated.
# | User | Rating |
---|---|---|
1 | Radewoosh | 3759 |
2 | orzdevinwang | 3697 |
3 | jiangly | 3662 |
4 | Benq | 3644 |
5 | -0.5 | 3545 |
6 | ecnerwala | 3505 |
7 | tourist | 3486 |
8 | inaFSTream | 3478 |
9 | maroonrk | 3454 |
10 | Rebelz | 3415 |
# | User | Contrib. |
---|---|---|
1 | adamant | 173 |
2 | awoo | 168 |
3 | nor | 163 |
3 | SecondThread | 163 |
5 | BledDest | 162 |
5 | Um_nik | 162 |
7 | maroonrk | 161 |
8 | -is-this-fft- | 150 |
9 | Geothermal | 146 |
10 | TheScrasse | 143 |
I am pretty sure that the logic (find the pairs that are occuring the most) I have used is correct but I am getting a wrong answer. Can some tell me what's wrong with my code or provide a counter test case . Any help is appreciated.
Name |
---|
Why the downvotes??
or provide a counter test case
Why don't you just see it for youself (it is opened)? If you think
But it is too long
then in verdict you can seewrong answer 1st numbers differ - expected: '124', found: '128'
(1st number, and this input is clearly fully visible)Didn't read neither code nor problem, but countercase is accessible in your case.
Oh yes it is available. I thought the full testcase isn't available. Didn't scroll or swipe the testcase window. Thanks for the reply.