Chat Group Gym - 101775A

https://cn.vjudge.net/problem/Gym-101775A

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
//#include <unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%lld",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 1e18
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

//-----------------------------------------------
const int maxn=1e5+2;
const int mod=1e9+7;

ll pow(ll x,ll n)
{
    ll ans=1;
    while(n)
    {
        if(n&1) ans=ans*x%mod;
        x=x*x%mod;
        n>>=1;
    }
    return ans;
}
ll inv[maxn+100];
void init()
{

    inv[1]=1;
    for(int i=2;i<=maxn;i++) inv[i]=inv[mod%i]*(mod-mod/i)%mod;
}

int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);

    init();
    int T;

    int cas=0;

    cin>>T;
    while(T--)
    {
        ll n;
        cin>>n;
        ll k;
        cin>>k;
        ll ans=pow(2LL,n);

        ll tmp=1;
        for(int i=0;i<k;i++)
        {
            ans=(ans-tmp+mod)%mod;
            tmp=tmp*(n-i)%mod;
            tmp=tmp*inv[i+1]%mod;
        }
        cout<<"Case #"<<++cas<<": ";
        cout<<ans<<endl;

    }



    return 0;
}