codeforces 122A Lucky Division
来源:互联网 发布:jersey 返回对象json 编辑:程序博客网 时间:2024/05/16 20:30
Petya loves lucky numbers. Everybody knows that lucky numbers are positive integers whose decimal representation contains only the lucky digits4 and 7. For example, numbers47, 744,4 are lucky and 5, 17, 467 are not.
Petya calls a number almost lucky if it could be evenly divided by some lucky number. Help him find out if the given numbern is almost lucky.
The single line contains an integer n (1 ≤ n ≤ 1000) — the number that needs to be checked.
In the only line print "YES" (without the quotes), if numbern is almost lucky. Otherwise, print "NO" (without the quotes).
47
YES
16
YES
78
NO
Note that all lucky numbers are almost lucky as any number is evenly divisible by itself.
In the first sample 47 is a lucky number. In the second sample16 is divisible by 4.
AC:
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,flag=0;
scanf("%d",&n);
int p[]={4,7,47,74,444,447,474,744,477,747,774};
for(int i=0;i<11;i++)
if(n%p[i]==0||n==p[i])
flag=1;
if(flag)
printf("YES\n");
else
printf("NO\n");
}
- CodeForces 122A Lucky Division
- CodeForces 122A Lucky Division
- codeforces 122A Lucky Division
- 【CodeForces】A. Lucky Division
- Codeforces Problems-122A. Lucky Division
- codeforces 122A(Lucky Division) Java
- 122A - Lucky Division
- CF 122A. Lucky Division
- CF 122A- Lucky Division
- A. Lucky Division
- Codeforces Beta Round #91 (Div. 2) / 122A Lucky Division (数论)
- Codeforces刷题之路——122A Lucky Division
- Lucky Division
- Lucky Division
- codeforces 808A Lucky Year
- 【Codeforces 808 A. Lucky Year】
- Lucky Division【理解题意】
- Coderforces Lucky Division
- 链式调用-普通调用
- React Native 学习资源精选仓库(汇聚知识,分享精华)
- SimpleDateFormat的使用
- HbaseTemplate配置进阶:利用Spring自动装配加载HbaseTemplate
- android六大布局和UI组件
- codeforces 122A Lucky Division
- java 金额数字转中文
- 设计模式之生成者与消费者模式
- 设计模式C++实现(16)——状态模式
- ShareSDK新浪微博登录提示 21338:sso package or sign error"
- SVN:Please execute the 'Cleanup' command.
- 数字的因子和
- 获得员工部门
- Android面试篇之HashMap和Hashtable的区别