-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1154B.cpp
79 lines (66 loc) · 1.14 KB
/
1154B.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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
int a[102],b[102];
cin >> n;
for(int i=0; i<n; i++)
cin >> a[i];
sort(a,a+n);
int f;
int j =0;
for(int i=0; i<n; i++)
{
if(a[i]==a[i+1])
{
f=0;
continue;
}
else
{
f=1;
b[j]=a[i];
//cout << b[j] << endl;
j++;
}
}
if(f==0)
{
b[j]=a[n-1];
//cout << b[j] << endl;
}
sort(b,b+j);
//cout << j << endl;
if(j>3)
{
cout << -1 << endl;
}
else if(j==3)
{
if((b[2]-b[1])==(b[1]-b[0]))
{
cout << b[2]-b[1] << endl;
}
else
{
cout << -1 << endl;
}
}
else if(j==2)
{
if((b[1]-b[0])%2!=0)
{
cout << b[1]-b[0] << endl;
}
else
{
cout << (b[1]-b[0]) / 2 << endl;
}
}
else if(j==1)
{
cout << 0 << endl;
}
return 0;
}