## TLE '17 Contest 4 P4 - Willson and Target Practice

View as PDF

Points: 17 (partial)
Time limit: 3.0s
Java 5.0s
Python 10.0s
Memory limit: 512M

Authors:
Problem types
Allowed languages
Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, CommonLisp, D, Dart, F#, Forth, Fortran, Go, Groovy, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, Nim, ObjC, OCaml, Octave, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig
The poor unsuspecting targets don't see it coming...

Willson the Canada Goose is like any other Canada Goose - he likes to engage in target practice.

There are unsuspecting targets that Willson can practice on. The target is located at .

Unlike other geese who choose a circular area for target practice, Willson is unique and decides to choose an equilateral triangle with side length as his area, with the additional constraint that one side of the triangle must be parallel to the line .

Could you tell Willson the maximum number of targets that could be in such an area?

Note: A target on the perimeter of the triangle is counted.

#### Constraints

All coordinates satisfy .

15
215
320
430

Note 1: There can be multiple targets at the same coordinate.

Note 2: Python users are recommended to submit in PyPy.

#### Input Specification

The first line of input will contain two integers, and .

lines of input follow. The line will contain two integers, and .

#### Output Specification

Output a single integer, the maximum number of targets that can be in an area as described above.

#### Sample Input

5 3
1 1
2 0
2 4
3 2
3 3

#### Sample Output

3