hdu5676 ztr loves lucky numbers (打表二分)

原创 2016年06月01日 20:14:35

ztr loves lucky numbers
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1132 Accepted Submission(s): 478

Problem Description
ztr loves lucky numbers. Everybody knows that positive integers are lucky if their decimal representation doesn’t contain digits other than 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.

Lucky number is super lucky if it’s decimal representation contains equal amount of digits 4 and 7. For example, numbers 47, 7744, 474477 are super lucky and 4, 744, 467 are not.

One day ztr came across a positive integer n. Help him to find the least super lucky number which is not less than n.

Input
There are T(1≤n≤105) cases

For each cases:

The only line contains a positive integer n(1≤n≤1018). This number doesn’t have leading zeroes.

Output
For each cases
Output the answer

Sample Input

2
4500
47

Sample Output

4747
47

#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
#include<iostream>
using namespace std;

typedef long long ll;

int bit(ll num){
    return log10(num)+1;
}
vector<ll> vec;

bool judge(ll num){
    int l4=0,l7=0;
    while(num){
        if(num%10==4){
            ++l4;
        }else if(num%10==7){
            ++l7;
        }else return false;
        num/=10;
    }
    return l4==l7;
}
void dfs(ll num){
    if(num&&judge(num))vec.push_back(num);
    if(bit(num)<18){
        ll nums=num*10+4;
        dfs(nums);
        nums=num*10+7;
        dfs(nums);
    }
}

int main(){
    int T;
    ll uu=19923;

    vec.clear();
    dfs(0LL);
    sort(vec.begin(),vec.end());
    scanf("%d",&T);
    int len=vec.end()-vec.begin();
    while(T--){
        ll n;
        scanf("%lld",&n);
        int pos=upper_bound(vec.begin(),vec.end(),n)-vec.begin();

        if(pos==len){
            printf("44444444447777777777\n");
        }else{
            printf("%lld\n",vec[pos]);
        }
    }
    return 0;
}
版权声明:本文为博主原创文章,未经博主允许不得转载。 举报

相关文章推荐

hdu5676 ztr loves lucky numbers DFS+二分

ztr loves lucky numbers Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java...

hdu 5676-ztr loves lucky numbers

ztr loves lucky numbers Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/...

我是如何成为一名python大咖的?

人生苦短,都说必须python,那么我分享下我是如何从小白成为Python资深开发者的吧。2014年我大学刚毕业..

hdu 5676 ztr loves lucky numbers【dfs+剪枝】

ztr loves lucky numbers    Accepts: 99    Submissions: 736  Time Limit: 2000/1000 MS (Java/Ot...

HDOJ 5676 ztr loves lucky numbers (贪心+数位DP)

题意定义幸运数为只包含4和7并且4和7数量相等的数,给一个小于1e18的数,求大于这个数的第一个幸运数。思路思路一:实际上可以先打表dfs出所有的小于1e18的幸运数,然后每次输入n之后二分找就可以了...

HDU 5756 ztr loves lucky numbers (dfs)

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5676题目大意:只有7和4且7和4数量相等的数字为幸运数字,给你数字n,你要找出大于等于n的最小的幸运数...

BestCoder Round #82 (div.2) -ztr loves lucky numbers(BFS)

ztr loves lucky numbers    Accepts: 99    Submissions: 736  Time Limit: 2000/1000 MS (Java/Ot...

hdu 5678 ztr loves trees(dfs序、主席树静态第k大)

题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=5678 题目大意: 给出一颗根为1的树,有n个点,每个点都有一个value值。然后给出n-1条边,表...

hdu 5677-ztr loves substring

ztr loves substring Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Oth...

HDU 5675 ztr loves math——BestCoder Round #82(div.2)

HDU 5675 ztr loves math——BestCoder Round #82(div.2)

HDU 5677 ztr loves substring

Problem Description ztr love reserach substring.Today ,he has n string.Now ztr want to konw,can h...
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)