试题 C ：直线

一、题目描述

P8741 [蓝桥杯 2021 省 B] 试题 C ：直线

二、算法简析

设两点 $P_1(x_1,y_1)$ 和 $P_2(x_2,y_2)$。

• 斜率为：

$$k=\frac{y_2-y_1}{x_2-x_1}$$

• 斜截式为：

$$\begin{array}{rl}y-y_1& =k(x-x_1)\\ y-y_1& =\frac{y_2-y_1}{x_2-x_1}(x-x_1)\end{array}$$

• 化解为一般式 $Ax+By=C$：

$$\begin{array}{rl}y-y_1& =\frac{y_2-y_1}{x_2-x_1}(x-x_1)\\ (y-y_1)(x_2-x_1)& =(y_2-y_1)(x-x_1)\\ (x_2-x_1)y-y_1{x}_2+y_1{x}_1& =(y_2-y_1)x-y_2{x}_1+y_1{x}_1\\ (y_2-y_1)x-(x_2-x_1)y& =x_1{y}_2-x_2{y}_1\end{array}$$

$$\begin{array}{rl}\therefore A& =(y_2-y_1)\\ B& =x_1-x_2\\ C& =x_1{y}_2-x_2{y}_1\end{array}$$

• 将 $A,B,C$ 分别除以三者的最大公约数，得到最简形式。

---

三、本题代码

#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> P;
typedef pair<P, int> line;

vector<P> d;
set<line> S;

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

void init(void)
{
	for (int i = 0; i < 20; i++)
		for (int j = 0; j < 21; j++)
			d.push_back(P(i, j));
}

void solve(void)
{
	for (int i = 0; i < d.size(); i++)
	{
		for (int j = i + 1; j < d.size(); j++)
		{
			int x1 = d[i].first, x2 = d[j].first;
			int y1 = d[i].second, y2 = d[j].second;
			
			int A, B, C;
			A = y2 - y1;
			B = x1 - x2;
			C = x1 * y2 - x2 * y1;
			int tmp = gcd(gcd(A, B), C);
			S.insert(line(P(A / tmp, B / tmp), C / tmp));
		}
	}
}

int main()
{
	init();
	solve();
	cout << S.size() << endl;
	
	return 0;
}

---

完