zoukankan      html  css  js  c++  java
  • POJ 3650:The Seven Percent Solution

    The Seven Percent Solution
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 7684   Accepted: 5159

    Description

    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

    你  离  开  了  ,  我  的  世  界  里  只  剩  下  雨  。  。  。

    #include<stdio.h>
    #include <string.h>
    int main()
    {
        char str[80];
        while(gets(str) && strcmp(str, "#") != 0)
        {
            int i, len = strlen(str);
            for(i = 0; i < len; i++)
            {
                if(str[i] == ' ')
                    printf("%%20");
                else if(str[i] == '!')
                    printf("%%21");
                else if(str[i] == '$')
                    printf("%%24");
                else if(str[i] == '%')
                    printf("%%25");
                else if(str[i] == '(')
                    printf("%%28");
                else if(str[i] == ')')
                    printf("%%29");
                else if(str[i] == '*')
                    printf("%%2a");
                else printf("%c",str[i]);
            }
            printf("
    ");
        }
        return 0;
    }

  • 相关阅读:
    450. 删除二叉搜索树中的节点
    958. 二叉树的完全性检验
    5211. 概率最大的路径(197)
    5447. 石子游戏 IV
    174. 地下城游戏
    Codeforces Round #622 (Div. 2).C2
    Codeforces Round #624 (Div. 3) F. Moving Points 题解
    竞赛头
    离散化
    线段树
  • 原文地址:https://www.cnblogs.com/im0qianqian/p/5989581.html
Copyright © 2011-2022 走看看