CF95B.Lucky Numbers
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
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 .
输入格式
The only line contains a positive integer n ( 1<=n<=10100000 ). This number doesn't have leading zeroes.
输出格式
Output the least super lucky number that is more than or equal to n .
输入输出样例
输入#1
4500
输出#1
4747
输入#2
47
输出#2
47