GO Solution For UVa 10305 - Ordering Tasks. In this post we will see how we can solve this challenge in GoLang for UVa Online Judge.

Problem Description

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


You can find the full details of the problem Ordering Tasks at UVa Online Judge

Sample Input

5 4
1 2
2 3
1 3
1 5
0 0

Sample Output

4 1 5 2 3

Solution: Please check the main.go snippet for the solution.

Solution originally posted at: Github by @codingsince1985