235A - LCM Challenge - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long
using ll = long long;
using vb = vector<bool>;
using vvb = vector<vb>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vc = vector<char>;
using vvc = vector<vc>;
using vs = vector<string>;
#define mp make_pair
#define fi first
#define se second
#define fr(n) for(int i=0;i<n;i++)
#define fri(n) for(int i=1;i<=n;i++)
#define pb push_back
#define max(a,b) ((a)>(b)? (a):(b))
#define min(a,b) ((a)<(b)? (a):(b))
#define all(v) v.begin(),v.end()
#define rall(x) (x).rbegin(), (x).rend()


#define N 2e5 + 5
const int MAXN = 500005;
const int MOD = 1e9+7;



// int dfs(int node,int prev,vi &dist)
// {
//     visited[node]=true;
//     int next=0;
//     for(auto i: tree[node])
//     {
//         if(!visited[i])
//             next+=dfs(i,prev+1,dist);
//     }
//     dist.push_back(prev-next);
//     return next+1;
// }



int lcm(int a, int b){
    return (a*b)/__gcd(a,b); 
}


 void solve(){
    int n;
    cin>>n;
    if(n==1){
        cout<<1<<endl;
        return;
    }
    if(n==2){
        cout<<2<<endl;
        return;
    }
    if(n==3){
        cout<<6<<endl;
        return;
    }

    if(n%2!=0){
        cout<<n*(n-1)*(n-2);
        return;
    }
    else{
        if(n%3==0){
            cout<<(n-1)*(n-2)*(n-3);
        }
        else{
            cout<<(n)*(n-1)*(n-3);
        }

    }
    return;


 }

signed main(){
    IOS
    #ifndef ONLINE_JUDGE
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
    #endif
    int tests;
    // cin>>tests;
    tests =1;
    while(tests--){
        solve();
    }
}