Find two positive integers mm m with the greatest common divisor of n n n.
Enter mm m n nn。
mmm, The greatest common divisor of n n n; For all data:m mm,n nn<100000010000001000000。
4 6
2
使用您的 图灵编程OJ 通用账户