Cyclic Components
You are given an undirected graph consisting of $$$n$$$ vertices and $$$m$$$ edges. Your task is to find the number of connected components which are cycles.Here are some definitions of graph theory.An undirected graph consists of two sets: set of nodes (called vertices) and set of edges. Each edge connects a pair of vertices. All edges are bidirectional (i.e. if a vertex $$$a$$$ is connected with a vertex $$$b$$$, a vertex $$$b$$$ is also connected with a vertex $$$a$$$). An edge can't connect vertex with itself, there is at most one edge between a pair of vertices.Two vertices $$$u$$$ and $$$v$$$ belong to the same connected component if and only if there is at least one path along edges connecting $$$u$$$ and $$$v$$$.A connected component is a cycle if and only if its vertices can be reordered in such a way that:  the first vertex is connected with the second vertex by an edge,  the second vertex is connected with the third vertex by an edge,  ...  the last vertex is connected with the first vertex by an edge,  all the described edges of a cycle are distinct. A cycle doesn't contain any other edges except described above. By definition any cycle contains three or more vertices.  There are $$$6$$$ connected components, $$$2$$$ of them are cycles: $$$[7, 10, 16]$$$ and $$$[5, 11, 9, 15]$$$. 
In the first example only component $$$[3, 4, 5]$$$ is also a cycle.The illustration above corresponds to the second example.
The first line contains two integer numbers $$$n$$$ and $$$m$$$ ($$$1 \le n \le 2 \cdot 10^5$$$, $$$0 \le m \le 2 \cdot 10^5$$$) — number of vertices and edges.The following $$$m$$$ lines contains edges: edge $$$i$$$ is given as a pair of vertices $$$v_i$$$, $$$u_i$$$ ($$$1 \le v_i, u_i \le n$$$, $$$u_i \ne v_i$$$). There is no multiple edges in the given graph, i.e. for each pair ($$$v_i, u_i$$$) there no other pairs ($$$v_i, u_i$$$) and ($$$u_i, v_i$$$) in the list of edges.
Print one integer — the number of connected components which are also cycles.
from os import path
import sys
if path.exists('input.txt'):
    sys.stdin = open('input.txt', 'r')
    sys.stdout = open('output.txt', 'w')

def st():
    (n, m) = map(int, input().split())
    G = [[] for _ in range(n + 1)]
    for _ in range(m):
        (u, v) = map(int, input().split())
        u -= 1
        v -= 1
        G[u].append(v)
        G[v].append(u)
    vis = [False] * (n + 1)

    def dfs(u):
        cnt = len(G[u]) == 2
        st = [u]
        while st:
            v = st.pop()
            if not vis[v]:
                vis[v] = True
                for u in G[v]:
                    if not vis[u]:
                        st.append(u)
                        cnt &= len(G[u]) == 2
        return cnt
    c = 0
    for i in range(n):
        if not vis[i]:
            c += dfs(i)
    print(c)
T = 1
for _ in range(T):
    st()
import sys
from collections import deque
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
MOD = 10 ** 9 + 7

def solve():

    def dfs(i):
        que = deque([i])
        tmp = []
        while que:
            v = que.pop()
            tmp.append(v)
            for u in edge[v]:
                if visited[u]:
                    continue
                visited[u] = True
                que.append(u)
        for v in tmp:
            if len(edge[v]) != 2:
                return False
        return True
    (n, m) = map(int, input().split())
    edge = [[] for _ in range(n)]
    for _ in range(m):
        (u, v) = map(lambda x: int(x) - 1, input().split())
        edge[u].append(v)
        edge[v].append(u)
    visited = [False] * n
    res = 0
    for i in range(n):
        if not visited[i]:
            visited[i] = True
            if dfs(i):
                res += 1
    print(res)
if __name__ == '__main__':
    solve()
from collections import deque
import sys, threading
input = lambda : sys.stdin.readline().strip()

def main():
    from collections import defaultdict
    (n, m) = list(map(int, input().split()))
    graph = defaultdict(list)
    for _ in range(m):
        (v1, v2) = list(map(int, input().split()))
        graph[v1].append(v2)
        graph[v2].append(v1)
    visited = set()
    line = deque()
    count = 0
    node_num = 0
    twos = 0

    def findNodes():
        nonlocal node_num, twos
        while line:
            start = line.popleft()
            for neig in graph[start]:
                if neig not in visited:
                    line.append(neig)
                    node_num += 1
                    if len(graph[neig]) == 2:
                        twos += 1
                    visited.add(neig)
    for node in graph:
        if node not in visited:
            node_num += 1
            visited.add(node)
            line.append(node)
            if len(graph[node]) == 2:
                twos += 1
            findNodes()
            if node_num == twos:
                count += 1
            (node_num, twos) = (0, 0)
    print(count)
if __name__ == '__main__':
    sys.setrecursionlimit(1 << 30)
    threading.stack_size(1 << 27)
    main_thread = threading.Thread(target=main)
    main_thread.start()
    main_thread.join()