试题D路径

分析：题目要求算1-2021的最短路径，结点之间的边权是给定的，所以可以通过Dijkstra算法来求最短路径
先解决(i,j)之间的权值，i、j之间的最小公倍数记为d，d可以通过求i、j之间的最大公约数gcd(i,j)让i*j/gcd(i,j)求得
1、构建邻接矩阵

int n = 2021;
for(int i = 1; i <= n; i++){
	for (int j = i+1; j < i+22; j++){//i和j之间的绝对值<=21时，i和j之间才有边
		G[i][j] = G[j][i] = i*j/gcd(i,j);
	}
}

2、Dijkstra算法
可以参考这篇博客

#include <iostream>
#include <cstring>
using namespace std;

const int N = 2100, INF = 0x3f3f3f3f;
int n, G[N][N], dist[N];
bool visited[N] = {false};

int gcd(int a, int b){
    if (b == 0) return a;
    else    return gcd(b, a%b); 
}

void Dijkstra(int s){
    memset(dist, 0x3f, sizeof (dist));
    dist[s] = 0;
    for (int i = 0; i < n; i++){
        int u = -1, MIN = INF;
        for (int j = 1; j <= n; j++){
            if (!visited[j] && dist[j] < MIN){
                u = j;
                MIN = dist[j];
            }
        }
        if (u == -1)    return ;
        visited[u] = true;
        for (int v = 1; v <= n; v++){
            if (!visited[v] && G[u][v] != INF && dist[u] + G[u][v] < dist[v]){
                dist[v] = dist[u] + G[u][v];
            }
        }
    } 
}

int main(){
    n = 2021;
    memset(G, 0x3f, sizeof(G));
    for (int i = 1; i <= n; i++){
        for (int j = i+1; j < i+22; j++){
            G[i][j] = G[j][i] = i * j / gcd(i,j);
        }
    }
    Dijkstra(1);
    cout<<dist[2021]<<endl;
    return 0;
}

结果：