How to use extended Eucledian Algorithm in this problem?

Правка en1, от Waynebot, 2019-07-07 20:29:09

Hello Everyone,
Problem link
I am trying to solve this problem But stuck at some point. I used EX. Eucledian Algorithm to check whether Solution exist or not but not able to understand how to build logic to get total number of ways. Can you help me in solving this?

Теги #math, #gcd

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский Waynebot 2019-07-07 20:30:00 15
en1 Английский Waynebot 2019-07-07 20:29:09 560 Initial revision (published)