A pattern can be seen in the solution that the result will be equal to (n/2)*m . May be I am missing any mathematical concept behind this reason. Can anyone provide me the mathematical logic behind the solution? Why is this working?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | cry | 158 |
4 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
A pattern can be seen in the solution that the result will be equal to (n/2)*m . May be I am missing any mathematical concept behind this reason. Can anyone provide me the mathematical logic behind the solution? Why is this working?
Name |
---|
lets take an example for n=12 and m=3.
So 1,2,3,7,8,9 will have -ve sign and 4,5,6,10,11,12 will have positive sign
Now if you look carefully you can see that a n/2 pairs consisting of one +ve and one -ve numbers are formed such that their addition is equal to m
here,
4 — 1 = 3
5 — 2 = 3
6 — 3 = 3
10 — 7 = 3
11 — 8 = 3
12 — 9 = 3
Therefore n/2 pairs will be formed having sum of both numbers as m. Hence the answer is (n/2)*m
Why am i getting Runtime Error when using Fast IO but AC without that! WA AC