【CodeForces】A. Lucky Division

Problem here

Problem

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

Sample test(s)

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.

Solution

brute force


#include <iostream>

using namespace std;



int nums[] = {4, 7, 44, 47, 74, 77, 444, 447, 477, 474, 747, 777, 744};



int main(){

    int input;

    cin >> input;

    bool flat = false;

    for(int i = 0; i < 13; i++){

        if(input % nums[i] == 0){

            flat = true;

        }

    }



    if(flat){

        cout << "YES" << endl;

    }else{

        cout << "NO" << endl;

    }



    return 0;

}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值