project euler problem 170

Find the largest 0 to 9 pandigital that can be formed by concatenating products

This problem is not fun at all. I checked the discussion,  I did not find any elegant method. A prev_permutation algorithm might be of help.