Pagini recente » Cod sursa (job #420282) | Cod sursa (job #360212) | Cod sursa (job #2971093) | Cod sursa (job #864336) | Cod sursa (job #1923333)
#include <fstream>
#include <math.h>
#include <vector>
#include <set>
#include <algorithm>
#include <cstring>
//#include <unordered_map>
#include <iomanip>
#include <time.h>
#include <stdio.h>
#include <bitset>
#include <map>
#define MAX 500000000000
//#include <iostream>
//#include <windows.h>
#include <deque>
//#include "PEZai.h"
//#include <Tlhelp32.h>
using namespace std;
//ifstream cin("jocul.in");
//ofstream cout("jocul.out");
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
using namespace std;
int n, dp[103][103];
int main()
{
cin >> n;
for(int i = 0; i < n; i++)
for(int j = 0; j < n; j++)
cin >> dp[i][j];
for(int k = 0; k < n; k++)
for(int i = 0; i < n; i++)
for(int j = 0; j < n; j++)
if(i != j && dp[i][k] != 0 && dp[k][j] != 0)
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j]);
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++)
cout << dp[i][j] << " ";
cout << "\n";
}
}