原题链接:https://www.51nod.com/onlineJudge/questionCode.html#!problemId=1010
思路:预处理+二分
AC代码:
#include<bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const long long MAXN = 1e18 + 5555;
int cnt = 0;
long long n;
long long a[1000000];
void preProcess() {
for (long long i = 1; i <= MAXN; i <<= 1) {
for (long long j = 1; j*i <= MAXN; j *= 3) {
for (long long k = 1; i*j*k <= MAXN; k *= 5) {
if (i == 1 && j == 1 && k == 1)continue;
a[cnt++] = i*j*k;
}
}
}
sort(a, a + cnt);
}
int main() {
preProcess();
int t;
scanf("%d", &t);
while (t--) {
scanf("%lld", &n);
printf("%lld\n", *lower_bound(a, a + cnt, n));
}
return 0;
}