Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
Register
ACM ICPC 2018 World Finals
Language:
BF
 Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 259 Accepted: 63

Description

BF is a language that was designed to challenge and amuse programmers. BF uses a simple machine model consisting, besides the program, of:

• An array of 30,000 byte cells – byte value ranges from 0 to 255 - initialized to zeroes.

• A movable pointer into a circular array (initialized to point to location 0)

• Two streams of bytes for input and output (most often connected to a keyboard and a monitor respectively, and using the ASCII character encoding).

In this problem you are asked to implement a BF interpreter, your program should read a BF program and an input stream and should print the output stream.

BF syntax is easy, only the following commands are available:

 Character Spelled as Meaning > Greater than Increment the pointer (to point to the next cell to the right). < Less than Decrement the pointer (to point to the next cell to the left). + Plus sign Increment (increase by one) the byte at the pointer. - Minus sign Decrement (decrease by one) the byte at the pointer. . Dot (period) Puts the value of the byte at the pointer into the output stream. , Comma Accept one byte of input - from the input stream - storing its value in the byte at the pointer. [ Left square bracket Jump forward to the command after the corresponding ‘]’ if the byte at the pointer is zero. ] Right square bracket Jump back to the command after the corresponding ‘[‘ if the byte at the pointer is nonzero.

The given BF programs will be syntactically valid also the ‘>’ and ‘<’ operators will never lead to a value outside range [0-30000].

Input

Input starts with the number of test cases on a line by itself. Then a number of test cases; each test case is formatted as follows.

1. A BF program (possibly with extra letters and/or white space characters embedded anywhere in the text).

2. A white space and a dollar sign – ‘\$’ – indicating end of BF program.

3. A space, the input stream, another space and a dollar sign terminator indicating the end of the input stream.

4. A new line.

A test case may span on multiple lines and each two consecutive test cases are separated by a blank line.

The embedded text could be any characters except the dollar sign terminator, you should ONLY process the 8 commands and detect the end of program/input by the dollar signs, discard any other characters when processing. In the sample input only the relevant input is underlined, however in the real test cases there will be no signs of input termination except for the dollar signs.

Output

Output should be “Case “ then test case number (starting with 1) , a colon, a space followed by the contents of the BF program output stream and a new line after each test case.

Sample Input

```3
,>,>,>,.<.<.<. \$ abcde \$

This is a sample BF program ,>++++++[<-------->-],[<+>-]<. That
Prints the summation of 2 numbers \$ 23 \$

every cell 8*4=32 and prints 'em in reverse order \$ AB \$```

Sample Output

```Case 1: dcba
Case 2: 5
Case 3: ba```

Source

[Submit]   [Go Back]   [Status]   [Discuss]