Error
|
|
---|---|
@Ibrahim Nash | 6379 |
@blackshadows | 6329 |
@mb1973 | 5376 |
@Quandray | 5231 |
@akhayrutdinov | 5111 |
@saiujwal13083 | 4510 |
@sanjay05 | 3762 |
@marius_valentin_dragoi | 3522 |
@sushant_a | 3459 |
@verma_ji | 3357 |
@KshamaGupta | 3318 |
Complete Leaderboard | |
|
|
@184025 | 112 |
@terabaap123 | 99 |
@anamikaprasad124 | 92 |
@arshjit_singh7 | 92 |
@kumsachin10 | 90 |
@vaibhavinayak | 75 |
@NullPointerException | 74 |
@TanmayJ | 74 |
@ronaldo77 | 72 |
@bhupindersingh25122001 | 68 |
@ritiksethi21 | 68 |
Complete Leaderboard |
The problem is to find shortest distances between every pair of vertices in a given edge weighted directed Graph. The Graph is represented as Adjancency Matrix, and the Matrix denotes the weight of the edegs (if it exists) else INF (1e7).
Input:
The first line of input contains an integer T denoting the no of test cases. Then T test cases follow. The first line of each test case contains an integer V denoting the size of the adjacency matrix. The next V lines contain V space separated values of the matrix (graph). All input will be integer type.
Output:
For each test case output will be V*V space separated integers where the i-jth integer denote the shortest distance of ith vertex from jth vertex. For INT_MAX integers output INF.
Constraints:
1 <= T <= 20
1 <= V <= 100
1 <= graph[][] <= 500
Example:
Input
2
2
0 25
INF 0
3
0 1 43
1 0 6
INF INF 0
Output
0 25
INF 0
0 1 7
1 0 6
INF INF 0
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?
Yes