提出 #20534268

---

ソースコード 拡げる

#include <bits/stdc++.h>

#include <atcoder/all>
#include <boost/multiprecision/cpp_int.hpp>

using namespace std;
using namespace atcoder;

#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
using ll = long long;
#define pint pair<int, int>
#define pll pair<ll, ll>
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
// const ll mod = 1e9 + 7;

using Bint = boost::multiprecision::cpp_int;
using mint = modint1000000007;

int main() {
  int t;
  cin >> t;
  while(t--){
    ll x, y, p, q;
    cin >> x >> y >> p >> q;
    vector<ll> mod(2);
    mod[1] = 2 * x + 2 * y;
    mod[0] = p + q;
    ll ans = longinf;
    for (ll i = p; i < p + q;i++) {
      for (ll j = x; j < x + y;j++){
        vector<ll> rem(2);
        rem[0] = i;
        rem[1] = j;
        auto temp=crt(rem, mod);
        if(temp.second)ans = min(ans,temp.first);
      }
    }
    if(ans<longinf){
      cout << ans << endl;
    }else{
      cout << "infinity" << endl;
    }
  }
}

提出情報

ジャッジ結果