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<H1><font color="#000">Problem B:</font> Repeated Substitution with Sed</H1>3 4<p>5Do you know "sed," a tool provided with Unix? Its most popular use is to substitute every6occurrence of a string <i.α</i> contained in the input string (actually each input line) with another7string <i>β</i>. More precisely, it proceeds as follows.8</p>9 10<ol>11 <li> Within the input string, every non-overlapping (but possibly adjacent) occurrences of <i>α</i> are12 marked. If there is more than one possibility for non-overlapping matching, the leftmost13 one is chosen.</li>14 <li> Each of the marked occurrences is substituted with <i>β</i> to obtain the output string; other15 parts of the input string remain intact.</li>16</ol>17 18<p>19For example, when <i>α</i> is "<span>aa</span>" and <i>β</i> is "<span>bca</span>", an input string "<span>aaxaaa</span>" will produce "<span>bcaxbcaa</span>",20but not "<span>aaxbcaa</span>" nor "<span>bcaxabca</span>". Further application of the same substitution to the string21"<span>bcaxbcaa</span>" will result in "<spna>bcaxbcbca</span>", but this is another substitution, which is counted as the22second one.23</p>24<p>25In this problem, a set of substitution pairs (<i>α<sub>i</sub></i>, <i>β<sub>i</sub></i>) (<i>i</i> = 1, 2, ... , <i>n</i>), an initial string <i>γ</i>, and a26final string <i>δ</i> are given, and you must investigate how to produce <i>δ</i> from <i>γ</i> with a minimum27number of substitutions. A single substitution (<i>α<sub>i</sub></i>, <i>β<sub>i</sub></i>) here means simultaneously substituting28all the non-overlapping occurrences of <i>α<sub>i</sub></i>, in the sense described above, with <i>β<sub>i</sub></i>.29</p>30 31<p>32You may use a specific substitution (<i>α<sub>i</sub></i>, <i>β<sub>i</sub></i> ) multiple times, including zero times.33</p>34 35<H2>Input</H2>36 37<p>38The input consists of multiple datasets, each in the following format.39</p>40 41<p>42 <i>n</i><br>43 <i>α</i><sub>1</sub> <i>β</i><sub>1</sub><br>44 <i>α</i><sub>2</sub> <i>β</i><sub>2</sub><br>45 .<br>46 .<br>47 .<br>48 <i>α</i><sub><i>n</i></sub> <i>β</i><sub><i>n</i></sub><br>49 <i>γ</i></br>50 <i>δ</i></br>51</p>52 53<p>54<i>n</i> is a positive integer indicating the number of pairs. <i>α<sub>i</sub></i> and <i>β<sub>i</sub></i> are separated by a single space.55You may assume that 1 ≤ |<i>α<sub>i</sub></i>| < |<i>β<sub>i</sub></i>| ≤ 10 for any <i>i</i> (|<i>s</i>| means the length of the string <i>s</i>),56 57<i>α<sub>i</sub></i> ≠ <i>α<sub>j</sub></i> for any <i>i</i> ≠ <i>j</i>, <i>n</i> ≤ 10 and 1 ≤ |<i>γ</i>| < |<i>δ</i>| ≤ 10. All the strings consist solely of lowercase58letters. The end of the input is indicated by a line containing a single zero.59</p>60 61<H2>Output</H2>62 63<p>64For each dataset, output the minimum number of substitutions to obtain <i>δ</i> from <i>γ</i>. If <i>δ</i> cannot65be produced from <i>γ</i> with the given set of substitutions, output <span>-1</span>.66 67</p>68 69<H2>Sample Input</H2>70<pre>71272a bb73b aa74a75bbbbbbbb76177a aa78a79aaaaa80381ab aab82abc aadc83ad dee84abc85deeeeeeeec861087a abc88b bai89c acf90d bed91e abh92f fag93g abe94h bag95i aaj96j bbb97a98abacfaabe990100</pre>101 102<H2>Output for the Sample Input</H2>103<pre>1043105-110671074108</pre>109 110