最新文章专题视频专题问答1问答10问答100问答1000问答2000关键字专题1关键字专题50关键字专题500关键字专题1500TAG最新视频文章推荐1 推荐3 推荐5 推荐7 推荐9 推荐11 推荐13 推荐15 推荐17 推荐19 推荐21 推荐23 推荐25 推荐27 推荐29 推荐31 推荐33 推荐35 推荐37视频文章20视频文章30视频文章40视频文章50视频文章60 视频文章70视频文章80视频文章90视频文章100视频文章120视频文章140 视频2关键字专题关键字专题tag2tag3文章专题文章专题2文章索引1文章索引2文章索引3文章索引4文章索引5123456789101112131415文章专题3
当前位置: 首页 - 科技 - 知识百科 - 正文

CodeforcesRound#273(Div.2)AInitialBet_html/css

来源:动视网 责编:小采 时间:2020-11-27 15:56:36
文档

CodeforcesRound#273(Div.2)AInitialBet_html/css

CodeforcesRound#273(Div.2)AInitialBet_html/css_WEB-ITnose:题目链接:Initial Bet Initial Bet time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output There
推荐度:
导读CodeforcesRound#273(Div.2)AInitialBet_html/css_WEB-ITnose:题目链接:Initial Bet Initial Bet time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output There


题目链接:Initial Bet


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 of b, then print the only value "-1" (quotes for clarity).

Sample test(s)

input

2 5 4 0 4

output

input

4 5 9 2 1

output

-1

Note

In the first sample the following sequence of operations is possible:

  1. One coin is passed from the fourth player to the second player;
  2. One coin is passed from the fourth player to the fifth player;
  3. One coin is passed from the first player to the third player;
  4. One coin is passed from the fourth player to the second player.




解题思路:水题,不解释,8分钟交题,虽然一激动少了个条件,忘记判非零了,但是还是在10分钟内出了这题,创了我的cf最快出题纪录了~~~




AC代码:

#include #include #include #include #include #include #include #include #include #include #include #include using namespace std;#define INF 0x7fffffffint main(){ #ifdef sxk freopen("in.txt","r",stdin); #endif int a,b,c,d,e; while(scanf("%d%d%d%d%d",&a,&b,&c,&d,&e)!=EOF) { int sum = a + b + c + d + e; if(sum%5 == 0 && sum) printf("%d\n", sum/5); else printf("%d\n", -1); } return 0;}

文档

CodeforcesRound#273(Div.2)AInitialBet_html/css

CodeforcesRound#273(Div.2)AInitialBet_html/css_WEB-ITnose:题目链接:Initial Bet Initial Bet time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output There
推荐度:
标签: html css web
  • 热门焦点

最新推荐

猜你喜欢

热门推荐

专题
Top