给定两个整数n和k，构造一个n个正整数的数组，使得数组之和能被k整除，并且数组中的最大元素尽可能小。求这种情况下最小可能的最大元素。输入包含t个测试用例，每个用例包含n和k的值。输出每个测试用例中满足条件的最小最大元素。
E - 1000
You are given two integers n and k.
You should create an array of n positive integers a1,a2,…,an such that the sum (a1+a2+⋯+an) is divisible by k and maximum element in a is minimum possible.
What is the minimum possible maximum element in a?
Input
The first line contains a single integer t (1≤t≤1000) — the number of test cases.
The first and only line of each test case contains two integers n and k (1≤n≤109; 1≤k≤109).
Output
For each test case, print one integer — the minimum possible maximum element in array a such that the sum (a1+⋯+an) is divisible by k.
#include <iostream>
using namespace<
最低0.47元/天 解锁文章
扫一扫
367
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
