Pagini recente » Cod sursa (job #1429580) | Istoria paginii runda/winners13/clasament | Cod sursa (job #1885052) | Istoria paginii runda/simulareojiclasa7/clasament | Cod sursa (job #1535469)
#include <iostream>
#include <fstream>
using namespace std;
int n, a[102][102];
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
void rf()
{
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] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i != j)
a[i][j]=a[i][k]+a[k][j];
}
int main()
{
f>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
f>>a[i][j];
rf();
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
g<<a[i][j]<<" ";
g<<'\n';
}
f.close();
g.close();
}