-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathBalife.cpp
81 lines (72 loc) · 1.15 KB
/
Balife.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
80
81
#include<stdio.h>
int num[9000];
int main()
{
int i,j,n,sum,one,res,ch,rounds;
float left[9000],right[9000];
scanf("%d",&n);
while(n!=-1)
{
sum=0;
for(i=0;i<n;i++)
{
scanf("%d",&num[i]);
sum+=num[i];
}
if(sum%n!=0)
printf("-1\n");
else
{
one = sum/n;
rounds=0;
for(int i=0;i<n;i++)
{
// if(num[i]>one)
// num[i]-=rounds;
// if(num[i]<one)
// num[i]-=rounds;
//
if(num[i]!=one)
{
if(num[i]>one)
{
if((num[i]-one)>rounds)
{
num[i+1]+=(num[i]-one);
num[i]=num[i]-rounds;
rounds+=(num[i]-one);
num[i]=one;
}
else if((num[i]-one)<=rounds)
{
//num[i]=num[i]-rounds;
num[i+1]+=(num[i]-one);
//rounds+=(num[i]-one);
num[i]=one;
}
}
if(num[i]<one)
{
if((one-num[i])>rounds)
{
num[i+1]-=(one-num[i]);
num[i]=num[i]+rounds;
rounds+=(one-num[i]);
num[i]=one;
}
else if((one-num[i])<=rounds)
{
//num[i]=num[i]-rounds;
num[i+1]-=(one-num[i]);
//rounds+=(num[i]-one);
num[i]=one;
}
}
}
}
printf("%d\n",rounds);
}
scanf("%d",&n);
}
return 0;
}