HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Sections > Geometry > problem:


50399 - Mobile Base Station

Guest
• Review clarifications (1)

Section problems

• 50670 - Picture
• 51041 - Plane Segmentation
• 50422 - Area and Perimeter of diffe...
• 50473 - Counting Circles Positions
• 50327 - Parallel Lines
• 50362 - Pythagorean Numbers
• 50328 - How far away
• 50397 - The Number of Points in a ...
• 50399 - Mobile Base Station
• 50487 - Radius of Inscribed Circle
• 50480 - What quadrant is it?
• 50825 - Drawing Polygon
• 50508 - The Biggest Area
• 50854 - Area of Triangle Revised
• 50669 - Area of an Irregular Polygon
• 51034 - Area of 3 Shapes
• 50349 - Area of a Triangle

Feedback

If you notice incorrect translations in Contester, please let author know.

Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb.
Prepared by Ibrahim Mesecan.

Mobile Base Station

A mobile service provider wants to test its base stations. The company wants to see if the number of simultaneous connections is as described in device specifications. For the test, they will provide n people in the normal coverage of base station; and then, they will compare the real connections from the station.

Question:
Write a program that is going to read the coordinates and the coverage radius of the base station and then coordinates of n people. Find how many of these people are in the coverage of the base station.

Input specification
You will be first given 3 floating point numbers: x and y coordinates of the station followed by its coverage radius. Then, you will be given an integer number (n): the number of people. The following n lines will contain two floating point numbers: x and y coordinates of every person where coordinates are floating point numbers on a plane -5000 ≤ (x,y) ≤ 5000; 0 < radius ≤ 2000 and 0 < n ≤ 5000.

Output specification
Show just one integer number: the number of people in the coverage of the station.

Sample Input I  
  10 10 5 5
  12.7 12
  7.8 6.5
  16 12
  15.1 10
  10 15
Sample Input II  
  0 -1 9 5
  9 8
  3 -5
  -9 -1
  -3 -10
  3 10
Sample Output I  
  3
Sample Output II  
  2


Для отправки решений необходимо выполнить вход.

www.contester.ru