Product of Three Numbers

Product of Three Numbers
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
You are given one integer number n. Find three distinct integers a,b,c such that 2≤a,b,c and a⋅b⋅c=n or say that it is impossible to do it.
If there are several answers, you can print any.
You have to answer t independent test cases.
Input
The first line of the input contains one integer t (1≤t≤100) — the number of test cases.
The next n lines describe test cases. The i-th test case is given on a new line as one integer n (2≤n≤109).
Output
For each test case, print the answer on it. Print “NO” if it is impossible to represent n as a⋅b⋅c for some distinct integers a,b,c such that 2≤a,b,c.
Otherwise, print “YES” and any possible such representation.
Example
input
5
64
32
97
2
12345

output
YES
2 4 8
NO
NO
NO
YES
3 5 823

Codeforces © 2010-2019 by Mike Mirzayanov
2020-01-22 17:3

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
const int MOD = 10000007;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1.0);
const int maxn = 50;

string a;
int main()
{
    int n,t;
    cin>>t;
    while(t--){
        cin>>n;
        int fl=0;
        double si=pow((double)n,1.0/3);
        double sj=sqrt(n);

        for(int i=2;i<=si;i++)
        {
            for(int j=i+1;j<=sj;j++)
            {
                if(n%i==0){
                    int z=n/i;
                    if(z%j==0){
                        z=z/j;
                        if(i!=j&&i!=z&&z!=j)
                        {
                            fl=1;
                            printf("YES\n");
                            printf("%d %d %d\n",i,j,z);
                            break;

                        }
                    }
                }



            }
            if(fl==1)
            {
                break;
            }
        }
        if(fl==0)
            printf("NO\n");

    }


}