Codeforces Round #443 (Div. 2) 【A、B、C、D】

Codeforces Round #443 (Div. 2)

 

codeforces 879 A. Borya's Diagnosis【水题】

 1 #include<cstdio>
 2 #include<cstring>
 3 #include<algorithm>
 4 using namespace std;
 5 int main(){
 6     int n, t = 0, s, d;
 7     scanf("%d", &n);
 8     while(n--) {
 9         scanf("%d%d", &s, &d);
10         while(s <= t) {s += d;}
11         t = s;
12     }
13     printf("%d\n", t);
14     return 0;
15 }

78ms