1 1 2
1

1 2 3
2

234 532 245
3

12345 87654 23456
4

1223456 8098887645 567321
4

12345 654345678 1234567890
5

Edited by author 05.07.2011 20:09

Hey Maria,
Problem states that the input, consists of 3 space-separated pairwise DISTINCT integers so your first example doesn't satisfy conditions and hence, is useless.

Regards,
Sepehr

99 8 1
3

Maria , for test number 4, I think the answer should be 3 :
First aborigine brings a pile of 75309 ( 87654-12345 ) , the second aborigine also brings a pile of 75309 stones , because that's still the biggest difference , and the third points to the two equal piles. Correct me if I'm wrong!

thanks :) got AC after testing you input and fixing the program
P.S. long in JAVA is enough!!!!

hopless dreamer,
No, u r wrong. The FIRST aborigine will bring the pile of 64198 stones, becouse it's the LEAST. And the second aborigine will bring the pile of 64198 - 23456 = 40742 stones and so on.

"Professor asked one of the aborigines to point at two piles with the MINIMAL difference of numbers of stones in them and tell what this difference is."

Edited by author 06.07.2012 18:07

Edited by author 06.07.2012 18:07

Big thx :) got AC