given an n-element ring shaped array and a step of length i, how do you find a number of different cycles needed to visit every element
ive been thinking about it for a while, looking at data but cant really come up with anything
ive been thinking about it for a while, looking at data but cant really come up with anything
