2018/12/12acm日常第二周第一题

最新推荐文章于 2022-10-20 21:19:59 发布

转载最新推荐文章于 2022-10-20 21:19:59 发布 · 109 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/gidear/p/10433320.html

本文介绍了一个算法问题，即如何判断一个数是否为近似幸运数。幸运数是指其十进制表示中仅包含4和7的正整数。近似幸运数则指该数中幸运数字的数量本身是一个幸运数。文章通过示例详细解释了判断过程，并提供了一段C++代码实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Nearly Lucky Number
各项指标
题目：
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”.(个数要为4||7个)

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”.
问题地址

#include<iostream>
using namespace std;

int main()
{
	char n[20];
	while (cin>>n)
	{
		int j = 0, i = 0;
		for (int i = 0;n[i]!='\0'; i++)
		{
			if (n[i] == '7' || n[i] == '4')
			{
				j++;
			}
		}
		if (j==i-1)
		{
			cout << "YES";
		}
		else
		{
			if (j==4||j==7)
			{
				cout << "YES";
			}
			else
			{
				cout << "NO";
			}
		}
	}
    return 0;
}