Question

C++ programming/Introduction to MatLab

THE PROJECT

This project requires you to find more Pythagorean Triples, or right triangles with all integer side lengths. The list of triples produced must be limited by prompting for and reading a maximum side length from the user. No side, a, b, or c, can be longer than the maximum side length provided by the user. The maximum side length obtained from the user must be validated as an integer value that is strictly greater than zero. Illegal maximum side lengths should be reported with appropriate error messages.

FINDING TRIPLES

After validating user input, your program script must call a separate function that counts and returns the number of triples found. As it finds triples, it must call a subfunction that prints that triple to the screen. After this search function returns the number that it found, the program script must print the number found.

EXCLUDING DUPLICATES

These are the same triangles that have had sides a and b flipped. Your solution must exclude these duplicates by making sure that the length of “Side A” is always strictly less than the length of “Side B”. Or stated another way, the values for each triple reported must be strictly increasing when reported in the order: Side A, Side B, Hypotenuse.

ANOTHER TYPE OF DUPLICATE

Your final task is to eliminate these similar duplicates of scale. This task is more tricky. The easiest way to handle it is to store all side lengths a and b in parallel arrays.

TEST

1. -1

2. -2.3

3. 2.3

4. 5

5. 10

6. 15

7. 25

8. 1000

Answer 1

***Please upvote or give a rating if the solution helped you***

Screenshot of the C++ code:-

Screenshot of two outputs:-

C++ code to copy:-

#include<iostream>
#include <math.h>

using namespace std;

//A subfunction that prints that triple to the screen
void print(int a,int b,int c){

cout<< "\n"<< a << " " << b << " " << c <<endl;
}

//A separate function that counts and returns the number of triples found.
int count(int lim){
//The sides and the hypotenuse respectively
int a,b,c;
int count = 0;

//Two parallel arrays to store the sides
int a_arr[lim],b_arr[lim];
//To iterate through the arrays
int i,j = 0;
bool found = false;

cout<< " \n Pythagorean triples between 1 to " << lim << ":\n\n "<<endl;

for(a = 1; a<=lim ; a++){
for( b = 1; b<=lim ; b++){
for( c = 1; c<=lim ; c++){
if((a*a + b*b) == c*c )
{
for(i = 0;i<j;i++)
{

//This elimimates the duplicates
if((b_arr[i] == a && a_arr[i] == b)|| (a % a_arr[i] == 0 && b % b_arr[i] == 0))
{
found = true;
break;
}

}

if(found == false){

a_arr[j] = a;
b_arr[j] = b;
count++;
print(a,b,c);
j++;
}
else{
found = false;
}
}
}
}
}

return count;
}

int main()
{
int max_i;
double maxi;

//Prompting for and reading a maximum side length from the user into a double variable
cout<<"Enter maximum side length";
cin >> maxi;

//Validating input and reporting with appropriate error messages.
if (maxi > 0 && (round(maxi) == maxi)){
max_i = (int)maxi;

cout << "\n\nTotal no of triples found " << count(max_i);
}
else{
//If input is negative
if(maxi < 0)
cout << "Side length cannot be negative"<<endl;
////If input is fractional
else if(round(maxi) != maxi)
cout << "Side length cannot be fractional"<<endl;
}
}