Codeforces--678A--Johny Likes Numbers

题目描述：
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.
输入描述:
The only line contains two integers n and k (1 ≤ n, k ≤ 109).
输出描述:
Print the smallest integer x > n, so it is divisible by the number k.
输入：
5 3
25 13
26 13
输出：
6
26
39
题意：
给定整数n和k, 找出比n大的且能被k整除的最小整数
题解：
k不断加自己，直到比n大
代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;

int main(){
    int n,k;
    while(scanf("%d%d",&n,&k)!=EOF){
        int sum = k;
        while(sum <= n){
            sum += k;
        }
        printf("%d\n",sum);
    }
    return 0;
}