HDU 5747 Aaronson [位运算]

#Description
中文题目请看
http://bestcoder.hdu.edu.cn/contests/contest_chineseproblem.php?cid=718&pid=1001
#Algorithm
把n转化为2进制，前面M位直接加一，超过M的加1<<(i - m)
#Code

#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
void solve()
{
  long long n, m;
  cin >> n >> m;
  vector<int> v;
  while (n) {
    v.push_back(n % 2);
    n /= 2;
  }
  long long ans = 0;
  for (int i = 0; i < v.size(); i++)
  if (v[i])
  {
    if (i <= m) ans += v[i]; else {
      ans += (1 << (i - m));
    }
  }
  cout << ans << endl;
}
int main()
{
  freopen("in.txt", "r", stdin);
  int t;
  scanf("%d", &t);
  while (t--) {
    solve();
  }
}