Problem:
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

Solution in C (GCC 9.2.1) (judge verdict: Runtime Error)

#include<stdio.h>
int main()
{
  int i=0,j=0,k=0,tmp=0,N=0,alice=0,bob=0,ans;
  int a[100]={0};
  scanf("%d",&N);
  for(i=0;i<N;i++)
  {
    scanf("%d",&a[i]);
  }
  for(j=0;j<N;j++)
  {
  for(i=0;i<N;i++)
  {
  if(a[i]<a[i+1])
  {
    tmp=a[i];
    a[i]=a[i+1];
    a[i+1]=tmp;
  }
  }
  }
  for(i=0;i<=N;i=i+2)
  {
    alice=alice+a[i];
  }
  for(i=1;i<=N;i=i+2)
  {
   bob=bob+a[i];
  }
  ans=alice-bob;
  printf("%d",ans);
  return 0;
}