CodeForces - 678A - A. Johny Likes Numbers

---

题目连接：http://codeforces.com/problemset/problem/678/A

题目描述

Description

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.

Input

The only line contains two integers n and k (1 ≤ n, k ≤ 10^9).

Output

Print the smallest integer x > n, so it is divisible by the number k.

Sample Input

5 3

Sample Output

6

Sample Input

25 13 

Sample Output

26

Sample Input

26 13

Sample Output

39

解题思路

题意，找到比n大，而且是k的倍数的数x，如果遍历比n大的数的话会超时，直接用公式，n/k，n为k的多少倍，然后加1，乘上k，一定比n大，而且是k的整数倍

AC代码

#include<iostream>
using namespace std;
int main () {
    int n, k;  
    scanf("%d %d", &n, &k);  
    printf("%d\n", k*(n/k+1));  
    return 0; 
}