Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

#include #include using namespace std; const int FIRST = 30; const int LAST = 30

ID: 3849305 • Letter: #

Question

#include #include using namespace std; const int FIRST = 30; const int LAST = 30; const int SIZE = 50; const int ROWS = 12; const int COLUMNS = 4; struct contestant_data { char fname[FIRST]; char lname[LAST]; double distance[ROWS][COLUMNS]; double longestDistance; }; void read_in_data(contestant_data players[], const int SIZE); void display_data(contestant_data players[], const int SIZE); void read_in_data(contestant_data players[], const int SIZE) { ifstream inputfile; inputfile.open("frisbee_throw.txt"); if (!inputfile) { cout << "Sorry, the file is unable to open!" << endl; return; } // for (int p = 0; p < SIZE; p++) // { for (int n = 0; n < 30; n++) { inputfile >> players[SIZE].fname[n]; inputfile >> players[SIZE].lname[n]; for (int r = 0; r < ROWS; r++) { for (int c = 0; c < COLUMNS; c++) { inputfile >> players[SIZE].distance[r][c]; } } } for (int r = 0; r < ROWS; r++) { players[SIZE].longestDistance = players[SIZE].distance[r][0]; for (int c = 0; c < COLUMNS; c++) { if (players[SIZE].longestDistance < players[SIZE].distance[r][c]) players[SIZE].longestDistance = players[SIZE].distance[r][c]; cout << "Longest Distance for Player" << (r + 1) << players[SIZE].longestDistance; } } //} } void display_data(contestant_data players[], const int SIZE) { for (int n = 0; n < 30; n++) { cout << players[SIZE].fname[n] << players[SIZE].lname[n]; } } int main() { const int SIZE = 50; contestant_data players[SIZE]; read_in_data(players, SIZE); display_data(players, SIZE); return 0; }

Explanation / Answer

As you haven't mentioned the task to performed, i corrected some of the error and resubmitting the code:

#include <iostream>
#include <stdio.h>
using namespace std;

const int FIRST = 30;
const int LAST = 30;
const int SIZE = 50;
const int ROWS = 12;
const int COLUMNS = 4;
struct contestant_data {
   char fname[FIRST];
   char lname[LAST];
   double distance[ROWS][COLUMNS];
   double longestDistance;
};

void read_in_data(contestant_data players[], const int SIZE);
void display_data(contestant_data players[], const int SIZE);

void read_in_data(contestant_data players[], const int SIZE) {
   ifstream inputfile;
   inputfile.open("frisbee_throw.txt");
   if (!inputfile) {
       cout << "Sorry, the file is unable to open!" << endl;
       return;
   }
for (int p = 0; p < SIZE; p++)
{
for (int n = 0; n < 30; n++)
{
inputfile >> players[SIZE].fname[n];
inputfile >> players[SIZE].lname[n];
for (int r = 0; r < ROWS; r++) {
   for (int c = 0; c < COLUMNS; c++)
   {
       inputfile >> players[SIZE].distance[r][c];
   }
}
}
for (int r = 0; r < ROWS; r++)
{
   players[SIZE].longestDistance = players[SIZE].distance[r][0];
   for (int c = 0; c < COLUMNS; c++) {
       if (players[SIZE].longestDistance < players[SIZE].distance[r][c])
           players[SIZE].longestDistance = players[SIZE].distance[r][c];

       cout << "Longest Distance for Player" << (r + 1) << players[SIZE].longestDistance; }
}
}
} void display_data(contestant_data players[], const int SIZE)
{
for (int n = 0; n < 30; n++)
{
   cout << players[SIZE].fname[n] << players[SIZE].lname[n];
}
}


int main()
{
   const int SIZE = 50;
   contestant_data players[SIZE];
   read_in_data(players, SIZE);
   display_data(players, SIZE);
   return 0;
}