• B


    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

    Input

    47

    Output

    YES

    Input

    16

    Output

    YES

    Input

    78

    Output

    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 }
  • 相关阅读:
    Android中的内部类引起的内存泄露
    Android的消息机制: Message/MessageQueue/Handler/Looper
    ArrayList/Vector的原理、线程安全和迭代Fail-Fast
    JVM中的Stack和Frame
    JVM中的垃圾收集算法和Heap分区简记
    无锁编程以及CAS
    简述Java内存模型的由来、概念及语义
    MQTT协议简记
    RabbitMQ的工作队列和路由
    RabbitMQ 入门
  • 原文地址:https://www.cnblogs.com/acgoto/p/9125141.html
Copyright © 2020-2023  润新知