URAL 1893
2017-05-22 20:12
197 查看
#include <string> #include <iostream> #include <cstdio> using namespace std; int main() { int a; char c; while(scanf("%d%c",&a,&c)!=EOF) { if(a==1||a==2) { if(c=='A'||c=='D') { printf("window\n"); } else if(c=='B'||c=='C') { printf("aisle\n"); } else { printf("neither\n"); } } else if(a>=3&&a<=20) { if(c=='A'||c=='F') { printf("window\n"); } else if(c>='B'&&c<='E') { printf("aisle\n"); } else { printf("neither\n"); } } else if(a>=21&&a<=65) { if(c=='A'||c=='K') { printf("window\n"); } else if(c=='C'||c=='D'||c=='G'||c=='H') { printf("aisle\n"); } else { printf("neither\n"); } } } return 0; }
相关文章推荐
- A380 URAL - 1893
- CJOJ 1976 二叉苹果树 / URAL 1018 Binary Apple Tree
- ural1009(动态规划)
- URAL - 1004 Sightseeing Trip(最小环)
- Amount of Degrees URAL - 1057 数位dp
- ural1223 鹰蛋(dp优化)
- Ural-1076 Trash(最小费用最大流算法)
- Ural 1277 Cops and Thieves(最小点割集/最小割)
- Ural 1028 Stars(树状数组)
- URAL 1032 A - Find a Multiple——抽屉原理+构造
- URAL - 1036 Lucky Tickets(DP+大数)
- URAL1947 Meander 思路
- Ural 1416 Confidential
- ural1297
- E - Buttons URAL - 1023
- URAL 1001. Reverse root
- [URAL 1147][USACO rect1]Shaping Regions(矩形切割)
- Ural 1280. Topological Sorting
- ural 1002 phone numbers
- ural 1033 Labyrinth