If the three sides of a Triangle are entered through the keyboard, write a program to check whether the Triangle is isosceles, equilateral, scalene Triangle. Show Note: Isosceles Triangle: A Triangle is called isosceles triangle if length of 2 sides of it are equal. Scalene Triangle: A Triangle is called scalene triangle if length of all 3 sides are different or not equal. Output 1:Enter values for a, b and c101010 It’s an Equilateral Triangle Write a C program to input sides of a triangle and check whether a triangle is equilateral, scalene or isosceles triangle using if else. How to check whether a triangle is equilateral, scalene or isosceles triangle in C programming. Logic to classify triangles as equilateral, scalene or isosceles triangle if sides are given in C program. Example Output Triangle is equilateral triangleRequired knowledgeBasic C programming, Relational operators, Logical operator, If else Properties of triangle
Logic to check equilateral, scalene or isosceles triangleStep by step descriptive logic to classify triangle as equilateral, scalene or isosceles triangle.
Program to check equilateral, scalene or isosceles triangle/** * C program to check whether a triangle is Equilateral, Isosceles or Scalene */ #include <stdio.h> int main() { int side1, side2, side3; /* Input sides of a triangle */ printf("Enter three sides of triangle: "); scanf("%d%d%d", &side1, &side2, &side3); if(side1==side2 && side2==side3) { /* If all sides are equal */ printf("Equilateral triangle."); } else if(side1==side2 || side1==side3 || side2==side3) { /* If any two sides are equal */ printf("Isosceles triangle."); } else { /* If none sides are equal */ printf("Scalene triangle."); } return 0; }Enter three sides of triangle: 30 30 30 Equilateral triangle. Happy coding 😉
Given three integers as X, Y, and Z representing the three sides of a triangle, the task is to check whether the triangle formed by the given sides is equilateral, isosceles, or scalene.
Examples:
Approach: Follow the steps below to solve the problem:
Below is the implementation of the above approach:
Time Complexity: O(1) Article Tags : Practice Tags : |