/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 8ms 580.0 KiB
#2 Accepted 9ms 796.0 KiB
#3 Accepted 7ms 588.0 KiB
#4 Accepted 9ms 540.0 KiB
#5 Accepted 56ms 832.0 KiB
#6 Accepted 23ms 596.0 KiB
#7 Accepted 99ms 1.078 MiB
#8 Accepted 90ms 1.543 MiB

Code

#include<bits/stdc++.h>
using namespace std;
#define getbit(n, i) (((n) & (1LL << (i))) != 0) 
#define setbit0(n, i) ((n) & (~(1LL << (i)))) 
#define setbit1(n, i) ((n) | (1LL << (i))) 

#define ll long long
template<typename s, typename t> void smax(s &a, const t &b) {if (a<b) a=b;}
template<typename s, typename t> void smin(s &a, const t &b) {if (a>b) a=b;}
char gap = 32;

#define rng_init mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define rng_seed(x) mt19937 rng(x)
#define fill(x, y) memset(x, y, sizeof(x))
#define srt(v) sort(v.begin(), v.end())
#define rsrt(v) sort(v.rbegin(),v.rend())
#define sum_v(v) accumulate(v.begin(), v.end(), 0)
#define pb push_back
#define lll __int128_t
ll hashPrime = 1610612741;

void solve(){
    ll a;
    cin >> a;
    ll ans=0;
    if(a%4==0) ans=a;
    else if(a%4==1) ans=1;
    else if(a%4==2) ans=a+1;
    else ans = 0;
    cout << ans << endl;
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t; cin >> t;
    while(t--){
        solve();
    }
}

Information

Submit By
Type
Submission
Problem
P1009 XOR Love
Language
C++17 (G++ 13.2.0)
Submit At
2024-12-06 12:22:37
Judged At
2024-12-06 12:22:37
Judged By
Score
100
Total Time
99ms
Peak Memory
1.543 MiB