Codeforces 667div3 D.Decrease the Sum of Digits

You are given a positive integer n. In one move, you can increase n by one (i.e. make n:=n+1). Your task is to find the minimum number of moves you need to perform in order to make the sum of digits of n be less than or equal to s.

You have to answer t independent test cases.

Input
The first line of the input contains one integer t (1≤t≤2⋅104) — the number of test cases. Then t test cases follow.

The only line of the test case contains two integers n and s (1≤n≤1018; 1≤s≤162).

Output
For each test case, print the answer: the minimum number of moves you need to perform in order to make the sum of digits of n be less than or equal to s.

Example
Input
5
2 1
1 1
500 4
217871987498122 10
100000000000000001 1
Output
8
0
500
2128012501878
899999999999999999

题意：加上最小的数使得一个数n每位之和小于s

思路：按照每一位来考虑，先写一个函数计算每位总和，设定一个base，根据贪心，肯定从个位数开始操作，把当前数变成0则需要base - n % base ，若还不满足则移动到上一位，模拟即可

#include <bits/stdc++.h>

using namespace std;

#define LL long long

int cal(LL x){
    int sum = 0;
    while(x){
        sum +=x % 10;
        x /= 10;
    }
    return sum;
}

int main(){
    int t;
    cin >> t;

    while(t --){
        LL n,s;
        cin >> n >> s;
        
        LL x = n;
        LL base = 10;
        while(cal(n) > s){
            n += base - n % base;
            base *= 10;
        }
        
        cout << n - x << '\n';
    }
    return 0;
}