122A - Lucky Division Codeforces || Codeforces 122A - Lucky Division Solution
Problem Name: 122A Lucky Division
Judge: Codeforces
Problem link: 122A Lucky Division
Codeforces 122A - Lucky Division Solution in C++/Cpp
#include <iostream>
using namespace std;
int main()
{
int lucky_numbers[] = {4,7,47,74,44,444,447,474,477,777,774,744};
int n, count = 0;
cin >> n;
for (int i = 0; i < 12; i++)
{
if (n % lucky_numbers[i] == 0) count++;
}
if (count > 0) cout << "YES" << endl;
else cout << "NO" << endl;
return 0;
}
Tags: Codeforces 122A - Lucky Division solution in C C++, 122A
codeforces solution in C C++, Codeforces 122A solution in C C++, Codeforces
Lucky Division solution in C C++, 122A - Lucky Division Codeforces solution in
C C++, Codeforces 122A - Lucky Division solution in C C++
