[codeforces 1328A] Divisibility Problem 整除+模

Codeforces Round #629 (Div. 3)   比赛人数10967

[codeforces 1328A]  Divisibility Problem    整除+模

总目录详见https://blog.csdn.net/mrcrack/article/details/103564004

也在线测评地址https://codeforces.ml/contest/1328/problem/A

Problem	Lang	Verdict	Time	Memory
A - Divisibility Problem	GNU C++11	Accepted	31 ms	0 KB

算是这段时间codeforces比赛比较简单的题目了。

整除+模

#include <stdio.h>
int main(){
	int t,a,b;
	scanf("%d",&t);
	while(t--){
		scanf("%d%d",&a,&b);
		if(a%b==0)printf("0\n");
		else printf("%d\n",b-a%b);
	}
	return 0;
}