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<h2>Playing with Stones</h2>2<p>3 Koshiro and Ukiko are playing a game with black and white stones. The rules of the game are as follows:4</p>5 6<ol>7 <li>8Before starting the game, they define some small areas and place "one or more black stones and one or more white stones" in each of the areas.9 </li>10 11 12 <li>13Koshiro and Ukiko alternately select an area and perform one of the following operations.<br>14 15(a) Remove a white stone from the area<br>16(b) Remove one or more black stones from the area. Note, however, that the number of the black stones must be less than or equal to white ones in the area.<br>17(c) Pick up a white stone from the stone pod and replace it with a black stone. There are plenty of white stones in the pod so that there will be no shortage during the game.<br>18 19</li>20<li>If either Koshiro or Ukiko cannot perform 2 anymore, he/she loses.</li>21</ol>22 23<p>24 They played the game several times, with Koshiro’s first move and Ukiko’s second move, and felt the winner was determined at the onset of the game. So, they tried to calculate the winner assuming both players take optimum actions.25</p>26 27<p>28 Given the initial allocation of black and white stones in each area, make a program to determine which will win assuming both players take optimum actions.29</p>30 31<h2>Input</h2>32<p>33The input is given in the following format.34</p>35<pre>36$N$37$w_1$ $b_1$38$w_2$ $b_2$39:40$w_N$ $b_N$41</pre>42 43<p>44 The first line provides the number of areas $N$ ($1 \leq N \leq 10000$). Each of the subsequent $N$ lines provides the number of white stones $w_i$ and black stones $b_i$ ($1 \leq w_i, b_i \leq 100$) in the $i$-th area.45 </p>46 47<h2>Output</h2>48<p>49 Output <span>0</span> if Koshiro wins and <span>1</span> if Ukiko wins.50</p>51 52<h2>Sample Input 1</h2>53<pre>5445524 995615 685712 905895 7959</pre>60<h2>Sample Output 1</h2>61<pre>62063</pre>64<h2>Sample Input 1</h2>65<pre>663672 466894 86946 5770</pre>71<h2>Sample Output 2</h2>72<pre>73174</pre>75