View Code of Problem 3818

#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;

int main(void)
{
    int n, m, k;
    while (scanf("%d %d %d", &n, &m, &k) != EOF)
    {
        int arr[n][n];
        memset(arr, 0, sizeof(arr));
        for (int i = 0; i < m; i++)
        {
            int a, b, c;
            scanf("%d %d %d", &a, &b, &c);
            arr[a][b] = c;
            arr[b][a] = c;
        }
        for (int k = 0; k < n; k++)
        {
            for (int i = 0; i < n; i++)
            {
                for (int j = 0; j < n; j++)
                {
                    if (arr[i][k] != 0 && arr[k][j] != 0)
                    {
                        if (arr[i][j] != 0)
                        {
                            if (arr[i][j] > arr[i][k] + arr[k][j] && k != i && k != j)
                            {
                                arr[i][j] = arr[i][k] + arr[k][j];
                                arr[j][i] = arr[i][k] + arr[k][j];
                            }
                        }
                        else
                        {
                            arr[i][j] = arr[i][k] + arr[k][j];
                            arr[j][i] = arr[i][k] + arr[k][j];
                        }
                    }
                }
            }
        }
        while (k--)
        {
            int a, b;
            cin >> a >> b;
            cout << arr[a][b] << endl;
        }
    }
}