ZOJ Problem Set - 2932 The Seven Percent Solution

本文深入探讨了URI中百分比编码的使用,特别是在处理保留字符时。通过具体示例,展示了如何将特定保留字符替换为相应的百分比编码,如空格变为%20,感叹号变为%21等。此外,提供了源代码实现,帮助读者理解编码过程。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

ZOJ Problem Set - 2932
The Seven Percent Solution

Time Limit: 1 Second      Memory Limit: 32768 KB

Uniform Resource Identifiers (or URIs) are strings like http://icpc.baylor.edu/icpc/mailto:foo@bar.orgftp://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.

CharacterEncoding
" " (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

Source: The 2007 ACM Mid-Central USA Programming Contest
SOURCE CODE:
#include<iostream>
#include
<string>
#include
<sstream>
#include
<limits>

using namespace std;

int main()
{
string s;
while(getline(cin,s) && s != "#")
{
char c;
for(int i = 0; i < s.length(); i++)
{
c
= s[i];
switch(c)
{
case ' ':
cout
<<"%20";
break;
case '!':
cout
<<"%21";
break;
case '$':
cout
<<"%24";
break;
case '%':
cout
<<"%25";
break;
case '(':
cout
<<"%28";
break;
case ')':
cout
<<"%29";
break;
case '*':
cout
<<"%2a";
break;
default:
cout
<<c;
break;
}
}
cout
<<endl;
}
return 0;
}

转载于:https://www.cnblogs.com/malloc/archive/2011/07/02/2096328.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值