最大公約数(ユークリッドの互除法)
(math/gcd.hpp)

• View this file on GitHub
• Last update: 2022-11-17 17:44:39+09:00
• Include: #include "math/gcd.hpp"
• Link: View error logs on GitHub Actions

Required by

• math/lcm.hpp

Verified with

• verify/AOJ-ALDS1_1_B.test.cpp
• verify/AOJ-NTL_1_C.test.cpp

Code

#pragma once
template <class T>
T GCD(T a, T b){
  if(b == 0) return a;
  return GCD(b, a % b);
}

#line 2 "math/gcd.hpp"
template <class T>
T GCD(T a, T b){
  if(b == 0) return a;
  return GCD(b, a % b);
}

Back to top page