diff options
| author | omagdy7 <omar.professional8777@gmail.com> | 2022-11-29 19:40:03 +0200 |
|---|---|---|
| committer | omagdy7 <omar.professional8777@gmail.com> | 2022-11-29 19:40:03 +0200 |
| commit | fd8997e2ffdeac5f821ab0333698b5e610da14f3 (patch) | |
| tree | da557dfdb5356441edf4abe59df3fe618e1db3e6 /codeforces/CompareTShirtSizes/main.cpp | |
| parent | 115f46e93398fea52915071eff859a5a2fa11b06 (diff) | |
| download | competitive-programming-fd8997e2ffdeac5f821ab0333698b5e610da14f3.tar.xz competitive-programming-fd8997e2ffdeac5f821ab0333698b5e610da14f3.zip | |
Added new problems
Diffstat (limited to 'codeforces/CompareTShirtSizes/main.cpp')
| -rw-r--r-- | codeforces/CompareTShirtSizes/main.cpp | 114 |
1 files changed, 114 insertions, 0 deletions
diff --git a/codeforces/CompareTShirtSizes/main.cpp b/codeforces/CompareTShirtSizes/main.cpp new file mode 100644 index 0000000..11bf999 --- /dev/null +++ b/codeforces/CompareTShirtSizes/main.cpp @@ -0,0 +1,114 @@ +#include<bits/stdc++.h> +using namespace std; + +using ll = long long; +using pi = pair<int, int>; +using vpi = vector<pi>; +using vi = vector<int>; +using vll = vector<long long>; +using mpii = map<int, int>; +using mpll = map<ll, ll>; +using db = long double; + +#define pb push_back +#define all(x) (x).begin(), (x).end() +#define rall(x) (x).rbegin(), (x).rend() +#define lb lower_bound +#define ub upper_bound + +const int MOD = (int)1e9 + 7; +const db PI = acos((db)-1); +const int dx[4]{1, 0, -1, 0}; +const int dy[4]{0, 1, 0, -1}; + +//pretty printing +template<typename K, typename V> +void printm(const map<K, V> &mp) { + cerr << "{" << endl; + for (auto p : mp) { + cerr << " { " << p.first << " : " << p.second << " }\n"; + } + cerr << "}" << endl; +} +template<typename T> +void printv(const vector<T> &v) { + cerr << "["; + for (int i = 0; i < v.size(); i++) { + if (i == v.size() - 1) { + cerr << v[i]; + } else { + cerr << v[i] << ", "; + } + } + cerr << "]\n"; +} + +template<typename T> +void printvv(const vector<vector<T>> &v) { + cerr << "[\n"; + for (auto &vec : v) { + cout << " "; + printv(vec); + } + cerr << "]\n"; +} +void print() { + cerr << "\n"; +} + +template<typename T, typename... TS> +void print(T val, TS... vals) { + cerr << val << " "; + print(vals...); +} + + +/* stuff you should look for: + --------------------------- + * special cases (n=1?) + * int overflow, array bounds + * do smth instead of nothing and stay organized + * WRITE STUFF DOWN + * DON'T GET STUCK ON ONE APPROACH + */ + +void solve() { + string s1, s2; + cin >> s1 >> s2; + int t1 = s1[s1.length() - 1]; + int t2 = s2[s2.length() - 1]; + int x1 = 0, x2 = 0; if (t1 == 'L' && t2 != 'L') { + cout << '>' << '\n'; + } else if (t2 == 'L' && t1 != 'L') { + cout << '<' << '\n'; + } else if (t1 == 'M' && t2 == 'L' || (t1 == 'S' && t2 == 'M')){ + cout << '<' << '\n'; + } else if (t2 == 'M' && t1 == 'S' || (t1 == 'M' && t2 == 'S')) { + cout << '>' << '\n'; + } + else if (t1 == t2) { + x1 = s1.length() - 1; + x2 = s2.length() - 1; + if (x1 == x2) { + cout << '=' << '\n'; + } else if (x1 > x2 && t1 != 'S') { + cout << '>' << '\n'; + } else if (x1 > x2 && t1 == 'S') { + cout << '<' << '\n'; + } else { + cout << '<' << '\n'; + } + } +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while(tt--) { + solve(); + } +} + + |
