HDU 5878 I Count Two Three 2016 ACM/ICPC Asia Regional Qingdao Online 1001

预处理出1e9内所有的2^a*3*b*5^c*7*d，sort一下再用stl二分查找一下第一个不小于n的数

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <bitset>
using namespace std;

#define rep(i,a,b) for (int i=(a),_ed=(b);i<=_ed;i++)
#define per(i,a,b) for (int i=(b),_ed=(a);i>=_ed;i--)
#define pb push_back
#define mp make_pair
const int inf_int = 2e9;
const long long inf_ll = 2e18;
#define inf_add 0x3f3f3f3f
#define mod 1000000007
#define LL long long
#define ULL unsigned long long
#define MS0(X) memset((X), 0, sizeof((X)))
#define SelfType LL
SelfType Gcd(SelfType p,SelfType q){return q==0?p:Gcd(q,p%q);}
SelfType Pow(SelfType p,SelfType q){SelfType ans=1;while(q){if(q&1)ans=ans*p;p=p*p;q>>=1;}return ans;}
#define Sd(X) int (X); scanf("%d", &X)
#define Sdd(X, Y) int X, Y; scanf("%d%d", &X, &Y)
#define Sddd(X, Y, Z) int X, Y, Z; scanf("%d%d%d", &X, &Y, &Z)
#define reunique(v) v.resize(std::unique(v.begin(), v.end()) - v.begin())
#define all(a) a.begin(), a.end()
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef vector<int> vi;
typedef vector<long long> vll;
inline int read(){int ra,fh;char rx;rx=getchar(),ra=0,fh=1;while((rx<'0'||rx>'9')&&rx!='-')rx=getchar();if(rx=='-')fh=-1,rx=getchar();while(rx>='0'&&rx<='9')ra*=10,ra+=rx-48,rx=getchar();return ra*fh;}
//#pragma comment(linker, "/STACK:102400000,102400000")


LL f[1000000];


int main()
{
	//freopen("in.txt","r",stdin);
	//freopen("out.txt","w",stdout);
	ios::sync_with_stdio(0);
	cin.tie(0);
	int cnt = 0;
	for(int a=0;a<=32;a++)
    {
        for(int b=0;b<=25;b++)
        {
            for(int c=0;c<=20;c++)
            {
                for(int d=0;d<=15;d++)
                {
                    if(a+b+c+d<50)f[cnt++] = Pow(2,a)*Pow(3,b)*Pow(5,c)*Pow(7,d);
                }
            }
        }
    }
    sort(f,f+cnt);
    int t;
    t = read();
    while(t--)
    {
        LL n;
        scanf("%I64d",&n);
        LL ans = lower_bound(f,f+cnt,n) - f;
        printf("%I64d\n",f[ans]);
    }

	return 0;
}