I Count Two Three（打表+排序+二分查找）

I Count Two Three

二分查找用lower_bound

这道题用cin，cout会超时。。。

AC代码；

 /* */
 # include <iostream>
 # include <cstring>
 # include <string>
 # include <cstdio>
 # include <cmath>
 # include <algorithm>
 using namespace std;

 const int TWO = 2;
 const int THREE = 3;
 const int FIVE = 5;
 const int SEVEN = 7;

 const long long MAXN = 1e9+100;
 const int N=1e6;
 long long a[N];
 int m;

 void maketable()
 {
     m=0;
     for(long long i=1; i<MAXN; i*=TWO )
     {
         for(long long j=1; j*i<MAXN; j*=THREE )
         {
             for(long long k=1; i*j*k<MAXN; k*=FIVE )
             {
                 for(long long l=1; i*j*k*l<MAXN; l*=SEVEN )
                 {
                     a[m++] = i*j*k*l;
                 }
             }
         }
     }
 }

 int main()
 {
     ios::sync_with_stdio(false);
     maketable();
     sort(a,a+m);
     int t;
     long long n;
     scanf("%d", &t);
     //cin>>t;
     while( t-- )
     {
         scanf("%lld",&n);
        printf("%lld\n", *lower_bound(a, a+m, n));
 //        cin>>n;
 //        cout<<*lower_bound(a,a+m,n)<<endl;
     }
     return 0;
 }