算法训练 最大最小公倍数 (C++)
#include <iostream>
using namespace std;
int main() {
long long n, ans;
cin >> n;
if(n <= 2)
ans = n;
else if(n % 2 == 1)
ans = n * (n-1) * (n-2);
else if(n % 3 == 0)
ans = (n - 1) * (n - 2) * (n - 3);
else
ans = n * (n - 1) * (n - 3);
cout << ans;
return 0;
}