【HDU - 5878】I Count Two Three（打表）

题干：

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 ii-th attacks failed if and only if ii can be rewritten as the form of 2a3b5c7d2a3b5c7d which a,b,c,da,b,c,d are non-negative integers.

At recent dinner parties, we call the integers with the form 2a3b5c7d2a3b5c7d "I Count Two Three Numbers".
A related board game with a given positive integer nn from one agent, asks all participants the smallest "I Count Two Three Number" no smaller than nn.

Input

The first line of input contains an integer t (1≤t≤500000)t (1≤t≤500000), the number of test cases. tt test cases follow. Each test case provides one integer n (1≤n≤109)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 nn.

Sample Input

Sample Output

题目大意：

定义一组数，数是只含有2357四个因子。5e5次询问，每次询问一个x，让你输出这一组数中大于等于x的第一个数。

解题报告：

对这组数打表，然后对于查询直接二分就行了。注意打表的时候可能爆longlong所以需要边打表边剪枝。

AC代码：

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<queue>
#include<map>
#include<vector>
#include<set>
#include<string>
#include<cmath>
#include<cstring>
#define F first
#define S second
#define ll long long
#define pb push_back
#define pm make_pair
using namespace std;
typedef pair<int,int> PII;
const int MAX = 2e5 + 5;
ll a2[33],a3[33],a5[33],a7[33];
const ll INF = 1e9;
int tot;
ll db[MAX];
int main()
{int t;ll a2=1,a3=1,a5=1,a7=1,n;for(ll i = 1; i<=33; i++,a2*=2) {ll tmp = a2;a3=1;for(ll j = 1; j<=33; j++,a3*=3) {tmp=a2*a3;if(tmp > INF) break;a5=1;for(int k = 1; k<=33; k++,a5*=5) {tmp=a2*a3*a5;if(tmp > INF) break;a7=1;for(int q = 1; q<=33; q++,a7*=7) {tmp=a2*a3*a5*a7;if(tmp > INF) break;db[++tot] = tmp;}}}}sort(db+1,db+tot+1);cin>>t;while(t--) {scanf("%lld",&n);int pos = lower_bound(db+1,db+tot+1,n) - db;printf("%lld\n",db[pos]);}return 0 ;
}

【HDU - 5878】I Count Two Three（打表）相关推荐

HDU 5878 I Count Two Three
打表,二分. 满足条件的数字个数不多,可以全部找出来,排个序,每次询问的时候二分一下. #pragma comment(linker, "/STACK:1024000000,10240000 ...
mysql 左表为null_sql left join count 左表为空表的时候出现空行
sql left join count 左表为空表的时候出现空行 mysql> CREATE TABLE `test`.`tab1` ( `id` INT NOT NULL AUTO_INCRE ...
[codeforces 1327E] Count The Blocks 打表找规律+根据规律找公式+优化公式
Educational Codeforces Round 84 (Rated for Div. 2) 比赛人数13522 [codeforces 1327E] Count The Blocks ...
HDU - 5878 A - I Count Two Three H 技巧枚举
题意输入 t (1≤t≤500000), the number of test cases. t test cases follow. Each test case provides one int ...
我说 SELECT COUNT(*) 会造成全表扫描，面试官让我回去等通知
来自:码海前言上篇 SQL 进阶技巧(下) 中提到使用以下 sql 会导致慢查询 SELECT COUNT(*) FROM SomeTable SELECT COUNT(1) FROM SomeT ...
html统计筛选表格count,Excel中工作表数据进行计数和筛选的操作方法
execl2007作为办公软件,统计数据的功能十分强大,如何对一个工作表的数据进行计数和筛选,今天,学习啦小编就教大家在Excel中工作表数据进行计数和筛选的操作方法. Excel中工作表数据进行计数 ...
HDU 6155 Subsequence Count (DP、线性代数、线段树)
题目链接 http://acm.hdu.edu.cn/showproblem.php?pid=6155 题解 DP+线代好题.(考场上过多时间刚前两题,没怎么想这题--) 首先列出一个DP式: 设\( ...
HDU - 2089 不要62 【暴力打表】【数位DP】
不要62 HDU - 2089 题意求区间[n,m]之间有多少个数字不含4或者连续的62 解法1 由于数据范围是0~1e6,所以直接暴力判断每一位数字是否含有4或者62,然后求前缀和即可 #incl ...
数学--数论--Hdu 5793 A Boring Question （打表+逆元）
There are an equation. ∑0≤k1,k2,⋯km≤n∏1⩽j<m(kj+1kj)%1000000007=? We define that (kj+1kj)=kj+1!kj! ...

【HDU - 5878】I Count Two Three（打表）

【HDU - 5878】I Count Two Three（打表）相关推荐

最新文章

热门文章