{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cimg src\u003d\"CDN_BASE_URL/17be20248928c165a1eb57dea6766887?v\u003d1714329823\" border\u003d\"0\" alt\u003d\"Problem illustration\" align\u003d\"RIGHT\" class\u003d\"problem_raimage\"\u003e\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eAt the Petrozavodsk Training Camp, the Psych Up team didn\u0027t waste any \r\ntime. The programmers passed with three stars all the levels of the \r\npopular game “Angry Birds Rio” except for one level. Whatever they tried \r\nto do, it didn\u0027t work. Then the programmers decided to automate the \r\nprocess and sat down at their computer. \u003c/div\u003e\u003c/div\u003e\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eThe game goes as follows. There is a slingshot shooting with angry birds \r\nat the left bottom corner of the map. The slingshot can shoot a bird at \r\nany angle to the ground. The aim is to hit monkeys suspended in the air to \r\nthe right of the slingshot. No forces act on the birds except for the \r\ngravity force, which imparts to them an acceleration of \u003ci\u003eg\u003c/i\u003e \u003d 9.81 m/s\u003csup\u003e2\u003c/sup\u003e \r\ndirected downward. As a result, the horizontal component of the velocity \r\nof each bird is constant, while the vertical component changes with time. \u003c/div\u003e\u003c/div\u003e\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eThe programmers can\u0027t pass a level at which there are only five monkeys \r\nand the slingshot. It is required to defeat all the monkeys with the \r\nminimum number of shots. Hitting a monkey doesn\u0027t affect a bird in any \r\nway, so its motion is continued. The birds and monkeys are so small that \r\nthey can be regarded as points. The map of the level is infinite to the \r\nright and upward. \u003c/div\u003e\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eIn each of the five input lines you are given a pair of integers not \r\nexceeding 10\u0026nbsp;000, which are the coordinates of a monkey in meters. The \r\nslingshot is at the point\u0026nbsp;(0, 0). The \u003ci\u003eOx\u003c/i\u003e axis is directed to the right \r\nand the \u003ci\u003eOy\u003c/i\u003e axis is directed upward. It is guaranteed that there is no \r\nstraight line containing the slingshot and more than one monkey. \u003c/div\u003e\u003c/div\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eOutput the minimum number of shots needed for hitting all the monkeys.\u003c/div\u003e\u003c/div\u003e"}},{"title":"Sample","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e1 5\r\n2 8\r\n3 9\r\n4 8\r\n5 5\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e1\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}