CSU1567: Reverse Rot（水题）

Description

A very simplistic scheme, which was used at one time to encode information, is to rotate the characters within an alphabet and rewrite them. ROT13 is the variant in which the characters A-Z are rotated 13 places, and it was a commonly used insecure scheme that attempted to "hide" data in many applications from the late 1990‘s and into the early 2000‘s.

It has been decided by Insecure Inc. to develop a product that "improves" upon this scheme by first reversing the entire string and then rotating it. As an example, if we apply this scheme to string ABCD with a reversal and rotation of 1, after the reversal we would have DCBA and then after rotating that by 1 position we have the result EDCB.

Your task is to implement this encoding scheme for strings that contain only capital letters, underscores, and periods. Rotations are to be performed using the alphabet order:

ABCDEFGHIJKLMNOPQRSTUVWXYZ_.
Note that underscore follows Z, and the period follows the underscore. Thus a forward rotation of 1 means ‘A‘ is shifted to ‘B‘, that is, ‘A‘→‘B‘, ‘B‘→‘C‘, ..., ‘Z‘→‘_‘, ‘_‘→‘.‘, and ‘.‘→‘A‘. Likewise a rotation of 3 means ‘A‘→‘D‘, ‘B‘→‘E‘, ..., ‘.‘→‘C‘.

Input

Each input line will consist of an integer N, followed by a string. N is the amount of forward rotation, such that 1 ≤ N ≤ 27. The string is the message to be encrypted, and will consist of 1 to 40 characters, using only capital letters, underscores, and periods. The end of the input will be denoted by a final line with only the number 0.

Source

#include<stdio.h>
#include<string.h>
int main()
{
    char  str[45],mod[]={"ABCDEFGHIJKLMNOPQRSTUVWXYZ_."},ch;
    int n;
    while(scanf("%d ",&n)>0&&n)
    {
        //getchar();
        scanf("%s",str);
        int len=strlen(str);
        for(int i=0,j=len-1;i<j;i++,j--)
        {
            ch=str[i]; str[i]=str[j];str[j]=ch;
        }
        for(int i=0;i<len;i++)
        {
            for(int j=0;j<28;j++)
            if(str[i]==mod[j])
            {
                if(j+n<28)
                    printf("%c",mod[j+n]);
                else
                    printf("%c",mod[j+n-28]);
            }
        }
        printf("\n");
    }
}

标签：

原文地址：http://blog.csdn.net/u010372095/article/details/44904357

CSU1567: Reverse Rot（水题）

1567: Reverse Rot

Description

Input

Output

Sample Input

Sample Output

HINT

Source