CF110A.Nearly Lucky Number

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Petya loves lucky numbers. We all know that lucky numbers are the positive integers whose decimal representations contain only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.

Unfortunately, not all numbers are lucky. Petya calls a number nearly lucky if the number of lucky digits in it is a lucky number. He wonders whether number nn is a nearly lucky number.

输入格式

The only line contains an integer nn ( 1<=n<=10181<=n<=10^{18} ).

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

输出格式

Print on the single line "YES" if nn is a nearly lucky number. Otherwise, print "NO" (without the quotes).

输入输出样例

  • 输入#1

    40047
    

    输出#1

    NO
    
  • 输入#2

    7747774
    

    输出#2

    YES
    
  • 输入#3

    1000000000000000000
    

    输出#3

    NO
    

说明/提示

In the first sample there are 3 lucky digits (first one and last two), so the answer is "NO".

In the second sample there are 7 lucky digits, 7 is lucky number, so the answer is "YES".

In the third sample there are no lucky digits, so the answer is "NO".

首页