Codeforces Beta Round 96 (Div. 2)
C
Turing Tape
Codeforces
未评级
原题
← BD →
翻译中…

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.
翻译中…
  1. The $*i*$-th element of the array is subtracted from the result of the previous step modulo 256.
翻译中…
  1. 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.

翻译中…

Input

翻译中…

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.

翻译中…

Output

翻译中…

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

翻译中…

Note

翻译中…

Let's have a closer look at the beginning of the example. The first character is "H" with ASCII-code $72 = 01001000_{2}$. Its reverse is $00010010_{2} = 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*$.

翻译中…

样例

Input #1
Hello, World!
Output #1
238
108
112
0
64
194
48
26
244
168
24
16
162
InputCopy OutputCopy
题目信息
题号
133C
时间限制
2 s
内存限制
256 MB

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。