// program answer for project 1 Fall 2000 in Data Structures
// c.f. description in assignment proj1 fall 00 .doc
#include <iostream.h>

class mstring {
public:
  mstring () {len=0; str=NULL; }  // construct a NULL string
  mstring& operator = (char *);
  int operator == (mstring);
  const int length() { return len; }
  char operator [] (int i) { return str[i]; }
private:
  char * str;
  int len;
};


// compare to mstrings for equality
int mstring:: operator == (mstring m)
{
if (len!=m.length()) return 0;
for (int i=0; i<len; i++)
  if (str[i]!=m[i]) return 0;
return 1;
}

// assign a cstring to an mstring
mstring& mstring::operator = (char * cstr)
{
if (len>0) delete str;
len=0;
while (cstr[len]!='\0') len++;
str = new char[len];
for (int i =0; i<len; i++)
  str[i]=cstr[i];
return *this;
}

// input a string & copy to an mstring
istream& operator >> (istream& IN, mstring& m)
{
char inpt[128];
IN >> inpt;
m=inpt;
return IN;
}

// output the characters of an mstring
ostream& operator << (ostream& OUT, mstring m) {
for (int i=0; i<m.length(); i++)
  OUT << m[i];
return OUT;
}

// return index if example found in list[0..n-1]
//    else return len
int mstr_search(mstring list[], int len, mstring example) {
int i;
for (i=0;i<len;i++)
  if (list[i]==example) return i;
return len;
}


#define MaxStus 20

main()
{
int exam1[MaxStus], exam2[MaxStus], nstus=0;
mstring stus[20], finished;
finished="done";

// read student data
for (nstus=0; nstus < MaxStus ; nstus++){
  cin >> stus[nstus] >> exam1[nstus] >> exam2[nstus];
  if (stus[nstus]==finished) break;
  }

// calculate & report stats
cout << " There were " << nstus << " students" << endl;
int imax= 0;
int imin = 0;
int i;
for (i=0;i<nstus;i++) {
  if (exam1[i]>exam1[imax]) imax=i;
  if (exam1[i]<exam1[imin]) imin=i;
  }
cout << "Exam 1 high: " << exam1[imax] << "  low: " << exam1[imin] << endl;
imax=imin=0;
for (i=0;i<nstus;i++) {
  if (exam2[i]>exam2[imax]) imax=i;
  if (exam2[i]<exam2[imin]) imin=i;
  }
cout << "Exam 2 high: " << exam2[imax] << "  low: " << exam2[imin] << endl;

// read names & look up
int sinx;
mstring inword;
int x =0;
do {
  cin >> inword;
  if (inword==finished) break;
  sinx=mstr_search(stus,nstus,inword);
  if (sinx<nstus)
    cout << "  exam 1: " << exam1[sinx] << "  exam 2: " << exam2[sinx] << endl;
  else
    cout << " Name " << inword << " Not found!" << endl;
  x++;
  } while (!(inword==finished)&& x<5);

return 0;
}