HDU 5878 I Count Two Three

I Count Two Three

Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 892    Accepted Submission(s): 448

Problem Description

I will show you the most popular board game in the Shanghai Ingress Resistance Team.
It all started several months ago.
We found out the home address of the enlightened agent Icount2three and decided to draw him out.
Millions of missiles were detonated, but some of them failed.

After the event, we analysed the laws of failed attacks.
It's interesting that the i-th attacks failed if and only if i can be rewritten as the form of 2a3b5c7d which a,b,c,d are non-negative integers.

At recent dinner parties, we call the integers with the form 2a3b5c7d "I Count Two Three Numbers".
A related board game with a given positive integer n from one agent, asks all participants the smallest "I Count Two Three Number" no smaller than n.

 

Input

The first line of input contains an integer t (1≤t≤500000), the number of test cases. t test cases follow. Each test case provides one integer n (1≤n≤109).

 

Output

For each test case, output one line with only one integer corresponding to the shortest "I Count Two Three Number" no smaller than n.

 

Sample Input

1011113123123412345123456123456712345678123456789

 

Sample Output

11214125125012348123480123480012348000123480000

 

Source

2016 ACM/ICPC Asia Regional Qingdao Online

这个题数据最大值给到1e9，里面 2a3b5c7d表示的数就更少了，所以直接打表就好，说实话，我这个acm小白刚开始没想到，诶，比赛时这个题超时了，

找数的时候用二分查找，比赛的时候也没想起来，*lower_bound(ans,ans+cou,n)，这个可以很方便的找出来，醉了，是我太年轻了，是时候努力一波了。