A. Borya's Diagnosis
来源:互联网 发布:事件驱动模型 php 编辑:程序博客网 时间:2024/05/27 21:02
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?
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 a single integer — the minimum day at which Borya can visit the last doctor.
32 21 22 2
4
210 16 5
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.
解题说明:此题是一道模拟题,按照题目意思需要见到所有的医生,其实就是求一个最大值,直接模拟即可。
#include<cstdio>#include<iostream>#include<string>#include<cstring>#include<cmath>using namespace std;int main(){int a, b;int n, t = 0, i;scanf("%d", &n);for (i = 0; i<n; i++){scanf("%d %d", &a, &b);if (t < a){t = a;}else{while (t >= a){a += b;}t = a;}}printf("%d\n", t);return 0;}
- A. Borya's Diagnosis
- Codeforces 879 A Borya's Diagnosis
- code forces 443 A.Borya's Diagnosis(找规律)
- Codeforces Round #443 (Div. 2) A. Borya's Diagnosis
- Codeforces Round #443 (Div. 2) A. Borya's Diagnosis
- Codeforces Round #443 (Div. 2)A. Borya's Diagnosis
- Codeforces Round #443 (Div. 2) A. Borya's Diagnosis(水水的模拟)
- Codeforces Round #443 (Div. 2) A. Borya's Diagnosis 水模拟
- Codeforces 443A Borya and Hanabi(暴力)
- Codeforces 442A - Borya and Hanabi
- CodeForces 442A Borya and Hanabi
- Codeforces Round #253 (Div. 1) A Borya and Hanabi
- Codeforces#253 Div. 1 442A - Borya and Hanabi
- Borya and Hanabi - CF#253 (Div. 2)C (442A) 状压暴力枚举
- network diagnosis with nipping
- CAA Device Diagnosis Example
- BMW Diagnosis & Information System / GT1
- B/S、C/S、 A/S
- 移植u-boot-2012.04----支持DM9000网卡
- 进程间通讯——共享内存
- 2017腾讯LIVE开发者大会精彩回顾!
- MySQL总结(一)
- 11月面【三】
- A. Borya's Diagnosis
- 解决npm 的 shasum check failed for错误
- Android弹出式窗口PopuWindow的使用
- Java基础--3常量
- leetcode add two numbers
- 大数据算法课程笔记8a:page replacement algorithm
- MSP430单片机的ADC详解
- 菜鸟之路spring cloud 学习|第二篇 服务消费者
- 纯CSS3文章卡片UI设计效果