1211. 商人的宣传

#include <iostream>
#include <cstring>

using namespace std;

int main() {
    int schedule[101][101] = {0};
    int tmp[101][101] = {0};
    int once[101][101] = {0};
    int cities, connections, days, queries, start, destination;
    cin >> cities >> connections >> days;
    for(int i = 0; i < connections; i++) {
        int a, b;
        cin >> a >> b;
        schedule[a][b] = 1;
        once[a][b] = 1;
    }
    for(int count = 1; count < days; count++) {
        for(int i = 1; i < 101; i++) {
            for(int j = 1; j < 101; j++) {
                tmp[i][j] = schedule[i][j];
                schedule[i][j] = 0;
            }
        }
        for(int i = 1; i < 101; i++) {
            for(int j = 1; j < 101; j++) {
                for(int k = 1; k < 101; k++) {
                    schedule[i][j] += tmp[i][k] * once[k][j];
                }
            }
        }
    }
    cin >> queries;
    for(int i = 0; i < queries; i++) {
        cin >> start >> destination;
        cout << schedule[start][destination] << endl;
    }
    return 0;
}