int main(){
int t,i,min,n;
// cin >> t;
fastRead(&t);
while(t--){
min = 100000000;
// cin >> n;
fastRead(&n);
int xr,tmp;
long long int sum = 0;
// cin >> xr;
fastRead(&xr);
if(xr < min)
min = xr;
sum += xr;
for(i=1;i<n;i++){
// cin >> tmp;
fastRead(&tmp);
sum += tmp;
if(tmp < min)
min = tmp;
xr ^= tmp;
}
if(!xr){
// cout << (sum-min) << endl;
printf("%lld\n",(sum-min));
}
else
// cout << "NO\n";
printf("NO\n");
}
return 0;
}
int main(){
long long int n,a,t;
t= fastRead();
while(t--){
n=fastRead();
for(long long int i=0; i< n; i++)
a= fastRead();
printf("%llu\n",(n*(n-1))>>1);
}
return 0;
}
int main(){
long long int t;
fastRead(t);
while(t>0){
long long int n;
fastRead(n);
printf("%lld\n",(2*n)+((n-1)*n/2));
t--;
}
return 0;
}
int main()
{
int t,i=0,flag = 0,len;
char c[60];
fastRead(&t);
while(t--)
{
flag = 0;
scanf("%s",c);
len = strlen(c);
for(i=0;i<len;i++)
{
if(c[i] == 'D')
{
flag =1;
}
}
if(flag)
printf("You shall not pass!\n");
else
printf("Possible\n");
}
return 0;
}
int main(){
int T,N,sum,M,i;
int arr[101];
T= fastRead();
while(T--){
N=fastRead();
for(i=0; i< N; i++) arr[i]= fastRead();
sum=0;
std::sort(arr, arr+N);
for(i=1, M=N; i< N;i++){
--M;
sum+=(arr[i]- arr[i-1])*M;
}
printf("%d\n",sum);
}
}
int main(){
int T,i,j;
int num,max;
fastRead(&T);
while(T--){
fastRead(&num);
for(i=0;i<num;i++){
for(j=0;j<=i;j++){
fastRead(&arr[i][j]);
}
}
high=0;
printf("%d\n",maxTrav(0,0,num,0));
}
return 0;
}
int main()
{
int test,n,a;
fastRead(&test);
while(test--)
{
fastRead(&n);
a=0;
while(n>0)
{
a+=n/5;
n/=5;
}
printf("%d\n",a);
}
return 0;
}
int main(){
int T,N, j;
int counter;
T= fastRead();
int *arr=new int[SIZE];
while(T--){
memset(arr, 0,sizeof(int)*SIZE);
counter=0;
N= fastRead();
for(int i=0; i< N; i++){
j= fastRead();
if(!arr[j]) counter++;
arr[j]= 1;
}
printf("%d\n",counter);
}
}
int main(){
int T,N, velocity,temp;
int arr[100002];
T= fastRead();
while(T--){
N=fastRead();
for(int i=0; i< N; i++) arr[i]= fastRead();
velocity=arr[0];
for(int i=1; i< N; i++){
temp= arr[i]+i;
if(temp > velocity){
velocity= temp;
}
}
printf("%d\n",velocity);
}
return 0;
}
int main(){
int N1,N2,N3,i,j;
std::map<int, int> map_;
int *arr= new int[50001];
N1= fastRead()+fastRead()+ fastRead();
int counter=0;
for(i=0;i< N1; i++){
N2= fastRead();
if(map_.find(N2) == map_.end())
map_[N2]=0;
map_[N2]++;
}
for(std::map<int, int>::iterator iter= map_.begin(); iter!=map_.end(); iter++)
if(iter->second >= 2)
arr[counter++]=iter->first;
printf("%d\n",counter);
for(i=0; i< counter; i++) printf("%d\n",arr[i]);
}
int main(){
int A,N,K, counter;
A=fastRead();
N=fastRead();
K=fastRead();
int *arr=(int*)malloc(sizeof(int)*100);
counter=0;
if(N>0){
N=N+1;
while(A){
arr[counter]= A%N;
A/=N;
if(counter < K)
counter++;
}
}
for(int i=0;i< K; i++)
printf("%d ",arr[i]);
printf("\n");
}
int main(){
int N,x1,x2,x3,y1,y2,y3;
N=fastRead();
int counter=0;
while(N--){
x1= fastRead(); y1= fastRead();
x2= fastRead(); y2= fastRead();
x3= fastRead(); y3= fastRead();
if(!dot(x1-x2, y1-y2, x3-x2, y3-y2) || !dot(x1-x3, y1-y3, x2-x3, y2-y3)
|| !dot(x2-x1, y2-y1, x3-x1, y3- y1))
counter++;
}
printf("%d\n",counter);
}
int main(){
char chr;
fastRead(&n);
fastRead(&m);
fastRead(&c);
update(1,c);
while(m--){
chr = getchar();
while(!(chr=='Q' || chr=='S'))
chr = getchar();
if(chr == 'Q'){
fastRead(&p);
printf("%lld\n",query(p));
}else{
fastRead(&u); fastRead(&v); fastRead(&k);
update(u,k);
update(v+1,-k);
}
}
return 0;
}
