[Solution] Chopping Carrots (Easy Version) Codeforces Solution

D1. Chopping Carrots (Easy Version)

time limit per test

4 seconds

memory limit per test

64 megabytes

input

standard input

output

standard output

This is the easy version of the problem. The only difference between the versions is the constraints on n, k, ai, and the sum of n over all test cases. You can make hacks only if both versions of the problem are solved.

Note the unusual memory limit.

You are given an array of integers a1,a2,…,an of length n, and an integer k.

The cost of an array of integers p1,p2,…,pn of length n is max

Here, \lfloor \frac{x}{y} \rfloor denotes the integer part of the division of x by y. Find the minimum cost

Solution Click Below:-  👉CLICK HERE

 of an array p such that 1 \le p_i \le k for all 1 \le i \le n.

Input

The first line contains a single integer t (1 \le t \le 100) — the number of test cases.

The first line of each test case contains two integers n and k (1 \le n, k \le 3000).

Another String Minimization Problem Codeforces Solution

Making Towers Codeforces Solution

Qpwoeirut And The City Codeforces Solution

Chopping Carrots (Easy Version) Codeforces Solution

Chopping Carrots (Hard Version) Codeforces Solution

The second line contains n integers a_1, a_2, \ldots, a_n (1 \le a_1 \le a_2 \le \ldots \le a_n \le 3000).

It is guaranteed that the sum of n over all test cases does not exceed 3000.

Output

For each test case, print a single integer — the minimum possible cost of an array p satisfying the condition above.