codeforces A. Divisibility Problem

题目

题意：

给你两个数$a,b$，问把$a$最少加多少可以使得$a$%$b=0$

思路：

分成三种情况：

• 当$a<=b$就是$b-a$
• 当$a>b$的时候我们要求出$b$的最小倍数是多少，然后减去$a$就行了。

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <vector>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <deque>
#include <stack>
using namespace std;
typedef long long ll;
typedef vector<int> vec;
typedef pair<int, int> pii;
template <class T>
inline void read(T &ret) {
    char c;
    int sgn;
    if (c = getchar(), c == EOF) return ;
    while (c != '-' && (c < '0' || c > '9')) c = getchar();
    sgn = (c == '-') ? -1:1;
    ret = (c == '-') ? 0:(c - '0');
    while (c = getchar(), c >= '0' && c <= '9') ret = ret * 10 + (c - '0');
    ret *= sgn;
    return ;
}
inline void out(int x) {
    if (x > 9) out(x / 10);
    putchar(x % 10 + '0');
}
int main() {
    ll a, b, t;
    read(t);
    while (t--) {
        read(a), read(b);
        if (a <= b) out(b - a);
        else if (a % b == 0) out(0);
        else b = (a / b + 1) * b, out(b - a);
        putchar('\n');
    }

}