POJ 3650 The Seven Percent Solution
来源:互联网 发布:工业大数据 智能制造 编辑:程序博客网 时间:2024/05/24 01:23
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.
CharacterEncoding" " (space)%20"!" (exclamation point)%21"$" (dollar sign)%24"%" (percent sign)%25"(" (left parenthesis)%28")" (right parenthesis)%29"*" (asterisk)%2aInput
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
这道题也是一道水题,直接遍历数组,遇到要求变化的字符就输出相应的字符。其他字符就原样输出。
AC代码:
#include<iostream>#include<algorithm>#include<cstring>#include<cstdio>using namespace std;int main(){char a[1111];while(gets(a)){if(a[0]=='#')break;for(int i=0;a[i];i++){if(a[i]==' ')cout<<"%20";else if(a[i]=='!')cout<<"%21";else if(a[i]=='$')cout<<"%24";else if(a[i]=='%')cout<<"%25";else if(a[i]=='(')cout<<"%28";else if(a[i]==')')cout<<"%29";else if(a[i]=='*')cout<<"%2a";elsecout<<a[i];}cout<<endl;}return 0;}
- poj 3650 The Seven Percent Solution
- poj 3650 The Seven Percent Solution
- POJ 3650:The Seven Percent Solution
- POJ 3650 The Seven Percent Solution G++
- POJ 3650 The Seven Percent Solution
- POJ 3650 The Seven Percent Solution
- poj 3650 The Seven Percent Solution
- POJ 3650 && HDU 2719 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
- HDU2719:The Seven Percent Solution
- POJ3650----The Seven Percent Solution
- 学习日记6
- 写一个函数满足:给定一个int list a,满足a[i+1]>=a[i],给定int key,找出list a中第一个大于等于key的元素的index,无满足要求的元素则返回-1.
- 数据库优化策略小结
- POJ
- Python 常用技巧(待续)
- POJ 3650 The Seven Percent Solution
- 解决点击edittext时有时无法弹出软键盘的问题
- 算法——冒泡排序
- 开此博客记录自己的学习笔记
- Prime Time 暴力打表
- HDUOJ 1027 Ignatius and the Princess II(next_permutation)
- sql带条件查找最小缺失编号
- 从基础出发:统计学习方法三要素
- Java之字符串String,StringBuffer,StringBuilder