Solution to the problem number OLOLO of Spoj - OLOLO.

Any questions do not hesitate to contact.

#include<bits/stdc++.h>
 
int main()
{
    long long n, i, num, result = 0;
    scanf("%lld", &n);
    for(i=0; i< n; i++)
    {
        scanf("%lld", &num);
        result = result ^ num;
    }
    printf("%lld\n", result);
    return 0;
} 

Don't miss anything.

Keep in touch with Isaac Lozano Osorio!