Submission #1819977

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;
long n,t,a[12],cs,c,d,m,kq;
int main()
{
    cin >> t;
    while (t--){
        cin >> m >> n;
        cs=0;c=n;kq=0;d=0;
        for (int i=1;i<=10;i++) a[i]=0;
        if (m==1){
            cout << n << endl;
            continue;
        }
        while (c!=0){
            a[++cs]=c%2;
            c=c/2;
        }
        for (int i=7;i>=1;i--){
            if (a[i]==0) d=d+pow(2,i-1);
        }
        if (m%2==0) kq=127*(m-1)+d;
        else kq=127*(m-1)+n;
        cout << kq << endl;
    }
    return 0;
}

Submission Info

Judge Result