Hi guys, Today i sees a apparently easy math problem (but i can't solved):

Two persons walk simutanious around two circles with size A and B with positions [1,2,3,...,A] and [1,2,3,...,B].

Then follow Q querys. Each query give two positions x and y, and asks the number of step for person A arrive on position x and person B arrive on position y (on same time) using O(1).

Thanks guys, i'm very novice in math problems.

Hi guys, i'm trying solve this problem.

The resume is: given a set of points, print the smallest circle that cover all points.

I'm searching, but only find aproximate algorithms.

Somebody know a algoritm without aproximate?

Thanks for advice.