I Count Two Three
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 253 Accepted Submission(s): 131
Problem Description
I will show you the most popular board game in the Shanghai Ingress Resistance Team.
It all started several months ago.
We found out the home address of the enlightened agent Icount2three and decided to draw him out.
Millions of missiles were detonated, but some of them failed.
After the event, we analysed the laws of failed attacks.
It's interesting that the i -th attacks failed if and only if i can be rewritten as the form of 2a3b5c7d which a,b,c,d are non-negative integers.
At recent dinner parties, we call the integers with the form 2a3b5c7d "I Count Two Three Numbers".
A related board game with a given positive integer n from one agent, asks all participants the smallest "I Count Two Three Number" no smaller than n .
It all started several months ago.
We found out the home address of the enlightened agent Icount2three and decided to draw him out.
Millions of missiles were detonated, but some of them failed.
After the event, we analysed the laws of failed attacks.
It's interesting that the i -th attacks failed if and only if i can be rewritten as the form of 2a3b5c7d which a,b,c,d are non-negative integers.
At recent dinner parties, we call the integers with the form 2a3b5c7d "I Count Two Three Numbers".
A related board game with a given positive integer n from one agent, asks all participants the smallest "I Count Two Three Number" no smaller than n .
Input
The first line of input contains an integer
t (1≤t≤500000)
, the number of test cases.
t
test cases follow. Each test case provides one integer
n (1≤n≤109)
.
Output
For each test case, output one line with only one integer corresponding to the shortest "I Count Two Three Number" no smaller than
n
.
Sample Input
10 1 11 13 123 1234 12345 123456 1234567 12345678 123456789
Sample Output
1 12 14 125 1250 12348 123480 1234800 12348000 123480000
题意:找到由
2a3b5c7d组成的大于等于n的值
分析:由2a3b5c7d 组成的值很少,只有几千,所以预处理打表,然后用二分查找。
STL库中有两个二分查找函数:
ForwardIter lower_bound(ForwardIter first, ForwardIter last,const _Tp& val)算法
返回一个非递减序列[first, last)中的第一个大于等于值val的位置。
ForwardIter upper_bound(ForwardIter first, ForwardIter last, const _Tp& val)算法
返回一个非递减序列[first, last)中第一个大于val的位置。
代码如下:
#include <stdio.h>
#include <string.h>
#include <algorithm>
#define INF 1e9
using namespace std;
long long ans[100000];
bool cmp(long long a,long long b)
{
return a<b;
}
int main()
{
int n;
int i,j,k,l;
long long a[4];
int cou=0;
a[0]=1;
for(i=0;i<30;i++)
{
a[1]=1;
if(a[0]>INF)
break;
for(j=0;j<30;j++)
{
a[2]=1;
if(a[0]*a[1]>INF || a[1]>INF)
break;
for(k=0;k<30;k++)
{
a[3]=1;
if(a[0]*a[1]*a[2]>INF || a[2]>INF)
break;
for(l=0;l<30;l++)
{
if(a[0]*a[1]*a[2]*a[3]>INF || a[3]>INF)
break;
ans[cou++]=a[0]*a[1]*a[2]*a[3];
a[3]=a[3]*7;
}
a[2]=a[2]*5;
}
a[1]=a[1]*3;
}
a[0]=a[0]*2;
}
int T;
sort(ans,ans+cou,cmp);
scanf("%d",&T);
while(T--)
{
scanf("%d",&n);
printf("%d\n",*lower_bound(ans,ans+cou,n));
}
return 0;
}
2a3b5c7d
2a3b5c7d
2a3b5c7d