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 4 5<h3>Anchored Balloon</h3>6 7 8<p>9A balloon placed on the ground is connected to one or more anchors on the ground with ropes.10Each rope is long enough to connect the balloon and the anchor.11No two ropes cross each other.12Figure E-1 shows such a situation.13</p>14 15 16<center>17<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE2_anchoredBalloon-1">18<br>19Figure E-1: A balloon and ropes on the ground20</center>21 22 23<p>24Now the balloon takes off, and your task is to find how high 25the balloon can go up with keeping the rope connections.26The positions of the anchors are fixed.27The lengths of the ropes and the positions of the anchors are given.28You may assume that these ropes have no weight and29thus can be straightened up when pulled to30whichever directions.31Figure E-2 shows the highest position of the balloon for32the situation shown in Figure E-1.33</p>34 35<center>36<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE2_anchoredBalloon-2">37<br>38Figure E-2: The highest position of the balloon39</center>40 41 42<h3>Input</h3>43 44 45<p>46The input consists of multiple datasets, each in the following format. 47</p>48 49<blockquote>50<i>n</i><br>51<i>x</i><sub>1</sub> <i>y</i><sub>1</sub> <i>l</i><sub>1</sub> <br>52... <br>53<i>x</i><sub><i>n</i></sub> <i>y</i><sub><i>n</i></sub> <i>l</i><sub><i>n</i></sub> <br>54</blockquote>55 56<p>57The first line of a dataset contains an integer <i>n</i> (1 ≤ <i>n</i> ≤ 10) representing the number of the ropes.58Each of the following <i>n</i> lines contains three integers, 59<i>x</i><sub><i>i</i></sub>, <i>y</i><sub><i>i</i></sub>, and <i>l</i><sub><i>i</i></sub>, separated by a single space. 60<i>P</i><sub><i>i</i></sub> = 61(<i>x</i><sub><i>i</i></sub>, <i>y</i><sub><i>i</i></sub>) represents62the position of the anchor connecting the <i>i</i>-th rope,63and <i>l</i><sub><i>i</i></sub> represents the length of the rope.64You can assume that 65−100 ≤ <i>x</i><sub><i>i</i></sub> ≤ 100, 66−100 ≤ <i>y</i><sub><i>i</i></sub> ≤ 100, and671 ≤ <i>l</i><sub><i>i</i></sub> ≤ 300.68The balloon is initially placed at (0, 0) on the ground.69You can ignore the size of the balloon and the anchors.70</p>71 72 73<p>74You can assume that <i>P</i><sub><i>i</i></sub> and <i>P</i><sub><i>j</i></sub> 75represent different positions if <i>i</i> ≠ <i>j</i>.76You can also assume that the distance between77<i>P</i><sub><i>i</i></sub> and (0, 0) is less than or equal to 78<i>l</i><sub><i>i</i></sub>−1.79This means that the balloon can go up at least 1 unit high.80</p>81 82 83 84<p>85Figures E-1 and E-2 correspond to the first dataset of Sample Input below. 86</p>87 88 89 90<p>91The end of the input is indicated by a line containing a zero. 92</p>93 94 95<h3>Output</h3>96 97 98<p>99For each dataset, 100output a single line containing the maximum height that the balloon can go up.101The error of the value should be no greater than 0.00001. 102No extra characters should appear in the output. 103</p>104 105<h3>Sample Input</h3>106<pre>107310810 10 2010910 -10 20110-10 10 120111111210 10 16113211410 10 2011510 -10 201162117100 0 101118-90 0 9111921200 0 5312130 40 102122312310 10 2012410 -10 20125-10 -10 2012631271 5 131285 -3 13129-3 -3 13130313198 97 168132-82 -80 193133-99 -96 211134413590 -100 160136-80 -80 15013790 80 15013880 80 245139414085 -90 290141-80 -80 220142-85 90 14514385 90 17014451450 0 41463 0 5147-3 0 51480 3 51490 -3 51501015195 -93 260152-86 96 21115391 90 177154-81 -80 124155-91 91 14415697 94 165157-90 -86 19415889 85 167159-93 -80 22216092 -84 2181610162</pre>163 164<h3>Output for the Sample Input</h3>165 166<pre>16717.320508116816.000000016917.320508117013.801120017153.000000017214.142135617312.0000000174128.392875717594.1879092176131.12408161774.000000017872.2251798179</pre>180 181