Bacon's Cipher（培根密码）

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，然后将得到的二进制数按照5个一组的规律转换成十进制进而转换成大写字母，0代表A，1代表B，以此类推。

 

解题思路：直接模拟一下即可。

 

 

 

 #include<stdio.h>
 #include<string.h>
 int main()
 {
     int n,i,ans;
     int a[];
     char c;
     while(scanf("%d",&n)!=EOF)
     {
         getchar();
         for(i=;i<n;i++)
         {
             scanf("%c",&c);
             if(c>='A'&&c<='Z')
             {
                 a[i]=;
             }
             else
             {
                 a[i]=;
             }

         }
         for(i=;i<n;i+=)
         {
             ans=a[i]*+a[i+]*+a[i+]*+a[i+]*+a[i+]*;
             printf("%c",ans+'A');
         }
         printf("\n");
     }
     return ;
 }