- 01
- 02
- 03
- 04
- 05
- 06
- 07
- 08
- 09
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- 21
- 22
- 23
- 24
- 25
- 26
- 27
- 28
- 29
- 30
- 31
- 32
- 33
- 34
- 35
- 36
- 37
- 38
- 39
- 40
- 41
- 42
- 43
- 44
- 45
- 46
- 47
- 48
- 49
- 50
#include <iostream>
#include <set>
#include <queue>
#include <iterator>
#include <algorithm>
using namespace std;
class Complex
{
public:
char a;
char b;
public:
Complex(){}
Complex(char i, char j)
{
this->a = i;
this->b = j;
}
friend bool operator < (const Complex& complex1, const Complex& complex2)
{
return ((complex1.a < complex2.a && complex1.b < complex2.b) || (complex1.a < complex2.a && complex1.b == complex2.b) || (complex1.a == complex2.a && complex1.b < complex2.b));
}
friend bool operator >(const Complex& complex1, const Complex& complex2)
{
return ((complex1.a > complex2.a && complex1.b > complex2.b) || (complex1.a > complex2.a && complex1.b == complex2.b) || (complex1.a == complex2.a && complex1.b > complex2.b));
}
friend ostream& operator << (ostream& out, Complex const& complex)
{
out << "First: " << complex.a << " Second: " << complex.b;
return out;
}
friend bool operator == (const Complex& complex1, const Complex& complex2)
{
return ( complex1.a == complex2.a && complex1.b == complex2.b);
}
~Complex()
{
}
};
dxd 03.06.2015 00:44 # 0
kegdan 03.06.2015 00:53 # 0
Vasiliy 03.06.2015 15:20 # 0