Submission #1495633

---

Source Code Expand

#include <iostream>
#define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++)
using namespace std;
typedef long long ll;

ll N, X;

int main(void) {
  cin >> N >> X;

  ll ans = N;
  ll a = max(X, N - X);
  ll b = min(X, N - X);
  while(b != 0) {
    ans += b * (a / b) * 2;
    swap(a, b);
    b %= a;
  }
  ans -= a;

  cout << ans << endl;
}

Submission Info

Judge Result