Codeforces Round #781 (Div. 2) ABCD

A - GCD vs LCM

题目要求 a + b + c + d , gcd ⁡ ( a , b ) × gcd ⁡ ( c , d ) = c × d a + b + c + d, \gcd(a, b) \times \gcd(c, d) = c \times d a+b+c+d,gcd(a,b)×gcd(c,d)=c×d，那么直接等号两侧都是 1 1 1即可。

#include 
#define int long long
#define endl '\n'
using namespace std;

inline void solve(){
    int n = 0; cin >> n, n -= 2;
    cout