#1181301 (C++23) No.3663 LCM Decomposition

• 問題: No.3663 LCM Decomposition
• ユーザー: lif4635
• 提出日時: 2026-08-30 15:23:43
• 言語: C++23 (gcc 15.3.0 + boost 1.92.0)
• 結果: TLE
• 実行時間: -
• コード長: 3,568 bytes
• コンパイル時間: 4,746 ms
• コンパイル使用メモリ: 387,432 KB
• 実行使用メモリ: 6,272 KB
• 最終ジャッジ日時: 2026-08-30 15:23:58
• 合計ジャッジ時間: 8,452 ms
• ジャッジサーバーID （参考情報）: judge1_0 / judge2_1

ファイルパターン	結果
sample	AC * 1
other	AC * 8 TLE * 1 -- * 5

ソースコード

// # pragma GCC target("avx2")
// # pragma GCC optimize("O3")
// # pragma GCC optimize("unroll-loops")
#ifdef harurun
#define debug(x) cerr<<#x<<": "<<x<<endl
#else
#define debug(x)
#endif
#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
// using mint = modint1000000007;
// using mint = double;
#endif

//define
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long long , long long>;
using vi = vector<int>;
using vll = vector<long long>;

#define rep(i,l,r) for (int i = (int)(l); i < (int)(r); i++)
#define rrep(i,l,r) for (int i = (int)(r-1); i >= (int)(l); i--)
#define len(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define elif else if
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
const int inf = 1e9;
const long long infl = 1LL<<60;
const int mod = 998244353;
ll pow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
template<class T, class U> bool chmin(T& a, const U& b){ if(a > T(b)){ a = b; return 1; } return 0; }
template<class T, class U> bool chmax(T& a, const U& b){ if(a < T(b)){ a = b; return 1; } return 0; }
template <class T>
using spq = priority_queue<T, vector<T>, greater<T>>;

template<class T>istream& operator>>(istream& i, vector<T>& v) {for(int j = 0; j < (int)(v).size(); j++) i >> v[j]; return i;}
struct IoSetup {
    IoSetup() {
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(15);
    }
} iosetup;

vi div(int n){
    vi d;
    int i = 1;
    while (i * i <= n){
        if (n % i == 0){
            d.pb(i);
            if (i != n / i){
                d.pb(n / i);
            }
        }
        i++;
    }
    sort(all(d));
    return d;
}

void solve(){
    int n, l, r; cin >> n >> l >> r;
    vi ds = div(n);
    map<int, vi> d;
    map<int, int> m;
    vi ods;
    for (auto x : ds) if (l <= x and x <= r) ods.pb(x);

    for (auto a : ods){
        for (auto b : ods){
            if (a == b) continue;
            // cout << a << " " << b << endl;
            int l = lcm(a, b);
            int ml = inf;
            if (m.count(l) == 0){
                for (auto c : ds){
                    // cout << l << " " << c << " " << lcm(c, l) << " " << n << endl;
                    if (lcm(l, c) == n) chmin(ml, c);
                }
                m[l] = ml;
            }else{
                ml = m[l];
            }
            vi ok;
            if (d.count(ml) == 0){
                for (auto c : ods){
                    if (c % ml == 0) ok.pb(c);
                    if (len(ok) >= 3) break;
                }
                d[ml] = ok;
            }else{
                ok = d[ml];
            }
            
            // cout << a << " " << b << " " << ml << " " << endl;
            // for (auto e : ok) cout << e << " ";
            // cout << endl;

            for (auto c : ok){
                if (c != a and c != b){
                    vi ans = {a, b, c};
                    sort(all(ans));
                    for (auto e : ans){
                        cout << e << " ";
                    }
                    cout << endl;
                    return ;
                }
            }
        }
    }

    cout << -1 << endl;
    return ;
}


int main(){
    int t;
    cin >> t;
    // t = 1;
    while(t--) solve();
    return 0;
}