Codeforces Round 564 (Div. 2)
A
Nauuo and Votes
Codeforces
800
原题
←B →
翻译中…

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 $x$ persons who would upvote, $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$ 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$ 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\le x,y,z\le100$), 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.

翻译中…

Note

翻译中…

In the first example, Nauuo would definitely get three upvotes and seven downvotes, so the only possible result is "-".

翻译中…

In the second example, no matter the person unknown downvotes or upvotes, Nauuo would get more upvotes than downvotes. So the only possible result is "+".

翻译中…

In the third example, Nauuo would definitely get one upvote and one downvote, so the only possible result is "0".

翻译中…

In the fourth example, if the only one person upvoted, the result would be "+", otherwise, the result would be "-". There are two possible results, so the result is uncertain.

翻译中…

样例

Input #1
3 7 0
Output #1
-
InputCopy OutputCopy
Input #2
2 0 1
Output #2
+
InputCopy OutputCopy
Input #3
1 1 0
Output #3
0
InputCopy OutputCopy
Input #4
0 0 1
Output #4
?
InputCopy OutputCopy
题目信息
题号
1173A
时间限制
1 s
内存限制
256 MB
标签
贪心

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。