Lucky Numbers (easy)

原创 2016年08月28日 15:10:05

链接:http://codeforces.com/problemset/problem/96/B

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


题意:只有4和7的数字为幸运数字,4和7的个数相同时为超级幸运数字,求给出一个n,从0到n有几个超级幸运数字。

分析:现在看来其实可以用数位dp,不过我还没有很好的掌握,当时用的是简单的dfs打表,毕竟数据不是很大


题解:

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <cstring>
#include <functional>
#include <cmath>
using namespace std;

int k=0;
__int64 table[110];
void dfs(int num,int n4,int n7,int nowp,int allp)
{
	if(n4==n7)
	{
		table[k]=num;
		k++;
	}
	if(nowp==allp)
		return;
	num*=10;
	num+=4;
	dfs(num,n4+1,n7,nowp+1,allp);

	num/=10;
	num*=10;
	num+=7;
	dfs(num,n4,n7+1,nowp+1,allp);
}
int main()
{
	//freopen("in.txt","r",stdin);
	int n;
	dfs(4,1,0,1,8);
	dfs(7,0,1,1,8);
	table[k]=4444477777;
	sort(table,table+110);
	while(~scanf("%d",&n))
	{
		int i;
		for(i=0;i<110;i++)
			if(table[i]>=n)
				break;
		printf("%I64d\n",table[i]);
	}
	return 0;
}

版权声明:本文为博主原创文章,未经博主允许不得转载。

CodeForces - 96B Lucky Numbers (easy)

Lucky Numbers (easy) Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u ...

寒假集训.Lucky Tickets. Easy!

Lucky Tickets. Easy! Time Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u...

Ural-1044. Lucky Tickets. Easy!(简单题)

1044. Lucky Tickets. Easy!Time limit: 2.0 second Memory limit: 64 MB BackgroundThe public transport ...

HDU 3880 Lucky Numbers 数学题

题目传送门:http://acm.hdu.edu.cn/showproblem.php?pid=3880题目大意:要构造一个这样的数的集合,里面的数不大于M,且给定a,b两个互质数,对于任意正整数m,...
  • fawks96
  • fawks96
  • 2016年11月07日 01:34
  • 160

HDU 5756 ztr loves lucky numbers (dfs)

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

HackerRank - lucky-numbers(数位DP)

A number is called lucky if the sum of its digits, as well as the sum of the squares of its digits i...

2016 Personal Training #8 Div.2 I - Lucky Numbers CodeForces 95B

CodeForces 95B 经过11遍的WA和TLE终于迈向胜利T_T,题不难但是要考虑很多细节,这种题也是接触太少以前都是嫌麻烦就放弃了,所以借这题也是有不少收获,在此告诫千万别放弃坚持就是胜利...

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

题意定义幸运数为只包含4和7并且4和7数量相等的数,给一个小于1e18的数,求大于这个数的第一个幸运数。思路思路一:实际上可以先打表dfs出所有的小于1e18的幸运数,然后每次输入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 5676 ztr loves lucky numbers【dfs+剪枝】

ztr loves lucky numbers    Accepts: 99    Submissions: 736  Time Limit: 2000/1000 MS (Java/Ot...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Lucky Numbers (easy)
举报原因:
原因补充:

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