Submission #4489327

---

Source Code Expand

#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;

//
#define int long long
#define pb(x) push_back(x)
#define m0(x) memset((x), 0, sizeof(x))
#define mm(x) memset((x), -1, sizeof(x))

//container
#define ALL(x) (x).begin(), (x).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define EACH(i, c) for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define UNIQUE(v) (v).erase(unique((v).begin(), (v).end()), (v).end());
#define PERM(c) \
  sort(ALL(c)); \
  for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))

// debug
#define GET_VAR_NAME(variable) #variable
#define test(x) cout << GET_VAR_NAME(x) << " = " << x << endl;

// bit_macro
#define bit(n) (1LL << (n))
#define bitset(a, b) (a) |= (1 << (b))
#define bitunset(a, b) (a) |= ~(1 << (b))
#define bitcheck(a, b) ((((a) >> (b)) & 1) == 1)
#define bitcount(a) __builtin_popcountll((a))

//typedef
typedef long long lint;
typedef unsigned long long ull;
typedef complex<long double> Complex;
typedef pair<int, int> P;
typedef tuple<int, int, int> TP;
typedef vector<int> vec;
typedef vector<vec> mat;

//constant
const int INF = (int)1e18;
const int MOD = (int)1e9 + 7;
const double PI = (double)acos(-1);
const double EPS = (double)1e-10;
const int dx[] = {-1, 0, 0, 1, 0, -1, -1, 1, 1};
const int dy[] = {0, -1, 1, 0, 0, 1, -1, 1, -1};

//
template <typename T>
void chmax(T &a, T b) { a = max(a, b); }
template <typename T>
void chmin(T &a, T b) { a = min(a, b); }
//
inline int toInt(string s) {
  int v;
  istringstream sin(s);
  sin >> v;
  return v;
}
template <class T>
inline string toString(T x) {
  ostringstream sout;
  sout << x;
  return sout.str();
}

//
struct Accelerate_Cin {
  Accelerate_Cin() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    cout << fixed << setprecision(20);
  };
};

//Ｏ(log(max(a,b))
// aとbの最大公約数
int gcd(lint a, lint b) {
  if (b == 0)
    return a;
  return gcd(b, a % b);
}

signed main() {
  string s;
  cin >> s;
  int X = 0, Y = 0;

  int i = 0;
  while (s[i] != '/') {
    X *= 10;
    X += s[i++] - '0';
  }

  i++;

  while (i != s.size()) {
    Y *= 10;
    Y += s[i++] - '0';
  }

  int t = gcd(X, Y);
  X /= t;
  Y /= t;

  vector<P> ans;
  for (int i = 0; i < 2; i++) {
    int n = 2 * X / Y + i;
    if (n % Y == 0) {
      int m = n * (n + 1) / 2 - n / Y * X;
      if (1 <= m && m <= n) {
        ans.pb(P(n, m));
      }
    }
  }

  if (ans.size() == 0) {
    cout << "Impossible" << endl;
  } else {
    for (auto x : ans) {
      cout << x.first << " " << x.second << endl;
    }
  }

  return 0;
}

Submission Info

Judge Result