Humanity's Last Code Exam / 2020_F / Ley Lines

## Problem Description

In 1921, the amateur archaeologist Alfred Watkins coined the term “ley lines” to refer to straight lines between numerous places of geographical and historical interest. These lines have often been associated with mysterious and mystical theories, many of which still persist.

One of the common criticisms of ley lines is that lines one draws on a map are actually of non-zero width, and finding “lines” that connect multiple places is trivial, given a sufficient density of points and a sufficiently thick pencil. In this problem, you will explore that criticism.

For simplicity, we will ignore the curvature of the earth and just assume we are dealing with a set of points on a plane, each of which has a unique (x,y) coordinate, and no three of which lie on a single straight line. Given such a set, and the thickness of your pencil, what is the largest number of points through which you can draw a single line?

**Input**

The first line of input consists of two integers n and t, where n (3≤n≤3000) is the number of points in the set and t (0≤t≤10⁹) is the thickness of the pencil. Then follow n lines, each containing two integers x and y (−10⁹≤x,y≤10⁹), indicating the coordinates of a point in the set.

You may assume that the input is such that the answer would not change if the thickness t was increased or decreased by 10^(−2), and that no three input points are collinear.

**Output**

Output the maximum number of points that lie on a single “line” of thickness t.

**Sample Input 1**

## Problem Description

In 1921, the amateur archaeologist Alfred Watkins coined the term “ley lines” to refer to straight lines between numerous places of geographical and historical interest. These lines have often been associated with mysterious and mystical theories, many of which still persist.

One of the common criticisms of ley lines is that lines one draws on a map are actually of non-zero width, and finding “lines” that connect multiple places is trivial, given a sufficient density of points and a sufficiently thick pencil. In this problem, you will explore that criticism.

For simplicity, we will ignore the curvature of the earth and just assume we are dealing with a set of points on a plane, each of which has a unique \((x, y)\) coordinate, and no three of which lie on a single straight line. Given such a set, and the thickness of your pencil, what is the largest number of points through which you can draw a single line?

**Input**

The first line of input consists of two integers \( n \) and \( t \), where \( n \) \((3 \leq n \leq 3000)\) is the number of points in the set and \( t \) \((0 \leq t \leq 10^9)\) is the thickness of the pencil. Then follow \( n \) lines, each containing two integers \( x \) and \( y \) \((-10^9 \leq x, y \leq 10^9)\), indicating the coordinates of a point in the set.

You may assume that the input is such that the answer would not change if the thickness \( t \) was increased or decreased by \( 10^{-2} \), and that no three input points are collinear.

**Output**

Output the maximum number of points that lie on a single “line” of thickness \( t \).

**Sample Input 1**