forked from krishna14kant/Data-Structures-
-
Notifications
You must be signed in to change notification settings - Fork 0
/
1593A.cpp
51 lines (48 loc) · 1.2 KB
/
1593A.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
//🎃🎃🎃😎😎😁🤓☣☣☣☣☣dark_coder☣☣☣☣☣😎😎😁🤓🎃🎃🎃
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define all(x) (x).begin(), (x).end()
#define li long long int
#define pi pair<int, int>
int main()
{
IOS int t;
cin >> t;
while (t--)
{
int a, b, c;
cin >> a >> b >> c;
int mx = max(a, max(b, c));
if((mx==a&&mx==b)||(mx==b&&mx==c)||(mx==c&&mx==a)){
a=mx-a+1;
b=mx-b+1;
c=mx-c+1;
}
else {
if (a == mx)
{
a = 0;
b = mx - b + 1;
c = mx - c + 1;
}
else if (b == mx)
{
b = 0;
c = mx - c + 1;
a = mx - a + 1;
}
else
{
c = 0;
b = mx - b + 1;
a = mx - a + 1;
}
}
cout << a << " " << b << " " << c << endl;
}
return 0;
}