HDU2719-字符串处理
来源:互联网 发布:合工大与宣城政府知乎 编辑:程序博客网 时间:2024/06/06 01:24
The Seven Percent Solution
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1584 Accepted Submission(s): 1140Problem Description
Uniform Resource Identifiers (or URIs) are strings like http://icpc.baylor.edu/icpc/, mailto:foo@bar.org, ftp://127.0.0.1/pub/linux, or even just readme.txt that are used to identify a resource, usually on the Internet or a local computer. Certain characters are reserved within URIs, and if a reserved character is part of an identifier then it must be percent-encoded by replacing it with a percent sign followed by two hexadecimal digits representing the ASCII code of the character. A table of seven reserved characters and their encodings is shown below. Your job is to write a program that can percent-encode a string of characters.Character Encoding" " (space) %20"!" (exclamation point) %21"$" (dollar sign) %24"%" (percent sign) %25"(" (left parenthesis) %28")" (right parenthesis) %29"*" (asterisk) %2a
Input
The input consists of one or more strings, each 1–79 characters long and on a line by itself, followed by a line containing only "#" that signals the end of the input. The character "#" is used only as an end-of-input marker and will not appear anywhere else in the input. A string may contain spaces, but not at the beginning or end of the string, and there will never be two or more consecutive spaces.
Output
For each input string, replace every occurrence of a reserved character in the table above by its percent-encoding, exactly as shown, and output the resulting string on a line by itself. Note that the percent-encoding for an asterisk is %2a (with a lowercase "a") rather than %2A (with an uppercase "A").
Sample Input
Happy Joy Joy!http://icpc.baylor.edu/icpc/plain_vanilla(**)?the 7% solution#
Sample Output
Happy%20Joy%20Joy%21http://icpc.baylor.edu/icpc/plain_vanilla%28%2a%2a%29?the%207%25%20solution
#include<stdio.h>#include<string.h>#include<stdlib.h>#define MAX 100char s[MAX];int main(){int i,j,l;while(gets(s)){l=strlen(s);if(s[0]=='#') break;for(i=0;i<l;i++){if(s[i]==' '){printf("%%20");}else if(s[i]=='!'){printf("%%21");}else if(s[i]=='$'){printf("%%24");}else if(s[i]=='%'){printf("%%25");}else if(s[i]=='('){printf("%%28");}else if(s[i]==')'){printf("%%29");}else if(s[i]=='*'){printf("%%2a");}else {printf("%c",s[i]);}}//forputs("");}//whilesystem("pause");return 0;}
0 0
- HDU2719-字符串处理
- HDU2719:The Seven Percent Solution
- 字符串处理
- 字符串处理
- 字符串处理
- 字符串处理
- 字符串处理
- 字符串处理
- 字符串处理
- 字符串处理
- 字符串处理
- 字符串处理
- 处理字符串
- 字符串处理
- 字符串处理
- 字符串处理
- 字符串处理
- 字符串处理
- Firefox浏览器访问非80端口受限的解决方法
- MSM8260 EHCI-MSM72k主控制器的状态机迁移分析
- 简单抓取豆瓣电影
- Apache Thrift - 可伸缩的跨语言服务开发框架
- android——BaseAdapter使用
- HDU2719-字符串处理
- 单元测试
- 堆和栈的区别 (转贴)
- TOJ 2644
- 1066:生成序列
- 测试驱动开发
- MSM8x60 OTG之设备控制器流程分析
- 苹果签署了协议 打开了iPhone和中国移动之间的连接
- Sphinx+Scws 搭建千万级准实时搜索&应用场景详解
原创粉丝点击
热门IT博客