Codeforces刷题之路——122A Lucky Division

A. Lucky Division
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

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 477444 are lucky and 517467 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或者47组合的数字定义为lucky number,不满足前者条件但是能够lucky number整除的称为almost lucky
解题思路:
由于 1<= n <= 1000,所以直接暴力法即可,将1000范围内的lucky number存入到数组中,输入值只要本身就是lucky number或者是almost lucky,则输出YES,否则NO。
注意事项:考虑完整,别漏哪一个数字了。

以下为解题代码(java实现)
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int[] num = {4,7,44,47,74,77,444,447,474,477,744,747,774,777}; 
		int n = scanner.nextInt();
		boolean flag = false;
		for(int i = 0;i < num.length;i++){
			if(n == num[i] || n % num[i] == 0){
				flag = true;
				break;
			}else{
				flag = false;
			}
		}
		if (flag) {
			System.out.println("YES");
		}else{
			System.out.println("NO");
		}
	}
}

你可能感兴趣的:(Codeforces)