思路:
求出n个骰子掷出点数之和为a的情况次数,对6^n求逆元再乘和为a的情况数,中间要注意取模,直接上代码,容易理解,最重要的一步就是dp就该情况出现的次数。
#include<set>
#include<map>
#include<stack>
#include<cmath>
#include<queue>
#include<vector>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include <stdio.h>
#include <string.h>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
ll dp[1005][6005];
ll ksm(ll a, ll b) {//求逆元
ll s = 1;
while (b) {
if (b & 1) {
a %= mod;
s %= mod;
s *= a;
}
a %= mod;
a *= a;
b >>= 1;
}
return s % mod;
}
void getNSumCountNotRecusion() {//dp求i个骰子掷出和为j的情况次数
memset(dp, 0, sizeof(dp));
for (int i = 1; i <= 6; i++)
dp[1][i] = 1;
for (int i = 1; i <= 1001; i++)
for (int j = 1; j <= 6006; j++)
for (int k = 1; k <= 6; k++)
dp[i][j] += dp[i - 1][j - k] % mod;
}
//快速幂模板:
ll quick(ll base, ll pow)
{
ll ret = 1;
while (pow)
{
if (pow & 1) ret = (ret * base) % mod;
base = (base * base) % mod;
pow >>= 1;
}
return ret % mod;//记得最后mod,比如mod==1的情况
}
int main() {
int t;
scanf("%d", &t);
getNSumCountNotRecusion();
while (t--)
{
int n, a;
scanf("%d%d", &n, &a);
ll q = quick(6, n);//情况总数
printf("%lld\n", (dp[n][a] * (ksm(q, mod - 2) % mod)) % mod);
}
}