被此题坑了

最新推荐文章于 2018-06-21 13:12:00 发布

置顶成长中的海东青

最新推荐文章于 2018-06-21 13:12:00 发布

阅读量569

点赞数

分类专栏：代码

本文链接：https://blog.csdn.net/m12110501061/article/details/8654346

版权

代码专栏收录该内容

5 篇文章 0 订阅

订阅专栏

#include<stdio.h>
#include<string.h>
int n;
char st[100000],t[100];
char trans()
{
    int a=0,b=1;
    for(int i=4; i>=0;i--)
    {
        if(t[i]>='0'&&t[i]<='9')
        {
            a+=b;
        }
        b*=2;
    }
    return a+'A';
}
int main()
{
    int i,j;
    while(~scanf("%d%*c",&n))
    {gets(st);
    for(i=0; i<n; i+=5)
    {
      for(j=0; j<5; j++)
      {
          t[j]=st[i+j];
      }
      printf("%c",trans());
    }
    printf("\n");
    }
    return 0;
}


 
 
  
  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.
 
 
 
 
  
   
 
 
 
 
  
  SampleInput
 
 
 
 
  
  35
ON1E2H5Q39AK2TGIC9ERT39B2P423L8B20D
 
 
 
 
  
   
 
 
 
 
  
  SampleOutput
 
 
 
 
  
  FLEENOW