该博客介绍了如何解决UVA在线判题系统中的10305题目，即任务排序问题。通过使用拓扑排序的方法，处理任务之间的依赖关系，确保每个任务在所有前置任务完成后才能执行。输入包含多个实例，每个实例包含任务数量n和直接依赖关系m，输出应为一个可能的任务执行顺序。博客提供了解题思路和样例输入输出。
Ordering Tasks
Input: standard input
Output: standard output
Time Limit: 1 second
Memory Limit: 32 MB
John has n tasks to do. Unfortunately, the tasks are not independent and the execution of one task is only possible if other tasks have already been executed.
Input
The input will consist of several instances of the problem. Each instance begins with a line containing two integers, 1 <= n <= 100 and m.
最低0.47元/天 解锁文章
扫一扫
1499
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
