CodeChef::FLOW017

 

#include <iostream>
using namespace std ;

int main(){
int t ;
cin >> t ;
while (t > 0){
int n[3] ;
for (int i = 0; i < 3; ++i) {
cin >> n[i];
}
int largest{INT32_MIN};
int smallest{INT32_MAX};
for (int i = 0; i < 3; ++i) {
if (n[i] > largest){
largest = n[i];
}
if (n[i] < smallest){
smallest = n[i];
}
}
for (int i = 0; i < 3; ++i) {
if (n[i] != largest and n[i] != smallest){
cout << n[i] << '\n';
}
}
t-- ;
}

return 0;
}

Comments

Popular posts from this blog

CodeChef::CSUB

Atcoder Educational Dp contest :: C vacation

How Recursion Works?