HDU4144：Bacon's Cipher

Problem Description
Bacon's cipher or the Baconian cipher is a method of steganography (a method of hiding a secret message as opposed to a true cipher) devised by Francis Bacon. A message is concealed in the presentation of text, rather than its content.
As we all know, each letter has its position in the alphabet, ‘A’ is 0, ‘B’ is 1, ‘C’ is 2…and so on. And each number can be represented in binary code, for example, 2 is ‘10’ in binary system. Then we expand the binary code to five digits by adding leading zeros, then 10 becomes 00010. Now we can use this number to encode. To simplify the question, we define the rules as below:
0 corresponds to a random uppercase letter and 1 corresponds to a random number, so after encoding, 00010 ( ‘C’ ) is transformed to ABC1D or JUG9N.
To decode, do the opposite way around.

Input
The first line contains a positive number l, represents the length of the encoded string. L<=10000 and can be divided by 5. The second line is the encoded string.
 

Output
The original string.
 

Sample Input
35
ON1E2H5Q39AK2TGIC9ERT39B2P423L8B20D

Sample Output
FLEENOW

题意：给出一串密码，字母代表0，数字代表1，每五个构成一个二进制，该二进制的值代表一个字母，求出明文

思路：水题，最近忙于考试，先A道水题来找找感觉

#include <stdio.h>
#include <string.h>

int num(char c)
{
    if(c>='A' && c<='Z')
    return 0;
    else return 1;
}

int main()
{
    int n,i,k;
    char a[10005];
    while(~scanf("%d%s",&n,a))
    {
        for(i = 0;i<n;i+=5)
        {
            k = 0;
            if(num(a[i]))
            k+=16;
            if(num(a[i+1]))
            k+=8;
            if(num(a[i+2]))
            k+=4;
            if(num(a[i+3]))
            k+=2;
            if(num(a[i+4]))
            k++;
            printf("%c",k+'A');
        }
        printf("\n");
    }

    return 0;
}

补充：软件开发 , C++ ,

上一个：C，C++中的static
下一个：模版——容器，迭代器