Codeforces Beta Round #91 (Div. 2 Only) A. Lucky Division【暴力/判断是不是幸运数字4,7的倍数】
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.
The single line contains an integer n (1 ≤ n ≤ 1000) — the number that needs to be checked.
In the only line print "YES" (without the quotes), if number n is almost lucky. Otherwise, print "NO" (without the quotes).
47
YES
16
YES
78
NO
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.
【代码】:
![](https://images.cnblogs.com/OutliningIndicators/ContractedBlock.gif)
#include<bits/stdc++.h> using namespace std; #define LL long long using namespace std; int n; int fun(int n) { while(n) { if(n%10!=4 && n%10!=7) return 0; n/=10; } return 1; } int main() { int n,f; ios::sync_with_stdio(false); while(cin>>n) { f=0;// for(int i=1;i<=n;i++) { if(n%i==0 && fun(i)) { f=1; } } if(f) puts("YES"); else puts("NO"); } return 0; }