CF1708A.Difference Operations

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

You are given an array aa consisting of nn positive integers.

You are allowed to perform this operation any number of times (possibly, zero):

  • choose an index ii ( 2in2 \le i \le n ), and change aia_i to aiai1a_i - a_{i-1} .

Is it possible to make ai=0a_i=0 for all 2in2\le i\le n ?

输入格式

The input consists of multiple test cases. The first line contains a single integer tt ( 1t1001\le t\le 100 ) — the number of test cases. The description of the test cases follows.

The first line contains one integer nn ( 2n1002 \le n \le 100 ) — the length of array aa .

The second line contains nn integers a1,a2,,ana_1,a_2,\ldots,a_n ( 1ai1091 \le a_i \le 10^9 ).

输出格式

For each test case, print "YES" (without quotes), if it is possible to change aia_i to 00 for all 2in2 \le i \le n , and "NO" (without quotes) otherwise.

You can print letters in any case (upper or lower).

输入输出样例

  • 输入#1

    4
    2
    5 10
    3
    1 2 3
    4
    1 1 1 1
    9
    9 9 8 2 4 4 3 5 3

    输出#1

    YES
    YES
    YES
    NO

说明/提示

In the first test case, the initial array is [5,10][5,10] . You can perform 22 operations to reach the goal:

  1. Choose i=2i=2 , and the array becomes [5,5][5,5] .
  2. Choose i=2i=2 , and the array becomes [5,0][5,0] .

In the second test case, the initial array is [1,2,3][1,2,3] . You can perform 44 operations to reach the goal:

  1. Choose i=3i=3 , and the array becomes [1,2,1][1,2,1] .
  2. Choose i=2i=2 , and the array becomes [1,1,1][1,1,1] .
  3. Choose i=3i=3 , and the array becomes [1,1,0][1,1,0] .
  4. Choose i=2i=2 , and the array becomes [1,0,0][1,0,0] .

In the third test case, you can choose indices in the order 44 , 33 , 22 .

首页