ACM-ICPC 2018 沈阳赛区网络预赛

Supreme Number

• 1000ms
• 131072K

 

A prime number (or a prime) is a natural number greater than 111 that cannot be formed by multiplying two smaller natural numbers.

Now lets define a number NNN as the supreme number if and only if each number made up of an non-empty subsequence of all the numeric digits of NNN must be either a prime number or 111.

For example, 171717 is a supreme number because 111, 777, 171717 are all prime numbers or 111, and 191919 is not, because 999 is not a prime number.

Now you are given an integer N (2≤N≤10100)N\ (2 \leq N \leq 10^{100})N (2≤N≤10100), could you find the maximal supreme number that does not exceed NNN?

Input

In the first line, there is an integer T (T≤100000)T\ (T \leq 100000)T (T≤100000) indicating the numbers of test cases.

In the following TTT lines, there is an integer N (2≤N≤10100)N\ (2 \leq N \leq 10^{100})N (2≤N≤10100).

Output

For each test case print "Case #x: y", in which xxx is the order number of the test case and yyy is the answer.

样例输入

2
6
100

样例输出

Case #1: 5
Case #2: 73

 #include<bits/stdc++.h>
 using namespace std;
 int main()
 {
     int a[] = {,,,,,,,,,,,,,,,,,,,
                 };
     int s;
     int t,count = ;
     cin >> t;
     while(t--)
     {
         cin >> s;
         cout << "Case #" << count++ << ": " ;
         if(s >= )
         {
             cout << a[] << endl;
             continue;
         }
         else
         {
             for(int i = ; i >= ; i --)
             {
                 if(s >= a[i])
                 {
                     cout << a[i] << endl;
                     break;
                 }
             }
         }
     }
     return ;
 }