Pagini recente » Cod sursa (job #2511003) | Cod sursa (job #2424424) | Istoria paginii runda/vali_tigan/clasament | Cod sursa (job #2048394) | Cod sursa (job #2569691)
#include <iostream>
#include <vector>
using namespace std;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
int n, i, j, k; vector < vector <int> > ad;
void citeste()
{
cin >> n;
for(i = 0; i < n; ++i)
for(j = 0; j < n; ++j)
{
cin >> ad[i][j];
}
}
void rezolva()
{
for(k = 0; k < n; ++k)
for(i = 0; i < n; ++i)
for(j = 0; j < n; ++j)
{
if(ad[i][j] > ad[i][k] + ad[k][j])
ad[i][j] = ad[i][k] + ad[k][j];
}
}
void afisare()
{
for(i = 0; i < n; ++i)
{
for(j = 0; j < n; ++j)
cout << ad[i][j] << ' ';
cout << '\n';
}
}
int main()
{
citeste();
// rezolva();
//afisare();
return 0;
}