Help me in solving SLOWSOLN problem

help
,
1

My issue

how to find the testcases value for the solution

My code

# cook your dish here
t=int(input())
for j in range(t):
    maxt,maxn,sumn=map(int,input().split())
    if maxn<=sumn:
        print(maxn**2+ (sumn-maxn)**2)
    else:
        print(maxn**2)

Problem Link: Slow Solution Practice Coding Problem - CodeChef

2

@mounika6178
hidden test cases can’t be shown .
Yeah but if u are a pro member then after clicking on debug my code , it will show u the test case for which your code is giving wrong answer.

3

I am talking about the number of test cases we have to find in the problem not the test cases of the problem,In that problem we have to find the number of test cases and then we have to calculate the time complexity

4

@mounika6178
with the help of max_n & sum_n we can find the number of testcase .
plzz refer following c++ code for better understanding .

#include <iostream>
using namespace std;

int main() {
	int T;
	cin>>T;  //no of test cases 
	while(T--)
	{
	    int maxT,maxN,sumN;
	    cin>>maxT>>maxN>>sumN; // taking requred inputs 
	    int test_2=sumN/maxN;  // finding he required no of test cases
	    int rem=sumN%maxN;     // finding the remainder
	    if(test_2<maxT)
	    {
	        int sum=test_2*maxN*maxN + rem*rem;
	        cout<<sum<<endl;
	    }
	    else 
	    {
	        int sum=maxT*maxN*maxN;;
	        cout<<sum<<endl;
	    }
	}
	return 0;
}