100880: [AtCoder]ABC088 A - Infinite Coins

Memory Limit:256 MB Time Limit:2 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

Score: $100$ points

Problem Statement

E869120 has $A$ $1$-yen coins and infinitely many $500$-yen coins.
Determine if he can pay exactly $N$ yen using only these coins.

Constraints

  • $N$ is an integer between $1$ and $10000$ (inclusive).
  • $A$ is an integer between $0$ and $1000$ (inclusive).

Input

Input is given from Standard Input in the following format:

$N$
$A$

Output

If E869120 can pay exactly $N$ yen using only his $1$-yen and $500$-yen coins, print Yes; otherwise, print No.


Sample Input 1

2018
218

Sample Output 1

Yes

We can pay $2018$ yen with four $500$-yen coins and $18$ $1$-yen coins, so the answer is Yes.


Sample Input 2

2763
0

Sample Output 2

No

When we have no $1$-yen coins, we can only pay a multiple of $500$ yen using only $500$-yen coins. Since $2763$ is not a multiple of $500$, we cannot pay this amount.


Sample Input 3

37
514

Sample Output 3

Yes

Input

题意翻译

E869120有一元硬币 $A$ 枚,500元硬币无数枚。 现在E869120需要支付 $ N $ 元,问在不找零的情况下能否付清。 输入格式: 第一行一个数 $ N $ 。 第二行一个数 $ A $ 。 输出格式: 如果可以,请输出 $Yes$ ,否则输出 $No$ 。 数据范围: $ 1≤N≤10000 $ ; $ 0≤A≤1000 $ ; $N$ , $A$ 都为整数 感谢@Panda_hu 提供的翻译

加入题单

上一题 下一题 算法标签: