506 完美数 思维+数位 [代码源][namomo spring camp]每日一题div2

直接考虑有点难搞，仔细看他说是每个数位的和也是一个好数。
这个值从$m\ast min(a,b)$到 $m\ast max(a,b)$
也就是说我从这之间搞出来check一下就好了。
那么他们的和也就是从$m个数中选i个数为b,m-i个数为a$

//acmer mxc
#include<bits/stdc++.h>
#define mst(s,x) memset(s,x,sizeof(s));
#define sr(x) scanf("%d",&x); 
#define sr2(a,b) scanf("%d%d",&a,&b); 
#define sr3(a,b,c) scanf("%d%d%d",&a,&b,&c); 
#define f(i,a,n) for(int i=a;i<=n;i++)
#define sc(x) cout<<#x<<" : "<<x<<endl;
#define hh cout<<endl;
//#define int __int128
#define pii pair<int,int>
#define pb(x) push_back(x)
#define mk(a,b) make_pair(a,b)
#define ls(x) x<<1
#define rs(x) x<<1|1
#define fi first
#define se second
#define ll __int128
#define inf 0x3f3f3f3f
using namespace std;
inline ll read()
{
	ll x=0,w=1; char c=getchar();
	while(c<'0'||c>'9') {if(c=='-') w=-1; c=getchar();}
	while(c<='9'&&c>='0') x=(x<<1)+(x<<3)+c-'0',c=getchar();
	return w==1?x:-x;
}
inline void write(ll x)
{
	if(x>=10) write(x/10);
	putchar(x%10+'0');
}
//------------------------------------------------
#define int long long
// #define int __int128
#define LL long long
#define dd double
const int N=1e6+5;
const int mod=1e9+7;

int jc[N];
int a,b,m;
int ksm(int a,int b)
{
	int res=1;
	while(b)
	{
		if(b&1) res=res*a%mod;
		a=a*a%mod;
		b>>=1;
	}
	return res;
}

void init()
{
	int now=1;
	jc[0]=1;
	for(int i=1;i<=N;i++)
	{
		now=now*i%mod;
		jc[i]=now;
	}
}

int C(int a,int b)
{
	return jc[a]*ksm(jc[a-b],mod-2)%mod*ksm(jc[b],mod-2)%mod;
}

bool check(int mid)
{
	int temp=mid;
	int sz[11]={0};
	while(mid)
	{
		sz[mid%10]++;
		mid/=10;
	}
	for(int i=0;i<10;i++)
	{
		if(sz[i]!=0&&!(i==a||i==b)) return false;
	}
	return true;
}

int ans;
inline void solve()
{
	init();
	scanf("%lld%lld%lld",&a,&b,&m);
	for(int i=0;i<=m;i++)
	{
		int t=(m-i)*b+i*a;
		if(check(t))
		{
			ans=(ans+C(m,i))%mod;
		}
	}	
	printf("%lld",ans);
}

//------------------------------------------------
signed main()
{
	clock_t c1=clock();
#ifdef LOCAL
    freopen("in.in","r",stdin);
    freopen("out.out","w",stdout);
#endif
//==================================
    int T=1;
	// cin>>T;
	for(int i=1;i<=T;i++)
	{
		solve();
	}
//==================================
end:
    cerr<<endl<< "Time used:" << clock() - c1 << endl;
	return 0;
}