For this Question: You are given two positive integers A and B. In one move, you can increase the value of A by 1, i. e, A = A + 1. Find the minimum number of moves required to make A divisible by B. More formally, find the number of times A has to be incremented so that <b>A % B == 0</b> becomes true where A % B defines the remainder we get after dividing A by B.First and the only lint of the input contains 2 integers, A and B.

Constraints:
1 <= A, B <= 10<sup>9</sup>Print the minimum number of moves required to make A divisible by B.Sample Input:
100 13

Sample Output:
4

Explaination:
We increase 100, four times to make it 104. 104 is fully divisible by 13., I have written this Solution Code: #include<bits/stdc++.h>
using namespace std;
 
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL);
#define int long long
#define pb push_back
#define ff first
#define ss second
#define endl '\n'
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
using T = pair<int, int>;
typedef long double ld;
 
const int mod = 1e9 + 7;
const int INF = 1e18;
 
void solve(){
    int A, B;
    cin >> A >> B;
    cout << (B - A % B) % B;
}
 
signed main(){
    fast
    int t = 1;
    // cin >> t;
    for(int i = 1; i <= t; i++){
        solve();
        if(i != t) cout << endl;
    }
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?