题目链接:https://www.51nod.com/onlineJudge/questionCode.html#!problemId=1010
思路:打个表,排序后二分查找。
#include<cstdio>
#include<queue>
#include<iostream>
#include<vector>
#include<map>
#include<cstring>
#include<string>
#include<set>
#include<stack>
#include<algorithm>
#define cle(a) memset(a,0,sizeof(a))
#define inf(a) memset(a,0x3f,sizeof(a))
#define ll long long
#define Rep(i,a,n) for(int i=a;i<=n;i++)
using namespace std;
const int INF = ( 2e9 ) + 2;
const ll maxn = 1e18 + 100;
const int maxsize = 1e6;
int cnt;
ll a[maxsize];
void init()
{
for(ll i=1;i<=maxn;i*=2)
for(ll j=1;j*i<=maxn;j*=3)
for(ll k=1;i*j*k<=maxn;k*=5)
a[cnt++]=1LL*i*j*k;
sort(a,a+cnt);
}
int main()
{
cnt=0;
init();
int t;
scanf("%d",&t);
while(t--)
{
ll n;
scanf("%lld",&n);
printf("%lld\n",*lower_bound(a+1,a+cnt,n));
}
}