C. Beautiful Numbers

time limit per test

 2 seconds

memory limit per test

 256 megabytes

input

 standard input

output

 standard 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, number111 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).

Sample test(s)

input

1 3 3

output

1

input

2 3 10

output

165

题目的意思就是给你两个数字，a和b，然后给出目标数字的位数n，然后一个n位数是又a,b两种数字构成，那么这个数就是good，然后这个数的每一位加起来构成新的一个数，并且新数也是一个good数，那么称原数为excell.求总个数mod1000000007 

结题思路：首先枚举a的个数，b的个数为n-i，可以合成一个新的数，判断这个数，如果为good，那么ans+=c(n,i)；

假如我们要求(a/b) mod p且无法直接求得a/b的值时，我们可以求出b对p的乘法逆元inv，那么(a/b) mod p=(a*inv) mod p;

费马小定理： x与x^(p-2)互为逆元（p是质数）其中求幂运算用到快速二分幂，注意取模问题.

#include<stdio.h>
long long a,b,n;
long long fun[1000007]={1,1};
int check(long long x)
{
    while(x>0)
    {
        long long temp=x%10;
        if(temp!=a&&temp!=b)
            return 0;
        x=x/10;
    }
    return 1;
}
long long quick(long long x,long long m)//快速二分幂 x^m
{
    long long ans=1;
    while(m)
    {
        if(m%2==1)
            ans=((ans%1000000007)*(x%1000000007))%1000000007;
        x=((x%1000000007)*(x%1000000007))%1000000007;
        m=m/2;
    }
    return ans;
}
int main()
{
    for(int i=2;i<=1000007;i++)
        fun[i]=(fun[i-1]%1000000007)*(i%1000000007)%1000000007;
    while(scanf("%lld%lld%lld",&a,&b,&n)!=EOF)
    {
        long long ans=0;
        for(long long i=0;i<=n;i++)
        {
            long long sum=i*a+b*(n-i);
            if(check(sum)==1)
            {
                long long c=((fun[n-i]%1000000007)*(fun[i]%1000000007))%1000000007;
                ans=((ans%1000000007)+((fun[n]%1000000007)*(quick(c,1000000005)%1000000007)%1000000007))%1000000007;
            }
        }
        printf("%lld\n",ans);
    }
return 0;
}