41 #ifndef ARITHMETIC_HPP
42 #define ARITHMETIC_HPP
66 template <
typename T>
class Arith {
71 for (int64_t i = 0; i < n; i++) {
80 for (int64_t i = 1; i < n; i++) {
89 for (int64_t i = 0; i < n; i++) {
121 int64_t
op_gcd(int64_t x, int64_t y);
T arr_sub(T arr[], int64_t n)
T arr_add(T arr[], int64_t n)
T arr_mlt(T arr[], int64_t n)
int64_t greatest_power(int64_t n, int64_t p)
Find greatest power of 2 itegers.
int64_t op_gcd(int64_t x, int64_t y)
Find Greatest Common Divisor of 2 integers.
The source C++ openGPMP namespace.