Problem 3272 · Hard

Find the Count of Good Integers

Count n-digit integers whose digits can be rearranged into a palindrome divisible by k, with no leading zero.

Open the interactive visualisation