Construct a set whose numbers are all ugly numbers, then take the number of a collection arbitrarily, assuming that it is K. Then 2K, 3k, 5K and 7K are also ugly numbers and are thrown into the set. Since the request for n is small, then the first N decimal number of priority queues is considered, and the set is extended from 1, and the N operation is repeated, and the final number is the answer.

Filename	Size	Update
丑数.cpp	1940	2018-01-03
丑数.exe	135434	2018-01-03
丑数.o	2295	2018-01-03

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．