【CODEFORCES】 A. Initial Bet
2017-05-01 08:24
1476 查看
A. Initial Bet
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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.
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.
Input
The input consists of a single line containing five integers c1, c2, c3, c4 and c5 —
the number of coins that the first, second, third, fourth and fifth players respectively have at the end of the game (0 ≤ c1, c2, c3, c4, c5 ≤ 100).
Output
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 ofb, then print the only value "-1"
(quotes for clarity).
Sample test(s)
input
output
input
output
Note
In the first sample the following sequence of operations is possible:
One coin is passed from the fourth player to the second player;
One coin is passed from the fourth player to the fifth player;
One coin is passed from the first player to the third player;
One coin is passed from the fourth player to the second player.
题解:加起来看能不能除5除的尽即可。
注意sum==0的时候也要输出-1。
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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.
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.
Input
The input consists of a single line containing five integers c1, c2, c3, c4 and c5 —
the number of coins that the first, second, third, fourth and fifth players respectively have at the end of the game (0 ≤ c1, c2, c3, c4, c5 ≤ 100).
Output
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 ofb, then print the only value "-1"
(quotes for clarity).
Sample test(s)
input
2 5 4 0 4
output
3
input
4 5 9 2 1
output
-1
Note
In the first sample the following sequence of operations is possible:
One coin is passed from the fourth player to the second player;
One coin is passed from the fourth player to the fifth player;
One coin is passed from the first player to the third player;
One coin is passed from the fourth player to the second player.
题解:加起来看能不能除5除的尽即可。
注意sum==0的时候也要输出-1。
#include <iostream> #include <cstring> #include <cstdio> using namespace std; int a,sum; int main() { for (int i=1;i<=5;i++) { scanf("%d",&a); sum+=a; } if (sum==0) printf("-1\n"); else if (sum%5==0) printf("%d\n",sum/5); else printf("-1\n"); return 0; }
相关文章推荐
- Codeforces-273(div2) A. Initial Bet
- 【CODEFORCES】 A. Initial Bet
- Fox And Jumping - CodeForces 510 D
- 【字典树】【贪心】Codeforces 706D Vasiliy's Multiset
- 【CodeForces】616C - The Labyrinth
- 寒假222_codeforces 290 div 2 D
- codeforces 703E
- 【CodeForces】616G - Alice, Bob, Two Teams
- Codeforces 486D Valid Sets 树形dp+计数
- Codeforces 706c dp
- Codeforces 762C Two strings
- codeforces 163A Substring and Subsequence (dp,最长公共子串变形)
- codeforces-508C -鬼吹灯(巧妙模拟)
- CodeForces 456D Elections(字典树+dp)
- codeforces 494B Obsessive String
- codeforces-Fox And Two Dots【DFS】(思维)
- CodeForces 618C 、Constellation
- codeforces 492D Vanya and Computer Game (二分)
- CodeForces 659B Qualifying Contest(选2个人参加比赛)
- codeforces-148E Porcelain