新生基础训练Alpha Y - Nearly Lucky Number【CodeForces - 110A】

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.

Time limit	Memory limit	Source	Tags	Editorial
2000 ms	262144 kB	Codeforces Beta Round #84 (Div. 2 Only)	implementation *800	Announcement Tutorial

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

问题链接：CodeForces - 110A

问题描述

设4和7为幸运数字，若一个数里面的幸运数字的量是4或者7，则称这个数为“近似幸运数”，求一个数是否为近似幸运数。

问题分析

利用string类中的find函数，分别记录输入的数字中有几个4和7，若总数为4或7，则输出YES，否则输出NO。

AC通过的C++语言程序代码如下：

#include<iostream>
#include<string>
using namespace std;
int main()
{
	string num;
	int idx = 0;
	int counter = 0;
	cin >> num;
	while(num.find('4', idx) != string::npos)
	{
		idx = num.find('4', idx);
		idx++;
		counter++;
	}
	idx = 0;
	while (num.find('7', idx) != string::npos)
	{
		idx = num.find('7', idx);
		idx++;
		counter++;
	}
	if (counter == 4 || counter == 7)
		cout << "YES";
	else
		cout << "NO";
}

代码分析

第一次先用while检查输入的数据中有多少个4：

while(num.find('4', idx) != string::npos)
{
	idx = num.find('4', idx);
	idx++;
	counter++;
}

若字符串中没有4，find函数会返回string::npos，如果有的话则会执行循环体，把，find函数找到的4的角标存于idx中并加1，作为下次寻找的起点角标，并使计数器自增，当循环体退出时，计数器counter会记录字符串中有多上个4。

同理，计算字符串中有多上个7：

while (num.find('7', idx) != string::npos)
{
	idx = num.find('7', idx);
	idx++;
	counter++;
}

最后判断字符串中4和7的数目是否为4或7并输出结果：

if (counter == 4 || counter == 7)
	cout << "YES";
else
	cout << "NO";