博客
关于我
强烈建议你试试无所不能的chatGPT,快点击我
Codeforces Round #564 (Div. 2) A. Nauuo and Votes
阅读量:6478 次
发布时间:2019-06-23

本文共 1528 字,大约阅读时间需要 5 分钟。

链接:

题意:

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 xx persons who would upvote, yy persons who would downvote, and there were also another zz persons who would vote, but you don't know whether they would upvote or downvote. Note that each of the x+y+zx+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 zz 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 zz persons vote, that the results are different in the two situations.

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

思路:

x-y的绝对值大于z就有稳定的答案,想同时特判z等于0.

代码:

#include 
using namespace std;typedef long long LL;const int MAXN = 1e5 + 10;const int MOD = 1e9 + 7;int n, m, k, t;int main(){// freopen("test.in", "r", stdin); int x, y, z; cin >> x >> y >> z; if (z < abs(x - y) || z == 0) { if (x > y) cout << "+" << endl; else if (y > x) cout << "-" << endl; else cout << "0" << endl; } else cout << "?" << endl; return 0;}

  

转载于:https://www.cnblogs.com/YDDDD/p/10990861.html

你可能感兴趣的文章
SmartGit 试用过期
查看>>
c#参数传递几点小结
查看>>
python 测试驱动开发的简单例子
查看>>
设计模式:观察者模式
查看>>
JDBC中驱动加载的过程分析
查看>>
Aes 加密简单例子
查看>>
AE 线编辑
查看>>
python 回溯法 子集树模板 系列 —— 15、总结
查看>>
软件设计之UML—UML的构成[上]
查看>>
蚂蚁金服硅谷ATEC科技大会:看技术如何带来平等的机会
查看>>
[SPLEB]CodeSmith原理剖析(1)
查看>>
PSR-2:编码风格指导
查看>>
jquery跟随屏幕滚动代码
查看>>
Jquery的$命名冲突
查看>>
UITextField用法
查看>>
数据库软件架构设计些什么
查看>>
播布客老顽童MySQL DBA培训目录
查看>>
pgbouncer安装配置过程
查看>>
Redis主从切换,官方说明(中文翻译)
查看>>
win7删除SVN脚本
查看>>