CF879A.Borya's Diagnosis

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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 $3$ and 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 $s_{i}$ -th day and works every $d_{i}$ day. So, he works on days $s_{i},s_{i}+d_{i},s_{i}+2d_{i},...$ .

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?

输入格式

First line contains an integer $n$ — number of doctors ( $1<=n<=1000$ ).

Next $n$ lines contain two numbers $s_{i}$ and $d_{i}$ ( $1<=s_{i},d_{i}<=1000$ ).

输出格式

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

输入输出样例

输入#1
```
3
2 2
1 2
2 2
```
输出#1
```
4
```
输入#2
```
2
10 1
6 5
```
输出#2
```
11
```

说明/提示

In the first sample case, Borya can visit all doctors on days $2$ , $3$ and $4$ .

In the second sample case, Borya can visit all doctors on days $10$ and $11$ .

首页