Pagini recente » Cod sursa (job #2989308) | Cod sursa (job #1860499) | Cod sursa (job #1717168) | Cod sursa (job #2730173) | Cod sursa (job #2484016)
#include<bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in"); ofstream fout("royfloyd.out");
unsigned short int w[101][101],dp[101][101][101], n;
void royfloyd(){
short unsigned int n1, n2;
for(int k=1; k<=n; k++){
for(int i=1; i<=n; i++){
for(int j=1; j<=n; j++){
n1=dp[k-1][i][j]; n2=dp[k-1][i][k]+dp[k-1][k][j];
dp[k][i][j]=n1>=n2?n2:n1 ;
}
}
}
}
int main(){
fin>>n;
for(int i=1; i<=n; i++){
for(int j=1; j<=n; j++){
fin>>w[i][j];
dp[0][i][j]=w[i][j];
}
}
royfloyd();
for(int i=1; i<=n; i++){
for(int j=1; j<=n; j++){
fout<<dp[n][i][j]<<' ';
}
fout<<endl;
}
return 0;
}