Pagini recente » Cod sursa (job #3324826) | Cod sursa (job #1043445) | Cod sursa (job #1444372) | Cod sursa (job #553876) | Cod sursa (job #953263)
Cod sursa(job #953263)
#include<iostream>
#include<fstream>
#include<algorithm>
using namespace std;
int main(){
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n;
in>>n;
int adj[100][100];
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
in>>adj[i][j];
for(int k=0;k<n;k++)
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
adj[i][j]=min(adj[i][j],adj[i][k]+adj[k][j]);
for(int i=0;i<n;i++){
for(int j=0;j<n;j++)
out<<adj[i][j]<<" ";
out<<'\n';
}
return 0;
}