Submission #2211783

---

Source Code Expand

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#include <iomanip>
#include <cassert>
#include <bitset>
using namespace std;

typedef pair<int, int> P;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define index(xs, x) (int)(lower_bound(all(xs), x) - xs.begin())
#define _1 first
#define _2 second
#define pb push_back
#define INF 1145141919
#define MOD 1000000007

int N, A, B;
signed main() {
  ios::sync_with_stdio(false); cin.tie(0);
  cin >> A >> B;
  N = A+B;
  if (A <= B) {
    cout << "Impossible\n";
    return 0;
  }
  cout << "Impossible\n";
  //cout<<"num="<<((B+1)*(B+2))/2-1<<"\n";
  /*
  if (((B+1)*(B+2))/2-1 > 2*N) {
    cout << "Impossible\n";
    return 0;
  }
  */
  return 0;
}

Submission Info

Judge Result