1010 只包含因子2 3 5的数

51nod题目链接
使用递推先计算出long long范围内的只包含235因子的数
经过测试在11000个数内
注意：
输入的数的范围是long long范围

#include <cstdio>
#include <algorithm>
#include <iostream>
using namespace std;
const int N = 11000;
const long long M = 1e18+1;
long long arr[N];

int main(){
	int n;
	long long x;
	arr[0] = 1;
	
	int i2 = 0, i3 = 0, i5 = 0;
	for(int i = 1; i <= 10917; i++){
		arr[i] = min(2*arr[i2], min(3*arr[i3], 5*arr[i5]));
		if(arr[i] == 2*arr[i2]) i2++;
		if(arr[i] == 3*arr[i3]) i3++;
		if(arr[i] == 5*arr[i5]) i5++;
		
	}

	scanf("%d", &n);
	while(n--){
		scanf("%lld", &x);
		//二分法
		long long  l = 1, r = min((long long)10917, x);
		while(l < r){
			long long mid = l + r >> 1;
			if(x <= arr[mid]) r = mid;
			else l = mid + 1;
		} 
		printf("%lld\n", arr[l]);
	}
	return 0;
}