【codeforces 96B】Lucky Numbers (easy) DFS

最新推荐文章于 2020-11-27 10:10:03 发布

hxtscjk

最新推荐文章于 2020-11-27 10:10:03 发布

阅读量522

点赞数

分类专栏： dfs

本文链接：https://blog.csdn.net/hxtscjk/article/details/79672800

版权

dfs 专栏收录该内容

1 篇文章 0 订阅

订阅专栏

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 Petya came across a positive integer n. Help him to find the least super lucky number which is not less than n.

Input

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

Output

Output the least super lucky number that is more than or equal to n.

Please, do not use the %lld specificator to read or write 64-bit integers in C++. It is preferred to use the cin, cout streams or the %I64d specificator.

Examples

Input

Copy

Output

Input

Copy

Output

题目大意：给你一个数，输出一个大于等于它的、只由4和7两个数字构成，并且4和7的数量相等的数字。

由题意知：

1、首先得数的数位肯定是偶数。

2、而且就算原数字的数位是偶数，得数的数位也不一定是偶数。因为比如7788，你就需要一个444777才能比它大。

3、还有个问题就是输入的数字才10的9次方，也就是说最多9位，那么就可以根据它的大小直接确定最终输出的数位是多少。比如大于74小于等于7744的数，输出的就是4位数。大于7744小于等于777444的，输出的就是6位数。

然后直接dfs一发，所有情况来一遍，找个最小的就行了。

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;
__int64 num;int m;__int64 ans;
int b[100];
void dfs(int sum,int sum4,int sum7)
{
    if(sum==m)
    {
        __int64 c=1;__int64 num1=0;
        for(int i=m-1;i>=0;i--)
        {
            num1+=(b[i]*c);
            c*=10;
        }
        if(num1>=num&&num1<ans)ans=num1;
        return ;
    }
    if(sum4)
    {
        b[sum]=4;
        dfs(sum+1,sum4-1,sum7);
    }
    if(sum7)
    {
        b[sum]=7;
        dfs(sum+1,sum4,sum7-1);
    }
}
int main()
{
    char a[100];
    while(~scanf("%s",a))
    {
        int n=strlen(a);
        num=0;__int64 c=1;
        for(int i=n-1;i>=0;i--)
        {
            num+=(c*(a[i]-'0'));
            c*=10;
        }
        m=0;
        if(num<=74)m=2;
        else if(num>74&&num<=7744)m=4;
        else if(num>7744&&num<=777444)m=6;
        else if(num>777444&&num<=77774444)m=8;
        else if(num>77774444)m=10;
        int sum7=m/2;int sum4=m/2;
        ans=7777744444;
        dfs(0,sum4,sum7);
        printf("%I64d\n",ans);
    }
}