HDOJ 5650-so easy

最新推荐文章于 2021-01-02 01:10:05 发布

ccq1n

最新推荐文章于 2021-01-02 01:10:05 发布

阅读量348

点赞数

分类专栏：【竞赛习题】文章标签： HDOJ

本文链接：https://blog.csdn.net/qq_29600137/article/details/51000606

版权

【竞赛习题】专栏收录该内容

247 篇文章 0 订阅

订阅专栏

so easy

Accepts: 512

Submissions: 1601

Time Limit: 2000/1000 MS (Java/Others)

Memory Limit: 65536/65536 K (Java/Others)

Problem Description

Given an array with n integers, assume $f (S)$ as the result of executing xor operation among all the elements of set $S$ . e.g. if $S = {1,2,3}$ then $f (S) = 0$ .

your task is: calculate xor of all $f (s)$ , here $\subseteq S$ .

Input

This problem has multi test cases. First line contains a single integer $T(T≤20)T(T\leq 20)$ which represents the number of test cases. For each test case, the first line contains a single integer number $n(1≤n≤1,000)n(1\leq n \leq 1,000)$ that represents the size of the given set. then the following line consists of $n$ different integer numbers indicate elements( $≤109\leq 10^9$ ) of the given set.

Output

For each test case, print a single integer as the answer.

Sample Input

1
3
1  2  3

Sample Output

0

In the sample， $S = \{1, 2, 3\}$ , subsets of  $S$  are:  $∅\varnothing$ , {1}, {2}, {3}, {1, 2}, {1, 3}, {2, 3}, {1, 2, 3}

#include<stdio.h>
int main(){
    int t,i,n,x;
    scanf("%d",&t);
    while(t--){
        scanf("%d",&n);
        for(i=1;i<=n;i++){
            scanf("%d",&x);
        }
        if(n==1)printf("%d\n",x);
        else printf("0\n");
    }
    return 0;
}