Help me in solving MARBLES problem

help
,
1

My issue

I don’t understand the solutions submitted by other. My understanding is to implement the below combination formula

(n+k-1) C (k-1)

Please help me on how to execute the same

My code

/* 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
	{
		// your code goes here
		Scanner sc = new Scanner(System.in);
		int t = sc.nextInt();
		while(t-->0) {
		  int n=sc.nextInt();
		  int k=sc.nextInt();
		  
		  if(n==k) {
		      console.log("1");
		  }
		  else {
		      n=n+k-1;
		      k=k-1;
		      
		      
		  }
		}
	}
}

Problem Link: MARBLES Problem - CodeChef

2 
class Codechef {
    public static void main(String[] args) throws java.lang.Exception {
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();
        while (t-- > 0) {
            int n = sc.nextInt();
            int k = sc.nextInt();

            if (n == k) {
                System.out.println("1");
            } else {
                n = n + k - 1;
                k = k - 1;
            }
        }
    }
}

=> your logic is perfect for only testcase 1, in testcase 2 you should improve your logic.
now, here in this code I help you to write correct your syntax,
System.out.println(“1”);Preformatted text