Algorithm
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≤t≤2⋅104) — 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≤x,y,z≤109).
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≤a,b,c≤109) in the second line. You can print a, b and c in any order.
5 3 2 3 100 100 100 50 49 49 10 30 20 1 1000000000 1000000000
YES 3 2 1 YES 100 100 100 NO NO YES 1 1 1000000000
Code Examples
#1 Code Example with C++ Programming
Code -
C++ Programming
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define debug(n) cout<<(n)<<endl;
const ll INF = 2e18 + 99;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin>>t;
while(t--){
int a[3];
cin>>a[0]>>a[1]>>a[2];
sort(a, a + 3, greater<int>());
if(a[0] == a[1]){
cout<<"YES"<<endl;
cout<<a[0]<<" "<<a[2]<<" "<<a[2]<<endl;
continue;
}
cout<<"NO"<<endl;
}
}Input
3 2 3
100 100 100
50 49 49
10 30 20
1 1000000000 1000000000
Output
3 2 1
YES
100 100 100
NO
NO
YES
1 1 1000000000
Demonstration
Codeforcess solution 1385-A A. Three Pairwise Maximums ,C++, Java, Js and Python,1385-A,Codeforcess solution