Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <string.h>
- using namespace std;
- class PlDrustvo{
- private:
- char *ime;
- int brTuri;
- int brChlenovi;
- public:
- PlDrustvo (const char *ime="", const int brTuri=0, const int brChlenovi=0)
- {
- this->ime = new char[strlen(ime)+1];
- strcpy(this->ime, ime);
- this->brTuri = brTuri;
- this->brChlenovi = brChlenovi;
- }
- ~PlDrustvo ()
- {
- delete [] ime;
- }
- PlDrustvo& operator= (const PlDrustvo& dru)
- {
- if(this!=&dru)
- {
- delete [] ime;
- ime = new char [strlen(dru.ime)+1];
- strcpy(ime, dru.ime);
- brTuri = dru.brTuri;
- brChlenovi = dru.brChlenovi;
- return *this;
- }
- else return *this;
- }
- friend bool operator> (const PlDrustvo& dru, const PlDrustvo& dru2)
- {
- if(dru.brChlenovi > dru2.brChlenovi) return true;
- else return false;
- }
- friend bool operator< (const PlDrustvo& dru, const PlDrustvo& dru2)
- {
- if(dru.brChlenovi < dru2.brChlenovi) return true;
- else return false;
- }
- PlDrustvo operator+ (const PlDrustvo& dru)
- {
- PlDrustvo pom;
- if(*this > dru)
- {
- delete[] pom.ime;
- pom.ime = new char[strlen(ime)+1];
- strcpy(pom.ime, ime);
- pom.brTuri = brTuri;
- pom.brChlenovi = brChlenovi + dru.brChlenovi;
- }
- else
- {
- delete[] pom.ime;
- pom.ime = new char[strlen(dru.ime)+1];
- strcpy(pom.ime, dru.ime);
- pom.brTuri = dru.brTuri;
- pom.brChlenovi = brChlenovi + dru.brChlenovi;
- }
- return pom;
- }
- friend ostream& operator<< (ostream& o, const PlDrustvo& dru)
- {
- o<<"Ime: "<<dru.ime<<" Turi: "<<dru.brTuri<<" Clenovi: "
- <<dru.brChlenovi<<endl;
- return o;
- }
- friend void najmnoguClenovi (const PlDrustvo *dru, int n)
- {
- PlDrustvo pom;
- for(int i=0; i<n; i++)
- {
- if(dru[i] > pom) pom = dru[i];
- }
- cout<<"Najmnogu clenovi ima planinarskoto drustvo: "<<pom;
- }
- };
- int main()
- {
- PlDrustvo drustva[3];
- PlDrustvo pl;
- for (int i=0;i<3;i++)
- {
- char ime[100];
- int brTuri;
- int brClenovi;
- cin>>ime;
- cin>>brTuri;
- cin>>brClenovi;
- PlDrustvo p(ime,brTuri,brClenovi);
- drustva[i] = p;
- }
- pl = drustva[0] + drustva[1];
- cout<<pl;
- najmnoguClenovi(drustva, 3);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement