Codeforces Beta Round #96 (Div. 2)

最新推荐文章于 2023-09-17 09:14:08 发布

ConwayTian

最新推荐文章于 2023-09-17 09:14:08 发布

阅读量862

点赞数

分类专栏： Codeforces 文章标签： character output integer features input each

本文链接：https://blog.csdn.net/Tsaid/article/details/7048014

版权

Codeforces 专栏收录该内容

15 篇文章 0 订阅

订阅专栏

INTERCAL is the oldest of esoteric programming languages. One of its many weird features is the method of character-based output, known as Turing Tape method. It converts an array of unsigned 8-bit integers into a sequence of characters to print, using the following method.

The integers of the array are processed one by one, starting from the first. Processing i-th element of the array is done in three steps:

1. The 8-bit binary notation of the ASCII-code of the previous printed character is reversed. When the first element of the array is processed, the result of this step is considered to be 0.

2. The i-th element of the array is subtracted from the result of the previous step modulo 256.

3. The binary notation of the result of the previous step is reversed again to produce ASCII-code of the i-th character to be printed.

You are given the text printed using this method. Restore the array used to produce this text.

<p< p="" style="font-family: verdana, arial, sans-serif; font-size: 14px; line-height: 21px; "><p< p="">

Input

<p< p="">

The input will consist of a single line text which contains the message printed using the described method. String text will contain between 1 and 100 characters, inclusive. ASCII-code of each character of text will be between 32 (space) and 126 (tilde), inclusive.

<p< p=""><p< p="">

Output

<p< p="">

Output the initial array, which was used to produce text, one integer per line.

<p< p=""><p< p="">

Sample test(s)

<p< p=""><p< p="">

input

Hello, World!

output

<p< p=""><p< p="">

Note

<p< p="">

Let's have a closer look at the beginning of the example. The first character is "H" with ASCII-code 72 = 01001000₂. Its reverse is 00010010₂ = 18, and this number should become the result of the second step of processing. The result of the first step is considered to be 0, so the first element of the array has to be (0 - 18) mod 256 = 238, where a mod b is the remainder of division of a by b.

#include<iostream>
using namespace std;

int main()
{
    char str[200];
    int num, i, j, k;
    int pre = 0;
    char temp[10];

    cin.getline(str,200,'\n');

    for ( i = 0; str[i] != 0; i++ )
    {
        num = str[i]; j = 0;
        while ( num != 0  )
        {
            k = num % 2;
            temp[j++] = k + '0';
            num = ( num - k ) / 2;
        }

        while ( j < 8 ) temp[j++] = '0';
        temp[j] = '\0';

        for ( j = 0; j < 8; j++ )
            num += (temp[j] -'0') << (7-j) ;
        //cout << "##" << temp << ' ' << num << endl;
        k = (pre - num ) % 256;
        if ( k < 0 ) k += 256;
        cout << k << endl;
        pre = num;
    }
    return 0;
}