URAL 1642 1D Maze
来源:互联网 发布:淘宝宝贝编辑教程 编辑:程序博客网 时间:2024/05/22 04:58
题目链接:点击打开链接
#include <cstdio>int main() {int n, s, x;while(~scanf("%d%d", &n, &s)) {int l = - 1000, r = 1000;for(int i = 0; i < n; i ++) {scanf("%d", &x);if(x < 0 && x > l) l = x;if(x > 0 && x < r) r = x;}if(l > s || r < s) puts("Impossible");else {if(s > 0) printf("%d %d\n", s, l*(-2)+s);else printf("%d %d\n", r*2-s, -s);}}return 0;}
0 0
- URAL 1642 1D Maze
- 1D Maze
- CodeForces 404E Maze 1D
- Timus 1642. 1D Maze迷宫
- URAL 1386 Maze 解题报告
- URAL 1386 Maze 简单模拟
- codeforces413E Maze 2D
- CF237 E 404E - Maze 1D(二分)
- Codeforces Round #237 (Div. 2) E. Maze 1D
- Problem D. Cross the maze
- <Google>Problem D. Dragon Maze
- CODEFORCES 197D Infinite Maze
- [题解]codeforces413e Maze 2D
- Problem D:Cross the maze google 2014
- CodeForces 413E Maze 2D
- codeforces 197D Infinite Maze dfs
- codeforces 715D. Create a Maze
- CF413E Maze 2D(线段树)
- 简单的Springmvc基于注解
- Telnet无需验证直接关闭Tomcat
- URAL 1641 Duties
- Gray Code [leetcode]
- 【iOS开发-19】遇到Apple Mach-O Linker Error的情况和解决办法,调整你打开的姿势
- URAL 1642 1D Maze
- 2014 ACM/ICPC Asia Regional Shanghai Online 1009
- URAL 1643 Attack of the Dark Fortress BFS
- Java include指令 使用示例
- js中eval的一个使用示例
- RAC监听日志与CRS日志 及常用命令
- hdu 5045 Contest (状压DP)
- android网络编程之post提交数据
- HDU5044--Tree(树链剖分)