Pagini recente » Cod sursa (job #1134509) | Cod sursa (job #856745) | Istoria paginii runda/oni_10_3 | Cod sursa (job #1042514) | Cod sursa (job #2156312)
#include <iostream>
#include <fstream>
#include <limits>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n,a[101][101];
void initialsetup(){
int d = std::numeric_limits<int>::max();
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++){
a[i][j]=d;
}
int main()
{
initialsetup();
in>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
in>>a[i][j];
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(a[i][j]>a[i][k]+a[k][j])
a[i][j]=a[i][k]+a[k][j];
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(i==j)
out<<0<<" ";
else
out<<a[i][j]<<" ";
}
out<<"\n";
}
return 0;
}