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# (Mono 4.6.2.0) (judge verdict: Runtime Error)

using System;
using System.Collections.Generic;
using System.Linq;

namespace atcoder
{
    class Program
    {
        static void Main(string[] args)
        {
            int N = int.Parse(Console.ReadLine());
            string[] input = Console.ReadLine().Split(' ');
            var a_list = new List<int>();
            foreach(string str in input){
                a_list.Add(int.Parse(str));
            }
            
            int AliceScore = 0;
            int BobScore = 0;
            while(true){
                //Alice
                int AliceMax = a_list.Max();
                a_list.RemoveAt(a_list.IndexOf(AliceMax));//IndexOf returns first position
                AliceScore += AliceMax;
                if(a_list.Count!=0) break;
                //Bob
                int BobMax = a_list.Max();
                a_list.RemoveAt(a_list.IndexOf(BobMax));//IndexOf returns first position
                BobScore += BobMax;
                if(a_list.Count!=0) break;
            }
            Console.WriteLine(AliceScore-BobScore);
        }
    }
}