hdu 5878

I Count Two Three

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

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

10
1
11
13
123
1234
12345
123456
1234567
12345678
123456789

 

Sample Output

1
12
14
125
1250
12348
123480
1234800
12348000
123480000

 

Source

2016 ACM/ICPC Asia Regional Qingdao Online

 

 

 

 #include <iostream>
 #include <cstdio>
 #include <algorithm>
 #include <cstdlib>
 #include <cstring>
 #include <string>
 #include <deque>
 #include <vector>
 #include <set>
 using namespace std;
 #define ll long long
 #define P pair<int,int>
 const int N= 5e3+;
 const ll  M = ;
 ll n,a[N];
 int cnt =;
 int t;
 ll pow(ll a,ll b){
     ll ans=;
     while(b){
         if(b&) ans=ans*a;
         b>>=;
         a*=a;
     }
     return ans;
 }
 void init()
 {
     ll i,j,k,l;
     for(i=;i<=;i++){
         if(pow(,i)>M) break;
         for(j=;j<=;j++){
             if(pow(,i)*pow(,j)>M) break;
             for(k=;k<=;k++) {//k++后，l 再次从0开始。
                 if(pow(,i)*pow(,j)*pow(,k)>M) break;
                 for(l=;l<=;l++){
                     if(pow(,i)*pow(,j)*pow(,k)*pow(,l)>M) break;//在这里跳出才可以继续循环
                     a[cnt++] = pow(,i)*pow(,j)*pow(,k)*pow(,l);
                 }
             }
         }
     }
     sort(a,a+cnt);
 }
 int main()
 {

     init();
     scanf("%d",&t);
     while(t--){
         scanf("%lld",&n);
         printf("%lld\n",a[lower_bound(a,a+cnt,n)-a]);
     }
     return ;
 }