Write a program in c++ that takes the string 1234567890AB, and convert it to hexadecimal and find all possible permutations of the hexadecimal number 1234567890AB. Program should test if each permutation is evenly divisible by 12. Program should skip permutations that include repeated numbers/letters (1224567898AB is not a solution because some numbers are used more than once).

each permutation of the program must be evenly divisible by the digits there. for example, the number 1234567890AB is evenly divisible by 12, 1234567890A is evenly divisible by 11, 1234567890 is evenly divisible by 10, 123456789 is evenly divisible by 9.... so on until 12 is evenly divisble by 2, 1 is evenly divisible by 1. if that is the case then we keep that permutation. if not we skip it and not consider it a solution. Program should output all results and a total count of how many correct results ( no repeating numbers/letters in permutations and is evenly divisible by 12)