Time Limit: 4000/2000 MS (Java/Others)
Memory Limit: 65536/65536 K (Java/Others)
解题思路:
先手写或者打表出来一些位置的值,填写在矩阵上,之后观察这些数字的规律,发现是向左旋转了45度的杨辉三角形,那么每个位置就用组合数替代,之后观察规律发现每个位置的值是C(n+m-4,m-2),所以用在线组合数取摸的方法就可以做了。
#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<map>
#include<queue>
#include<stack>
#define INF 0x3f3f3f3f
#define c(a) memset(a,0,sizeof a)
#define C_1(a) memset(a,-1,sizeof a)
#define C_i(a) memset(a,0x3f,sizeof a)
#define rush() int t;scanf("%d",&t);while(t--)
#define ll long long
using namespace std;
const ll MOD = 1e9 + 7;
const int maxn = 1e5 + 5;
ll inv(ll a)
{
return a == 1 ? 1 : (MOD - MOD / a) * inv(MOD % a) % MOD;
}
ll C(ll n, ll m)
{
if (m < 0) return 0;
if (n < m) return 0;
if (m > n - m) m = n - m;
ll up = 1, down = 1;
for (ll i = 0; i < m; i++)
{
up = up * (n - i) % MOD;
down = down * (i + 1) % MOD;
}
return up * inv(down) % MOD;
}
int main()
{
int n, m;
while (scanf("%d%d", &n, &m) == 2)
{
cout << (C(n + m - 4, m - 2) + MOD) % MOD << endl;
}
}