# C# – CodeForces – Borya’s Diagnosis

Every time, wherever I decide to take a look at CodeForces and to code & publish some of the easy problems, I am thinking that this is probably the last one, because it is too easy. However, I always find something interesting in those, thus they are worthy their time.

The problem of Borya  is probably a standard queuing problem – the catch is to find a way to interpret it, if possible with only one loop, the one reading the values:

It seems that Borya is seriously sick. He is going visit n doctors to find out the exact diagnosis. Each of the doctors needs the information about all previous visits, so Borya has to visit them in the prescribed order (i.e. Borya should first visit doctor 1, then doctor 2, then doctor 3and so on). Borya will get the information about his health from the last doctor.

Doctors have a strange working schedule. The doctor i goes to work on the si-th day and works every di day. So, he works on days si, si + di, si + 2di, ….

The doctor’s appointment takes quite a long time, so Borya can not see more than one doctor per day. What is the minimum time he needs to visit all doctors?

Input

First line contains an integer n — number of doctors (1 ≤ n ≤ 1000).

Next n lines contain two numbers si and di (1 ≤ si, di ≤ 1000).

Output

Output a single integer — the minimum day at which Borya can visit the last doctor.

I have managed to achieve something like this:

The idea is that we cannot be earlier than the firstDay (the condition in the if). And if we cannot manage to get for the first day, then we should try to get the earliest next possible day. Thus, the currentDay = firstDay + neededRepetitions * betweenDays. And really, this piece of code has taken some good amount of my time today.

This is the “Cheat-Library” that I use for CodeForces – https://github.com/Vitosh/C-Sharp-Stuff/blob/master/CodeForces/Prepared.cs.