Consider a sequence [Math Processing Error], where initially, [Math Processing Error] for each valid [Math Processing Error]. You may perform any number of operations on this sequence (including zero). In one operation, you should choose two valid indices [Math Processing Error] and [Math Processing Error], compute the greatest common divisor of [Math Processing Error] and [Math Processing Error] (let’s denote it by [Math Processing Error]), and change both [Math Processing Error] and [Math Processing Error] to [Math Processing Error].

You are given a sequence [Math Processing Error]. Is it possible to obtain this sequence, i.e. change [Math Processing Error] to [Math Processing Error], using the given operations?



The first line of the input contains a single integer [Math Processing Error] denoting the number of test cases. The description of [Math Processing Error] test cases follows.

The first line of each test case contains a single integer [Math Processing Error].

The second line contains [Math Processing Error] space-separated integers [Math Processing Error].


For each test case, print a single line containing the string “YES” if it is possible to obtain [Math Processing Error] or “NO” if it is impossible.



[Math Processing Error]

[Math Processing Error] for each valid [Math Processing Error]

the sum of [Math Processing Error] over all test cases does not exceed [Math Processing Error]


Subtask #1 (10 points): [Math Processing Error]

Subtask #2 (20 points): there is at most one valid index [Math Processing Error] such that [Math Processing Error]

Subtask #3 (70 points): original constraints


Example Input



1 2 2


1 2 3 2

Example Output




Example case 1: We cannot make the third element of the sequence [Math Processing Error] become [Math Processing Error].

Example case 2: We can perform one operation with [Math Processing Error], which changes the sequence [Math Processing Error] to [Math Processing Error].


March Long Challenge 2021 Solutions

April Long Challenge 2021 Solutions

Codechef Long Challenge Solutions

February Long Challenge 2021

1. Frog Sort Solution Codechef

2. Chef and Meetings Solution Codechef

3. Maximise Function Solution Codechef

4. Highest Divisor Solution Codechef

5. Cut the Cake Challenge Solution Codechef

6. Dream and the Multiverse Solution Codechef

7. Cell Shell Solution Codechef

8. Multiple Games Solution Codechef

9. Another Tree with Number Theory Solution Codechef

10. XOR Sums Solution Codechef

11. Prime Game Solution CodeChef

12. Team Name Solution Codechef

January Long Challenge 2021

November Challenge 2020 SOLUTION CodeChef

October Lunchtime 2020 CodeChef SOLUTIONS


Related :

Related :

Leave a Comment

4 + twelve =