- Category:
- Data structs
- Tags:
-
- File Size:
- 49kb
- Update:
- 2018-01-05
- Downloads:
- 0 Times
- Uploaded by:
- 姚任性
Description: 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.
To Search:
File list (Check if you may need any files):
| Filename | Size | Date |
|---|
| 丑数.cpp | 1940 | 2018-01-03
|
| 丑数.exe | 135434 | 2018-01-03
|
| 丑数.o | 2295 | 2018-01-03 |
Download