C++ Exercises: Check whether given length of three side form a right triangle
C++ Basic: Exercise-65 with Solution
Write a C++ program to check whether a given length of three sides forms a right triangle.
Pictorial Presentation:

Sample Solution:
C++ Code :
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
vector<int> triangle_sides(3);
cin >> triangle_sides[0] >> triangle_sides[1] >> triangle_sides[2];
sort(triangle_sides.begin(), triangle_sides.end());
if (triangle_sides[0]*triangle_sides[0] + triangle_sides[1]*triangle_sides[1] == triangle_sides[2]*triangle_sides[2])
{
cout << "Yes" << endl;
}
else
{
cout << "No" << endl;
}
return 0;
}
Sample Output:
Sample input : 6 9 7 Sample Output: No
Flowchart:

C++ Code Editor:
Contribute your code and comments through Disqus.
Previous: Write a C++ program to compute the sum of the two given integers and count the number of digits of the sum value.
Next: Write a C++ program to add all the numbers from 1 to a given number.
What is the difficulty level of this exercise?
C++ Programming: Tips of the Day
Why is there no std::stou?
The most pat answer would be that the C library has no corresponding "strtou", and the C++11 string functions are all just thinly veiled wrappers around the C library functions: The std::sto* functions mirror strto*, and the std::to_string functions use sprintf.
Ref: https://bit.ly/3wtz2qA
- Weekly Trends
- Python Interview Questions and Answers: Comprehensive Guide
- Scala Exercises, Practice, Solution
- Kotlin Exercises practice with solution
- MongoDB Exercises, Practice, Solution
- SQL Exercises, Practice, Solution - JOINS
- Java Basic Programming Exercises
- SQL Subqueries
- Adventureworks Database Exercises
- C# Sharp Basic Exercises
- SQL COUNT() with distinct
- JavaScript String Exercises
- JavaScript HTML Form Validation
- Java Collection Exercises
- SQL COUNT() function
- SQL Inner Join
We are closing our Disqus commenting system for some maintenanace issues. You may write to us at reach[at]yahoo[dot]com or visit us at Facebook