← Questions
Most distinct values of B[i] mod A[i]
0
I was asked this
No reports yet. Sign in to say where you were asked it.
You get an array A of n positive integers. You choose any array B of length n, and compute B[i] % A[i] for every i. Return the largest possible number of distinct values among these remainders.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding