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 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
2 | adamant | 164 |
4 | TheScrasse | 159 |
4 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
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