WERTYU题析
来源:互联网 发布:动态最优化基础 答案 编辑:程序博客网 时间:2024/06/05 19:59
Poj:http://poj.org/problem?id=2538
题析:
#include <stdio.h>int main(){ int i,c; char *s = "1234567890-=qwertyuiop[]\asdfghjkl;'zxcvbnm,./";
while( ( c = getchar ( ) ) == !EOF) //读入字符串
{
for (i=1 ; s[i] && s[i]!=c ; i++) //C中<span style="color: rgb(51, 51, 51); font-family: arial; font-size: 13px; line-height: 20.020000457763672px;">非>与>或,所以 s[i] && s[i]!=c 而不是s[i]&&s[i] != c</span>
<span style="color: rgb(51, 51, 51); font-family: arial; font-size: 13px; line-height: 20.020000457763672px;"> //终止条件:s[i]</span>
<span style="color: rgb(51, 51, 51); font-family: arial; font-size: 13px; line-height: 20.020000457763672px;"> if ( s[i] ) </span>
<span style="color: rgb(51, 51, 51); font-family: arial; font-size: 13px; line-height: 20.020000457763672px;"> putchar ( s[i-1] ); </span>
<span style="color: rgb(51, 51, 51); font-family: arial; font-size: 13px; line-height: 20.020000457763672px;"> else purchar(c); //</span>
}
return 0;}
0 0
- WERTYU题析
- WERTYU
- WERTYU
- WERTYU
- WERTYU
- WERTYU
- WERTYU
- WERTYU
- WERTYU
- WERTYU
- WERTYU
- WERTYU
- WERTYU
- WERTYU
- WERTYU
- WERTYU
- WERTYU (WERTYU, UVa10082)
- 1897: WERTYU
- sql
- POJ2909&&POJ1730基础数论
- Android java.lang.SecurityException: Permission Denial: requires android.permission.CALL_PRIVILEGED
- NLP: 中文分词算法--正向最大匹配 Forward Maximum Matching
- VS2010,如何取得一幅图像中某个像素值得快捷方法and将某一点像素值改为指定值
- WERTYU题析
- Web servicer调用异常org.apache.cxf.binding.soap.SoapFault * are not understood.
- android短信数据库字段详解
- 算法导论——lec 12 平摊分析与优先队列
- android的快速开发框架集合
- 左除 代替求逆(-1)
- strust2 form标签加上validate="true"后出错,求问问题原因
- 2014.07.11 整理:整理笔记记录
- qt中如何加入图片