Triangle (Easier)

AtCoder

IDabc262_b

Time2000ms

Memory256MB

Difficulty—

You are given a simple undirected graph with $N$ vertices and $M$ edges. The vertices are numbered $1, \dots, N$, and the $i$\-th $(1 \leq i \leq M)$ edge connects Vertex $U_i$ and Vertex $V_i$. Find the number of tuples of integers $a, b, c$ that satisfy all of the following conditions: * $1 \leq a \lt b \lt c \leq N$ * There is an edge connecting Vertex $a$ and Vertex $b$. * There is an edge connecting Vertex $b$ and Vertex $c$. * There is an edge connecting Vertex $c$ and Vertex $a$. ## Constraints * $3 \leq N \leq 100$ * $1 \leq M \leq \frac{N(N - 1)}{2}$ * $1 \leq U_i \lt V_i \leq N \, (1 \leq i \leq M)$ * $(U_i, V_i) \neq (U_j, V_j) \, (i \neq j)$ * All values in input are integers. ## Input Input is given from Standard Input in the following format: $N$ $M$ $U_1$ $V_1$ $\vdots$ $U_M$ $V_M$ [samples]

Samples

Input #1

Output #1

2

$(a, b, c) = (1, 4, 5), (2, 3, 5)$ satisfy the conditions.

Input #2

3 1
1 2

Output #2

Input #3

Output #3

API Response (JSON)

{
  "problem": {
    "name": "Triangle (Easier)",
    "description": {
      "content": "You are given a simple undirected graph with $N$ vertices and $M$ edges. The vertices are numbered $1, \\dots, N$, and the $i$\\-th $(1 \\leq i \\leq M)$ edge connects Vertex $U_i$ and Vertex $V_i$. Find ",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc262_b"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "You are given a simple undirected graph with $N$ vertices and $M$ edges. The vertices are numbered $1, \\dots, N$, and the $i$\\-th $(1 \\leq i \\leq M)$ edge connects Vertex $U_i$ and Vertex $V_i$.\nFind ...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments