NOJ 1553: [蓝桥杯2021初赛] 路径【最大公约数】【最小公倍数】【最短路】

---

一、题目链接

NOJ 1553: [蓝桥杯2021初赛] 路径

---

二、题目分析

（一）算法标签

最大公约数 最小公倍数 最短路

（二）解题思路

---

三、AC代码

解法一:

#include <iostream>
#include <cstring>

using namespace std;

const int N = 2030, INF = 0x3f3f3f3f;

int n;
int dist[N];
bool st[N];
int g[N][N];

void dijkstra()
{
	memset(dist, 0x3f, sizeof dist);
	dist[1] = 0;
	
	for (int i = 0; i < n; i ++ )
	{
		int t = -1;
		for (int j = 1; j <= n; j ++ )
			if (!st[j] && (t == -1 || dist[j] < dist[t]))
				t = j;
		st[t] = true;
		for (int j = 1; j <= n; j ++ )
			dist[j] = min(dist[j], dist[t] + g[t][j]);
	}
}

int gcd(int a, int b)
{
	return b ? gcd(b, a % b) : a;
}

int main()
{
	n = 2021;
	for (int i = 1; i <= n; i ++ )
		for (int j = 1; j <= n; j ++ )
			if (i == j) g[i][j] = 0;
			else g[i][j] = INF;
	
	for (int i = 1; i <= n; i ++)
		for (int j = i + 1; j <= n; j ++ )
			if (abs(i - j) <= 21) g[i][j] = g[j][i] = i * j / gcd(i, j);
	dijkstra();
	
	cout << dist[2021];	// 10266837
	return 0;
}

---

四、其它题解

NOJ 1553: [蓝桥杯2021初赛] 路径