A Julyed

Julyed

Time Limit: 2000MS Memory limit: 65536K

题目描述

    Julyed is preparing for her CET-6. She has N words to remember, but there is only M days left. If she can’t remember all these words, she won’t pass CET-6. If she can’t pass CET-6, she will be unhappy. But if she remember too many words in one day, she will be unhappy, too. If she is unhappy, tomriddly will be unhappy. So she will remember as little words as she can in one day. For the happiness of both tomriddly and Julyed, how many words at most will Julyed remember in one day?

输入

 Multiple test cases. The first line is an integer T (T <= 10000), indicating the number of test cases.

Each test case is a line with two integers N, M (1 <= N, M <= 200), indicating the number of words to remember and the number of days left.

输出

 One line per case, an integer indicates the answer.

示例输入

5

6 3

2 1

1 2

5 2

4 3

示例输出

2

2

1

3

2

题解： Julyed 要考六级了，有n 个单词要记，还剩m天， 没记住所有的单词她会不开心，每天记多了也会不开心，问每天最多记多少单词？

           

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
using namespace std;

int main(){
	int T, a, b, result;
	cin >> T;
	while(T--){
		result = 0; 
		cin >> a >> b;
		if (a % b == 0)
			result = a / b;
		else 
			result = a / b + 1;
		cout << result << endl; 
	} 
	return 0;
}