CANDY - Candy I


Jennifer is a teacher in the first year of a primary school. She has gone for a trip with her class today. She has taken a packet of candies for each child. Unfortunately, the sizes of the packets are not the same.

Jennifer is afraid that each child will want to have the biggest packet of candies and this will lead to quarrels or even fights among children. She wants to avoid this. Therefore, she has decided to open all the packets, count the candies in each packet and move some candies from bigger packets to smaller ones so that each packet will contain the same number of candies. The question is how many candies she has to move.

Input specification

The input file consists of several blocks of data. Each block starts with the number of candy packets N (1<= N <=10000) followed by N integers (each less than 1000) in separate lines, giving the number of candies in each packet. After the last block of data there is the number -1.

Output specification

The output file should contain one line with the smallest number of moves for each block of data. One move consists of taking one candy from a packet and putting it into another one. If it is not possible to have the same number of candies in each packet, output the number -1.

Example

Input file:
5
1
1
1
1
6
2
3
4
-1

Output file:
4
-1

hide comments
try2catch: 2016-01-24 06:18:48

single shot AC !
watch out for array size......

sharif ullah: 2016-01-08 11:38:24

count the move of 1 candy from a packet to another one.
3
1 4 4
balance-> 3 3 3
output->2;

tejasdond: 2016-01-02 16:45:44

watch this for the logic.
https://www.youtube.com/watch?v=mcCb17d1kwk

vishu_100: 2015-12-26 12:15:10

getting segv ?look at the size of array once again...!

saurabh_1999: 2015-12-16 14:29:54

AC in one go:easy one
my 15th :)

anavgupta31: 2015-12-03 17:15:28

what will be the name of the input and output file..?

princekumar: 2015-11-29 20:19:59

a[1000] :- TLE
a[t-1] :- AC
how??
plz explain

Timmy Jose: 2015-11-23 19:30:22

@sidk2496 Thanks for the endl tip, mate. This is irksome to say the least!

sakshamnagar: 2015-10-20 10:12:41

Watch out for the segmentation error

sandy: 2015-10-01 20:53:55

nice one for beginners :)


Added by:Fudan University Problem Setters
Date:2007-12-01
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: C99 ERL JS-RHINO
Resource:IPSC 1999