GCD (Greatest Common Divisor) for two 16-bit numbers

前端 未结 0 379
独厮守ぢ
独厮守ぢ 2020-12-29 00:16

The goal here is to find GCD for two 16-bit numbers stored in little-endian notation. The numbers are stored in the following memory cells:

  • first number: 0x3000
相关标签:
回答
  • 消灭零回复
提交回复
热议问题