prithivMLmods/Coder-Stat
Coder-Stat Dataset Overview The Coder-Stat dataset is a collection of programming-related data, including problem IDs, programming languages, original statuses, and source code snippets. This dataset is designed to assist in the analysis of coding patterns, error types, and performance metrics. Dataset Details Modalities Tabular: The dataset is structured in a tabular format. Text: Contains text data, including source code snippets.… See the full description on the dataset page: https://huggingface.co/datasets/prithivMLmods/Coder-Stat.
3139
1 2 3<H1>4<font color="#000">Problem D:</font> Circle and Points5</H1>6 7 8<P>9You are given <i>N</i> points in the <i>xy</i>-plane. You have a10circle of radius one and move it on the <i>xy</i>-plane, so as to11enclose as many of the points as possible. Find how many points can be12simultaneously enclosed at the maximum. A point is considered13<em>enclosed</em> by a circle when it is inside or on the circle.14</P>15 16 17<center>18<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_points"/>19<p>Fig 1. Circle and Points</p>20</center>21 22<H2>Input</H2>23 24 25<P>26The input consists of a series of data sets, followed by a single line27only containing a single character '0', which indicates the end of the28input. Each data set begins with a line containing an integer <i>N</i>,29which indicates the number of points in the data set. It is30followed by <i>N</i> lines describing the coordinates of the31points. Each of the <i>N</i> lines has two decimal fractions <i>X</i>32and <i>Y</i>, describing the <i>x</i>- and <i>y</i>-coordinates of a33point, respectively. They are given with five digits after the decimal34point.35</P>36 37 38 39<P>40You may assume 1 <= <i>N</i> <= 300, 0.0 <= <i>X</i> <= 10.0, and 0.041<= <i>Y</i> <= 10.0. No two points are closer than 0.0001. No two42points in a data set are approximately at a distance of 2.0. More43precisely, for any two points in a data set, the distance <i>d</i>44between the two never satisfies 1.9999 <= <i>d</i> <= 2.0001. Finally,45no three points in a data set are simultaneously very close to a46single circle of radius one. More precisely,47let P<sub>1</sub>, P<sub>2</sub>, and P<sub>3</sub> be any three points in a48data set, and <i>d</i><sub>1</sub>, <i>d</i><sub>2</sub>, and <i>d</i><sub>3</sub>49the distances from an arbitrarily selected point in the <i>xy</i>-plane to each of them50respectively. Then it never simultaneously holds that 0.9999 <=51<i>d</i><sub><i>i</i></sub> <= 1.0001 (<i>i</i> = 1, 2, 3).52</P>53 54 55<H2>Output</H2>56 57 58<P>59For each data set, print a single line containing the maximum number60of points in the data set that can be simultaneously enclosed by a61circle of radius one. No other characters including leading and62trailing spaces should be printed.63</P>64 65 66<H2>Sample Input</H2>67<PRE>683696.47634 7.69628705.16828 4.79915716.69533 6.20378726737.15296 4.08328746.50827 2.69466755.91219 3.86661765.29853 4.16097776.10838 3.46039786.34060 2.41599798807.90650 4.01746814.10998 4.18354824.67289 4.01887836.33885 4.28388844.98106 3.82728855.12379 5.16473867.84664 4.67693874.02776 3.879908820896.65128 5.47490906.42743 6.26189916.35864 4.61611926.59020 4.54228934.43967 5.70059944.38226 5.70536955.50755 6.18163967.41971 6.13668976.71936 3.04496985.61832 4.23857995.99424 4.293281005.60961 4.329981016.82242 5.796831025.44693 3.827241036.70906 3.657361047.89087 5.680001056.23300 4.595301065.92401 4.923291076.24168 3.813891086.22671 3.622101090110</PRE>111 112<H2>Output for the Sample Input</H2>113<PRE>11421155116511711118</PRE>119 120 121 122