Chapter4-Q27.c

/* 
Author is : Ibrahim Halil GEZER
4.27 (Pythagorean Triples) A right triangle can have sides that are all integers. The set of three
integer values for the sides of a right triangle is called a Pythagorean triple. These three sides must
satisfy the relationship that the sum of the squares of two of the sides is equal to the square of the
hypotenuse. Find all Pythagorean triples for side1, side2, and the hypotenuse all no larger than 500.
Use a triple-nested for loop that simply tries all possibilities. This is an example of “brute-force”
computing. It’s not aesthetically pleasing to many people. But there are many reasons why these
techniques are important. First, with computing power increasing at such a phenomenal pace, solutions
that would have taken years or even centuries of computer time to produce with the technology
of just a few years ago can now be produced in hours, minutes or even seconds. Recent
microprocessor chips can process a billion instructions per second! Second, as you’ll learn in more
advanced computer science courses, there are large numbers of interesting problems for which there
is no known algorithmic approach other than sheer brute force. We investigate many kinds of problem-
solving methodologies in this book. We’ll consider many brute-force approaches to various interesting
problems.
*/
#include <stdio.h>

int main (void)
{
	int hypo, side1, side2, number ;
	number = 500 ;
	int count = 0 ; // initialization to count
	for (side1=1; side1<=number; side1++){ // Outer for begins
		
		for (side2=1; side2<=number; side2++) { // inner for begins 
			
			for (hypo=1; hypo<=number; hypo++) { // deep inner for begins
				
				if ( hypo*hypo == side1*side1 +side2*side2 )
					
					if (side1<side2) { // I want every triangle just 1 time. For example ý don't want to see 3-4-5 and 4-3-5 triangles.
						printf ( "Here I found a right triangle! %6d - %-4d - %-4d triangle \n",side1,side2,hypo );
						count ++ ;
					} // end if 
				
			} // deep inner for ends
			
		} // inner for ends
	} // outer for ends
	printf ( "There are %d number right triangle. " , count );
	
	return 0 ;
} // end function main