palid_fara_recursie

#include <iostream>
#define Kmax 10
#define MOD 1000000007
using namespace std;
int c[2][Kmax];

void pdcomb(int n) /// folosesc doar doua linii (0 si 1)
{
    for(int i=0;i<=Kmax;++i)
        c[0][i]=c[1][i]=0;
    c[0][0]=c[1][0]=1; /// coloana 0
    for(int i=1;i<=n;++i)
    {
        for(int j=1;j<=i;++j)
            c[1][j]=(c[0][j]+c[0][j-1]);
        for(int k=0;k<=i;++k)
            c[0][k]=c[1][k];
    }
}

inline int P(int a,int n)
{
    int p=1;
    while(n > 0)
    {
        if(n%2==1)
            p=1LL*p*a%MOD;
        n/=2;
        a=1LL*a*a%MOD;
    }
    return p;
}

int main()
{
    int n,m,k;
    unsigned int sol;
    cin>>n;
    while(n--)
    {
        cin>>m>>k;
        if(m%2)
            ++m;
        pdcomb(k);
        if(k==1)
            cout<<1<<'\n';
        else
            if(k==2)
                cout<<P(2,m-1)%MOD<<'\n';
            else
            {
                sol=0;
                for(int i=0;k>2*i;++i)
                    sol+=(1ULL*c[1][i]*P(k-2*i,m))%MOD;
                cout<<(sol/P(2,k-1))%MOD<<'\n';
            }
    }
    return 0;
}