CF-476-D2-C Dreamoon and Sums. Question about proving in the editorial

Revision en1, by Bekh, 2018-08-13 21:33:33

http://mirror.codeforces.com/blog/entry/14256 in D2-C.

I understood that for each x there is exactly 1 k. But how can I prove that for each K in [1, a] there always exists nice numbers for all remainders [1, b-1]? For instance if a = 3, b = 5. How to be so sure that for Each k {1, 2, 3} there will always be nice numbers with remainder values [1, b-1]

Tags math, summations, algorithm proving

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English Bekh 2018-08-13 21:33:33 420 Initial revision (published)