Game of Dice Gym - 101532E 折半搜索_beat our dice game an-CSDN博客

本文介绍了一种使用折半搜索算法解决特定骰子乘积问题的方法。问题要求计算不同方式的数量，使n个特殊骰子的点数乘积模1e9+7等于给定值x。通过将问题转化为配对问题并利用快速幂计算逆元来降低复杂度。

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string>
#include<string.h>
#include<map>
#define LL long long
using namespace std;
const int MOD=1e9+7;
int diec[20][10];
map<LL,int> M;
long long ans=0;
int x;
long long pow(long long x,int n)
{
    long long y=1;
    long long u=x%MOD;
    while(n)
    {
        if(n&1) y=y*u%MOD;
        n>>=1;
        u=u*u%MOD;
    }
    return y;
}
void dfs(int s,int e,int flag,long long res)
{
    if(e==s)
    {
        if(flag)
        {
            ++M[res];
        }
        else
        {
            ans+=M[x*pow(res,MOD-2)%MOD];
        }
    }
    else
    {
        for(int i=0;i<6;i++)
        {
            dfs(s+1,e,flag,res*diec[s][i]%MOD);
        }
    }
}
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        ans=0;
        M.clear();
        int n;
        scanf("%d%d",&n,&x);
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<6;j++)
            {
                scanf("%d",&diec[i][j]);
            }
        }
        dfs(0,n/2,1,1);
        dfs(n/2,n,0,1);
        cout<<ans<<endl;
    }
}

It is always fun to play with dice, here is one interesting game:

You are given n fair dice with 6 faces, the faces does not necessarily have values from 1 to 6 written on them. instead, they can have any values from 1 to 100 written on them.

Suppose you threw the n dice one after another, let us define the result of the throws as the multiplication of the numbers you get from each dice mod 10⁹ + 7.

You task is to find how many different ways you can get the result of the dice throws equal to x.

Input

The first line contains an integer T, where T is the number of test cases.

The first line of each test case contains two integers n and x (1 ≤ n ≤ 14) (0 ≤ x < 10⁹ + 7), where n is the number of the dice and x is the required result from the throws.

Then n lines follow, the i^th line contains 6 integers f_i1, f_i2, ..., f_i6 (1 ≤ f_ij ≤ 100), giving the values of i^th dice's faces.

Output

For each test case, print a single line containing how many different ways you can get the result of the dice throws equal to x

Example

Input

3
3 9
1 2 3 4 5 6
1 2 3 4 5 6
1 2 3 4 5 6
5 6
1 2 9 9 9 9
1 2 9 9 9 9
1 3 9 9 9 9
1 3 9 9 9 9
1 6 9 9 9 9
5 999999937
100 1 1 1 1 1
100 1 1 1 1 1
100 1 1 1 1 1
100 1 1 1 1 1
100 1 1 1 1 1

Output