package hackerrank;

import java.util.Scanner;

/**
 * https://www.hackerrank.com/challenges/sansa-and-xor
 */
public class SansaAndXOR {
    private static int sansaAndXOR(int[] array) {
        // TODO
        return 0;
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int testCases = in.nextInt();
        for (int t = 0; t < testCases; t++) {
            int n = in.nextInt();
            int[] array = new int[n];
            System.out.println(sansaAndXOR(array));
        }
    }
}

@@ -193,32 +193,253 @@
     
-// TODO%0A        return 0
+if (array.length %25 2 == 0) %7B%0A            return 0;%0A        %7D%0A        int result = 0;%0A        for (int i = 0; i %3C array.length; i++) %7B%0A            if (i %25 2 != 0) %7B%0A                result %5E= array%5Bi%5D;%0A            %7D%0A        %7D%0A        return result
 ;%0A  
@@ -643,32 +643,32 @@
 = in.nextInt();%0A
-
             int%5B
@@ -689,16 +689,113 @@
 int%5Bn%5D;%0A
+            for (int i = 0; i %3C n; i++) %7B%0A                array%5Bi%5D = in.nextInt();%0A            %7D%0A
         

Update Sansa and XOR