Question

Project: Perfect Square Table (Figure 1) Figure 1 shows a number square table. A "Perfect Square Table" is a square of positive integers such that the sum of each row, column, and diagonal is the same constant. For example, the square table in Figure 1 is a Perfect Square Table with a constant of 34. Write a program that determines if a square table is a Perfect Square Table. The number of rows in the table is>1 but< 100. The numbers in the table, all integers, are between 0 and 1002 16 3 2 13 5 10 11 8 9 6712 4 15 141 Input Data: Data about the number of rows and columns in the table are first read from the input tile. In our example, the input tile appears as tollows // This square table has 4 rows and columns 16 3 2 13 5 10 11 8 9 6 7 12 4 15 14 1 Output Data: Display the table as shown below if and only if the number of rows8 Square Table Size: 4 161 31 2 13 1 51 101 11 8I 1 91 61 71 12 1 41 151 14 11 Then display a message such as "This is a Perfect Square Table with a constant of 34!" or "This is not a Perfect Square Table Algorithm - will be discussed in class

// Use the following

Project: Perfect Square Table
   A “Perfect Square Table” is a square of positive integers such that the
   sum of each row, column, and diagonal is the same constant.
   This program reads square tables from files, checks if they are perfect squares,
   and displays messages such as “This is a Perfect Square Table with a constant of 34!”
   or “This is not a Perfect Square Table”.

   NAME:
   IDE:

   */

   #include <iostream>

   using namespace std;

   const int MAXTBLSIZE = 100; // the maximum table size is 100

   int main( void )
   {
       string fileName[] = {"T0.txt", "T1.txt", "T2.txt", "TA.txt", "T3.txt", "T4.txt", "T5.txt", "T6.txt", "T7.txt", ""};
       int table[MAXTBLSIZE][MAXTBLSIZE] = {0};
       int tblSize;     // the number of rows and columns
       int tblConstant; // -1 if it is not a perfect table or the table's constant otherwise
       int choice = 1; // to stop the program to allow the user to see the results one table at a time
  
       // test loop: takes the names of 7 input files from an array
       for (int i = 0; choice == 1 && fileName[i] != ""; i++)
       {
           if (readTable(fileName[i], table, tblSize))
           {
               tblConstant = testTable(table, tblSize);
               printTable(table, tblSize);
               printResults(tblConstant);
           }
           else
           {
               cout << "Error: Input file \"" << fileName[i] << "\" not found!" << endl;
           }
      
           cout << "Please enter 1 to continue 0 to stop" << endl;
           cin >> choice;
       }
  
       return 0;
   }   // main

   /** Save the output below


   */

Answer 1

If you have any doubts, please give me comment...

#include <iostream>

#include <fstream>

#include <iomanip>

using namespace std;

const int MAXTBLSIZE = 100; // the maximum table size is 100

bool readTable(string fileName, int table[][MAXTBLSIZE], int &tblSize);

int testTable(int table[][MAXTBLSIZE], int tblSize);

int printTable(int table[][MAXTBLSIZE], int tblSize);

int printResults(int tblStatus);

int main(void)

{

string fileName[] = {"T0.txt", "T1.txt", "T2.txt", "TA.txt", "T3.txt", "T4.txt", "T5.txt", "T6.txt", "T7.txt", ""};

int table[MAXTBLSIZE][MAXTBLSIZE] = {0};

int tblSize; // the number of rows and columns

int tblConstant; // -1 if it is not a perfect table or the table's constant otherwise

int choice = 1; // to stop the program to allow the user to see the results one table at a time

// test loop: takes the names of 7 input files from an array

for (int i = 0; choice == 1 && fileName[i] != ""; i++)

{

if (readTable(fileName[i], table, tblSize))

{

tblConstant = testTable(table, tblSize);

printTable(table, tblSize);

printResults(tblConstant);

}

else

{

cout << "Error: Input file \"" << fileName[i] << "\" not found!" << endl;

}

cout << "Please enter 1 to continue 0 to stop" << endl;

cin >> choice;

}

return 0;

} // main

bool readTable(string fileName, int table[][MAXTBLSIZE], int &tblSize){

ifstream in;

in.open(fileName.c_str());

if(in.fail())

return false;

in>>tblSize;

for(int i=0; i<tblSize; i++){

for(int j=0; j<tblSize; j++){

in>>table[i][j];

}

}

return true;

}

int testTable(int table[][MAXTBLSIZE], int tblSize){

int sum = 0;

for (int i = 0; i < tblSize; i++)

sum = sum + table[i][i];

for (int i = 0; i < tblSize; i++) {

int rowSum = 0;

for (int j = 0; j < tblSize; j++)

rowSum += table[i][j];

if (rowSum != sum)

return -1;

}

for (int i = 0; i < tblSize; i++) {

int colSum = 0;

for (int j = 0; j < tblSize; j++)

colSum += table[j][i];

if (sum != colSum)

return -1;

}

return sum;

}

int printTable(int table[][MAXTBLSIZE], int tblSize){

cout<<"Square Table Size: "<<tblSize<<endl;

cout<<setfill('-')<<setw((tblSize+1)*3 + 2)<<"-"<<endl;

for(int i=0; i<tblSize; i++){

cout<<"|";

for(int j=0; j<tblSize; j++){

cout<<setw(3)<<setfill(' ')<<table[i][j]<<"|";

}

cout<<endl;

}

cout<<setfill('-')<<setw((tblSize+1)*3 + 2)<<"-"<<endl;

}

int printResults(int tblStatus){

if(tblStatus>0)

cout<<"This is a Perfect Square Table with a constant of "<<tblStatus<<"!"<<endl;

else

cout<<"This is not a Perfect Square Table"<<endl;

}

161 3 2 13 51 101 111 8 1 91 6 71 12 1 41 151 141 1 This is a Perfect Square Table with a constant of 34! Please enter 1 to continue to stop Error: Input file \""T1.txt\"" not found! Please enter 1 to continue to stop "",""error"":null,""modified"":1556240717,""source"":""automated""}"