Lucky Numbers (easy)(暴力解决)

 
Time Limit:2000MS    Memory Limit:262144KB    64bit IO Format:%I64d & %I64u
 

Description

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 and5, 17, 467 are not.

Lucky number is super lucky if it's decimal representation contains equal amount of digits4 and 7. For example, numbers47, 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 thann.

Input

The only line contains a positive integer n (1 ≤ n ≤ 109). 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.

Sample Input

Input
4500
Output
4747
Input
47
Output
47
题目大意:
给出一个整数,求出大于或等于这个数的最小超级幸运数:
超级幸运数:由4和7组成,4和7的个数相同:
题解:
打表,不要问为什么,任性!吐舌头
#include<stdio.h>
__int64 luck[1000]={47,74,4477,4747,4774,7447,7474,7744,444777,447477,447747,
447774,474477,474747,474774,477447,477474,477744,744477,744747,744774,747447,
747474,747744,774447,774474,774744,777444,44447777,44474777,44477477,44477747,
44477774,44744777,44747477,44747747,44747774,44774477,44774747,44774774,44777447,
44777474,44777744,47444777,47447477,47447747,47447774,
47474477,47474747,47474774,47477447,47477474,47477744,47744477,47744747,47744774,
47747447,47747474,47747744,47774447,47774474,47774744,47777444,74444777,74447477,
74447747,74447774,74474477,74474747,74474774,74477447,74477474,74477744,74744477,
74744747,74744774,74747447,74747474,74747744,74774447,74774474,74774744,74777444,
77444477,77444747,77444774,77447447,77447474,77447744,77474447,77474474,77474744,
77477444,77744447,77744474,77744744,77747444,77774444,4444477777};
int main()
{
	int n;
	while(~scanf("%d",&n))
	{
		for(int i=0;;i++)
		if(luck[i]>=n)
		{
			printf("%I64d\n",luck[i]);
			break;
		}
	}
}

  • 2
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 1
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值