#include <stdio.h>
int validate_checksum(int *mem, int n) {
// Write your XOR scan logic here
int j = 1, z;
if(n > 2)
{
j = *(mem + 0);
for(int i = 1; i < (n - 1); i++ )
{
z = (j ^ *(mem + i));
j = z;
/*
j = *(mem + i);
k = *(mem + (i+1));
l = j^k;
arr[i] = l;
*/
}
if(z == *(mem + (n -1)))
{
return 1;
}
//return 0;
}
else
{
if(n == 2)
{
if(*(mem + j) == *(mem + (++j)))
{
return 0;
}
return 1;
}
}
return 0;
}
int main() {
int n, arr[100];
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &arr[i]);
}
int result = validate_checksum(arr, n);
printf("%d", result);
return 0;
}Solving Approach
Input
5 10 20 30 40 60
Expected Output
0