This post is all about the solution of the "B - Adjacency List" AtCoder Beginner Contest 276 Problem Solution Statement.



AtCoder



Problem Statement :

There are N cities counted 1,...,N, and M roads that connect them.
The i-th road (1iM) connects the cities of A I and B i.

Write the following N routes.

Let d I be the amount of cities connected directly to city i(1iN), with those cities being city an i,1,..., city an i,d i.
​

in descending order
The i-th line (1iN) should contain d I +1 integers d i,a i,1,...,a i,d i.
​

kept separate by spaces, in this sequence.


Format of Input :

The input is provided in the following format from Standard Input


Format of the Output :

Display output.


Also Check this out:-

A - Rightmost AtCoder Beginner Contest 276 Problem Solution Click Here

Also Read :- Top Programming Languages of 2022 Click Here

Solution of the Problem: Click Here