zoukankan      html  css  js  c++  java
  • ZOJ Problem Set 2932 The Seven Percent Solution

    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.

    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
    

    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;
    }

  • 相关阅读:
    Linux Bash
    grep 及正则表达式
    Linux 文件系统
    Linux 操作系统基础
    常见的磁盘I/O和网络I/O优化技巧
    NIO的工作方式
    网络I/O 工作机制
    spring Boot环境下dubbo+zookeeper的一个基础讲解与示例
    深入分析Java I/O 工作机制
    CDN工作机制和负载均衡
  • 原文地址:https://www.cnblogs.com/malloc/p/2096328.html
Copyright © 2011-2022 走看看