Balls and Boxes Codechef Solution Java (BALLBOX)

Problem

• You have NN balls and KK boxes. You want to divide the NN balls into KK boxes such that:
• Each box contains  ≥1 balls.
• No two boxes contain the same number of balls.
• Determine if it is possible to do so.

Input Format

• The first line contains a single integer TT — the number of test cases. Then the test cases follow.
• The first and only line of each test case contains two space-separated integers NN and KK — the number of balls and the number of boxes respectively.

Output Format

• For each test case, output YES if it is possible to divide the NN balls into KK boxes such that the conditions are satisfied. Otherwise, output NO.
• You may print each character of YES and NO in uppercase or lowercase (for example, yes, yEs, Yes will be considered identical).

Constraints

• $1\le T\le 10^5$
• $1 \le N \le 10^9$
• $1 \le K \le 10^4$

/* package codechef; // don't place package name! */ import java.util.*; import java.lang.*; import java.io.*; /* Name of the class has to be "Main" only if the class is public. */ class Codechef { public static void main (String[] args) throws java.lang.Exception { try{ Scanner sc =new Scanner(System.in); int t= sc.nextInt(); while(t>=1 && t<=100000) { int n = sc.nextInt(); int k = sc.nextInt(); if(n>=1 && n<=(Math.pow(10, 9)) && k>=1 && k<=(Math.pow(10, 4))) { if(n==1 && k==1) { System.out.println("YES"); } else{ int val = k*(k+1)/2; if(n>=val) { System.out.println("YES"); } else { System.out.println("NO"); } } } } } catch(Exception e){ return; } } }