NITK06  MODIFY SEQUENCE
Suppose we have a sequence of nonnegative integers, Namely a_{1}, a_{2}, ..., a_{n}. At each time we can choose one term a_{i} with 0 < i < n and we subtract 1 from both a_{i} and a_{i+1}. We wonder whether we can get a sequence of all zeros after several operations.
Input
The first line is the number of test cases T (0 < T <= 20).
The first line of each test case is a number N (0 < N <= 10000). The next line is N nonnegative integers, 0 <= a_{i} <= 10^{9}.
Output
If it can be modified into all zeros with several operations output “YES” in a single line, otherwise output “NO” instead.
Example
Input: 2 2 1 2 2 2 2 Output: NO YES
Explanation
It is clear that [1 2] can be reduced to [0 1] but no further to convert all integers to 0. Hence, the output is NO.
In second case, output is YES as [2 2] can be reduced to [1 1] and then to [0 0] in just two steps.
hide comments
sedulous_001:
20170925 17:23:50
Wrong Test cases. It is not supposed to accept the sequence 0 4 2 0 2. As it is not possible to reduce down the sequence into the one with all entries zero. But it is accepting my code which accepts this sequence. :(


up79:
20170618 11:29:56
think simple just do what question say :P 

cake_is_a_lie:
20170405 02:14:39
I wonder, what would constitute "strong" test cases? This is a very easy problem. 

srnsh:
20170112 15:05:51
Weak Test cases....wrong solution gets accepted. 

kira28:
20161208 14:48:06
AC in one go... !!


mohinem:
20161111 06:08:38
Ankit Jain teriii maa ki choot ...... aise question karega to tcs me kaise jayega ???? 

draco_nian:
20161019 13:25:29
Consider the case for n=1 :P 

minhthai:
20160125 16:15:32
nice problem, think opposite :) 

thedictator:
20151208 17:11:39
nice problem but weak test cases 

SangKuan:
20150819 09:01:56
brute force, want to know is there has other better way 
Added by:  Gaurav Jain 
Date:  20130925 
Time limit:  0.5s1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 