Help me in solving MISSP problem

help
,
1

My issue

Chef and Dolls

Chef is fan of pairs and he likes all things that come in pairs. He even has a doll collection in which the dolls come in pairs. One day while going through his collection he found that there are odd number of dolls. Someone had stolen a doll!!!

Help chef find which type of doll is missing…

Input
The first line contains an integer T, the number of test cases.
The first line of each test case contains an integer N, the number of dolls.
The next N lines are the types of dolls that are left.

Output
For each test case, display the type of doll that doesn’t have a pair, in a new line.

Constraints
1<=T<=10
1<=N<=100000 (10^5)
0<=type<=100000

Sample 1:

My code

#include<stdio.h>
int main()
{
    int t,n,i;
    scanf("%d",&t);
    for(int i=0;i<t;i++){
        int a[n],countmiss=0;
        scanf("%d",&a[n]);
        for(int i=0;i<n;i++){
          if(a[i]%2==0){
              printf("%d0");
          }  
          else{
              countmiss++;
          }
          
          
        }
        printf("%d\n",countmiss);
    }
    return 0;
}

Problem Link: Chef and Dolls Practice Coding Problem

2

@amansinghydv
the logic is calculate the xor of the whole array .
plzz refer the following code

#include <bits/stdc++.h>
using namespace std;

int main() {
	// your code goes here
    int t;
    cin>>t;
    while(t--)
    {
        int n;
        cin>>n;
        int ans=0;
        while(n--)
        {
            int x;
            cin>>x;
            ans^=x;
        }
        cout<<ans<<endl;
    }
}