CodeForces 416A
来源:互联网 发布:hottoys淘宝店哪些靠谱 编辑:程序博客网 时间:2024/05/17 05:03
这道题,有两个错误。一个是:没有测试负数的情况;另一个也是核心错误就是MAX不应该定义成 2000000001 而应该定义成 2000000000,最后取余的时候可以用(MAX + 1)。
Wa:
#include<iostream>#include<cstdio>#include<cstring>#include<string>using namespace std;#define MAX 2000000001int nasce,num,length,Max,Min;string ope;char ans;int main(){ while(scanf("%d",&nasce) != EOF) { Min = -MAX; Max = MAX; while(nasce--) { cin >> ope >> num >> ans; if(ans == 'Y') { if(ope == ">") Min = max(++num,Min); else if(ope == "<") Max = min(--num,Max); else if(ope == ">=") Min = max(num,Min); else if(ope == "<=") Max = min(num,Max); } else { if(ope == ">") Max = min(num,Max); else if(ope == "<") Min = max(num,Min); else if(ope == ">=") Max = min(--num,Max); else if(ope == "<=") Min = max(++num,Min); } } //cout << Min << ' ' << Max << ' ' << num << endl; if(Max >= Min) cout << Min % MAX<< endl; else cout << "Impossible" << endl; } return 0;}
Ac:
#include<iostream>#include<cstdio>#include<cstring>#include<string>using namespace std;#define MAX 2000000000int nasce,num,length,Max,Min;string ope;char ans;int main(){ while(scanf("%d",&nasce) != EOF) { Min = -MAX; Max = MAX; while(nasce--) { cin >> ope >> num >> ans; if(ans == 'Y') { if(ope == ">") Min = max(++num,Min); else if(ope == "<") Max = min(--num,Max); else if(ope == ">=") Min = max(num,Min); else if(ope == "<=") Max = min(num,Max); } else { if(ope == ">") Max = min(num,Max); else if(ope == "<") Min = max(num,Min); else if(ope == ">=") Max = min(--num,Max); else if(ope == "<=") Min = max(++num,Min); } } //cout << Min << ' ' << Max << ' ' << num << endl; if(Max >= Min) cout << Min % (MAX + 1) << endl; else cout << "Impossible" << endl; } return 0;}
0 0
- CodeForces 416A
- CodeForces 416A Guess a number!
- Codeforces 416A Guess a number! 题解
- codeforces problem/416/A 二分
- 模拟 之 Codeforces 416A
- CodeForces-a
- Codeforces 903A A
- CodeForces 416B-A - Art Union-DP
- codeforces 416 A. Guess a number!(简单模拟题)
- Codeforces 416A Guess a number!(水题)
- CodeForces 18A A - Triangle
- CodeForces 133A A. HQ9+
- codeforces 651A A. Joysticks
- 【Codeforces 597A】A. Divisibility
- 【 Codeforces 615A】A. Bulbs
- A. Divisibility CodeForces 597A
- codeforces 417A A. Elimination
- CodeForces 534A A. Exam
- 在Linux中DHCP服务器的配置
- Matlab绘制自然原点坐标的坐标轴
- 相遇
- 赵雅智_ListView_BaseAdapter
- 好的产品经理需要哪些素质?
- CodeForces 416A
- Quartz2D(1)
- ICMP协议,ping和traceroute
- 汽车O2O成大风口 易到用车估值30亿美金
- 第1次实验——八皇后及N皇后问题
- BASH-数据流重导向
- 利用jquery对动态生成的文本进行求和计算
- 编程基础知识——Java相关的“编码”问题
- Oracle BI Publisher 企业版在WIN7下的安装(BI Publisher Enterprise Edition)