Codeforces Beta Round #91 (Div. 2) / 122A Lucky Division (数论)_codeforces

本文介绍了Codeforces上的一道编程题“A. Lucky Division”，任务是判断一个整数是否为几乎幸运数，即能否被幸运数整除。文章提供了完整的解决方案，包括定义幸运数和几乎幸运数，并给出了一种通过枚举1000以内所有幸运数来检查输入数的方法。

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.

由于范围较小，可以先求出1000以内的所有lucky numbers（14个），再判断即可。

完整代码：

/*30ms,0KB*/

#include <cstdio>
const int lucky[14] = {4, 7, 44, 47, 74, 77, 444, 447, 474, 477, 744, 747, 774, 777};

int main(void)
{
	int num;
	scanf("%d", &num);
	bool yes = false;
	for (int i = 0; i < 14; ++i)
		if (num % lucky[i] == 0)
		{
			yes = true;
			break;
		}
	puts(yes ? "YES" : "NO");
	return 0;
}