蓝桥直线问题

 

#include<bits/stdc++.h>
using namespace std;
//定义一个点的结构体 
struct Point{
	double x,y;
}p[25*25];
//定义一个容器表示直线line，且pair中存放直线的k与b 
map<pair<double,double>,int> line; 

int main(){
	int cnt = 0;
	int row = 21, col = 20;
	for(int i = 0; i < row; i++)
	   for(int j = 0; j < col; j++){
	   	  p[cnt].x=i; p[cnt++].y=j;
	   }
	//先把直线数加上横线和纵线 
	int linenum = row + col;
	for(int i = 0; i < cnt; i++)
	   for(int j = 0; j < cnt; j++){
	   	if(p[i].x==p[j].x || p[i].y==p[j].y) continue;
	   	
	   	double k = (p[j].y-p[i].y)/(p[j].x-p[i].x);
	   	double b = (p[j].x*p[i].y-p[i].x*p[j].y)/(p[j].x-p[i].x);
	   	
	   	if(line[{k,b}]==0){
	   		line[{k,b}]=1;
	   		linenum++;
		   }
	   }
	cout<<linenum<<endl;
	return 0;
}