5 контест Даша

// 1
#include <iostream>
#include <vector>

using namespace std;

int n;
vector<vector<int>> graph(100, vector<int> (100));

void floid(){
    for (int i = 0; i < n; i++){
        for (int j = 0; j < n; j++){
            for(int k = 0; k < n; k++){
                graph[i][j] = min(graph[i][j], graph[i][k] + graph[k][j]);
            }
        }
    }
}

int main() {
    cin >> n;
    for (int i = 0; i < n; i++){
        for (int j = 0; j < n; j++) {
            cin >> graph[i][j];
        }
    }

    floid();

    for (int i = 0; i < n; i++){
        for (int j = 0; j < n; j++) {
            cout << graph[i][j] << ' ';
        }
        cout << endl;
    }

    return 0;
}

//2
#include <iostream>
#include <vector>

using namespace std;

int main() {
    int n, m, k;
    vector<int> v_from(100000);
    vector<int> v_to(100000);
    vector<int> v_weight(100000);
    vector<int> d(100, 1000000000);
    vector<int> d2(100, 1000000000);
    int s, f;
    cin >> n >> m >> k >> s >> f;
    s--;
    f--;

    for (int i = 0; i < m; i++){
        cin >> v_from[i] >> v_to[i] >> v_weight[i];
        v_from[i]--;
        v_to[i]--;
    }

    d[s] = 0;
    d2[s] = 0;
    for(int i = 0; i < k; i++){
        for(int j = 0; j < m; j++){
            if (d[v_from[j]] < 1000000000) {
                d2[v_to[j]] = min(d2[v_to[j]], d[v_from[j]] + v_weight[j]);
            }
        }
        d = d2;
    }

    if (d[f] == 1000000000){
        cout << -1;
    } else {
        cout << d[f];
    }

    return 0;
}