coejj_123's blog

Help Math Problem
By coejj_123, history, 10 years ago, In English

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 )

  • Vote: I like it
  • +15
  • Vote: I do not like it

Comments Comments (2)
| Write comment?
»
10 years ago, hide # |
 
Vote: I like it +1 Vote: I do not like it

Can you share link to the problem, or minimum value of A, B, C ?

Can we assume 1<=A,B,C<=200 ?

→ Reply
»
10 years ago, hide # |
← Rev. 2  
Vote: I like it +3 Vote: I do not like it

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.

→ Reply