Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
	"strconv"
)

func main() {
	scn := bufio.NewScanner(os.Stdin)
	scn.Split(bufio.ScanWords)
	nextInt := func() int { scn.Scan(); r, _ := strconv.Atoi(scn.Text()); return r }
	w := bufio.NewWriter(os.Stdout)

	n := nextInt()
	v := make([][]int, n)
	for i := 0; i < n; i++ {
		u := nextInt()
		k := nextInt()
		for j := 0; j < k; j++ {
			v[u-1] = append(v[u-1], nextInt())
		}
	}

	for _, vvs := range v {
		for j := 1; j <= n; j++ {
			if j > 1 {
				fmt.Fprint(w, " ")
			}
			p := sort.SearchInts(vvs, j)
			if p < len(vvs) && vvs[p] == j {
				fmt.Fprint(w, 1)
			} else {
				fmt.Fprint(w, 0)
			}
		}
		fmt.Fprintln(w)
	}

	w.Flush()
}

C++: #include<bits/stdc++.h>
using namespace std;

const int N = 1000;

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 < k; 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>
#include <string>
#include <vector>
#include <set>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <functional>
#include <map>
#include <cmath>
#include <queue>

using namespace std;

int main() {


    int n;scanf("%d",&n);
    int u;
    int k;
    vector<vector<int> > graph;
    graph.resize(n);
    for(int i=0;i<n;i++){
        graph[i].resize(n);
    }
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            graph[i][j]=0;
        }
    }

    for(int i=0;i<n;i++){
        scanf("%d",&u);
        scanf("%d",&k);
        int value;
        for(int j=0;j<k;j++){
            scanf("%d",&value);
            graph[u-1][value-1]=1;
        }
    }

    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            printf("%d ",graph[i][j]);
            if(j!=n-1){
                printf(" ");
            }
        }

    }

    return 0;
}

C++: #include<iostream>

using namespace std;

#define ll long long

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

    for (ll i=0; i<n; i++){
        for(ll j=0; j<n; j++){
            cout << A[i][j];
            if(j<n-1){
                cout << ' ';
            }
        }
        cout << '\n';
        
    }
}

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

typedef struct node{
    int vertexCode;
    node* next;
}* nodeptr;

class chainTable {
private:
    // nothing :P
public:
    nodeptr head, tail;

    chainTable() : head(NULL), tail(NULL) {}

    void push(int newVC) {  //  VC = Vertex Code
        nodeptr tmp = new node();
        tmp->vertexCode = newVC;
        tmp->next = NULL;

        if (this->head == NULL) {
            this->head = this->tail = tmp;
        } else {
            this->tail = this->tail->next = tmp;
        }
    }

    bool canGoTo(int target) {
        nodeptr tmp = this->head;
        while (tmp != NULL) {
            if (tmp->vertexCode == target) return true;
            else tmp = tmp->next;
        }

        return false;
    }

//    void travel(int target) {
//        nodeptr tmp = this->head;
//        while (tmp != NULL) {
//            if (tmp->vertexCode == target) return true;
//            else cout << tmp->vertexCode;
//        }
//
//        return false;
//    }
};

int main() {
   // freopen("in.txt", "r", stdin);

    int n, u, k, v;
    cin >> n;

    vector<chainTable> aList(n + 1);  // aList = adjacency list

    for (int i = 0; i < n; ++i) {
        cin >> u >> k;
        for (int j = 0; j < k; ++j) {
            cin >> v;
            aList[u].push(v);
        }
    }

    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) {
            if (aList[i].canGoTo(j)) {
                cout << "1";
            } else {
                cout << "0";
            }
            if (j != n) cout << " ";
        }
        cout << endl;
    }
//
//    cout << "--------------" << endl;
//    for (int i = 0; i < n; ++i) {
//        aList[i].travel();
//    }
}

C++: #include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int martix[105][105];

int main()
{
	int n, id, d,v;
	cin >> n;
	for(int i=0;i<n;i++)
	{
		cin >> id >> d;
		while (d--)
		{
			cin >> v;
			martix[id][v] = 1;
		}
	}
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= n; j++)
		{
			if (j ==1)	cout << martix[i][j];
			else cout << ' ' << martix[i][j];
		}
		putchar('\n');
	}
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

int main() {
    int n; cin >> n;
    vector<vector<int>> vec(n, vector<int>(n, 0));

    for (int i = 0; i < n; i++)
    {
        int u, k, tmp; cin >> u >> k;
        for (int j = 0; j < k; j++)
        {
            cin >> tmp;
            vec.at(i).at(tmp-1)=1;
        }
        
    }
    
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
        {
            cout << vec.at(i).at(j) ;
            if(j!=n-1) cout << " ";
        }
        if(i!=n-1)  cout << endl;
    }
    
}
//g++ -o a.exe a.cpp

C++: #include<stdio.h>
#include<math.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<stack>
#include<stdlib.h>
#include<queue>
#include<vector>
#include<list>
using namespace std;
int mp[111][111];
int main ()
{
    int n;
    scanf("%d",&n);
    for(int i=0;i<111;i++)
        for(int j=0;j<111;j++)
            mp[i][j]=0;
    for(int i=1;i<=n;i++)
    {
        int u,v;
        scanf("%d %d",&u,&v);
        for(int j=1;j<=v;j++)
        {
            int w;
            scanf("%d",&w);
            mp[u][w]=1;
        }
    }
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
    {
        if(j==n)
            printf("%d\n",mp[i][j]);
        else
            printf("%d ",mp[i][j]);
    }
    return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int G[102][102];
int main(){
	int n;
	scanf("%d",&n); 
	for(int i=1;i<=n;i++){
		int k,v1,v2;scanf("%d%d",&v1,&k);
		for(int j=1;j<=k;j++){
			scanf("%d",&v2);G[v1][v2]=1;
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			if(j!=n)
			printf("%d ",G[i][j]);
			else printf("%d",G[i][j]);
		}printf("\n");
	}
	return 0;
}

C++: #include"bits/stdc++.h"
using namespace std;



int main(void)
{
	int N, v, k, x;
	cin >> N;
	
	vector<vector<int>> G(N + 1, vector<int>(N + 1, 0));
	for (int i = 0; i < N; i++)
	{
		cin >> v >> k;
		for (int j = 0; j < k; j++)
		{
			cin >> x;
			G[v][x] = 1;
		}
	}

	for (int i = 1; i <= N; i++)
	{
		for (int j = 1; j <= N; j++)
		{
			if (j != 1) cout << " ";
			cout << G[i][j];
		}
		cout << endl;
	}

	return 0;
}

C++: #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <list>
#include <queue>
#include <deque>
#include <algorithm>
#include <numeric>
#include <utility>
#include <complex>
#include <functional>
#include <climits>

using namespace std;

int main() {
    int n;
    cin >> n;
    for(int i=0; i<n; i++) {
        int u, k;
        cin >> u >> k;
        int *ary = new int[n+1];
        for(int j=1; j<=n; j++) {
            ary[j] = 0;
        }
        for(int j=0; j<k; j++) {
            int v;
            cin >> v;
            ary[v] = 1;
        }
        for(int j=1; j<=n; j++) {
            if(j != 1) cout << " ";
            cout << ary[j];
        }
        cout << "\n";
        delete[] ary;
    }
}