forked from ngthanhtrung23/CompetitiveProgramming
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathB.cpp
More file actions
46 lines (38 loc) · 1.25 KB
/
B.cpp
File metadata and controls
46 lines (38 loc) · 1.25 KB
1
2
3
4
5
6
7
8
9
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
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; i--)
#define REP(i,a) for(int i=0,_a=(a); i<_a; i++)
#define EACH(it,a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
#define DEBUG(x) { cout << #x << " = "; cout << (x) << endl; }
#define PR(a,n) { cout << #a << " = "; FOR(_,1,n) cout << a[_] << ' '; cout << endl; }
#define PR0(a,n) { cout << #a << " = "; REP(_,n) cout << a[_] << ' '; cout << endl; }
#define sqr(x) ((x) * (x))
#define ll long long
#define SZ(X) ((int) ((X).size()))
using namespace std;
int id[333];
vector<string> all;
bool check(string s) {
REP(i,SZ(s)) id[s[i]] = i;
REP(i,SZ(all)) {
string req = all[i];
if (req[1] == '<' && id[req[0]] > id[req[2]]) return false;
if (req[1] == '>' && id[req[0]] < id[req[2]]) return false;
}
return true;
}
int main() {
ios :: sync_with_stdio(false);
string tmp;
while (cin >> tmp) {
all.push_back(tmp);
}
string s = "ABC";
do {
if (check(s)) {
cout << s << endl;
return 0;
}
} while (next_permutation(s.begin(), s.end()));
cout << "Impossible" << endl;
}