478A.md (1678B)
1 Source: https://codeforces.com/problemset/problem/478/A 2 3 A. Initial Bet 4 5 time limit per test 6 7 1 second 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 stdin 16 17 output 18 19 stdout 20 21 There are five people playing a game called "Generosity". Each person gives some non-zero number of coins *b* as an initial bet. After all players make their bets of *b* coins, the following operation is repeated for several times: a coin is passed from one player to some other player. 22 23 Your task is to write a program that can, given the number of coins each player has at the end of the game, determine the size *b* of the initial bet or find out that such outcome of the game cannot be obtained for any positive number of coins *b* in the initial bet. 24 25 Input 26 27 The input consists of a single line containing five integers *c*1, *c*2, *c*3, *c*4 and *c*5 — the number of coins that the first, second, third, fourth and fifth players respectively have at the end of the game (0 ≤ *c*1, *c*2, *c*3, *c*4, *c*5 ≤ 100). 28 29 Output 30 31 Print the only line containing a single positive integer *b* — the number of coins in the initial bet of each player. If there is no such value of *b*, then print the only value "-1" (quotes for clarity). 32 33 Examples 34 35 Input 36 37 ``` 38 2 5 4 0 4 39 ``` 40 41 Output 42 43 ``` 44 3 45 ``` 46 47 Input 48 49 ``` 50 4 5 9 2 1 51 ``` 52 53 Output 54 55 ``` 56 -1 57 ``` 58 59 Note 60 61 In the first sample the following sequence of operations is possible: 62 63 1. One coin is passed from the fourth player to the second player; 64 2. One coin is passed from the fourth player to the fifth player; 65 3. One coin is passed from the first player to the third player; 66 4. One coin is passed from the fourth player to the second player.