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 Java8 (OpenJDK 1.8.0) (judge verdict: Runtime Error)

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int masu[][] = new int[3][3];
		String line1[] = sc.nextLine().split(" ");
		String line2[] = sc.nextLine().split(" ");
		String line3[] = sc.nextLine().split(" ");
		int intline1[] = new int[3];
		int intline2[] = new int[3];
		int intline3[] = new int[3];
		for (int i = 0; i < 3; i++) {
			intline1[i] = Integer.parseInt(line1[i]);
			intline2[i] = Integer.parseInt(line2[i]);
			intline3[i] = Integer.parseInt(line3[i]);
		}
		boolean tate = intline1[0] - intline2[0] == intline1[1] - intline2[1] &&
				intline1[1] - intline2[1] == intline1[2] - intline2[2];
		boolean yoko = intline1[0] - intline1[1] == intline2[0] - intline2[1] &&
				intline2[0] - intline2[1] == intline3[0] - intline3[1];
		if(tate && yoko) {
			System.out.println("yes");
		}else {
			System.out.println("no");
		}
	}
}