被此题坑了

#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

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值