You are building a house. You'd prefer if all the walls have a precise right angle relative to the ground, but you have no device to measure angles. A friend that says he has a great idea how you could ensure that all walls are upright: All you need to do is step away a few feet from the wall, measure how far away you are from the wall, measure the height of the wall, and the distance from the upper edge of the wall to where you stand. You friend tells you to do these measurements for all walls, then he'll tell you how to proceed. Sadly, just as you are done, a timber falls on your friend, and an ambulance brings him to the hospital. This is too bad, because now you have to figure out what to do with your measurements yourself.

Given the three sides of a triangle, determine if the triangle is a right triangle, i.e. if one of the triangle's angles is 90 degrees.

Input

Input starts with an integer T (≤ 200), denoting the number of test cases.

Each test case consists of three integers 1 ≤ a, b, c ≤ 40000 separated by a space. The three integers are the lengths of the sides of a triangle.

Output

For each case, print the case number and yes or no depending on whether it's a right angle or not.

Sample

Sample Input	Sample Output
Click to copy 2 36 77 85 40 55 69	Click to copy Case 1: yes Case 2: no

Total Submissions

Users Tried

Users Solved

LOJ 1053 - Higher Math

In this problem, you will be given T test cases. Each test case contains three space-separated integers with values ranging from 1 to 40000. These integers denote the lengths of the sides of a triangle. Your task is to determine whether the triangle is right angled.

You can use the Pythagoras' Theorem to solve this problem. Pythagoras' Theorem states that:

In a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides.

Here is a tutorial for some additional explanation.

The problem is fairly simple. However, some people might find it difficult to get an Accepted verdict. The reason could be one of the following:

Forgetting to consider the length of the longest side as the hypotenuse
Failing to provide proper output format
Missing new line on each line

If you are still stuck with this problem, check the codes below:

C++

#include <bits/stdc++.h>
using namespace std;

int main() {
  int T, sides[3];
  cin >> T;
  for (int i = 1; i <= T; i++) {
    cin >> sides[0] >> sides[1] >> sides[2];
    sort(sides, sides + 3);
    int hypo_square = sides[2] * sides[2];
    int other_square = sides[0] * sides[0] + sides[1] * sides[1];
    cout << "Case " << i << ": " << (hypo_square == other_square ? "yes" : "no") << "\n";
  }
  return 0;
}

Java

package com.loj.volume;

import java.util.Scanner;
import java.util.Arrays;

class HigherMath {
  public static void main(String[] args) throws Exception {
    Scanner input = new Scanner(System.in);
    int T = input.nextInt(), sides[] = {0, 0, 0};
    for (int i = 1; i <= T; i++) {
      for (int j = 0; j < 3; sides[j] = input.nextInt(), j++);
      Arrays.sort(sides);
      int hypoSquare = sides[2] * sides[2];
      int otherSquare = sides[0] * sides[0] + sides[1] * sides[1];
      System.out.printf("Case %d: %s\n", i, (hypoSquare == otherSquare ? "yes" : "no"));
    }
  }
}

Tutorial source