EQUATION : Ax + By + Cz = N ( 1 <= A , B , C <= 200 , 1 <= N <= 10 ^ 18) Count solution (x , y , z) such that x >= 0 , y >= 0 , z >= 0 Result % MOD (MOD <= 10 ^ 9 + 9 )
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
EQUATION : Ax + By + Cz = N ( 1 <= A , B , C <= 200 , 1 <= N <= 10 ^ 18) Count solution (x , y , z) such that x >= 0 , y >= 0 , z >= 0 Result % MOD (MOD <= 10 ^ 9 + 9 )
| Name |
|---|



Can you share link to the problem, or minimum value of
A, B, C?Can we assume
1<=A,B,C<=200?If gcd(A, B, C) doesn't divide N, there is no solution. I didn't solved the problem, but I think approaching from Bezout's Identity is good way.