Accepted
Code
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
void solve(int cs) {
int x;
cin >> x;
if (x % 4 == 3) cout << "0\n";
else if (x % 4 == 0) cout << x << "\n";
else if (x % 4 == 2) cout << x + 1 << "\n";
else cout << "1\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int tc = 1;
cin >> tc;
for (int cs = 1; cs <= tc; cs++) {
solve(cs);
}
return 0;
}
Information
- Submit By
- Type
- Submission
- Problem
- P1009 XOR Love
- Language
- C++20 (G++ 13.2.0)
- Submit At
- 2024-07-10 18:20:35
- Judged At
- 2024-11-11 03:28:02
- Judged By
- Score
- 100
- Total Time
- 37ms
- Peak Memory
- 1.535 MiB