CF720E.Cipher

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Input data contains multiple test cases. The first line of input contains tt ( 1<=t<=1001<=t<=100 ) — the number of test cases.

Each test case is described as follows. The first line of the description contains nn ( 1<=n<=181<=n<=18 ) — the number of digits in the number. The second line contains nn decimal digits without spaces (but possibly with leading zeroes) — the number initially stored in the display computer. The following nn lines contain 10 characters each. The jj -th character of the ii -th of these lines is the code character for a digit j1j-1 in position ii , most significant digit positions are described first.

输入格式

For each test case print an integer: the number of seconds until Borya definitely knows what was the initial number stored on the display of the computer. Do not print leading zeroes.

输出格式

输入输出样例

  • 输入#1

    3
    2
    42
    abcdefghij
    jihgfedcba
    2
    42
    aaaaaaaaaa
    aaaaaaaaaa
    1
    2
    abcdabcdff
    

    输出#1

    0
    58
    2
    
首页