Надар 5 контет

// 1
#include <iostream>
#include <limits.h>

using namespace std;

int main() {
    int n, m, k;
    int s, f;
    cin >> n >> m >> k >> s >> f;
    s-=1;
    f-=1;
    int a[m], b[m], weight[m];
    for (int i = 0; i < m; i++) {
        cin >> a[i] >> b[i] >> weight[i];
        a[i] -= 1;
        b[i] -= 1;
    }
    int d[k+1][n];
    for (int i = 0; i < k+1; i++){
        for(int j = 0; j < n; j++){
            d[i][j] = INT_MAX;
        }
    }
    d[0][s] = 0;
    for (int i = 0; i < k; i++) {
        for(int l = 0; l < n; l++)
            d[i + 1][l] = d[i][l];
        for (int j = 0; j < m; j++) {
            if (d[i][a[j]] < INT_MAX) {
                d[i + 1][b[j]] = min(d[i+1][b[j]], d[i][a[j]] + weight[j]);
            }
        }
    }
    if (d[k][f] == INT_MAX) {
        cout << "-1";
    } else {
        cout << d[k][f];
    }

    return 0;
}

// 2
#include <iostream>

using namespace std;

int main() {int n;
    cin >> n;
    int gr[n][n];
    for (int i = 0; i < n; i++){
        for (int j = 0; j < n; j++){
            cin >> gr[i][j];
        }
    }
    for (int k = 0; k < n; k++){
        for (int i = 0; i < n; i++){
            for (int j = 0; j < n; j++){
                gr[i][j] = min(gr[i][j], gr[i][k] + gr[k][j]);
            }
        }
    }
    for (int i = 0; i < n; i++){
        for (int j = 0; j < n; j++){
            cout << gr[i][j] << " ";
        }
        cout << endl;
    }
    return 0;
}