Sponsored
Use these hints if you're stuck. Try solving on your own first.
11111 = 1111 * 10 + 1 We only need to store remainders modulo K.
If we never get a remainder of 0, why would that happen, and how would we know that?
Solve with full IDE support and test cases
