A12884 | $Prime Subtraction$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

You are given two integers $x$ and $y$ (it is guaranteed that $x > y$ ). You may choose any prime integer $p$ and subtract it any number of times from $x$ . Is it possible to make $x$ equal to $y$ ? Recall that a prime number is a positive integer that has exactly two positive divisors: $1$ and this integer itself. The sequence of prime numbers starts with $2$ , $3$ , $5$ , $7$ , $11$ . Your program should solve $t$ independent test cases.

The first line contains one integer $t$ ( $1 \le t \le 1000$ ) — the number of test cases. Then $t$ lines follow, each describing a test case. Each line contains two integers $x$ and $y$ ( $1 \le y < x \le 10^{18}$ ).

For each test case, print YES if it is possible to choose a prime number $p$ and subtract it any number of times from $x$ so that $x$ becomes equal to $y$ . Otherwise, print NO. You may print every letter in any case you want (so, for example, the strings yEs, yes, Yes, and YES will all be recognized as positive answer).

输入 #1

4
100 98
42 32
1000000000000000000 1
41 40

输出 #1

YES
YES
YES
NO

C++ 编辑器

输入

输出