DataStructureAndAlgorithm/2023201/main.cpp

#include <stdio.h>

int main() {
    int n = 0;
    int save[32] = {0};
    int cur_num = 0;
    int digit_num = 0;
    int result = 0;
    int index = 0;
    scanf("%d", &n);
    for (int count = 0; count < 3 * n - 1; count++) {
        scanf("%d", &cur_num);
        index = 0;
        while (cur_num) {
            if (cur_num & 1) {
                save[index]++;
            }
            index++;
            cur_num /= 2;
        }
    }

    for (int i = 0; i < 32; i++) {
        if (save[i] % 3) {
            result |= 1 << i;
        }
    }

    printf("%d", result);
    return 0;
}