寒假集训_专题四题解_D - Beautiful Numbers

题目

Vitaly is a very weird man. He’s got two favorite digits a and b. Vitaly calls a positive integer good, if the decimal representation of this integer only contains digits a and b. Vitaly calls a good number excellent, if the sum of its digits is a good number.

For example, let’s say that Vitaly’s favourite digits are 1 and 3, then number 12 isn’t good and numbers 13 or 311 are. Also, number 111 is excellent and number 11 isn’t.

Now Vitaly is wondering, how many excellent numbers of length exactly n are there. As this number can be rather large, he asks you to count the remainder after dividing it by 1000000007 (109 + 7).

A number’s length is the number of digits in its decimal representation without leading zeroes.

Input
The first line contains three integers: a, b, n (1 ≤ a < b ≤ 9, 1 ≤ n ≤ 106).

Output
Print a single integer — the answer to the problem modulo 1000000007 (109 + 7).

Examples
Input
1 3 3
Output
1
Input
2 3 10
Output
165

题目大意

beautiful number定义：给定两个个位数a、b，若x全由a、b组成且x各各位数之和也全由a、b组成，则x为beautiful number，求位数为n的beautiful number

题解

通过分析可以知道若n位中有k位为a，则剩下（n-k）位为b，总和为k*a+(n-k)*b，其中有C（n，k）个，枚举每个k即得答案

代码

#include <iostream>
using namespace std;
typedef long long LL;
const int mod = 1e9+7, N = 1e6 + 10;
int n,t,d, fact[N], infact[N];
bool check(int x,int a, int b)
{
	while(x)
	{
		int tmp = x % 10;
		if(tmp!=a&&tmp!=b)return false;
		x /= 10;
	}
	return true;
}
int qmi(int a, int k, int p)
{
	int res = 1%p;
	while(k)
	{
		if(k&1)res = (LL)res * a %p;
		k >>= 1;
		a = (LL)a*a%p;
	}
	return res;
}
int C(int a,int b)
{
	if(b == 0)return 1;
	return (LL)fact[a]*infact[b]%mod*infact[a-b]%mod;
}
int main()
{
	int a,b;
	cin >> a >> b >> n;
	fact[0] = infact[0] = 1;
	for(int i = 1; i <= n; i ++)
	{
		fact[i] = (LL)fact[i-1]*i%mod;
		infact[i] = (LL)infact[i-1]*qmi(i,mod-2,mod)%mod;
	}
	int ans = 0;
	int l = 0, t = n;
	while(t)l++,t/=10;
	for(int k = 0; k <= n; k ++)
	if(check(k*a+(n-k)*b,a,b))
	ans = (LL)(ans + C(n,k))%mod;
	cout << ans;
	return 0;
}