最小公倍数
(math/lcm.hpp)

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

Depends on

• math/gcd.hpp

Verified with

• verify/AOJ-NTL_1_C.test.cpp

Code

#include "../math/gcd.hpp"

#pragma once
template <class T>
inline T LCM(T a, T b){
  return a / GCD(a, b) * b;
}

Traceback (most recent call last):
  File "/usr/local/lib/python3.10/site-packages/onlinejudge_verify/documentation/build.py", line 71, in _render_source_code_stat
    bundled_code = language.bundle(stat.path, basedir=basedir, options={'include_paths': [basedir]}).decode()
  File "/usr/local/lib/python3.10/site-packages/onlinejudge_verify/languages/cplusplus.py", line 187, in bundle
    bundler.update(path)
  File "/usr/local/lib/python3.10/site-packages/onlinejudge_verify/languages/cplusplus_bundle.py", line 312, in update
    raise BundleErrorAt(path, i + 1, "#pragma once found in a non-first line")
onlinejudge_verify.languages.cplusplus_bundle.BundleErrorAt: math/lcm.hpp: line 3: #pragma once found in a non-first line

Back to top page