Informal unrated contest Codeforces Testing Round #3 is scheduled on December, 2 (Friday), 15:00 (UTC). We will test the latest innovations on Codeforces that they do not affect the contests. If not, we will fix it quickly :) So, this round will take place "as is", no warranty about it.

Problems for the round may be famous to someone, but I'll try to make them such not for any of you. It will be 3-4 problems, as quite simple and something more tricky. The contest duratiuon is 1 hour.

I say thanks in advance to all those who will come and test the system. Thank you!

MikeMirzayanov
Thank you for your hard work to prepare such a contest ,I will take it .

It was really funny contest with "hard" pretests :)

you should always increase minimum from (a,b) by maximum (a,b); if (a>b) b+=a;else a+=b;

and if (a >=n || b>=n) then print number of steps.that was my solution.

a b

1 1

1 2

3 2

3 5

8 5

answer is 4 . where is mistake ?

I must have 6 in result. It means you must have some pair like (6,x) or (x,6)

n(;When you need to calculate moves for position (m; n), you can get only (n; m - n) from it. For fast calculations use an algorithm similar to gcd :)