// List ADT implementation

#include <iostream>

using namespace std;

const int MAX = 100;

class List
{	int length;
	int  data[MAX];		// assuming: integer list
public:
	List()	// empty: length = 0
	{	length = 0;	}
	int Length()
	{	return length;	}
	bool IsEmpty()
	{	return length == 0;	}
	bool IsFull() const
	{	return length == MAX;	}
	void Insert(int item)
	{	data[length] = item; length++;	}
	bool IsPresent(int item) const; // prototype
	void Print() const
	{	for(int i=0; i<length; i++)
			cout << data[i] << " ";
		cout << endl;
	}
};

bool List :: IsPresent(int item) const
{	bool done = false;
	for(int i=0; i<length&&!done; i++)
		if( item == data[i])
			done = true;
	return done;
}

int main()
{	List list1;
	int item;

	cout << "Input a number: (ctrl + d to quit)" << endl;
	cin >> item;
	while(cin)
	{	list1.Insert(item);
		cout << "Input a another number: (ctrl + d to quit)" << endl;
		cin >> item;
	}

	cout << "\n********************************\nLength: "<< list1.Length() << endl;

	list1.Print();

	if(list1.IsPresent(77))
		cout << "\n77 is in the list.\n";
	else
		cout << "\n77 is not in the list.\n";
	

	cout << "\n\nBye.\n\n";
	return 0;

}