Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"managingGroups":{},"author":"18liyong","updateTime":1555932536000,"title":"两个整数的最小公倍数等于两整数之积除以最大公约数","dislikeCnt":0,"content":"```\n#include \u003ciostream\u003e\n\nusing namespace std;\nint gcd(int x,int y);\nint main()\n{\n int a\u003d12,b\u003d16;\n int t\u003dgcd(a,b);//最大公约数\n int k\u003d(a*b)/t;//最小公倍数\n cout\u003c\u003ct\u003c\u003cends\u003c\u003ck\u003c\u003cendl;\n return 0;\n}\nint gcd(int x,int y)\n{\n int mi\u003dmin(x,y);\n int ma\u003dmax(x,y);\n if(ma%mi\u003d\u003d0)\n return mi;\n else\n return gcd(mi,ma%mi);\n}\n\n``` ","threadId":46769,"likeCnt":1,"createTime":1555931119000,"isWorkbook":false,"viewCnt":1696,"openness":2,"fav":false,"id":1061,"trustable":false}