Rating changes for last rounds are temporarily rolled back. They will be returned soon. ×

help on a problem

Revision en1, by eighty, 2017-11-17 08:55:48

Hi Everyone.

Now I'm wondering about how many different ways of choosing K( K <= 1000 ; K <= N) numbers from 0 until N-1 such that the sum is divisible by N ( N <= 10^9).

Any advice?

Thank you.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English eighty 2017-11-17 08:55:48 219 Initial revision (published)