/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 14ms 560.0 KiB
#2 Accepted 25ms 580.0 KiB
#3 Accepted 17ms 568.0 KiB
#4 Accepted 21ms 552.0 KiB
#5 Accepted 176ms 872.0 KiB
#6 Accepted 44ms 620.0 KiB
#7 Accepted 267ms 1.07 MiB
#8 Accepted 243ms 1.438 MiB

Code

#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define dbg(a,b,c,d) cerr<<a<<"  "<<b<<"  "<<c<<"  "<<d<<endl;
#define kill(a) {cout<<a<<endl;continue;}
#define KILL(a) {cout<<a<<endl;return 0;}
#define debug cerr<<"Error Found"<<endl;
#define mem(a,b) memset(a,b,sizeof(a))
#define lcm(a, b) (a/__gcd(a,b))*b
#define w(t) cin>>t;while(t--)
#define pi  2 * acos(0.0)
#define endl "\n"
int t, cs = 0;
const int mxn = 2e3 + 3, mod = 1e9 + 7;

int32_t main()
{

    //fast
    w(t)
    {
        int n;
        cin >> n;
        n++;
        int ans = 0, one;
        for(int i = 0; i < 31; i++)
        {
            int a = 1<<i;
            if(a >= n)break;
            int tot_block = (n + a - 1) / a;
            int half = (tot_block + 1) / 2;
            if(!i)one = n / 2;
            else if(tot_block % 2 == 0) one = n % a;
            else one = 0;
            if(one & 1)ans += a;
        }
        cout << ans << endl;
    }
}

Information

Submit By
Type
Submission
Problem
P1009 XOR Love
Language
C++17 (G++ 13.2.0)
Submit At
2024-11-08 05:26:17
Judged At
2024-11-11 02:22:53
Judged By
Score
100
Total Time
267ms
Peak Memory
1.438 MiB