hdu 5676

ztr loves lucky numbers

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 530    Accepted Submission(s): 224

Problem Description

ztr loves lucky numbers. Everybody knows that positive integers are lucky if their decimal representation doesn't contain digits other than 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.

Lucky number is super lucky if it's decimal representation contains equal amount of digits 4 and 7. For example, numbers 47, 7744, 474477 are super lucky and 4, 744, 467 are not.

One day ztr came across a positive integer n. Help him to find the least super lucky number which is not less than n.

 

Input

There are T (1≤n≤105) cases

For each cases:

The only line contains a positive integer  n(1≤n≤1018). This number doesn't have leading zeroes.

 

Output

For each cases
Output the answer

 

Sample Input

2 4500 47

 

Sample Output

4747 47

 

Source

BestCoder Round #82 (div.2)

 

Recommend

wange2014   |   We have carefully selected several similar problems for you:   5679  5678  5677  5675  5674 

bfs打表二分查找

accode：

#pragma warning(disable:4786)//使命名长度不受限制
#pragma comment(linker, "/STACK:102400000,102400000")//手工开栈
#include