Problem Description
Some days ago, I learned the concept of LCM (least common multiple). I've played with it for several times and I want to make a big number with it.
But I also don't want to use many numbers, so I'll choose three positive integers (they don't have to be distinct) which are not greater thann. Can you help me to find the maximum possible least common multiple of these three integers?
Input
Output
Sample Input
9
Sample Output
504
僅僅要這三個數中有兩個數是奇數一個是偶數,最小公倍數就是這三個數的積。
#include<stdio.h> int main() { long long LCM,n; while(scanf("%lld",&n)>0) { if(n==1)LCM=1; if(n==2)LCM=2; if(n>2) { if(n%2)LCM=n*(n-1)*(n-2); else { if(n*(n-1)*(n-2)/2<n*(n-1)*(n-3)) LCM=n*(n-1)*(n-3); else LCM=n*(n-1)*(n-2)/2; } } printf("%lld\n",LCM); } }
更多文章、技術交流、商務合作、聯系博主
微信掃碼或搜索:z360901061

微信掃一掃加我為好友
QQ號聯系: 360901061
您的支持是博主寫作最大的動力,如果您喜歡我的文章,感覺我的文章對您有幫助,請用微信掃描下面二維碼支持博主2元、5元、10元、20元等您想捐的金額吧,狠狠點擊下面給點支持吧,站長非常感激您!手機微信長按不能支付解決辦法:請將微信支付二維碼保存到相冊,切換到微信,然后點擊微信右上角掃一掃功能,選擇支付二維碼完成支付。
【本文對您有幫助就好】元
