HDU.2719 The Seven Percent Solution
来源:互联网 发布:在linux执行shell 编辑:程序博客网 时间:2024/06/05 11:24
The Seven Percent Solution
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2340 Accepted Submission(s): 1682
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
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%21
http://icpc.baylor.edu/icpc/
plain_vanilla
%28%2a%2a%29
?
the%207%25%20solution
题意分析:
水,字符串的替换。按照题目要求进行替换即可。
Code:
/* Title:HDU.2719 Date:2016-9-30 Author:pengwill Blog:http://blog.csdn.net/pengwill97/ */#include<stdio.h>#include<string.h>int main(){ char ch[100]; while(gets(ch) && ch[0] != '#'){ int len = strlen(ch); int i; for(i = 0;i<len;i++){ if(ch[i] == ' '){ printf("%%20"); }else if(ch[i] == '!'){ printf("%%21"); }else if(ch[i] == '$'){ printf("%%24"); }else if(ch[i] == '%'){ printf("%%25"); } else if(ch[i] == '('){ printf("%%28"); }else if(ch[i] == ')'){ printf("%%29"); }else if(ch[i] == '*'){ printf("%%2a"); }else{ printf("%c",ch[i]); } if( i == len-1){ printf("\n"); } } } return 0;}
- hdu 2719 The Seven Percent Solution(模拟)
- HDU 2719 The Seven Percent Solution
- HDU.2719 The Seven Percent Solution
- hdu oj 2719 The Seven Percent Solution
- HDU The Seven Percent Solution
- 杭电Hdu 2719 The Seven Percent Solution
- POJ 3650 && HDU 2719 The Seven Percent Solution(水~)
- HDU 2719 The Seven Percent Solution (printf输出%25)
- HDU 1.2.3 The Seven Percent Solution
- HDU The Seven Percent Solution [Ad Hoc]
- HDU 1.2.3 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
- hd 2719 The Seven Percent Solution
- 2014 AnShan Coprime (hdu 5072) 容斥原理
- c++类和动态内存分配
- golang 建立web服务器 http包源码详解
- thinking in java 第十四章 类型信息
- leetcode193. Valid Phone Numbers
- HDU.2719 The Seven Percent Solution
- findContours出错 Debug Assertion Failed!Expression:_pFirstBlock == pHead vs2013
- Linux设置任务调度
- 116. Populating Next Right Pointers in Each Node
- 交叉编译器制作教程
- 数据结构之利用栈进行进制转换
- rcnn-->spp-net-->fast rcnn的改进
- win7 loader
- 使用CSP来辅助防御XSS