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-mcs 6.8.0.105) (judge verdict: Runtime Error)

/**************************************************
 * Atcoder problems
 * Contest No :088
 * Problem No :B
 * File Name  :program.cs
 * Create date:2020/06/27
 *
 * Copyright 2020 Shunichi Sato,All Rights Reserved.
**************************************************/
//memo terinal command
//compile:mcs program.cs
//excute :mono program.exe
using System;
using System.Linq;
using System.Collections.Generic;
class Program
{
    static void Main(string[] args)
    {
        // 個数の入力
        int N = int.Parse(Console.ReadLine());
        string[] input = Console.ReadLine().Split(' ');
        var list = new List<int>();
        for(int i = 1; i <= N;i++){
            list.Add(int.Parse(input[i-1]));
        }
        list.Sort((a, b) => b - a);

        int Alice = 0;
        int Bob = 0;
        // 計算
        for (int i = 1; i <= N; i++){
            if ( i % 2 ==  0)
            {
                Alice += list[i - 1];
            }
            else
            {
                Bob += list[i - 1];
            }
        }
        //出力
        Console.WriteLine(Bob - Alice);
    }
}