Напишите программу ниже |
#include <vector>
#include <iostream>
#include <climits>
using namespace std;
const int inf = INT_MAX;
int main()
{
int n, s, t;
cin >> n >> s >> t;
vector<vector<int> > d(n + 1, vector<int>(n + 1,inf));
for (int i = 0; i < n; ++i)
{
for (int j = 0; j < n; ++j)
{
int a;
cin >> a;
if (a != -1)
{
d[i + 1][j + 1] = a;
}
}
}
for (int k = 1; k <= n; ++k)
{
for (int i = 1; i <= n; ++i)
{
for (int j = 1; j <= n; ++j)
{
|
|
}
}
}
if (d[s][t] == inf)
{
cout << -1;
return 0;
}
cout << d[s][t] << endl;
}
|