#include #include #include using namespace std; // this func return product of a digit int product(int n) { int prod = 1; while (n > 0) prod *= (n%10), n /= 10; return prod; } // this func breaks down the nos in small parts void breakNo(string d, vector& nos) { string temp; for (size_t l = 1; l <= d.length(); l++) for (size_t t = 0; t < l; t++) { temp = ""; for (size_t a = t; a < l; a++) temp += d[a]; nos.push_back(atoi(temp.c_str())); } } // checks if no is colorful or not bool isColorful(vector nos) { set check; // check if there is any duplicate elements in set // if yes then return false else true for (auto it = nos.begin(); it != nos.end(); ++it) if (!check.insert(product(*it)).second) return false; return true; } int main() { int d[] = { 2369,33,3245,12345,5 }; // test-cases cout << "A number can be broken into different contiguous sub-subsequence parts.\n\nSuppose, a number 3245 can be broken into parts like 3,\n2, 4, 5, 32, 24, 45, 324, 245, 3245. And this number is\na COLORFUL number, since product of every digit of a\ncontiguous subsequence is different\n\n"; for (size_t i=0; i < sizeof(d)/sizeof(*d); i++) { vector nos; breakNo(to_string(d[i]), nos); // this is for printing output for (auto it = nos.begin(); it != nos.end(); ++it) cout << "(" << *it << " -> " << product(*it) << ") "; cout <<"\n#" << d[i] << (isColorful(nos) ? " is colorful number.\n" : " is not colorful number.\n") << string(30, '~') << "\n\n"; } }

colorful nos