文章目录
一、Divisibility Problem
总结
一、Divisibility Problem
本题链接：Divisibility Problem
题目：
A. Divisibility Problem
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
You are given two positive integers a and b. In one move you can increase a by 1 (replace a with a+1). Your task is to find the minimum number of moves you need to do in order to make a divisible by b. It is possible, that you have to make 0 moves, as a is already divisible by b. You have to answer t independent test cases.
Input
The first line of the input contains one integer t (1≤t≤1e4) — the number of test cases. Then t test cases follow.
The only line of the test case contains two integers a and b (1≤a,b≤1e9).
Output
For each test case print the answer — the minimum number of moves you need to do in order to make a divisible by b.
Example
input
5
10 4
13 9
100 13
123 456
92 46
output
2
5
4
333
0
本博客给出本题截图：
题意：输入两个数a和b，问a需要加多少才能变成b的倍数
AC代码
#include <cstdio> using namespace std; int main() { int t; scanf("%d", &t); while (t -- ) { int a, b; scanf("%d%d", &a, &b); int t = a % b; if (!t) puts("0"); else printf("%d\n", b - t); } return 0; }
总结
水题，不解释
