Pagini recente » Sandbox (cutiuţa cu năsip) | Cod sursa (job #2450758) | Cod sursa (job #696226) | Cod sursa (job #625825) | Cod sursa (job #1479389)
#include <fstream>
using namespace std;
short A[101][101];
int n;
void Citeste()
{
ifstream f("royfloyd.in");
f>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
f>>A[i][j];
f.close();
}
void Scrie()
{
ofstream g("royfloyd.out");
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
g<<A[i][j]<<" ";
g<<endl;
}
}
void Warshall()
{
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]&&j!=i)
if( !A[i][j] || A[i][j]>A[i][k]+A[k][j] ) A[i][j]=A[i][k]+A[k][j];
}
int main()
{
Citeste();
Warshall();
Scrie();
return 0;
}