AtCoder Beginner Contest 088
翻译中…
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.
翻译中…
样例
Input #1
2018
218
Output #1
Yes
We can pay $2018$ yen with four $500$-yen coins and $18$ $1$-yen coins, so the answer is `Yes`.
Input #2
2763
0
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.
Input #3
37
514
Output #3
Yes
题目信息
题面与样例版权归 AtCoder 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。