{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"hlce","formal_name":"Humanity's Last Code Exam","introduction":"Humanity's Last Code Exam evaluates problem solving and code generation using ICPC World Finals and IOI problems. The project describes 235 problems; this import selects its public ICPC dataset of 146 problems.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://humanity-s-last-code-exam.github.io/website/","indexing_mode":"noindex","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[]}},"task_id":"68378549-85a6-5757-a1db-5959576356bf","task_key":"ICPC~2dWorld~2dFinals--examples--2020~5fF","task_revision_id":"2","upstream_id":"2020_F","short_description":"Ley Lines","config":"ICPC-World-Finals","split":"examples","body":"{\"platform\":\"atcoder\",\"question_content\":\"## Problem Description\\n\\nIn 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.\\n\\nOne 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.\\n\\nFor 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?\\n\\n**Input**\\n\\nThe 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.\\n\\nYou 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.\\n\\n**Output**\\n\\nOutput the maximum number of points that lie on a single “line” of thickness \\\\( t \\\\).\\n\\n**Sample Input 1**\\n```\\n4 2\\n0 0\\n2 4\\n4 9\\n3 1\\n```\\n\\n**Sample Output 1**\\n```\\n3\\n```\\n\\n**Sample Input 2**\\n```\\n3 1\\n0 10\\n2000 10\\n1000 12\\n```\\n\\n**Sample Output 2**\\n```\\n2\\n```\",\"question_title\":\"Ley Lines\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://humanity-s-last-code-exam.github.io/website/","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}