蓝桥杯 算法训练 ALGO-2 最大最小公倍数

#include<iostream>using namespace std;int main(){long long ans;long long n;while( scanf("%lld",&n)!=EOF ){if(n<=2){printf("%lld\n",n);}else if(n%2==1){ans=n*(n-1)*(n-2);printf("%lld\n",ans);}else{if(n%3==0){ans=(n-1)*(n-2)*(n-3);printf("%lld\n",ans);}else{ans=n*(n-1)*(n-3);printf("%lld\n",ans);}}}return 0;}