AtCoder Grand Contest 025 B - RGB Coloring（组合数学+逆元）

B - RGB Coloring

---

Time limit : 2sec / Memory limit : 1024MB

Score : 700 points

Problem Statement

Takahashi has a tower which is divided into N layers. Initially, all the layers are uncolored. Takahashi is going to paint some of the layers in red, green or blue to make a beautiful tower. He defines the beauty of the tower as follows:

• The beauty of the tower is the sum of the scores of the N layers, where the score of a layer is A if the layer is painted red, A+B if the layer is painted green, B if the layer is painted blue, and 0 if the layer is uncolored.

Here, A and B are positive integer constants given beforehand. Also note that a layer may not be painted in two or more colors.

Takahashi is planning to paint the tower so that the beauty of the tower becomes exactly K. How many such ways are there to paint the tower? Find the count modulo 998244353. Two ways to paint the tower are considered different when there exists a layer that is painted in different colors, or a layer that is painted in some color in one of the ways and not in the other.

Constraints

• 1≤N≤3×105
• 1≤A,B≤3×105
• 0≤K≤18×1010
• All values in the input are integers.

---

Input

Input is given from Standard Input in the following format:

N A B K

Output

Print the number of the ways to paint tiles, modulo 998244353.

---

Sample Input 1

Copy

4 1 2 5

Sample Output 1

Copy

40

In this case, a red layer worth 1 points, a green layer worth 3 points and the blue layer worth 2 points. The beauty of the tower is 5 when we have one of the following sets of painted layers:

• 1 green, 1 blue
• 1 red, 2 blues
• 2 reds, 1 green
• 3 reds, 1 blue

The total number of the ways to produce them is 40.

---

Sample Input 2

Copy

2 5 6 0

Sample Output 2

Copy

1

The beauty of the tower is 0 only when all the layers are uncolored. Thus, the answer is 1.

---

Sample Input 3

Copy

90081 33447 90629 6391049189

Sample Output 3

Copy

577742975

题意：用a,b两个数去凑k，a,b两个数能使用的最多次数是n。问有多少种组合方法。

k的值最大为1e18，n最大是3e5。题目在求a+b的总数量，那么在保证a+b<=n的情况下，枚举一个求另一个的个数即可。最后求组合数的时候逆元处理。

代码实现：

#include<bits/stdc++.h>
#define sl(x) scanf("%lld",&x)
#define pl(x) printf("%lld\n",x) 
using namespace std;
const int N = 1e6+5;
const int mod = 998244353;
const int INF = 0x3f3f3f3f;
typedef long long ll;
ll inv(ll b)
{
	if(b == 1)
	return 1;
	return (mod-mod/b)*inv(mod%b)%mod;
}
ll fac[N];
ll C(ll n,ll m)
{
	ll t = (fac[m]*fac[n-m])%mod;
	return (fac[n]*inv(t))%mod;
}
ll ans[N][2];
int main()
{
	ll n,i,a,b,k;
	fac[0] = 1;
	fac[1] = 1;
	for(i = 2;i <= 3e5+5;i++)
	fac[i] = (fac[i-1]*i)%mod;
	sl(n);sl(a);sl(b);sl(k);
	ll cnt = 0;
	for(i = 0;i <= n;i++)
	{
		if(k-(i*a) >= 0 && (k-a*i)%b == 0 && (k-a*i)/b <= n)
		{
			ans[cnt][0] = i;
			ans[cnt++][1] = (k-a*i)/b;
		}
	}
	ll res=0;
	for(i = 0;i < cnt;i++)
	{
		res = (res+C(n,ans[i][0])*C(n,ans[i][1])%mod)%mod;
	}
	pl(res);
}