A. Nearly Lucky Number
来源:互联网 发布:java 时间格式 cst 编辑:程序博客网 时间:2024/05/16 23:46
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".
解题说明:此题不要被题目输入信息误导了,不是要把输入的数当成一个很大的数,而是应该看成一个字符串,然后从中找出4和7的个数统计即可,最后在用模10来计算个数是否为幸运数
#include <iostream>#include<cstdio>#include<cstring>#include<cmath>using namespace std;int main(){char a[20];int i,sum;int flag;sum=0;flag=0;scanf("%s",&a);for(i=0;a[i]!='\0';i++){if(a[i]=='4'||a[i]=='7'){sum++;}}if(sum==0){flag=1;}else{while(1){if(sum%10!=4&&sum%10!=7){flag=1;break;}sum=sum/10;if(sum==0){break;}}}if(flag==0){printf("YES\n");}else{printf("NO\n");}return 0;}
- A. Nearly Lucky Number
- A. Nearly Lucky Number
- 110A - Nearly Lucky Number
- Codeforces 110A-Nearly Lucky Number(实现)
- 【string】#84 A. Nearly Lucky Number
- CF 110A Nearly Lucky Number
- CodeForces 110A Nearly Lucky Number
- Problem--110A--Codeforces--Nearly Lucky Number
- codeforces 110A Nearly Lucky Number
- Coderforces Nearly Lucky Number
- codefroces 110A Nearly Lucky Number(模拟水题)
- codeforces 110A(Nearly Lucky Number) Java
- CodeForces 110A Nearly Lucky Number (近似幸运数字)
- CodeForces 110 A.Nearly Lucky Number(水~)
- Codeforces刷题之路——110A Nearly Lucky Number
- CodeForces 110A Nearly Lucky N…
- 『NYIST』第九届河南省ACM竞赛队伍选拔赛[正式赛二]- Nearly Lucky Number(Codeforces Beta Round #84 (Div. 2 Only)A. Nearly)
- nearly Prime Number
- mysql 索引背后的数据结构和算法原理(zz)
- Ubuntu下vi编辑器使用难解决
- hdu1455
- poj 1273 Drainage Ditches(最大费用流+最短增广路径算法)
- 【有趣的面试题】有人邀请ABCDEF六人参加一项会议
- A. Nearly Lucky Number
- poj1942 Paths on a Grid
- poj2038
- android数据存储二
- Bazaar版本管理工具 Ubuntu
- VxWorks Booting Process
- 常引用、常对象、对象的常成员
- EAS 生成子系统树后有些单据还是没有出现在配置信息中
- EAS 分录表头合并