Three Pairwise Maximums
题意翻译
## 题面描述
给你三个正整数$x,y,z$。
你需要找到三个正整数$a,b,c$,使得 $x=max(a,b)$,$y=max(a,c)$,$z=max(b,c)$。
## 输入格式
第一行一个整数$t$($1≤t≤2$ ⋅ $10^4$),表示共有$t$组数据。
接下来的$t$行,每行三个正整数$x,y,z$
## 输出格式
对于每组数据,输出答案:
- 如果不存在符合要求的$a,b,c$,输出“NO”
- 如果存在符合要求的$a,b,c$,第一行输出“YES”,第二行可以用任何顺序输出$a,b,c$($1$ $\le$ $a,b,c$ $\le$$10^9$)
题目描述
You are given three positive (i.e. strictly greater than zero) integers $ x $ , $ y $ and $ z $ .
Your task is to find positive integers $ a $ , $ b $ and $ c $ such that $ x = \max(a, b) $ , $ y = \max(a, c) $ and $ z = \max(b, c) $ , or determine that it is impossible to find such $ a $ , $ b $ and $ c $ .
You have to answer $ t $ independent test cases. Print required $ a $ , $ b $ and $ c $ in any (arbitrary) order.
输入输出格式
输入格式
The first line of the input contains one integer $ t $ ( $ 1 \le t \le 2 \cdot 10^4 $ ) — the number of test cases. Then $ t $ test cases follow.
The only line of the test case contains three integers $ x $ , $ y $ , and $ z $ ( $ 1 \le x, y, z \le 10^9 $ ).
输出格式
For each test case, print the answer:
- "NO" in the only line of the output if a solution doesn't exist;
- or "YES" in the first line and any valid triple of positive integers $ a $ , $ b $ and $ c $ ( $ 1 \le a, b, c \le 10^9 $ ) in the second line. You can print $ a $ , $ b $ and $ c $ in any order.
输入输出样例
输入样例 #1
5
3 2 3
100 100 100
50 49 49
10 30 20
1 1000000000 1000000000
输出样例 #1
YES
3 2 1
YES
100 100 100
NO
NO
YES
1 1 1000000000