1489: I Count Two Three
内存限制：128 MB
时间限制：1.000 S
评测方式：文本比较
命题人：
提交：0
解决：0
题目描述
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 attack failed if and only if i
can be rewritten as the form of 2^a*3^b*5^c*7^d,which a,b,c,d are non-negative integers.
At recent dinner parties, we call the integers with the form2^a*3^b*5^c*7^d "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.
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 attack failed if and only if i
At recent dinner parties, we call the integers with the form2^a*3^b*5^c*7^d "I Count Two Three Numbers".
A related board game with a given positive integer n
输入
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<=10^9)
n(1<=n<=10^9)
输出
For each test case, output one line with only one integer corresponding to the shortest "I Count Two Three Number" no smaller than n.
样例输入 复制
10
1
11
13
123
1234
12345
123456
1234567
12345678
123456789样例输出 复制
1
12
14
125
1250
12348
123480
1234800
12348000
123480000提示
找到第一个大于或等于n的数，并且这个数的因子是由2，3，5，7其中的一个或者多个组成
http://acm.hdu.edu.cn/showproblem.php?pid=5878