Nayem.'s blog

AtCoder Beginner contest 103c — Modulo Summation
By Nayem., history, 5 years ago, In English

I was trying to solve this problem

let, int moded = x % A here, the highest value of moded can be A-1;

but if we add some other numbers.. then.. (x % A1) + (x % A2) + .... + (x % An) then what can be the highest result if we add all the moded from Ai to An for this sequence?

for each Ai, if we take Ai-1, then the result will be maximum, but will there always exist an x if we were to get this maximum result?

  • Vote: I like it
  • 0
  • Vote: I do not like it

Comments Comments (1)
| Write comment?
»
5 years ago, # |
  Vote: I like it 0 Vote: I do not like it

There always exists such $$$m$$$.
Copy pasting from editorial.
Let

Unable to parse markup [type=CF_MATHJAX]


Then $$$m-1$$$ is the required $$$x$$$.
→ Reply