# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | cry | 161 |
2 | awoo | 160 |
2 | maomao90 | 160 |
4 | atcoder_official | 157 |
5 | -is-this-fft- | 156 |
6 | nor | 155 |
7 | adamant | 153 |
8 | maroonrk | 152 |
8 | Um_nik | 152 |
10 | djm03178 | 146 |
Name |
---|
why we ignored ac and bc in ab+ac+bc<=n ??
We do not ignore those terms. We just know that it is necessary for ab to be <= n (not sufficient. Therefore, our second loop for b goes to n / a, not n.
ok, thank you
Why is this downvoted? I thought explanations were pretty good
Great Explanations!
I still don't understand why for F we minus the total sum by the number of exceeding operations time x. Because what if before we transform a value to become smaller than x, that value is bigger than x and not necessarily equal to it? Can anyone explain further? Sorry for bad English.
Why do we add the value computed for c to count in problem D?
The E question is almost exactly the same as the "skill upgrade" of the 13th Provincial Competition of the 2022 Blue Bridge Cup, and I have done this question before and memorized the answers in the solution, but I said that I checked the duplicate with other codes, but I don't know those people at all