Pagini recente » Cod sursa (job #974306) | Cod sursa (job #232608) | Cod sursa (job #2824637) | Cod sursa (job #1270966) | Cod sursa (job #2104961)
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
long long int a[101][101];
int n;
int main()
{
f>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
{f>>a[i][j];
if(a[i][j]==0 && i!=j) a[i][j]=INT_MAX;}
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(a[i][k]<INT_MAX && a[k][j]<INT_MAX)
if(i!=j)
if(a[i][k]+a[k][j]<a[i][j]) a[i][j]=a[i][k]+a[k][j];
for(int i=1;i<=n;i++)
{for(int j=1;j<=n;j++)
g<<a[i][j]<<" ";
g<<"\n";
}
return 0;
}