CF1861A.Prime Deletion
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
A prime number is a positive integer that has exactly two different positive divisors: 1 and the integer itself. For example, 2 , 3 , 13 and 101 are prime numbers; 1 , 4 , 6 and 42 are not.
You are given a sequence of digits from 1 to 9 , in which every digit from 1 to 9 appears exactly once.
You are allowed to do the following operation several (maybe zero) times: choose any digit from the sequence and delete it. However, you cannot perform this operation if the sequence consists of only two digits.
Your goal is to obtain a sequence which represents a prime number. Note that you cannot reorder the digits in the sequence.
Print the resulting sequence, or report that it is impossible to perform the operations so that the resulting sequence is a prime number.
输入格式
The first line contains one integer t ( 1≤t≤5000 ) — the number of test cases.
Each test case consists of one line containing a string of 9 digits (without any characters between them). Each digit from 1 to 9 appears in this string exactly once.
输出格式
For each test case, print the answer on a separate line as follows:
- if it is impossible to perform the described operations, print −1 ;
- otherwise, print any sequence that represents a prime number, which can be obtained from the given string performing several (maybe zero) operations described in the statement. If there are multiple such sequences, you can print any one of them.
输入输出样例
输入#1
4 123456789 987654321 243567918 576318429
输出#1
167 53 3571 57638429