Discus Throw Solution Codechef

Table of Contents

• Discus Throw Solution Codechef
  • SOLUTION
• Codechef March Long Challenge 2022 Solutions

Discus Throw Solution Codechef

In discus throw, a player is given 3 throws and the throw with the longest distance is regarded as their final score. You are given the distances for all 3 throws of a player. Determine the final score of the player.

Input Format

• First line will contain T, number of test cases. Then the test cases follow.
• Each test case contains of a single line of input, three integers A,B, and C denoting the distances in each throw.

Output Format

For each test case, output the final score of the player.

Constraints

• 1≤T≤100
• 1≤A,B,C≤100

Sample Input 1

3
10 15 8
32 32 32
82 45 54

Sample Output 1

15
32
82

Explanation

• Test Case 1: The longest distance is achieved in the second throw, which is equal to 15 units. Thus, the answer is 15.
• Test Case 2: In all throws, the distance is 32 units. Thus, the final score is 32.
• Test Case 3: The longest distance is achieved in the first throw which is equal to 82 units. Thus, the answer is 82.

SOLUTION

Program: Discus Throw Solution Codechef in Python

j = int(input())
for i in range(j):
    l=list(map(int, input().split(" ")))
    print(max(l))

Program: Discus Throw Solution Codechef in C++

#include <iostream>
using namespace std;
int main() {
	int t;
	cin>>t;
	int a,b,c;
	while(t--){
	    cin>>a>>b>>c;
	    if(a>b){
	        if(a>c){
	            cout<<a<<endl;
	        }else{
	            cout<<c<<endl;
	        }
	    }else if(b>c){
	        cout<<b<<endl;
	    }else{
	        cout<<c<<endl;
	    }
	}
	return 0;
}

Program: Discus Throw Solution Codechef 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 a = sc.nextInt();
		   int b = sc.nextInt();
		   int c = sc.nextInt();
		   int ans = Math.max(a,Math.max(b,c));
		   System.out.println(ans);
		   t--;
		}
	}
}

Codechef March Long Challenge 2022 Solutions

• Bath in Winters Solution Codechef
• Discus Throw Solution Codechef
• Count the Ones Solution Codechef
• MEX on Trees Solution Codechef
• Subarray XOR Solution Codechef
• Substring of a Substring Solution Codechef
• Exact Marks Solution Codechef
• Akash and Function Solution Codechef
• Akash and Missing Class Solution Codechef
• Wordle Solution Codechef