Your input is a series of rectangles, one per line. Each rectangle is specified as two points(X,Y) that specify the opposite corners of a rectangle. All coordinates will be integers in the range 0 to 100. For example, the line
5 8 7 10
specifies the rectangle who’s corners are(5,8),(7,8),(7,10),(5,10).
If drawn on graph paper, that rectangle would cover four squares. Your job is to count the number of unit(i.e.,1*1) squares that are covered by any one of the rectangles given as input. Any square covered by more than one rectangle should only be counted once.
Input
The input format is a series of lines, each containing 4 integers. Four -1’s are used to separate problems, and four -2’s are used to end the last problem. Otherwise, the numbers are the x-ycoordinates of two points that are opposite corners of a rectangle.
Output
Your output should be the number of squares covered by each set of rectangles. Each number should be printed on a separate line.
Sample Input
5 8 7 10
6 9 7 8
6 8 8 11
-1 -1 -1 -1
0 0 100 100
50 75 12 90
39 42 57 73
-2 -2 -2 -2
Sample Output
8
10000
用一个二维数组来放坐标,已经有的坐标就用一来标记,记录格数。
注意面积就是等于一的格数,每次循环要清零
#include <iostream>
using namespace std;
int main()
{
int a, b, c , d;int sum=0;
int p[120][120] = { 0 };
while (cin >> a >> b >> c >> d)
{
if (a == -1 && d == -1 && c == -1 && b == -1)
{
for (int i = 0; i < 120; i++)
{
for (int j = 0; j < 120; j++)清零
{
p[i][j] = 0;
}
}
cout << sum << endl;
sum = 0;
continue;
}
if (a == -2 && d == -2 && c == -2 && b == -2)
{
cout << sum<<endl;
break;
}
if (a > c) { int t = a; a = c; c = t; }//比较大小,小的放前面
if (b > d) { int t = b; b = d; d = t; }
for (int i = a; i < c; i++)///不用等于
{
for (int j = b; j < d; j++)
{
if (p[i][j] == 0)
{
p[i][j] = 1;
sum++;
}
}
}
}
}