(Relax ST1.18)POJ 3619 Speed Reading
2013-11-28 22:51
387 查看
题意:整本书N页,k组,s页/分钟,一次持续t分钟,需休息r分钟
/* * POJ_3619_1.cpp * * Created on: 2013年11月26日 * Author: Administrator */ #include <iostream> #include <cstdio> using namespace std; int main() { int n, k; while (scanf("%d%d", &n, &k) != EOF) { while (k--) { int s, t, r; scanf("%d%d%d", &s, &t, &r); int page = 0, time = 0, rtime = 0; while (true) { page += s; time++; rtime++; if (page >= n) { break; } if (rtime % t == 0) {//***每t分钟休息r分钟 time += r; } } printf("%d\n", time); } } return 0; }
相关文章推荐
- (Relax ST1.29)POJ 3672 Long Distance Racing(来回路问题..)
- (Relax ST1.13)POJ 2780 Linearity(给出若干个点,求最多有多少个点共线,不能使用n^3算法)
- (Relax ST1.17)POJ 3618 Exploration(求在t时间内能去n个景点中的几个)
- poj 3619 Speed Reading
- poj 3619 Speed Reading
- POJ 3619 Speed Reading(水~)
- (Relax ST1.11)POJ 2159 Ancient Cipher(判断一个字符串是否是另外一个字符串的原串)
- (Relax ST1.3)POJ 1045 Bode Plot
- (Relax ST1.4)POJ 1056 IMMEDIATE DECODABILITY(判断一个字符串是否是另外一个字符串的前缀)
- POJ 3619 Speed Reading(简单题)
- (Relax ST1.22)POJ 3664 Election Time(两次排序的巧妙应用)
- (Relax ST1.10)POJ 2027 No Brainer()
- poj 3619 Speed Reading
- (Relax ST1.16)POJ 3589 Number-guessing Game(求连个字符串中相同的字符有多少个和同位置&&同字符的字符个数有多少个)
- (Relax ST1.15)POJ 3175 Finding Bovine Roots
- (Relax ST1.20)POJ 3663 Costume Party(贪心+剪枝)
- (Relax ST1.29)POJ 3749 破译密码(将一个字符串按照一定的规则转化成另外一个字符串)
- (Relax ST1.19)POJ 3627 Bookshelf(贪心)
- (Relax ST1.8)POJ 1517 u Calculate e(求各阶乘累加之和)
- POJ 3619 Speed Reading(简单题)