Problem:
All Pairs Shortest Path

Input

An edge-weighted graph G (V, E).

|V| |E|
s0 t0 d0
s1 t1 d1
:
s|E|-1 t|E|-1 d|E|-1

|V| is the number of vertices and |E| is the number of edges in G. The graph vertices are named with the numbers 0, 1,..., |V|-1 respectively.

si and ti represent source and target vertices of i-th edge (directed) and di represents the cost of the i-th edge.

Output

If the graph contains a negative cycle (a cycle whose sum of edge costs is a negative value), print

NEGATIVE CYCLE

in a line.

Otherwise, print

D0,0 D0,1 ... D0,|V|-1
D1,0 D1,1 ... D1,|V|-1
:
D|V|-1,0 D1,1 ... D|V|-1,|V|-1

The output consists of |V| lines. For each ith line, print the cost of the shortest path from vertex i to each vertex j (j = 0, 1, ... |V|-1) respectively. If there is no path from vertex i to vertex j, print "INF". Print a space between the costs.

Constraints

1 ≤ |V| ≤ 100

0 ≤ |E| ≤ 9900

-2 × 107 ≤ di ≤ 2 × 107

There are no parallel edges

There are no self-loops

Sample Input 1

4 6
0 1 1
0 2 5
1 2 2
1 3 4
2 3 1
3 2 7

Sample Output 1

0 1 3 4
INF 0 2 3
INF INF 0 1
INF INF 7 0

Sample Input 2

4 6
0 1 1
0 2 -5
1 2 2
1 3 4
2 3 1
3 2 7

Sample Output 2

0 1 -5 -4
INF 0 2 3
INF INF 0 1
INF INF 7 0

Sample Input 3

4 6
0 1 1
0 2 5
1 2 2
1 3 4
2 3 1
3 2 -7

Sample Output 3

NEGATIVE CYCLE

Solution in JAVA (judge verdict: Wrong Answer)

import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		try(Scanner sc = new Scanner(System.in)){
			int v=sc.nextInt();
			int e=sc.nextInt();
			int[][] cost=new int[v][v];
			int INF=100000000;
			for(int i=0; i<v; i++) {
				for(int j=0; j<v; j++) {
					cost[i][j]=(i==j)? 0:INF;
				}
			}
			
			for(int i=0; i<e; i++) {
				int s=sc.nextInt();
				int t=sc.nextInt();
				int d=sc.nextInt();
				cost[s][t]=d;
			}
			boolean minor=false;
			for(int k=0; k<v; k++) {
				for(int i=0; i<v; i++) {
					for(int j=0; j<v; j++) {
						if(cost[i][j]>cost[i][k]+cost[k][j] && cost[i][k]!=INF && cost[k][j]!=INF)
						cost[i][j]=Math.min(cost[i][j], cost[i][k]+cost[k][j]);
						//System.out.println("cost["+i+"]["+k+"]="+cost[i][k]+" cost["+k+"]["+j+"]="+cost[k][j]);
						//System.out.println("cost["+i+"]["+j+"]="+cost[i][j]);
					}
					if(cost[i][i]<0) minor=true;
				}
			}
			if(minor) System.out.println("NEGATIVE CYCLE");
			else {
				for(int i=0; i<v; i++) {
					for(int j=0; j<v; j++) {
						if(j>0) System.out.print(" ");
						System.out.print((cost[i][j]>=INF)? "INF":cost[i][j]);
					}
					System.out.println();
				}
			}
			
		}
	}
}