跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F1221. Johny Likes Numbers

  • ID: 1227
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:入门
  • 上传者:
  • 模拟
  • 数学
  • 编程与模拟
  • 入门
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Johny Likes Numbers

题目描述

A. Johny Likes Numbers
time limit per test
0.5 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

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≤109).

Output

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

Examples
Input
5 3
Output
6
Input
25 13
Output
26
Input
26 13
Output
39


题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 702 题。保留原作者与原赛事署名。