Pagini recente » bruh | Cod sursa (job #2524758) | Borderou de evaluare (job #1853262) | Cod sursa (job #2857063)
#include <fstream>
#include <climits>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
static int d[102][102];
int n,m;
int main() {
in>>n;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++) {
if(d[i][j]==0 && i!=j)
d[i][j]=INT_MAX;
in >> d[i][j];
}
}
for(int k=1;k<=n;k++)
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
if(d[i][k]+d[k][j]<d[i][j])
d[i][j]=d[i][k]+d[k][j];
}
}
}
for(int i=1;i<=n;i++) {
for (int j = 1; j <= n; j++)
out << d[i][j] << " ";
out<<"\n";
}
return 0;
}