Help me in solving SLOWSOLN problem

help
,
1

My issue

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
	}
}

Problem Link: SLOWSOLN Problem - CodeChef

2

@varunred08
First, initiate remainder and quotient with 0, if sumN/maxN >= maxT this means you have less no of test cases so you should add N(square) to maxT times otherwise store q and r by dividing sumN and maxN and simply do N(square) with quotient no of times and add a remainder square.

like this

/* 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
	{
		Scanner sc = new Scanner(System.in);
		int t = sc.nextInt();
		while(t-->0){
		    int maxT = sc.nextInt();
		    int maxN = sc.nextInt();
		    int sumN = sc.nextInt();
		    int r = 0;
		    int q = 0;
		    if(sumN/maxN >= maxT){
		        System.out.println(maxT*maxN*maxN);
		    } else if(sumN/maxN < maxT){
		        q = sumN/maxN;
		        r = sumN%maxN;
		        System.out.println(q*maxN*maxN + r*r);
		    }
		}
	}
}