C :

#include<stdio.h>
int main()
{
	int i,j;
	int t,n[100];
	scanf("%d",&t);
	for(i=0;i<t;i++)
	scanf("%d",&n[i]);
	for(i=0;i<t;i++)
	{
		if(n[i]%4==0||n[i]%7==0)
		printf("YES\n");
		else if(n[i]%47==0||n[i]%74==0)
		printf("YES\n");
		else if(n[i]%477==0||n[i]%474==0||n[i]%444==0||n[i]%447==0)
		printf("YES\n");
		else if(n[i]%777==0||n[i]%774==0||n[i]%744==0||n[i]%747==0)
		printf("YES\n");
		else
		printf("NO\n");
	 } 
	 return 0;
}

C++ :

#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e6+10;
typedef pair<int,int> PII;
typedef priority_queue<int , vector<int>, greater<int>> minqueue;  //从小到大 queue
typedef priority_queue<int, vector<int>, less<int>> maxqueue;      //从大到小 queue

int gcd(int a, int b){  //最大公因数 
    return b ? gcd(b, a % b) : a;
}

int lcm(int a, int b){ //最小公倍数 
    return a * b / __gcd(a, b);
}

int qmi(int base, int power, int p)  //快速幂求余 
{
	int result = 1;   
	while (power > 0)           
	{
		if (power & 1)         							
			result = result * base % p;   
		base = base * base % p ;       						
		power >>= 1;         						
	}
	return result % p;       
}

void solve()
{
	int n;
	cin>>n;
	for(int i=1;i<=n;i++){
		int x=i;
		int flag=1;
		while(x>0){
			if(x%10!=4&&x%10!=7){
				flag=0;
				break;
			}
			x/=10;
		}
		if(flag){
			if(n%i==0){
				cout<<"YES"<<'\n';
				return;
			}
		}
	}
	cout<<"NO"<<'\n';
}

signed main()
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	int t;
	t=1;
	cin>>t; 
	while(t--)     
	{
		solve();
	}
	return 0;
}