Pagini recente » Cod sursa (job #769577) | Cod sursa (job #2936333) | Cod sursa (job #1787962) | Istoria paginii runda/cnilc1_2-dq/clasament | Cod sursa (job #2156296)
#include <iostream>
#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(a[i][j]>a[i][k]+a[k][j])
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;
}