「CFgym100514I」Peace of AmericanPie

2014年11月2日2,8230

You are given an encrypted string, encrypted using a certain algorithm. Decrypt it !

Input

The first and only line of input contains a string s,each character of s is either 0 or 1 . (8 ≤ |s| ≤ 8 × 10⁴)

Output

Print the original string.

Sample test(s)

input

01100011011010000110000101110010011110100110010101101000

1	01100011011010000110000101110010011110100110010101101000

output

charzeh

charzeh

input

01111001011011110111010101110011011001010110011001101001

1	01111001011011110111010101110011011001010110011001101001

output

yousefi

yousefi

input

0100110101001101010101000011000000110001

1	0100110101001101010101000011000000110001

output

MMT01

MMT01

题解

八个数字一组二进制

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<cstring>
using namespace std;
string a;
int main()
{
    cin>>a;
    int t=a.length();
    for(int i=1;i<=t/8;i++)
    {
		int tot=0;
		for(int j=0;j<8;j++)
		{
			tot+=(a[(i-1)*8+j]-'0')*(1<<(7-j));
		}
		tot+=i;
		printf("%c",tot-i);
    }
    return 0;
}