C. Product of Three Numbers----思维(稍水)

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
inputCopy
5
64
32
97
2
12345
outputCopy
YES
2 4 8
NO
NO
NO
YES
3 5 823

解析: abc=n，我们a*b看成一个整体为d,求出d后,只要n/d即可

#include<bits/stdc++.h>
using namespace std;
int n,x;
vector<int> v;
map<int,int> mp;
int main()
{
	cin>>n;
	while(n--)
	{
		cin>>x;
		v.clear();
		int t;
		for(int i=2;i<=sqrt(x);i++)
		{
			if(x%i==0) 
			{
				v.push_back(i);
				x/=i;
			}
			if(v.size()==2) break;
		}
		if(v.size()==2)
		{
			v.push_back(x);
			if(v[0]!=v[1]&&v[1]!=v[2])
			{
				cout<<"YES"<<endl;
				cout<<v[0]<<" "<<v[1]<<" "<<v[2]<<endl;
			}
			else
			{
				cout<<"NO"<<endl;
			}
		}
		else cout<<"NO"<<endl;
	}
}