# Submit Info #152

Problem Lang User Status Time Memory
Sum of Floor of Linear d hos AC 89 ms 3.17 MiB

ケース詳細
Name Status Time Memory
example_00 AC 3 ms 1.02 MiB
random_00 AC 23 ms 2.32 MiB
random_01 AC 89 ms 3.17 MiB
random_02 AC 71 ms 2.83 MiB
random_03 AC 50 ms 2.61 MiB
random_04 AC 24 ms 2.24 MiB
small_00 AC 16 ms 2.05 MiB
small_01 AC 50 ms 2.39 MiB
small_02 AC 39 ms 2.26 MiB
small_03 AC 27 ms 2.09 MiB
small_04 AC 12 ms 2.05 MiB

import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } // floor(a / m) // m > 0 long floor(long a, long m) { return a / m - ((a % m < 0) ? 1 : 0); } // sum{ floor((a x + b) / m) | l <= x <= r } // m > 0 long sumFloors(long m, long a, long b, long l, long r) in { assert(m > 0, "sumFloors: m > 0 must hold"); } do { long sum; for (; l <= r; ) { const q = floor(a, m); const aa = a - q * m; const ll = floor(aa * l + b, m) + 1; const rr = floor(aa * r + b, m); sum += q * ((r + 1) * r / 2 - l * (l - 1) / 2) + r * rr - (l - 1) * (ll - 1) + (rr - ll + 1); a = m; m = aa; l = -rr; r = -ll; } return sum; } void main() { try { for (; ; ) { const numCases = readInt(); foreach (caseId; 0 .. numCases) { const N = readLong(); const M = readLong(); const A = readLong(); const B = readLong(); const res = sumFloors(M, A, B, 0, N - 1); writeln(res); } } } catch (EOFException e) { } }