ProblemSolve_cf/1617B_ GCD_Problem.cpp at main · SRIJONDEY/ProblemSolve_cf · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
#include<bits/stdc++.h>
using namespace std;

void solve(){
    int n;
    cin>>n;

    int m = n - 1;
    int a = 2;

    while(std::gcd(m, a) > 1){
        a++;
    }

    cout << a << " " << m - a << " " << 1 << "\n";
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t;
    cin>>t;
    while(t--){
        solve();
    }
}