CodeForces-122A

题目链接:Problem - 122A - Codeforces

题目要求判断一个数的因子是否含有4和7

那么把他的因子提取出来判断判断每一位数是否含有4和7就可以了

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <queue>
#include <cmath>
#include <cstring>
#include <string>
#include <stack>
#include <deque>
#include <map>
#include <set>
using namespace std;
#define ll long long
#define endl "\n"
#define rep(i, a, b) for (ll i = (a); i <= (b); i++)
#define repr(i, a, b) for (ll i = (a); i < (b); i++)
#define rrep(i, a, b) for (ll i = (b); i >= (a); i--)
#define rrepr(i, a, b) for (ll i = (b); i > (a); i--)
#define min(a,b) (a)<(b)?(a):(b)
#define max(a,b) (a)>(b)?(a):(b)

ll cnt,n,m,t,ans,ant;
const int N=1e5+10;
ll arr[N];
string str;

inline ll read()
{
    char c = getchar();int x = 0,s = 1;
    while(c < '0' || c > '9') {if(c == '-') s = -1;c = getchar();}//是符号
    while(c >= '0' && c <= '9') {x = x*10 + c -'0';c = getchar();}//是数字
    return x*s;
}

bool check(ll x)
{
    ll temp=x;
    while(temp)
    {
        m=temp%10;
        if(m!=7&&m!=4) return 0;
        temp/=10;
    }
    return 1;
}

void solve()
{
    cin>>n;
    rep(i,1,n)
        if(n%i==0)
            arr[cnt++]=i;

    repr(i,0,cnt)
        if(check(arr[i])) 
        {
            puts("YES");
            return;
        }
    puts("NO");
    return;
}

int main()
{
    solve();
    return 0;
}