lightOJ 1186 Incredible Chess

#include <iostream>#include <cstdio>const int MAX = 105;int arr1[105], arr2[105];int main(){int t, cas = 0;std::cin >> t;while (t--){int num;std::cin >> num;for (int i = 0; i != num; ++i){std::cin >> arr1[i];}for (int j = 0; j != num; ++j){std::cin >> arr2[j];}int res = arr2[0] - arr1[0] - 1;for (int i = 1; i != num; ++i){res = (res ^ (arr2[i] - arr1[i] - 1));}printf("Case %d: ", ++cas);if (res)std::cout << "white wins\n";elsestd::cout << "black wins\n";}return 0;}