1656C-C. Make Equal With Mod题解java

C. Make Equal With Mod
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
You are given an array of n non-negative integers a1,a2,…,an. You can make the following operation: choose an integer x≥2 and replace each number of the array by the remainder when dividing that number by x, that is, for all 1≤i≤n set ai to aimodx.

Determine if it is possible to make all the elements of the array equal by applying the operation zero or more times.

Input
The input consists of multiple test cases. The first line contains a single integer t (1≤t≤104) — the number of test cases. Description of the test cases follows.

The first line of each test case contains an integer n (1≤n≤105) — the length of the array.

The second line of each test case contains n integers a1,a2,…,an (0≤ai≤109) where ai is the i-th element of the array.

The sum of n for all test cases is at most 2⋅105.

Output
For each test case, print a line with YES if you can make all elements of the list equal by applying the operation. Otherwise, print NO.

You may print each letter in any case (for example, “YES”, “Yes”, “yes”, “yEs” will all be recognized as a positive answer).

输入
4
4
2 5 6 8	YES
3
1 1 1	YES
5
4 1 7 0 8	NO
4
5 9 17 5	YES

分析：该集合中不能同时存在1 与x与x+1

import java.util