UVA - 445 - Marvelous Mazes
来源:互联网 发布:汉诺塔递归算法思想 编辑:程序博客网 时间:2024/04/29 06:40
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=94&page=show_problem&problem=386
题意:根据输入的字符串,解读成迷宫信息
解题:一开始用字符串来处理,测试OK,但WA;改用字符处理,直接AC。有时问题真得用字符来处理,又简单又高效!
#include <iostream>#include <stdio.h>using namespace std;int main(){char ch;int n = 0;while ( (ch=cin.get()) != EOF ){if ( isdigit(ch) ){n += (ch-'0');} // end ifelse{if ( isalpha(ch) || ch=='*' ){if (ch == 'b') ch = ' ';while ( n-- ){cout <<ch;} // end whilen = 0;} // end ifelse{if ( ch == '!' || ch == '\n' ){cout <<endl;} // end ifelse{} // end else} // end else} // end else} // end whilereturn 0;}
0 0
- UVa 445 - Marvelous Mazes
- Uva 445 Marvelous Mazes
- UVA 445 - Marvelous Mazes
- UVA-445-Marvelous Mazes
- UVA 445 - Marvelous Mazes
- UVa 445 - Marvelous Mazes
- UVA 445 - Marvelous Mazes
- UVA:445 - Marvelous Mazes
- UVa 445 - Marvelous Mazes
- UVA - 445 - Marvelous Mazes
- UVa 445 - Marvelous Mazes
- UVa 445 Marvelous Mazes
- UVA 445 Marvelous Mazes
- UVA - 445 Marvelous Mazes
- UVA 445 Marvelous Mazes
- UVA 445 - Marvelous Mazes
- UVA - 445 Marvelous Mazes
- UVA 445 Marvelous Mazes
- BIOS、BootLoader、uboot对比
- Apache tomcat集群实现
- ADT CentOS 连接Android手机 魅族
- HDU 1428 漫步校园 (搜索 + dp)
- MFC 椭圆窗体的实现
- UVA - 445 - Marvelous Mazes
- 用lingo直接求经济批量问题的整数解
- memcache研究笔记 之 conn内存管理借鉴
- TreeFTL:Efficient RAM Management for High Performance of NAND Flash-based Storage Systems-论文注释笔记
- Dynamics CRM 2013 installation
- PHP数据库抽象层PDO操作
- solr性能优化
- 在Tomcat容器中使用struts2-json-plugin的问题
- 给超链接加onclick属性