#784900 (C++17) No.2030 Googol Strings

• 問題: No.2030 Googol Strings
• ユーザー: miscalc
• 提出日時: 2022-08-05 21:38:50
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 66 ms / 2,000 ms
• コード長: 2,110 bytes
• コンパイル時間: 4,489 ms
• コンパイル使用メモリ: 264,828 KB
• 実行使用メモリ: 13,648 KB
• 最終ジャッジ日時: 2024-09-15 17:57:35
• 合計ジャッジ時間: 5,778 ms
• ジャッジサーバーID （参考情報）: judge2 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	42 ms; 5,248 KB
testcase_01	AC	21 ms; 5,248 KB
testcase_02	AC	19 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	37 ms; 5,376 KB
testcase_05	AC	17 ms; 5,376 KB
testcase_06	AC	41 ms; 13,648 KB
testcase_07	AC	50 ms; 11,192 KB
testcase_08	AC	50 ms; 11,192 KB
testcase_09	AC	22 ms; 5,376 KB
testcase_10	AC	23 ms; 5,376 KB
testcase_11	AC	22 ms; 5,376 KB
testcase_12	AC	43 ms; 5,376 KB
testcase_13	AC	36 ms; 5,376 KB
testcase_14	AC	22 ms; 5,376 KB
testcase_15	AC	42 ms; 5,376 KB
testcase_16	AC	66 ms; 5,376 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll safemod(ll A, ll M) {ll res = A % M; if (res < 0) res += M; return res;}
ll divfloor(ll A, ll B) {if (B < 0) {return divfloor(-A, -B);} return (A - safemod(A, B)) / B;}
ll divceil(ll A, ll B) {if (B < 0) {return divceil(-A, -B);} return divfloor(A + B - 1, B);}
ll pow_ll(ll A, ll B) {ll res = 1; for (int i = 0; i < B; i++) {res *= A;} return res;}
ll arisum_ll(ll a, ll d, ll n) { return n * a + (n & 1 ? ((n - 1) >> 1) * n : (n >> 1) * (n - 1)) * d; }
ll arisum2_ll(ll a, ll l, ll n) { return n & 1 ? ((a + l) >> 1) * n : (n >> 1) * (a + l); }
ll arisum3_ll(ll a, ll l, ll d) { assert((l - a) % d == 0); return arisum2_ll(a, l, (l - a) / d + 1); }
template<class T> void unique(vector<T> &V) {V.erase(unique(V.begin(), V.end()), V.end());}
template<class T> void sortunique(vector<T> &V) {sort(V.begin(), V.end()); V.erase(unique(V.begin(), V.end()), V.end());}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)
template<class T> void printvec(const vector<T> &V) {int _n = V.size(); for (int i = 0; i < _n; i++) cout << V[i] << (i == _n - 1 ? "" : " ");cout << '\n';}
template<class T> void printvect(const vector<T> &V) {for (auto v : V) cout << v << '\n';}
template<class T> void printvec2(const vector<vector<T>> &V) {for (auto &v : V) printvec(v);}
//*
#include <atcoder/all>
using namespace atcoder;
//using mint = modint998244353;
using mint = modint1000000007;
//using mint = modint;
//*/

bool solve(string s, string t)
{
  if (s.size() < t.size())
    return !solve(t, s);
  s += s;
  while (s.size() > t.size())
  {
    t += t;
  }
  t = t.substr(0, s.size());
  return s >= t;
}

int main()
{
  ll T;
  cin >> T;
  while (T--)
  {
    string x, y;
    cin >> x >> y;
    cout << (solve(x, y) ? "X\n" : "Y\n");
  }
}