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<script type="text/x-mathjax-config">3 MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], skipTags: ["script","noscript","style","textarea","code"], processEscapes: true }});4</script>5<script type="text/javascript" async src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config=TeX-AMS_HTML"></script>6 7<h2>Problem K8 Counting Cycles9</h2>10 11<p>12 Given an undirected graph, count the number of simple cycles in the graph. Here, a simple cycle is a connected subgraph all of whose vertices have degree exactly two.13</p>14 15<h3>Input</h3>16<p>17 The input consists of a single test case of the following format.18</p>19 20<pre>21$n$ $m$22$u_1$ $v_1$23...24$u_m$ $v_m$25</pre>26 27<p>28 A test case represents an undirected graph $G$.29</p>30 31<p>32 The first line shows the number of vertices $n$ ($3 \leq n \leq 100 000$) and the number of edges $m$ ($n - 1 \leq m \leq n + 15$). The vertices of the graph are numbered from $1$ to $n$.33</p>34 35<p>36The edges of the graph are specified in the following $m$ lines. Two integers $u_i$ and $v_i$ in the37$i$-th line of these m lines mean that there is an edge between vertices $u_i$ and $v_i$. Here, you can assume that $u_i < v_i$ and thus there are no self loops.38 </p>39 40<p>41 For all pairs of $i$ and $j$ ($i \ne j$), either $u_i \ne u_j$ or $v_i \ne v_j$ holds. In other words, there are no parallel edges.42</p>43 44<p>45 You can assume that $G$ is connected.46</p>47 48 49<h3>Output</h3>50<p>51 The output should be a line containing a single number that is the number of simple cycles in the graph.52</p>53 54 55<h3>Sample Input 1</h3>56<pre>574 5581 2591 3601 4612 3623 463</pre>64 65<h3>Sample Output 1</h3>66<pre>67368</pre>69 70<h3>Sample Input 2</h3>71<pre>727 9731 2741 3752 4762 5773 6783 7792 3804 5816 782</pre>83 84<h3>Sample Output 2</h3>85<pre>86387</pre>88 89<h3>Sample Input 3</h3>90<pre>914 6921 2931 3941 4952 3962 4973 498</pre>99 100<h3>Sample Output 3</h3>101<pre>1027103</pre>104