CodeForces - 300C Beautiful Numbers 组合数取模 卢卡斯定理 模板

GDUT 2020寒假训练 数论 D

原题链接

• D - Beautiful Numbers
• CodeForces - 300C

题目

outputstandard output
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).

样例

input

1 3 3

output
1
input

2 3 10

output
165

题目大意

给出a和b，如果一个长度为n的数字中每一位都是a或者b且所有位的数字的和也符合上述规定，则说明这个数excellent，求长度为n的excellent的数的个数

思路

首先枚举有m个a，（n-m）个b，那么这些数相加的和$sum=am+b(n-m)$，那么判断这个数sum也是仅由a和b组成的数字，那么就有$C_n^m$种方案，将方案数累计到ans中再模p即可
组合数取模
然后就是处理$C_n$