System.out.println("Result: " + 2 + 3 + 5);System.out.println("Result: " + 2 + 3 * 5);
Anonymous Quiz
16%
A. Result: 10Result: 30
26%
B. Result: 10Result: 25
23%
C. Result: 235Result: 215
6%
D. Result: 215Result: 215
29%
E. Compilation fails
Anyone who wants to grow this channel can take authority as I can't do further but we have already shared lot of contents here that you can even clear Apple interviews too
message @stockkida
*Terms and conditions applied
message @stockkida
*Terms and conditions applied
Chef received NN candies on his birthday. He wants to put these candies in some bags. A bag has KK pockets and each pocket can hold at most MM candies. Find the minimum number of bags Chef needs so that he can put every candy into a bag.
Input Format
The first line of input will contain a single integer TT, denoting the number of test cases.
Each test case consists of a single line containing three space-separated integers N, K, MN,K,M.
Output Format
For each test case, print the minimum number of bags Chef needs so that he can put all the candies in one of the bags.
Constraints
1 \leq T \leq 10001≤T≤1000
1 \leq N, K, M \leq 1001≤N,K,M≤100
Sample 1:
Input
Output
4
6 2 3
3 1 2
8 4 1
25 4 2
Output
1
2
2
4
Input Format
The first line of input will contain a single integer TT, denoting the number of test cases.
Each test case consists of a single line containing three space-separated integers N, K, MN,K,M.
Output Format
For each test case, print the minimum number of bags Chef needs so that he can put all the candies in one of the bags.
Constraints
1 \leq T \leq 10001≤T≤1000
1 \leq N, K, M \leq 1001≤N,K,M≤100
Sample 1:
Input
Output
4
6 2 3
3 1 2
8 4 1
25 4 2
Output
1
2
2
4
Java Hyd Team
https://drive.google.com/drive/folders/18nDPHCC2nckQXzJG_3hlee0ksbF4tovG
Please download selectively from this 1gb file.