Morris' Blog 我在摸索我存在的意義、生命的意義、內涵及價值。 沒有真正神手般的厲害，套用模式是大部分的情況。 沒那麼厲害的我存在的意義為何，襯托出神的存在？ 有時候不能怪別人不給我機會，我已經開始省思， 為什麼我沒有給別人機會的原因，而是全要靠別人。 有時候我認為我與眾不同，那是因為我做不到很多人能辦到的事情。 我聽不到、玩不起來、說得不夠明瞭、理解得不夠多， 我缺少的語文能力，就是一切一切無能的判定。 為此，我不曉得能做些對別人有幫助的事情。 我知道我自己是個不服輸的性格，但現在我不得不認輸。 我沒有能力，因此我必須認輸。 我到底來這世界作什麼？處處充滿不確定性， 而我總是無法出類拔萃，想當個一般人似乎也回不了頭了。 越強大的挑戰需要越強力的支持，而我的支持是什麼？ 最近嘗試與人談話，但都是失敗的結局，沒人能接受， 不需要言語，不需要溝通，一切所想都表達不出來。

49愛的鼓勵 6訂閱站台

F  — Brainfuck

Time Limit: 3 sec
Memory Limit: 32 MB

Recently your friend Bob has bought a new brainfuck programmable LED display. However executing a program directly on LED display takes huge amount of time. Because of this, now Bob decided to write the interpreter of display instruction set in order to test and debug all his programs on his PC and only after that execute his code on LED display. However Bob knows only one programming language — its certainly brainfuck (otherwise he would not have bought this LED display). So he asks you to write him an interpreter.

A display’s program is a sequence of commands executed sequentially. The commands of the display processor is a subset of brainfuck language commands. The commands that processor was capable to execute were ’>’, ’<’, ’+’, ’–’ and ’.’, which are described in the table below. Moreover, this LED display has an array of 100 bytes of circular memory (initialised with zeros) and a pointer to this array (initialised to point to the leftmost byte of the array). This means, that after incrementing a pointer, which points to the rightmost byte of memory, it will point to the leftmost byte and vice versa. Individual bytes are circular as well, so increasing a 255 gives a 0 and vice versa.

Command	Description
>	Increment the pointer (to point to the next cell to the right).
<	Decrement the pointer (to point to the next cell to the left).
+	Increment (increase by one) the byte at the pointer.
–	Decrement (decrease by one) the byte at the pointer.
.	Output the value of the byte at the pointer.

INPUT

There is a number of tests T (T ≤ 100) on the first line. After T tests follow. Each test case is a sequence of display processor commands on a separate line. You can assume that line length is less than 100000.

OUTPUT

For each test output a single line "Case T: D". Where T is the test number (starting from 1) and D is display’s memory dump in hexademical numeration system after executing given brainfuck program. Every byte must be separated exactly by one space character. See examples for clarification. Please note, that the sample input and output is divided into several lines only for convenience.

SAMPLE INPUT

1
..++<><<+++>>++++++++++++++++++++++++++>>>+++<+...++<><<+++>>++++++++++++++++++++++++++>>>+++<+...++<><<+++>>++++++++++++++++++++++++++>>>+++<+.

SAMPLE OUTPUT

Case 1: 1F 00 20 03 1D 03 01 03 00 00 00 00 
00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 
00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 
00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 
00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 
00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 
00 00 00 00 00 00 00 00 00 00 00 03 00

---

題目名稱太吸引人了

#include <stdio.h>

int main() {
    int t, cases = 0;
    char cmd[100005];
    scanf("%d", &t);
    getchar();
    while(t--) {
        gets(cmd);
        unsigned char mem[100] = {};
        int idx = 0, i;
        for(i = 0; cmd[i]; i++) {
            switch(cmd[i]) {
                case '>':idx++;break;
                case '<':idx--;break;
                case '+':mem[idx]++;break;
                case '-':mem[idx]--;break;
            }
            if(idx >= 100)  idx = 0;
            if(idx < 0) idx = 99;
        }
        printf("Case %d:", ++cases);
        for(i = 0; i < 100; i++)
            printf(" %02X", mem[i]);
        puts("");
    }
    return 0;
}