ACM(白银组题）problem Y

幸运数字

A. Nearly Lucky Number
time limit per test2 seconds
memory limit per test256 megabytes
input ：standard input
output ：standard output
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.

Input
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.

Output
Print on the single line “YES” if n is a nearly lucky number. Otherwise, print “NO” (without the quotes).

Examples
Input
40047
Output
NO
Input
7747774
Output
YES
Input
1000000000000000000
Output
NO
Note
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”.

题目简述：
输入一个数，这个数是近似幸运数，而不是就是幸运数，写的时候看错题，卡了好久。
近似幸运数是指一串数字中的‘ 7 ’和‘ 4 ’的总个数是幸运数字，即7或者4，或者全是7和4的数；

题目分析：
用一个字符数组来接收输入的字符，循环结构和if结构来判断当前字符是否为‘ 7’，‘ 4’，如果是则令计数记加一；最后输出该计数即可；

AC代码：

#include<iostream>
using namespace std;
int main()
{
 char s[30];
 int i;
 while (cin >> s)
 {
  int count=0;
  for (i = 0; i < strlen(s); i++)
  {
   if (s[i]=='4'||s[i]=='7')
   {
    count++;
   }
  }
  if (count == 4 || count == 7)
   cout << "YES" << endl;
  else
   cout << "NO" << endl;
 }
 return 0;
}