2的多少次方,可以找找规律
#include<iostream>
#include<cstring>
#include<vector>
#include<cmath>
#include<iomanip>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
long long n,k;
cin>>n>>k;
cout<<fixed<<setprecision(0)<<pow(2,n-k)<<endl;
}
}