Type: Default 1000ms 256MiB

练8.5 幸运数

You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.

说明

A同学认为自己的幸运数是不超过NN的非负整数里能被KK整除的最大的数,你能帮他的算幸运数吗?

输入格式

输入—行,包含两个整数NN,KK(1NK2×1091 ≤N,K≤2×10^9)。

输出格式

输出—行,包含一个整数,表示幸运数。

样例

3 2
2

周六10:30

Not Attended
Status
Done
Rule
ACM/ICPC
Problem
11
Start at
2023-12-9 10:00
End at
2023-12-9 12:00
Duration
2 hour(s)
Host
Partic.
2