2021蓝桥杯省赛第一场试题E:路径

在这里插入图片描述

#include<bits/stdc++.h>
using namespace std;
const int N = 2050;
typedef long long ll;
#define INF 99999999
int g[N][N];
int n = 2021;
/*求最大公约数*/
int gcd(int a, int b)
{
	return !b ? a : gcd(b, a % b);
}
int main()
{
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= n; j++)
		{
			if (i == j)
				g[i][j] = g[j][j]=0;
			else if (abs(i - j) > 21)
				g[i][j] = INF;
			else if (abs(i - j) <= 21)
				g[i][j] = g[j][i] = i*j/gcd(i,j);
		}
	}
	/*Floyd算法*/
	for(int k=1;k<=n;k++)
		for(int i=1;i<=n;i++)
			for (int j = 1; j <= n; j++)
			{
				if (g[i][j] > (g[i][k] + g[k][j]))
					g[i][j] = g[i][k] + g[k][j];
			}
	printf("%lld", g[1][2021]);
	return 0;
}