mmrz's library

This documentation is automatically generated by online-judge-tools/verification-helper

---

Project maintained by mm-rz Hosted on GitHub Pages — Theme by mattgraham

verify/yukicoder/3020.test.cpp

• View this file on GitHub
• Last update: 2025-07-01 03:22:56+09:00
• Problem: https://yukicoder.me/problems/no/3020

Depends on

• binary_gcd (math/binary_gcd.hpp)
• template/template.hpp

Code

#define PROBLEM "https://yukicoder.me/problems/no/3020"

#include "./../../template/template.hpp"
#include "./../../math/binary_gcd.hpp"

using namespace mmrz;

void mmrz::solve(){
	ll a, b, c, d;
	cin >> a >> b >> c >> d;
	ll g = binary_gcd(abs(a), binary_gcd(abs(b), binary_gcd(abs(c), abs(d))));
	if(g == 0){
		cout << "0 0\n";
		return;
	}
	ll det = a*d - b*c;
	cout << g << " " << abs(det/g) << endl;
}

#line 1 "verify/yukicoder/3020.test.cpp"
#define PROBLEM "https://yukicoder.me/problems/no/3020"

#line 1 "template/template.hpp"
# include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const double pi = acos(-1);
template<class T>constexpr T inf() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T hinf() { return inf<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); }
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); }
template<class T> bool chmin(T& a,T b) { if(a > b){a = b; return true;} return false; }
template<class T> bool chmax(T& a,T b) { if(a < b){a = b; return true;} return false; }
int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }
int d_sum(ll n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }
int d_cnt(ll n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }
ll gcd(ll a, ll b) { if (b == 0)return a; return gcd(b, a%b); };
ll lcm(ll a, ll b) { ll g = gcd(a, b); return a / g*b; };
ll MOD(ll x, ll m){return (x%m+m)%m; }
ll FLOOR(ll x, ll m) {ll r = (x%m+m)%m; return (x-r)/m; }
template<class T> using dijk = priority_queue<T, vector<T>, greater<T>>;
# define all(qpqpq)           (qpqpq).begin(),(qpqpq).end()
# define UNIQUE(wpwpw)        (wpwpw).erase(unique(all((wpwpw))),(wpwpw).end())
# define LOWER(epepe)         transform(all((epepe)),(epepe).begin(),TL<char>)
# define UPPER(rprpr)         transform(all((rprpr)),(rprpr).begin(),TU<char>)
# define rep(i,upupu)         for(ll i = 0, i##_len = (upupu);(i) < (i##_len);(i)++)
# define reps(i,opopo)        for(ll i = 1, i##_len = (opopo);(i) <= (i##_len);(i)++)
# define len(x)                ((ll)(x).size())
# define bit(n)               (1LL << (n))
# define pb push_back
# define eb emplace_back
# define exists(c, e)         ((c).find(e) != (c).end())

struct INIT{
	INIT(){
		std::ios::sync_with_stdio(false);
		std::cin.tie(0);
		cout << fixed << setprecision(20);
	}
}INIT;

namespace mmrz {
	void solve();
}

int main(){
	mmrz::solve();
}
#line 2 "math/binary_gcd.hpp"

#line 5 "math/binary_gcd.hpp"

long long binary_gcd(long long a, long long b){
	if(a == 0)return b;
	if(b == 0)return a;

	a = std::abs(a);
	b = std::abs(b);

	int a_zero = __builtin_ctzll(a);
	int b_zero = __builtin_ctzll(b);
	a >>= a_zero;
	b >>= b_zero;
	
	while(a != b){
		if(a > b){
			std::swap(a, b);
		}
		b -= a;
		b >>= __builtin_ctzll(b);
	}
	return a << std::min(a_zero, b_zero);
}
#line 5 "verify/yukicoder/3020.test.cpp"

using namespace mmrz;

void mmrz::solve(){
	ll a, b, c, d;
	cin >> a >> b >> c >> d;
	ll g = binary_gcd(abs(a), binary_gcd(abs(b), binary_gcd(abs(c), abs(d))));
	if(g == 0){
		cout << "0 0\n";
		return;
	}
	ll det = a*d - b*c;
	cout << g << " " << abs(det/g) << endl;
}

Back to top page