/* Name:poj 1468 Rectangles Author:Unimen Date: 23/04/11 19:27 */ /* 解题报告: 1、由时间5000ms,猜测可以用暴力求解 2、暴力求解时注意不要重复计数 */ #include <iostream> using namespace std; struct Rect { int xmin, xmax; int ymin, ymax; }; Rect strRects[5001]; int main() { int n; int i, j; int sum; while(cin>>n) { sum = 0; for(i=1; i<=n; i++) { cin>>strRects[i].xmin>>strRects[i].xmax>>strRects[i].ymin>>strRects[i].ymax; } for(i=1; i<=n; i++) { for(j=1; j<=n; j++) { if(i!=j && strRects[i].xmin>=strRects[j].xmin && strRects[i].xmax<=strRects[j].xmax && strRects[i].ymin>=strRects[j].ymin && strRects[i].ymax<=strRects[j].ymax) { ++sum; break; //避免重复计数 } } } cout<<sum<<endl; } return 0; }