B - Lucky Division

标签：lin   tput   petya   sel   div   visible   水过   represent   false   

Problem description

Petya loves lucky numbers. Everybody knows that lucky numbers are positive integers whose decimal representation contains only the lucky digits 4 and 7. For example, numbers 47, 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 number n is almost lucky.

Input

The single line contains an integer n (1?≤?n?≤?1000) — the number that needs to be checked.

Output

In the only line print "YES" (without the quotes), if number n is almost lucky. Otherwise, print "NO" (without the quotes).

Examples

47

YES

16

YES

78

NO

Note

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 sample 16 is divisible by 4.

解题思路：幸运数字只由4和7组成。题目要求判断输入的数字n是否可以整除这些幸运数字中的某一个，如果可以为"YES"，否则为"NO"。幸运数字就先打好表，其最大值不超过1000即可，简单水过！

AC代码：

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3 int main(){
 4     int n,obj[14]={4,7,44,47,74,77,444,447,474,477,744,747,774,777};
 5     bool flag=false;cin>>n;
 6     for(int i=0;i<14;++i)
 7         if(n%obj[i]==0){flag=true;break;}
 8     if(flag)cout<<"YES"<<endl;
 9     else cout<<"NO"<<endl;
10     return 0;
11 }

B - Lucky Division

标签：lin   tput   petya   sel   div   visible   水过   represent   false   

原文地址：https://www.cnblogs.com/acgoto/p/9125141.html