// Find Rectangle: // Original Code By Brianpo Kpo 4:00 PM at 2/2/2018 (ARGENTINIAN CALENDAR: (DD/MM/YY)) // Better Working in Original C++, SoloLearn has some "input" bugs! // First, we have to initialize the main variables and libraries: #include #include using namespace std; int dummy_list[4][4]; int tries; bool isRect = false; bool isSquare = false; int coord_s[4][2]; int c_x; // These two are included here, int c_y; // specially for the C++ version. // Sort_Comb is made here, instead of in main function, to ensure there // are no compiling errors. // Make a list with all possible combinations (24): int sort_comb[24][4] = { {1, 2, 3, 4},{1, 2, 4, 3},{1, 3, 2, 4},{1, 4, 2, 3}, {1, 3, 4, 2},{1, 4, 3, 2},{2, 1, 3, 4},{2, 1, 4, 3}, {3, 1, 2, 4},{4, 1, 2, 3},{3, 1, 4, 2},{4, 1, 3, 2}, {2, 3, 1, 4},{2, 4, 1, 3},{3, 2, 1, 4},{4, 2, 1, 3}, {3, 4, 1, 2},{4, 3, 1, 2},{2, 3, 4, 1},{2, 4, 3, 1}, {3, 2, 4, 1},{4, 2, 3, 1},{3, 4, 2, 1},{4, 3, 2, 1} }; int comb = 24; // Combinations generated at site: http://jacamas.pcriot.com/combinations.html // This is a function that will be needed while checking: void rectify (int tim) { dummy_list[0][0] = coord_s[sort_comb[tim][0]-1][0]; dummy_list[0][1] = coord_s[sort_comb[tim][0]-1][1]; dummy_list[1][0] = coord_s[sort_comb[tim][1]-1][0]; dummy_list[1][1] = coord_s[sort_comb[tim][1]-1][1]; dummy_list[2][0] = coord_s[sort_comb[tim][2]-1][0]; dummy_list[2][1] = coord_s[sort_comb[tim][2]-1][1]; dummy_list[3][0] = coord_s[sort_comb[tim][3]-1][0]; dummy_list[3][1] = coord_s[sort_comb[tim][3]-1][1]; } // Execution function int main(int argc, char **argv) { // Now we make the user to input the coordinates: // sample_list is not really necessary here: for (int a = 0;a < 4;a++) { cout << "Please enter coord \"X\" Nº" << (a+1) << ": "; cin >> c_x; coord_s[a][0] = c_x; cout << endl; cout << "Please enter coord \"Y\" Nº" << (a+1) << ": "; cin >> c_y; coord_s[a][1] = c_y; cout << endl; } // Now that we have the coordinates, we have to test if it's a rectangle: while (tries < comb) { rectify(tries); if (dummy_list[0][0] == dummy_list[1][0] && dummy_list[0][0] != dummy_list[2][0] && dummy_list[0][0] != dummy_list[3][0] && dummy_list[2][0] == dummy_list[3][0] && dummy_list[2][0] != dummy_list[1][0] && dummy_list[2][0] != dummy_list[0][0]) { if (dummy_list[0][1] == dummy_list[2][1] && dummy_list[0][1] != dummy_list[1][1] && dummy_list[0][1] != dummy_list[3][1] && dummy_list[1][1] == dummy_list[3][1] && dummy_list[1][1] != dummy_list[2][1] && dummy_list[1][1] != dummy_list[0][1]) { if (dummy_list[2][0] - dummy_list[0][0] != dummy_list[0][1] - dummy_list[1][1]) { isRect = true; break; } else { isSquare = true; break; } } } tries++; } // Checks if it was selected as "True" in any iteration: if (isRect == true) { cout << "\nIt's a rectangle!" << endl; // Output if true if (tries > 0) { cout << "Result got in " << (tries+1) << " tries." << endl; } else { cout << "Result got in one try." << endl; } } else { // Outputs if false if (isSquare == true) { cout << "\nThat's a square, not a rectangle!" << endl; if (tries > 0) { cout << "Result got in " << (tries+1) << " tries." << endl; } else { cout << "Result got in one try." << endl; } } else { cout << "\nIt's not a rectangle!" << endl; } } cout << "\nProgram created by Brianpo Kpo!"; return 0; }

C++_Find_rectangles_by_coordinates -By Brianpo Kpo - for the user Kuanlin Chen