Codeforces Round #629 (Div. 3) A. Divisibility Problem

A. Divisibility Problem

题目链接-A. Divisibility Problem

题目大意
给两个数$a,b$，每次可以对$a$进行加1操作，问最少几次操作后$a$可以整除$b$
解题思路

• 如果输入$a$可以整除$b$，直接输出0
• 否则算出离$a$最近的$b$的倍数与$a$的差值即可
• 具体操作见代码

附上代码

#include<bits/stdc++.h>
#define int long long
#define lowbit(x) (x &(-x))
#define endl '\n'
using namespace std;
const int INF=0x3f3f3f3f;
const int dir[4][2]={-1,0,1,0,0,-1,0,1};
const double PI=acos(-1.0);
const double eps=1e-10;
const int M=1e9+7;
const int N=1e5+5;
typedef long long ll;
typedef pair<int,int> PII;
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	
	int t;
	cin>>t;
	while(t--){
		int a,b;
		cin>>a>>b;
		if(a%b==0)
			cout<<0<<endl;
		else{
			int ans=(a/b+1)*b-a;
			cout<<ans<<endl;
		}
	}
	return 0;
}