Johny Likes Numbers

链接：http://acm.hust.edu.cn/vjudge/problem/401740/origin

题目：Johny likes numbers n and k very much. Now Johny wants to find the smallest integer x greater than n, so it is divisible by the number k.

题意：给两个数a，b。求满足既是b的倍数又大于a的最小的数

分析：，这个，可以看看a对b的余数，如果不是零就加到成为b的倍数，是零的话就加b，或者直接看看a是b的几倍，然后这个倍数取整加一再乘b就保证了大于a且是b的倍数。

题解：

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <cstring>
#include <functional>
#include <cmath>
using namespace std;

int main()
{
	int n,k,x;
	//freopen("in.txt","r",stdin);
	while(~scanf("%d %d",&n,&k))
	{
		int t=n%k;
		t=k-t;
		if(t!=0)
			x=n+t;
		else 
			x=n+k;
		printf("%d\n",x);
	}
	return 0;
}