zoukankan      html  css  js  c++  java
  • SDNU 1059.The Seven Percent Solution(水题)

    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–1000 characters long and on a line by itself, followed by a line containing only "#" that signals the end of 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
    #include <cstdio>
    #include <iostream>
    #include <cmath>
    #include <string>
    #include <cstring>
    #include <algorithm>
    #include <queue>
    using namespace std;
    #define ll long long
    
    string s;
    
    int main()
    {
        while(getline(cin, s) && s != "#")
        {
            int len = s.size();
            for(int i = 0; i<len; i++)
            {
                if(s[i] == ' ')
                    cout<<"%20";
                else if(s[i] == '!')
                    cout<<"%21";
                else if(s[i] == '$')
                    cout<<"%24";
                else if(s[i] == '%')
                    cout<<"%25";
                else if(s[i] == '(')
                    cout<<"%28";
                else if(s[i] == ')')
                    cout<<"%29";
                else if(s[i] == '*')
                    cout<<"%2a";
                else
                    cout<<s[i];
            }
            printf("
    ");
        }
        return 0;
    }
  • 相关阅读:
    Leetcode 剑指 Offer 27(二叉树的镜像)
    Leetcode 1022从根到叶的二进制之和
    Leetcode 993二叉树的堂兄弟节点
    Leetcode 965单值二叉树
    Leetcode 938 二叉搜索树的范围和
    hdu 2082 找单词
    母函数模板
    hdu 1398 Square Coins
    hdu 1085 Holding Bin-Laden Captive!
    hdu 1028 Ignatius and the Princess III
  • 原文地址:https://www.cnblogs.com/RootVount/p/10889807.html
Copyright © 2011-2022 走看看