Pagini recente » Cod sursa (job #408582) | Cod sursa (job #2321402) | Cod sursa (job #927324) | Cod sursa (job #2324760) | Cod sursa (job #3150455)
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n, a[101][101];
int main() {
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(i==j)
continue;
if(a[i][k]==0||a[k][j]==0)
continue;
if(a[i][j]==0)
a[i][j]=a[i][k]+a[k][j];
else
a[i][j]=min(a[i][j], a[i][k]+a[k][j]);
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
out<<a[i][j]<<' ';
out<<'\n';
}
return 0;
}