Submission #1819955

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

long long test, n, d, dem, ma[10], res;

void pt(long long x){
    dem = 0;
    long long tmp[10];
    for(long long i = 1; i <= 7; i++) tmp[i] = 0;
    while(x > 0){
        dem ++;
        tmp[dem] = x % 2;
        x = x / 2;
    }
    for(long long i = 1; i <= 7; i++) ma[i] = tmp[8 - i];
}

int main()
{
    cin >> test;
    while(test--){
        cin >> n >> d;
        pt(d);
        res = 0;
        for(long long i = 1; i <= 7; i++){
            if(n % 2 == 0){
                if(ma[i] == 0) res = res + n * pow(2, 7 - i);
                else res = res + (n - 1) * pow(2, 7 - i);
            }
            else{
                if(ma[i] == 0) res = res + (n - 1) * pow(2, 7 - i);
                else res = res + n * pow(2, 7 - i);
            }
        }
        cout << res << endl;
    }
}

Submission Info

Judge Result