微信公众号搜"智元新知"关注
微信扫一扫可直接关注哦!

Codeforces Round #564 (Div. 2)A

A. Nauuo and Votes

题目链接http://codeforces.com/contest/1173/problem/A

题目

Nauuo is a girl who loves writing comments.

One day,she posted a comment on Codeforces,wondering whether she would get upVotes or downVotes.

It‘s kNown that there were xpersons who would upVote,yy  y persons who would downVote,and there were also another z persons who would Vote,but you don‘t kNow whether they would upVote or downVote. Note that each of the x+y+z people would Vote exactly one time.

There are three different results: if there are more people upVote than downVote,the result will be "+"; if there are more people downVote than upVote,the result will be "-"; otherwise the result will be "0".

Because of the z z   unkNown persons,the result may be uncertain (i.e. there are more than one possible results). More formally,the result is uncertain if and only if there exist two different situations of how the z  z    persons Vote,that the results are different in the two situations.

Tell Nauuo the result or report that the result is uncertain.

 

Input

 

The only line contains three integers x,y,z(0=<x,z<=100) x,corresponding to the number of persons who would upVote,downVote or unkNown.

Output

 

If there is only one possible result,print the result : "+","-" or "0".

 

Otherwise,print "?" to report that the result is uncertain.

Example

intput

3 7 0

output

-

题意

There are there numbers ,they are x,y and z.   you can give z to x and y,

if x are the most,you can output "+",

if y are the most,you can output "-",

if you are not sure which are the most,you should output "?".

思路

it‘s a easy problem,you can compare  a and b+c,b and a+c.

 

#include<bits/stdc++.h>
using namespace std;
int main()
{

    int a,b,c;
    while(cin>>a>>b>>c)
    {
        if(a==b&&c==0)
            cout<<0<<endl;
        else if(a>b+c)
            cout<<"+"<<endl;
        else if(b>a+c)
            cout<<"-"<<endl;
        else
            cout<<"?"<<endl;
    }
    return 0;
}

版权声明:本文内容由互联网用户自发贡献,该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容, 请发送邮件至 dio@foxmail.com 举报,一经查实,本站将立刻删除。