在找不到问题了，有没有好心人帮忙看看？

#include <iostream>
#include <cstring>
using namespace std;
typedef long long LL;

const int N = 110, mod = 1e5;
int g[N][N];
LL d[N];
bool st[N];
int pow2[N], p[N];
int n, m;

int find(int x) {
    if (p[x] != x) p[x] = find(p[x]);
    return p[x];
}

void dijkstra() {
    // 初始化
    memset(d, 0x3f, sizeof d);
    d[0] = 0;
    // n 次循环
    for (int k = 0; k < n; k ++ ) {

        int minv = 0, mind = 0x3f3f3f3f;
        for (int i = 0; i < n; i ++ ) {
            if (!st[i] && d[i] < mind) {
                mind = d[i];
                minv = i;
            }
        }
        
        st[minv] = true;
        
        for (int i = 0; i < n; i ++ ) {
            if (!st[i]) {
                d[i] = min(d[i], d[minv] + g[minv][i]);
            }
        }
        
    }
    
}

int main() {
    
    pow2[0] = 1;
    for (int i = 1; i < 510; i ++ ) pow2[i] = (LL) 2 * pow2[i - 1...