Pagini recente » Cod sursa (job #2462403) | Borderou de evaluare (job #2279891) | Cod sursa (job #1051802) | Cod sursa (job #1631827) | Cod sursa (job #1805023)
#include <fstream>
using namespace std;
int c[105][105];
int t[105][105];
int main()
{
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n;
f >> n;
for(int i = 1; i <= n; i ++)
for(int j = 1; j <= n; j ++)
f >> c[i][j];
for(int k = 1; k <= n; k ++)
for(int i = 1; i <= n; i ++)
for(int j = 1; j <= n; j ++)
if(c[i][j] > c[i][k] + c[k][j]) {
c[i][j] = c[i][k] + c[k][j];
t[i][j] = k;
}
for(int i = 1; i <= n; i ++) {
for(int j = 1; j <= n; j ++)
g << c[i][j] << " ";
g << "\n";
}
return 0;
}