Codeforces Round #443 (Div. 2) A. Borya's Diagnosis 水模拟
来源:互联网 发布:男士皮衣品牌推荐 知乎 编辑:程序博客网 时间:2024/06/03 17:04
手动模拟
#include<bits/stdc++.h>using namespace std;int n;int main() { scanf("%d", &n); int t = 0; for(int i = 0; i < n; ++i) { int s, d; scanf("%d %d", &s, &d); if(t < s) { t = s;} else { int cnt = (t - s) / d; t = s + (cnt+1)*d; } } cout << t << endl; return 0;}
阅读全文
1 0
- 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 879 A Borya's Diagnosis
- A. Borya's Diagnosis
- code forces 443 A.Borya's Diagnosis(找规律)
- Codeforces Round #253 (Div. 1) A Borya and Hanabi
- Codeforces Round #253 (Div. 2)——Borya and Hanabi
- Codeforces Round #297 (Div. 2) A(模拟)
- Codeforces Round #340 (Div. 2)(A) 模拟
- Codeforces Round #343 (Div. 2) -A. Far Relative’s Birthday Cake(组合+模拟)
- Codeforces Round #346 (Div. 2) -A. Round House(模拟)
- Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2) A 模拟
- Codeforces Round #253 (Div. 2) C Borya and Hanabi (思维+bitmask)
- Codeforces Round #194 (Div. 2) / 334A Candy Bags(模拟)
- Codeforces Round #173 (Div. 2) / 282A Bit++(模拟)
- String(Java)重要
- 学习C程的上课方式
- 自定义View进度条
- LeetCode 之 Balanced Binary Tree
- 39. Combination Sum
- Codeforces Round #443 (Div. 2) A. Borya's Diagnosis 水模拟
- 【笔记】简单选择排序
- 报错:”Gradle error : Write access is allowed from event dispatch thread only in android studio
- MT 210 Notice to Receive通知接收
- TypeError: List of Tensors when single Tensor expected
- 扫描二维码
- MyAdapter
- activity的启动模式及应用场景
- MT 256 Advice of Non-Payment of Cheques非支付支票通知