题解 | #小乐乐与欧几里得#
小乐乐与欧几里得
https://www.nowcoder.com/practice/da13e0cf321e4df9acd0fdf0a433cbb0
#include <stdio.h> int main() { long long m,n,t; scanf("%lld%lld",&m,&n); //scanf("%d%d",&m,&n); long long p=m*n; while(n!=0) { t=m%n; m=n; n=t; } long long max=m;//m是大的值 long long min=p/m;//这里m已经=n printf("%lld\n",max+min); //return 0; }