This documentation is automatically generated by online-judge-tools/verification-helper
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/sum_of_floor_of_linear
#include "../../template/template.hpp"
#include "../../math/number-theory/sum-of-floor-of-linear.hpp"
int main() {
int T;
cin >> T;
while(T--) {
int64 N, M, A, B;
cin >> N >> M >> A >> B;
cout << sum_of_floor_of_linear(N, M, A, B) << "\n";
}
}
#line 1 "test/verify/yosupo-sum-of-floor-of-linear.test.cpp"
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/sum_of_floor_of_linear
#line 1 "template/template.hpp"
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
}
} iosetup;
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << p.first << " " << p.second;
return os;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
for (int i = 0; i < (int)v.size(); i++) {
os << v[i] << (i + 1 != v.size() ? " " : "");
}
return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
for (T &in : v) is >> in;
return is;
}
template <typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
template <typename T = int64>
vector<T> make_v(size_t a) {
return vector<T>(a);
}
template <typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t) fill_v(e, v);
}
template <typename F>
struct FixPoint : F {
explicit FixPoint(F &&f) : F(forward<F>(f)) {}
template <typename... Args>
decltype(auto) operator()(Args &&...args) const {
return F::operator()(*this, forward<Args>(args)...);
}
};
template <typename F>
inline decltype(auto) MFP(F &&f) {
return FixPoint<F>{forward<F>(f)};
}
#line 4 "test/verify/yosupo-sum-of-floor-of-linear.test.cpp"
#line 1 "math/number-theory/sum-of-floor-of-linear.hpp"
template <typename T>
T sum_of_floor_of_linear(const T &n, const T &m, T a, T b) {
T ret = 0;
if (a >= m) ret += (n - 1) * n * (a / m) / 2, a %= m;
if (b >= m) ret += n * (b / m), b %= m;
T y = (a * n + b) / m;
if (y == 0) return ret;
T x = y * m - b;
ret += (n - (x + a - 1) / a) * y;
ret += sum_of_floor_of_linear(y, a, m, (a - x % a) % a);
return ret;
}
#line 6 "test/verify/yosupo-sum-of-floor-of-linear.test.cpp"
int main() {
int T;
cin >> T;
while(T--) {
int64 N, M, A, B;
cin >> N >> M >> A >> B;
cout << sum_of_floor_of_linear(N, M, A, B) << "\n";
}
}
Env | Name | Status | Elapsed | Memory |
---|---|---|---|---|
g++ | example_00 | AC | 6 ms | 4 MB |
g++ | random_00 | AC | 16 ms | 4 MB |
g++ | random_01 | AC | 46 ms | 4 MB |
g++ | random_02 | AC | 37 ms | 4 MB |
g++ | random_03 | AC | 27 ms | 4 MB |
g++ | random_04 | AC | 16 ms | 4 MB |
g++ | small_00 | AC | 11 ms | 4 MB |
g++ | small_01 | AC | 26 ms | 4 MB |
g++ | small_02 | AC | 22 ms | 4 MB |
g++ | small_03 | AC | 17 ms | 4 MB |
g++ | small_04 | AC | 11 ms | 4 MB |
clang++ | example_00 | AC | 6 ms | 4 MB |
clang++ | random_00 | AC | 16 ms | 4 MB |
clang++ | random_01 | AC | 48 ms | 4 MB |
clang++ | random_02 | AC | 37 ms | 4 MB |
clang++ | random_03 | AC | 28 ms | 4 MB |
clang++ | random_04 | AC | 16 ms | 4 MB |
clang++ | small_00 | AC | 11 ms | 4 MB |
clang++ | small_01 | AC | 28 ms | 4 MB |
clang++ | small_02 | AC | 21 ms | 4 MB |
clang++ | small_03 | AC | 17 ms | 4 MB |
clang++ | small_04 | AC | 10 ms | 4 MB |