Slow Solution Solution Codechef

by

Slow Solution Solution Codechef

Chef is trying to solve a problem having T test cases, where, for each test case he is given a single integer N. Chef has an algorithm which takes exactly N2 iterations for a test case with value N.

The constraints of the problem are as follows:

  • 1≤T≤maxT
  • 1≤N≤maxN
  • Sum of N over all test cases does not exceed sumN.

Given the values maxT,maxN, and sumN, determine the maximum number of iterations Chef’s algorithm can take for any valid input file satisfying all the constraints.

Formally speaking, find the maximum value of N12+N22+⋯+NT2 for any valid input file satisfying all the constraints.

Input Format

  • The first line of input will contain a single integer T, denoting the number of test cases.
  • Each test case consists of single line consisting of three integers maxT, maxN, and sumN.

Output Format

For each test case, output the the maximum number of iterations Chef’s algorithm can take in any valid test file.

Constraints

  • 1≤T≤1000
  • 1≤maxT≤maxN≤sumN≤104

Sample Input 1

4
10 100 200
3 10 100
1000 1000 2200
100 100 100

Sample Output 1

20000
300
2040000
10000

Explanation

  • Test Case 1: Worst case for Chef’s algorithm would be where T=2 and N=100 for both the test cases. In this case, Chef’s algorithm will take 1002+1002=20000 iterations.
  • Test Case 2: Worst case for Chef’s algorithm would be where T=3 and N=10 for all the 3 test cases. In this case, Chef’s algorithm will take 102+102+102=300 iterations.
  • Test Case 3: Worst case for Chef’s algorithm would be where T=3 and N=1000,1000, and 200 for the three test cases respectively. In this case, Chef’s algorithm will take 10002+10002+2002=2040000 iterations.
  • Test Case 4: Worst case for Chef’s algorithm would be where T=1 and N=100. In this case Chef’s algorithm will take 1002=10000 iterations.

SOLUTION

Program: Slow Solution Solution in Python

for i in range(int(input())):
    t,n,s=map(int,input().split())
    if t<=s//n:
        print(t*(n*n))
    else:
        print((s//n)*(n*n) + pow(s%n,2))

Program: Slow Solution Solution in C++

#include <bits/stdc++.h>
using namespace std;
int main() {
    int t;
    cin>>t;
    while(t--) {
        int a, b, c;
        cin>>a>>b>>c;
        long long ans=0;
        while(a && c) {
            int x = min(b, c);
            c -= x;
            a--;
            ans += x*x;
        }
        cout<<ans<<endl;
    }
    return 0;
}

Program: Slow Solution Solution in Java

import java.util.*;
import java.lang.*;
import java.io.*;
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 Tmax =sc.nextInt();
        int Nmax =sc.nextInt();
        int Nsum =sc.nextInt();
            int k = Nsum/Nmax;
            int rem =Nsum%Nmax;
            if(k<Tmax){
                if(rem != 0){
                    System.out.println((k)*Nmax*Nmax + (rem)*(rem));
                }
                else{
                    System.out.println(k*Nmax*Nmax);
                }
            }
            else{
                System.out.println(Tmax*Nmax*Nmax);
            }
        }
        }
    }

Related:

Leave a Comment

11 + one =