4492：Mystery

题目描述

None

输入解释

The first line of input contains a single integer P, (1 <= P <= 1000), which is the number of data sets that follow. Each data set consists of several lines. Each data set should be processed identically and independently.

The first line of each data set contains an integer D which is the data set number. The second line contains no more than the 93 distinct printable ASCII characters. The third line contains an integer, N (1 <= N <=512 ), which is the number of integers on the next (fourth) line of the dataset. Each integer on the fourth line is in the range -X to X where X is the number of characters on the second line minus 1.

输出解释

For each data set there is one correct line of output. It contains the data set number (D) followed by a single space, followed by a string of length N made of the characters on the second line of the input data set.

输入样例

4
1
MAC
3
1 1 1
2
IW2C0NP3OS 1RLDFA
22
0  3  3  -3  7  -8  2  7  -4  3  8  7  4  1  1  -4  5  2  5  -6  -3  -4
3
G.IETSNPRBU
17
2  4  5  -6  -1  -3  -2  -4  -4  1  -1  5  -3  4  1  -2  4
4
PIBN MRDSYEO
16
-4  4  -1  4  5  3  -5  4  -3  -3  -2  -5  -5  -3  1  3

输出样例

1 ACM
2 ICPC 2013 WORLD FINALS
3 IN ST. PETERSBURG
4 SPONSORED BY IBM

来自杭电HDUOJ的附加信息

Recommend

liuyiding

该题目是Virtual Judge题目，来自杭电HDUOJ

题目来源 Greater New York 2012

源链接： HDU-4492

最后修改于 2020-10-25T23:14:04+00:00 由爬虫自动更新

共提交 0 次

通过率 --%

时间上限	内存上限
2000/1000MS(Java/Others)	32768/32768K(Java/Others)