백준 9298번 Ant Entrapment

문제 링크입니다: https://www.acmicpc.net/problem/9298

9298번: Ant Entrapment

간단한 수학 문제였습니다.

 

	#include <iostream>
	#include <algorithm>
	using namespace std;
	const double MAX = 1001;
	const double MIN = -1001;
	int main(void)
	{
	int T;
	cin >> T;
	for (int t = 1; t <= T; t++)
	{
	int N;
	cin >> N;
	double minX = MAX, maxX = MIN;
	double minY = MAX, maxY = MIN;
	for (int n = 0; n < N; n++)
	{
	double X, Y;
	cin >> X >> Y;
	minX = min(minX, X);
	maxX = max(maxX, X);
	minY = min(minY, Y);
	maxY = max(maxY, Y);
	}
	printf("Case %d: ", t);
	double area = abs((maxX - minX) * (maxY - minY));
	double perimeter = abs((maxX - minX) + (maxY - minY)) * 2;
	printf("Area %.9lf, Perimeter %.9lf\n", area, perimeter);
	}
	return 0;
	}

view raw .cpp hosted with ❤ by GitHub

 

개발환경:Visual Studio 2017

 

지적, 조언, 질문 환영입니다! 댓글 남겨주세요~