Go: package main

/*
グラフの表現 隣接行列による表現
*/

import (
	"bufio"
	"fmt"
	"log"
	"os"
	"strconv"
	"strings"
)

func main() {
	scanner := makeScanner(8192)
	n := eGetInt(scanner)
	g := make([][]int, n)
	for i := 0; i < n; i++ {
		g[i] = make([]int, n)
		ints := eGetInts(scanner)
		num := ints[0]
		for j := 0; j < ints[1]; j++ {
			g[num-1][ints[j+2]-1] = 1
		}
	}
	for i := 0; i < n; i++ {
		s := fmt.Sprint(g[i])
		fmt.Println(s[1 : len(s)-1])
	}
}

////////////////////////////////////////////////////////////////////////////////
// ライブラリ
////////////////////////////////////////////////////////////////////////////////
func makeScanner(maxByte int) *bufio.Scanner {
	scanner := bufio.NewScanner(os.Stdin)
	scanner.Buffer(make([]uint8, 0, 8192), maxByte)
	return scanner
}
func makeWordScanner() *bufio.Scanner {
	scanner := makeScanner(8192)
	scanner.Split(bufio.ScanWords)
	return scanner
}
func eGetLine(r *bufio.Scanner) string {
	if r.Scan() {
		return r.Text()
	}
	err := r.Err()
	if err != nil {
		log.Fatal(err)
	}
	// EOF
	return ""
}
func eGetInt(r *bufio.Scanner) int {
	line := eGetLine(r)
	return eAtoi(line)
}
func eGetInt64(r *bufio.Scanner) int64 {
	line := eGetLine(r)
	return eAtoInt64(line)
}
func eGetFields(r *bufio.Scanner) []string {
	line := eGetLine(r)
	return strings.Fields(line)
}
func eGetInts(r *bufio.Scanner) []int {
	fields := eGetFields(r)
	ints := make([]int, len(fields))
	for i := 0; i < len(ints); i++ {
		ints[i] = eAtoi(fields[i])
	}
	return ints
}
func eGetInt64s(r *bufio.Scanner) []int64 {
	fields := eGetFields(r)
	ints := make([]int64, len(fields))
	for i := 0; i < len(ints); i++ {
		ints[i] = eAtoInt64(fields[i])
	}
	return ints
}
func eGetChars(r *bufio.Scanner) []string {
	line := eGetLine(r)
	return strings.Split(line, "")
}
func eAtoi(s string) int {
	n, err := strconv.Atoi(s)
	if err != nil {
		log.Fatal(err)
	}
	return n
}
func eAtoInt64(s string) int64 {
	n, err := strconv.ParseInt(s, 10, 64)
	if err != nil {
		log.Fatal(err)
	}
	return n
}

C++: #include <iostream>
#include <vector>
using namespace std;

int main () {
    int n ;
    cin >> n;

    vector <int> v[n + 1];

    for (int i = 0; i < n; i++) {
        int x, no;
        cin >> x >> no;
        for(int j = 0; j < no; j++) {
            int temp;
            cin >> temp;
            v[x].push_back(temp);
        }
    }
	
//	for(int i=1;i<=n;i++){
//		for(int x:v[i]) cout<< x<< ' ';
//		cout<<endl;
//	}
//	cout<<endl;//deb
	
    for (int i = 1; i <= n; i++) {
        int pre = 1;

        for (int j = 0; j < v[i].size(); j++) {
            for (int k = pre ; k < v[i][j]; k++)
                cout << "0 ";
            
			cout << "1"<< ((v[i][j]==n)?'\n':' ');

            pre = v[i][j] + 1;
        }
        for (int j = pre; j <= n; j++)
            cout << "0" << ((j==n)?'\n':' ');
    }

}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
    int n,k,u,d;
    cin>>n;
    vector<vector<int> > Adj(n,vector<int>(n,0));
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            Adj[i][j]=0;
        }
    }
    for(int i=0;i<n;i++){
        cin>>k>>u;
        for(int j=0;j<u;j++){
            cin>>d;
            Adj[k-1][d-1]=1;
        }
    }
    
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            if(j==n-1){
                cout<<Adj[i][j]<<"\n";
            }else{
                cout<<Adj[i][j]<<" ";
            }
        }
    }
    
    return 0;
}

C++: #include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <ctime>
#include <cstring>
using namespace std;

int n;


