#include<bits/stdc++.h>
#define ll long long
using namespace std;
struct Point{
double x,y;
}point[25*25];//存下每一个点
map<pair<double,double>,int> m;//存斜率k和截距b
int main(){
int cnt=0;
for(int i=0;i<20;i++){
for(int j=0;j<21;j++){
point[cnt].x=i;
point[cnt].y=j;
cnt++;
}
}
int ans=20+21;
for(int i=0;i<cnt;i++){
for(int j=0;j<cnt;j++){
//两点的直线与坐标轴平行或共点
if(point[i].x==point[j].x||point[i].y==point[j].y)
continue;
//斜率和截距
double k=(point[j].y-point[i].y)/(point[j].x-point[i].x);
double b=(point[j].x*point[i].y-point[j].y*point[i].x)/(point[j].x-point[i].x);
if(m[{k,b}]==0){
m[{k,b}]=1;
ans++;
}
}
}
cout<<ans<<endl;
}
//40257
也可以用set容器:
#include <iostream>
#include <vector>
#include <set>
using namespace std;
struct point
{
int x; //横坐标
int y; //纵坐标
};
int main()
{
vector<point> p;//存放所有点
for (int i = 0; i <= 19; ++i)
for (int j = 0; j <= 20; ++j)
p.push_back({i, j});
int len = p.size();
set<pair<double, double>> lines; //存放斜直线y=kx+b
for (int i = 0; i < len; ++i)
{
for (int j = 0; j < len; ++j)
{
if (p[i].x != p[j].x && p[i].y != p[j].y) // 统计所有斜直线的情况
{
double k = (p[j].y - p[i].y) * 1.0 / (p[j].x - p[i].x);
double b = (p[j].y * (p[j].x - p[i].x) - (p[j].y - p[i].y) * p[j].x) * 1.0 / (p[j].x - p[i].x);
//double b = p[j].y - k * p[j].x; 不用这种方法,避免k造成精度爆炸
lines.insert(pair<double, double>(k, b));
}
}
}
cout << lines.size() + 20 + 21 << endl; // 总的直线=斜直线+横直线+竖直线
return 0;
}