0%

Codeforces 122A

Codeforces 122A - Lucky Division

Lucky Division

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

範例:

input:

1
47

output:

1
YES

input:

1
16

output:

1
YES

input:

1
78

output:

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

題意:

找出信幸運數字。

思路:

這題再找一個幸運的數字,因為N小於1000所以我們直接把1000以內幸運數字存在陣列裡面,題目也說道如果有數字可以被幸運數字整除,那麼它也是幸運數字。

程式碼: