洛谷-对角矩形坐标

在这里插入图片描述

#include <iostream>
using namespace std;
const int N = 9;
int a[N][N];//记录数据
int b[999];//记录x的个数
int c[999];//记录y的个数

int main () 
{
    
    
	for (int i = 0; i < 3; i++) //输入
	{
    
    
		for (int j = 0; j < 2; j++) 
		{
    
    
			cin >> a[i][j];
		}
	}
	for (int i = 0; i < 3; i++) //记录个数
	{
    
    
		b[a[i][0]]++;
	}
	int x, v;//求出x坐标
	for (v = 0; v < 999; v++) 
	{
    
    
		if (b[v] == 1)
			x = v;
	}
	int y,n;//求出y坐标
	for (int i= 0; i< 3; i++) 
	{
    
    
		c[a[i][1]]++;
	}
	for (n = 0; n < 999; n++) 
	{
    
    
		if (c[n] == 1)
			y = n;
	}
	cout << x << " " << y << endl;
	return 0;
}

Guess you like

Origin blog.csdn.net/weixin_52045928/article/details/115876568