CF 1650B - DIV + MOD

B. DIV + MOD

Not so long ago, Vlad came up with an interesting function:

• $f_a(x)=\lfloor \frac{x}{a}\rfloor +x$ mod $a$, where $\lfloor \frac{x}{a}\rfloor$ is $x_a$, rounded down, $x$ mod $a$ — the remainder of the integer division of $x$ by $a$.
  For example, with $a=3$ and $x=11$, the value $f_3(11)=\lfloor \frac{11}{3}\rfloor +11mod3=3+2=5$.
  The number $a$ is fixed and known to Vlad. Help Vlad find the maximum value of $f_a(x)$ if $x$ can take any integer value from $l$ to $r$ inclusive $(l\le x\le r)$.

Input
The first line of input data contains an integer $t(1\le t\le 10^4)$ — the number of input test cases.
This is followed by t lines, each of which contains three integers $l_i,r_i$ and $a_i(1\le l_i\le r_i\le 10^9,1\le a_i\le 10^9)$ — the left and right boundaries of the segment and the fixed value of $a$.
Output
For each test case, output one number on a separate line — the maximum value of the function on a given segment for a given $a$.
Example
input

5
1 4 3
5 8 4
6 10 6
1 1000000000 1000000000
10 12 8

output

2
4
5
999999999
5

Note
In the first sample:

• $f_3(1)=\lfloor \frac{1}{3}\rfloor +1mod3=0+1=1$,
• $f_3(2)=\lfloor \frac{2}{3}\rfloor +2mod3=0+2=2$,
• $f_3(3)=\lfloor \frac{3}{3}\rfloor +3mod3=1+0=1$,
• $f_3(4)=\lfloor \frac{4}{3}\rfloor +4mod3=1+1=2$

As an answer, obviously, $f_3(2)$ and $f_3(4)$ are suitable.

题目大意：
就是找出 $i\in [l,r]$, $i$ 整除 $a$ 向下取整 + $i$ $mod$ $a$ 后的最大值。
解题思路：
先记录 $f_a(r)=\lfloor \frac{r}{a}\rfloor +r$ $mod$ $a$ 求出来的值，因为 $右边界/a$ 的商最大。然后就是找出比 $r$ 小的且 $mod$ $a$ 后的余数最大的那个值就是 $r/a\ast a-1$，判断它是否在 $[l,r]$ 内，如果在给定的区间内那么最大值则在 $f_a(r)$ 和 $f_a(r/a\ast a-1)$ 之中，否则为$f_a(r)$。

#include <bits/stdc++.h>
using namespace std;

int main()
{
    int t; cin>>t;
    while(t--)
    {
        int l, r, a;
        cin>>l>>r>>a;
        int ans = r/a + r%a; //在 r 的值
        if(r/a*a-1 >= l) //若区间内存在比 r 小的且 mod a 后的余数最大的数
            ans = max(ans, r/a-1 + a-1);
        //比r/a小1所以商为 r/a-1 , 余数为 a-1 时余数才最大
        cout<<ans<<'\n';
    }
    return 0;
}