Borya's Diagnosis(模拟)

11人阅读 评论(0) 收藏 举报
分类:

Borya's Diagnosis

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 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.

Examples
Input
3
2 2
1 2
2 2
Output
4
Input
2
10 1
6 5
Output
11
Note

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.

思路:模拟,因为题目要求只能按照所给的医生顺序进行就医,所以就按照开始工作的天数和间隔天数进行模拟

如果当前医生开始工作的日期大于需要天数d ,d直接等于医生的工作日期,相当于等到了那一天,如果

医生的开始工作日期小于当前天数说明我们错过了,只能再等他上班,每次隔y天,每次加y知道大于了我们消耗的天数d

直接就让d等于它

code:

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int main(){
    int n,x,y,d = 0;
    scanf("%d",&n);
    for(int i = 0; i < n; i++){
       scanf("%d%d",&x,&y);
       if(d < x) d = x;
       else{
         while(x <= d) x += y;
         d = x;
       }
    }
    printf("%d\n",d);
    return 0;
}


查看评论

Codeforces 879 A Borya's Diagnosis

题目链接 题目大意:给出n个医生的工作时间,问按顺序拜访所有医生最少要用多少天。 医生的工作时间符合等差数列。 题目分析:一开始以为不按顺序拜访卡了很久。 如果是按顺序拜访的话利用等差数列公式...
  • xiuya19
  • xiuya19
  • 2017-10-27 13:11:13
  • 172

Codeforces Round #443 (Div. 2) A. Borya's Diagnosis(水水的模拟)

It seems that Borya is seriously sick. He is going visit n doctors to find out the exact diagnosis. ...
  • qq_37497322
  • qq_37497322
  • 2017-10-27 08:49:05
  • 398

Codeforces Round #443 (Div.2) - A - Borya's Diagnosis

A. Borya's Diagnosis time limit per test 2 seconds memory limit per test 256 megabytes ...
  • w326159487
  • w326159487
  • 2017-10-27 19:23:48
  • 170

code forces 443 A.Borya's Diagnosis(找规律)

It seems that Borya is seriously sick. He is going visit n doctors to find out the exact diagnosis. ...
  • qq_38538733
  • qq_38538733
  • 2017-10-27 11:11:11
  • 291

A. Borya's Diagnosis

time limit per test 2 seconds memory limit per test 256 megabytes input standard input ...
  • jj12345jj198999
  • jj12345jj198999
  • 2017-11-06 22:22:23
  • 222

Codeforces Round #443 A. Borya's Diagnosis

题目链接:http://codeforces.com/contest/879/problem/A 题意:n个医生,要求依次序访问每个医生,每个医生第si,si+di si+2di....si+n...
  • qq_29538137
  • qq_29538137
  • 2018-01-28 09:24:24
  • 10

test eewayinfo.cap

cm>  send 00a404000f4150504c45544545574159494e464f => 00 A4 04 00 0F 41 50 50 4C 45 54 45 45 57 41 5...
  • fzhptr
  • fzhptr
  • 2010-12-01 17:38:00
  • 336

Codeforces Round #443 (Div. 2)A. Borya's Diagnosis

A. Borya's Diagnosis time limit per test 2 seconds memory limit per test 256 megabytes ...
  • u012181348
  • u012181348
  • 2017-10-31 21:20:31
  • 118

Codeforces Round #443 (Div. 2) A. Borya's Diagnosis

病人去看医生,医生的上班规律是,第s天上班之后每d天上一次班,问最后一次看医生是第几天。病人看医生也有要求,要求看医生需要按顺序看,也就是,看完第一个医生才能看下一个医生...
  • AC__GO
  • AC__GO
  • 2017-10-27 13:15:56
  • 102

Fault Diagnosis Based on Deep Learning

  • 2017年03月07日 08:48
  • 416KB
  • 下载
    个人资料
    持之以恒
    等级:
    访问量: 3万+
    积分: 4124
    排名: 9146
    文章存档
    最新评论