Description

In this problem we simulate a simple text editor. Given a series of keyboard input, output the final text content.
The text editing rules are defined as following:
1. Normal alphabetical input and whitespace input (abcdefg…. and ‘ ‘) directly write  after the cursor of the text content.
And four special commands started with a backslash(/) character
2. The backspace command which deletes a letter before the cursor (/backspace)
3. The newline command which creates a new line after the cursor (/newline)
4. The two navigating commands which move the cursor (/left /right)

The size of the text content is fixed to 500 characters, and the text content of testcases will not exceed 500 characters when simulating.

Hint:

#include 

#define MAX_SIZE 500

char content[MAX_SIZE];
char input[MAX_SIZE];

int main()
{

    fgets(input, MAX_SIZE, stdin);

    /* your code here */

    printf("%s", content);

    return 0;
}

Input

The keyboard input sequence.
There is always a valid command(/backspace /newline /left /right) right after the backslash character.
There is no newline character at the end

Output

The final text content.
 

Sample Input  Download

Sample Output  Download

Tags

Discuss

Description

One day, your mathematician friend get trouble again. He is trying to find the max sum of the inversion in the array, but the array is too large to calculate by handcraft method. He ask you to help him finish the job and write down the problem below:

Input

T

N_1 S_1

N_2 S_2

...

N_T S_T

T : The number of the testcase (1<= T<= 10)

N_i : The size of input sequence (2<= N_i < 1000)

S_i : The positive sequence with each element in the sequence is less than 1000000

Output

If there exists inversions, print out the max sum of inversions in the sequence

If there doesn't exists inversions, print out the string "No Inversion!"

(each output string must follow by a newline character)

Sample Input  Download

Sample Output  Download

Tags

Discuss

Description

Find the ball is one of the most interesting game in the past. Playing "Find the ball" will test and improve the player's attention and memory. In the begining of the game, There are one yellow ball will be hidden under three cups and then swaps each cup many time as fast as possible, Finally, you need to find where is the ball.

One day, a game developer thinked that using three cups to play the game is too easy. He wanted to expaned three cups to n cups and one ball to m ball. However he was no idea to write an program for the game. In order to help the game developer, you need to write a program to simulate the procedure and record the final location of each ball.

Input

N

M S

T

A_1 B_1

A_2 B_2

N : The size of cups (3 <= N <= 40)

M : The number of balls (1<= B <= N/2, and each location of ball will not repeat)

S : The sequence of each ball's location

T : The number of instruction to swap the cup (1 <= T < 100)

A_i, B_i : The location of both two cup to swap (A_i and B_i may have same value)

Note: the location start from 1

Output

Print out the simulated procedure and the final location of each ball from left to right.

(for simulated procedure : each line followed by a newline).

(Balls are represented by asterisk '*', and non-ball cells are represented by a minus sign '-')

(for the final location of each ball : each location should be separated by a space, and make sure there is a trailing space followed by a newline character at the end of line.)

Note: for simulated procedure should print out the initial state first

Sample Input  Download

Sample Output  Download

Tags

Discuss