Pagini recente » Cod sursa (job #1851025) | Cod sursa (job #1326551) | Cod sursa (job #795918) | Cod sursa (job #1771627) | Cod sursa (job #1857354)
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n, i, j, k, a[105][105];
int sol[105][105];
int main() {
f >> n;
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
f >> a[i][j];
for (k = 1; k <= n; k++)
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
if ((a[i][k]+a[k][j]<a[i][j]||a[i][j]==0) && (i!=j) &&(a[i][k]!=0&&a[k][j]!=0))
a[i][j]=a[i][k]+a[k][j];
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++)
g << a[i][j] <<" ";
g << "\n";
}
return 0;
}