푸바프로그래밍

//main.cpp #include<iostream> #include"probability.h" #include"GameSystem.h" #include"NormalMan.h" #include"PowerMan.h" #include"TankerMan.h" using namespace std; enum MyEnum { POWER = 1, TANKER, NORMAL, }; int main() { Player *player; GameSystem gameSys; probability facedMonster(20); player = new Player; gameSys.selectPlayer(); switch (gameSys.getSel()) { case POWER: player = new PowerMan; break; case TANKER: player = new TankerMan; break; case NORMAL: player = new NormalMan; break; case 4: exit(1); break; default: cout << "Please input 1 ~ 3 nums.\n"; } gameSys.playMenu(); while (gameSys.getSel() == 1) { if (facedMonster.isGotit()) { Monster monster1; gameSys.warSystem(*player , monster1); } gameSys.playMenu(); } } //////////////////////////////////////////////////////////////////////////////////////...

//PFArray.h #ifndef PFArray_H #define PFArray_H namespace PFArraySavitch { template<class T> class PFArray { public: PFArray(); PFArray(int capacityValue); PFArray(const PFArray<T>& pfaObject); void addElement(T element); //선행조건: 배열은 가득차있지않다. //사후조건: 원소가 추가되었다. bool full() const; int getCapacity() const; int getNumberUsed() const; void emptyArray(); //사용된 원소의 수를 0으로 다시 설정하여 배열을 효과적으로 비게한다. T& operator[](int index); PFArray<T>& operator =(const PFArray<T>& rightSide); virtual ~PFArray(); private: T * a; //T형의 배열을 위한 것 int capacity;// 배열크기 int used; }; } #endif //////////////////////////////////////////////////////////////////////////////////////////// //PFArray.cpp #include<iostream> #include"PFArray.h" using std::cout; namespace PFArraySavitch { template<class T> PFArray<T>::PFArray() : capacity(50), used(0) { a = new T[cap...