Description: Test one: Enter a positive integer precision N, to remove any of them left after the S numbers about the number of the original order of the formation of a new positive integer. Write algorithm for a given N and S, find a program makes the rest of the number of digits of the new minimum. Experiment II: Programming with the deadline to resolve the stand-alone job scheduling problem.
To Search:
- [paixu] - Work sorting algorithm with a time limit
- [Operatingperiod] - On a single machine can handle only n-jo
File list (Check if you may need any files):
1(包含算法).cpp
2(包含算法).cpp
贪心法实验.doc
Download