GitHub repository: qianghaowork/Frogpuzzle
Primary language: C++
Description: m frogs are at the most left and n toads are at the most right. How many minium steps to completely  switch positions of frogs and toads?