int main(void){

	cin >> n;
	int suji[n];
	int	num[n];
	int adj[n][n];
	int ans[n][n];

	

	for(int i = 0; i < n; i++){
		
		cin >> suji[i] >> num[i];

		
		for(int j = 0; j < num[i]; j++){
			cin >> adj[i][j];
			adj[i][j] -= 1;
		}
	}

	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			ans[i][j] = 0;
		}
	}

	for(int i = 0; i < n; i++){
		for(int j = 0; j < num[i]; j++){
			ans[i][adj[i][j]] = 1;
		}
	}

	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			if(j == n - 1){
				cout << ans[i][j] << endl;
			}else{
				cout << ans[i][j] << " ";
			}
		}
	}



	
    return 0;
}

C++: #include <iostream>
using namespace std;
static const int N = 100;

int main(){
    int M[N][N]; // 0?????????????????£??\??????
    int n, u, k, v;
    
    cin >> n;
    
    for( int i = 0; i < n; i++){
        for( int j = 0; j < n; j++) M[i][j] = 0;
    }
    
    for(int i = 0; i < n; i++){
        cin >> u >> k;
        u--; // 0?????????????????????
        for( int j = 0; j < k; j++){
            cin >> v;
            v--; // 0?????????????????????
            M[u][v]  = 1; //u??¨v?????????????????????
        }
    }
    
    for ( int i = 0; i < n; i++){
        for (int j = 0; j < n; j++){
            if (j) cout << " "; // j = 0??\???????????????????????\?????§?????????????????\??????
            cout << M[i][j];
        }
        cout << endl;
    }
    
    return 0;
}

C++: #include<iostream>
using namespace std;
static const int N=100;

int main()
{
	int M[N][N];
	int n, u, k, v;

	cin >> n;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			M[i][j] = 0;
		}
	}
	for (int i = 0; i < n; i++) {
		cin >> u >> k;
		u--;
		for (int j = 0; j < n; j++) {
			cin >> v;
			v--;
			M[u][v] = 1;
		}
	}

	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			if (j)cout << " ";
			cout << M[i][j];
		}
		cout << endl;
	}

    return 0;
}

C++: #include <iostream>
using namespace std;

int main(void) {
	int N = 0;
	cin >> N;

	int* *A = new int*[N];
	for (int i = 0; i < N; i++)
		A[i] = new int[N];

	for (int i = 0; i < N; i++)
		for (int j = 0; j < N; j++)
			A[i][j] = 0;

	for (int i = 0; i < N; i++) {
		int u, v,w;
		cin >> u;
		u--;

		cin >> v;
		for (int j = 0; j < v; j++) {
			cin >> w;
			w--;
			A[u][w] = 1;
		}
	}

	for (int i = 0; i < N; i++){
		for (int j = 0; j < N; j++){
			if (j) cout << " ";
			cout << A[i][j];
		}
		cout << "\n";
	}
}

C++: #include <iostream>

int main()
{
	int n; std::cin >> n;
	
	int** A = new int*[n];
	for (int i=0; i<n; i++) A[i] = new int[n];
	
	for (int i=0; i<n; i++) {
		for (int j=0; j<n; j++) {
			A[i][j] = 0;
		}
	}
	
	for (int i=0; i<n; i++) {
		int x;
		int deg;
		std::cin >> x >> deg;
		for (int d=0; d<deg; d++) {
			int y;
			std::cin >> y;
			A[x-1][y-1]++;
		}
	}
	
	for (int i=0; i<n; i++) {
		std::cout << A[i][0];
		for (int j=1; j<n; j++) {
			std::cout << " " << A[i][j];
		}
		std::cout << std::endl;
	}
	
	return 0;
}

C++: #include<iostream>

int main() {
	int node_num, adj[100][100];

	std::cin >> node_num;

	for (int i = 0; i < node_num; i++) {
		int node, num;
		std::cin >> node >> num;
		for (int j = 0; j < num; j++) {
			int n;
			std::cin >> n;
			adj[i][n - 1] = 1;
		}
	}

	for (int i = 0; i < node_num; i++) {
		for (int j = 0; j < node_num; j++) {
			std::cout << adj[i][j] << (j != node_num - 1 ? " ":"");
		}
		std::cout << std::endl;
	}
}

C++: #include <cstdio>
#include <iostream>
#include <queue>
static const int N = 110;

using namespace std;

int main(){
    int M[N][N];
    int n;
    scanf("%d",&n); 
    for(int i =1; i<= n;i++) {
        for (int j=1; j<=n;j++) M[i][j] = 0;
    }

    for(int i=0; i<n;i++){
        int u,k;
        scanf("%d",&u);
        scanf("%d",&k);

        for(int j=0; j<k; j++){
            int l;
            scanf("%d",&l);
            M[u][l] = 1;
        }
    }

    for(int i=1; i<= n; i++){
        for(int j=1; j<= n; j++){
            if(j-1) cout << " ";
            cout << M[i][j] ;
        }
        cout << endl;
    }

    return 0;
}