Cod sursa(job #2361941)
| Utilizator | Data | 2 martie 2019 20:33:54 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int Cost[102][102],i,j,k,N;
void RF()
{
for(k=1;k<=N;k++)
for(i=1;i<=N;i++)
for(j=1;j<=N;j++)
if(k!=i and k!=j and Cost[i][k]+Cost[k][j]<Cost[i][j])
Cost[i][j]=Cost[i][k]+Cost[k][j];
}
int main()
{
f>>N;
for(i=1;i<=N;i++)
for(j=1;j<=N;j++)f>>Cost[i][j];
RF();
for(i=1;i<=N;i++)
{
for(j=1;j<=N;j++)g<<Cost[i][j]<<" ";
g<<"\n";
}
return 0;
}
