/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 2ms 540.0 KiB
#2 Accepted 3ms 540.0 KiB
#3 Accepted 2ms 540.0 KiB
#4 Accepted 2ms 540.0 KiB
#5 Accepted 12ms 916.0 KiB
#6 Accepted 4ms 628.0 KiB
#7 Accepted 17ms 924.0 KiB
#8 Accepted 20ms 1.426 MiB

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-07-10 18:20:35
Judged By
Score
100
Total Time
20ms
Peak Memory
1.426 MiB