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 n is a nearly lucky number.
The only line contains an integer n (1 ≤ n ≤ 1018).
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 n is a nearly lucky number. Otherwise, print "NO" (without the quotes).
40047
NO
7747774
YES
1000000000000000000
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".
理解什么是接近幸运数:是幸运数的个数是幸运数就是接近幸运数,比如例1:幸运数有4,4,7,三个幸运数,3不是幸运数,所以输出NO,否则是YES。题目中最多19位数字,幸运数是只包含4或7的数,4,7,44,47等等,所以只用判断4或7.
#include<stdio.h>
#include<string.h>
#define N 1000000
char a[N];
int main()
{
long long len,sum,i;
while(gets(a))
{
len=strlen(a);
sum=0;
for(i=0;i<len;i++)
{
if(a[i]=='4'||a[i]=='7')
sum++;
}
if(sum==4||sum==7)
printf("YES\n");
else
printf("NO\n");
}
return 0;
}