题解 | #小乐乐与欧几里得#
小乐乐与欧几里得
https://www.nowcoder.com/practice/da13e0cf321e4df9acd0fdf0a433cbb0
#include<stdio.h> int main() { long long m,n = 0; long long t,r= 0; scanf("%lld %lld",&m,&n); if(m<n)// if语句是为了把m作为最大值 { t = m; m = n; n = t; } r = m%n; long long k = m*n; while(m%n != 0)//辗转相除法 { m = n; n = r; r = m%n; } printf("%lld",n+(k/n)); return 0; }