Hadi & Math
What is the Sum of the numbers from 1 ... n
hint
Knowing the actual sum and the excepted sum, how to find the missing sum?
solution
tip
Michael And The Easy A
hint 1
hint 2
hint 3
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 150 |
Hadi & Math
What is the Sum of the numbers from 1 ... n
excepted_sum = n*(n+1)/2
Knowing the actual sum and the excepted sum, how to find the missing sum?
answer = n*(n+1)/2 — sum(Array)
For c++ users use long long, and for java users use long to avoid overflow
Michael And The Easy A
What is the maximum sum we can obtain if we have even number of negative integers?
What about odd number of negative integers?
What is the maximum number of negative integers we may have in an optimal sequence?
Name |
---|
Auto comment: topic has been updated by Adam_Jardali (previous revision, new revision, compare).
Auto comment: topic has been updated by Adam_Jardali (previous revision, new revision, compare).
Auto comment: topic has been updated by Adam_Jardali (previous revision, new revision, compare).