Counting Roads

AtCoder

IDabc061_b

Time2000ms

Memory256MB

Difficulty—

There are $N$ cities and $M$ roads. The $i$\-th road $(1≤i≤M)$ connects two cities $a_i$ and $b_i$ $(1≤a_i,b_i≤N)$ bidirectionally. There may be more than one road that connects the same pair of two cities. For each city, how many roads are connected to the city? ## Constraints * $2≤N,M≤50$ * $1≤a_i,b_i≤N$ * $a_i ≠ b_i$ * All input values are integers. ## Input Input is given from Standard Input in the following format: $N$ $M$ $a_1$ $b_1$ $:$ $a_M$ $b_M$ [samples]

Samples

Input #1

Output #1

2
2
1
1

*   City $1$ is connected to the $1$\-st and $3$\-rd roads.
*   City $2$ is connected to the $1$\-st and $2$\-nd roads.
*   City $3$ is connected to the $2$\-nd road.
*   City $4$ is connected to the $3$\-rd road.

Input #2

Output #2

5
5

Input #3

Output #3

API Response (JSON)

{
  "problem": {
    "name": "Counting Roads",
    "description": {
      "content": "There are $N$ cities and $M$ roads. The $i$\\-th road $(1≤i≤M)$ connects two cities $a_i$ and $b_i$ $(1≤a_i,b_i≤N)$ bidirectionally. There may be more than one road that connects the same pair of two c",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc061_b"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "There are $N$ cities and $M$ roads. The $i$\\-th road $(1≤i≤M)$ connects two cities $a_i$ and $b_i$ $(1≤a_i,b_i≤N)$ bidirectionally. There may be more than one road that connects the same pair of two c...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments