HDU2719:The Seven Percent Solution
来源:互联网 发布:黑客要学什么编程语言 编辑:程序博客网 时间:2024/05/17 00:51
Problem 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
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>int main(){ char str[10000]; int i,len; while(gets(str)) { if(!strcmp(str,"#")) break; len = strlen(str); for(i = 0;i<len;i++) { if(str[i] == ' ') printf("%%20"); else if(str[i] == '!') printf("%%21"); else if(str[i] == '$') printf("%%24"); else if(str[i] == '%') printf("%%25"); else if(str[i] == '(') printf("%%28"); else if(str[i] == ')') printf("%%29"); else if(str[i] == '*') printf("%%2a"); else printf("%c",str[i]); } printf("\n"); } return 0;}
- HDU2719:The Seven Percent Solution
- the seven percent solution
- The Seven Percent Solution
- The Seven Percent Solution
- The Seven Percent Solution
- The Seven Percent Solution
- The Seven Percent Solution
- 1530. The Seven Percent Solution
- Sicily1530 The Seven Percent Solution
- POJ3650----The Seven Percent Solution
- HDU_OJ-The Seven Percent Solution
- HDU The Seven Percent Solution
- zoj 2932 The Seven Percent Solution
- poj 3650 The Seven Percent Solution
- poj 3650 The Seven Percent Solution
- ZOJ 2932 The Seven Percent Solution
- hd 2719 The Seven Percent Solution
- hdu1.2.5 The Seven Percent Solution
- 内存的基本知识
- 快速排序
- C 二维数组与指针的关系
- 合唱队形---最长上升子序列变形
- 应用百度地图逆地址解析:经纬度-->地址
- HDU2719:The Seven Percent Solution
- Jlink V8固件修复(支持MDK4.70a)
- 简单选择排序
- 系统提示是我们不能忽视的,哪怕只是警告
- TIME_WAITlinux内核优化
- strdup
- C#判断文件路径是否存在或者判断文件是否存在
- struts2中 全局性的异常处理机制
- 直接插入排序