Zoj 2554 brownie points

// At the beginning, I have been reading questions for a long time, and I do not quite understand what the requirements are! After reading it again, I can understand it! // The requirement of the question is: in the given coordinates, take the coordinates in the center as the origin, and then calculate the first and third quadrants respectively, // The number of coordinate points in the second and fourth quadrants! # Include "iostream" using namespace STD; struct info {int X; int y ;}; info [200010]; int main () {int N, I, j, ans1, ans2; Info centerpoint; while (CIN> N & N) {for (I = 0; I <n; I ++) CIN> info [I]. x> info [I]. y; j = (n-1)/2; ans1 = ans2 = 0; centerpoint. X = info [J]. x, centerpoint. y = info [J]. y; for (I = 0; I <n; I ++) {If (info [I]. x> centerpoint. X & info [I]. y> centerpoint. y) | (info [I]. x <centerpoint. X & info [I]. Y <centerpoint. y) ans1 ++; else if (info [I]. x> centerpoint. X & info [I]. Y <centerpoint. y) | (info [I]. x <centerpoint. X & info [I]. y> centerpoint. y) ans2 ++;} cout <ans1 <"" <ans2 <Endl ;}}