在一片神奇的森林里，每根竹子的高度在经过特殊的削减后会产生奇特的变化。若削减一根竹子，其高度会减少1，而其他所有竹子则会增加1。问题是，是否可能通过这样的操作使所有竹子高度一致？解题关键在于，当两根竹子高度差为偶数时，它们可以变得相同。通过逐步比较并调整相邻竹子的高度，可以判断是否能实现所有竹子等高。最终，通过判断所有竹子两两之间的高度差是否为偶数来确定答案。
In a magical forest, there exists N bamboos that don't quite get cut down the way you would expect.
Originally, the height of the ith bamboo is equal to hi. In one move, you can push down a bamboo and decrease its height by one, but this move magically causes all the other bamboos to increase in height by one.
If you can do as many moves as you like, is it possible to make all the bamboos have the same height?
Input
The first line of input is T – the number of test cases.
The first line of each test case contains an integer N (1 ≤ N ≤ 105) - the number of bamboos.
The second line contains N space-separated integers hi (1 ≤ hi ≤ 105) - the original heights of the bamboos.
Output
For each test case, output on a sing
最低0.47元/天 解锁文章
179
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
