This repository was archived by the owner on Feb 22, 2026. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAdvantage.c
More file actions
73 lines (67 loc) Β· 1.36 KB
/
Advantage.c
File metadata and controls
73 lines (67 loc) Β· 1.36 KB
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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
// Hazart Ali
// University Of Scholars
#include<stdio.h>
#include<string.h>
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int n,max,max2;
scanf("%d ",&n);
int A[n];
for(int i=0; i<n; i++)
scanf("%d",&A[i]);
int unq=A[0],flag=1;
for(int i=1; i<n; i++)
{
if(unq!=A[i])
{
flag=0;
break;
}
}
if(flag==1)
{
for(int i=0; i<n; i++)
printf("0 ");
printf("\0");
continue;
}
else
{
if(A[0]>A[1])
{
max=A[0];
max2=A[1];
}
else
{
max=A[1];
max2=A[0];
}
for(int i=2; i<n; i++ )
{
if(A[i]>max)
{
max2=max;
max=A[i];
}
else if(A[i]>max2)
{
max2=A[i];
}
}
for(int i=0; i<n; i++)
{
if(A[i]!=max)
printf("%d ",A[i]-max);
else
printf("%d ",max-max2);
}
printf("\n");
}
}
return 0;
}