Go: package main

import "fmt"

func main() {
	var N int
	fmt.Scan(&N)
	graph := make([][]int, N)
	for i := range graph {
		graph[i] = make([]int, N)
		var u, k int
		fmt.Scan(&u, &k)
		for j := 0; j < k; j++ {
			var v int
			fmt.Scan(&v)
			v--
			graph[i][v] = 1
		}
	}
	for i := 0; i < N; i++ {
		for j := 0; j < N; j++ {
			if j > 0 {
				fmt.Print(" ")
			}
			fmt.Print(graph[i][j])
		}
		fmt.Println()
	}
}

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<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<bits/stdc++.h>
#define ll long long
#define rep(i, n) for(int i=0;i<(n);++i)
#define per(i, n) for(int i=(n)-1;i>=0;--i)
#define repa(i, n) for(int i=1;i<(n);++i)
#define foreach(i, n) for(auto &i:(n))
#define pii pair<int, int>
#define pll pair<long long, long long>
#define all(x) (x).begin(), (x).end()
#define bit(x) (1ll << (x))
const ll MOD = (ll)1e9+7;
const int INF = (ll)1e9+7;
const ll INFLL = (ll)1e18;
using namespace std;
template<class t>
using vvector = vector<vector<t>>;
template<class t>
using vvvector = vector<vector<vector<t>>>;
template<class t>
using priority_queuer = priority_queue<t, vector<t>, greater<t>>;
template<class t, class u> bool chmax(t &a, u b){if(a<b){a=b;return true;}return false;}
template<class t, class u> bool chmin(t &a, u b){if(a>b){a=b;return true;}return false;}

ll modpow(ll x, ll b){
	ll res = 1;
	while(b){
		if(b&1)res = res * x % MOD;
		x = x * x % MOD;
		b>>=1;
	}
	return res;
}

ll modinv(ll x){
	return modpow(x, MOD-2);
}

bool was_output = false;
template<class t>
void output(t a){
	if(was_output)cout << " ";
	cout << a;
	was_output = true;
}
void outendl(){
	was_output = false;
	cout << endl;
}

int main(){
	int n;
	cin >> n;
	vvector<int> ans(n, vector<int>(n, 0));
	rep(i, n){
		int t;
		cin >> t;
		--t;
		int time;
		cin >> time;
		rep(j, time){
			int to;
			cin >> to;
			--to;
			ans[t][to] = 1;
		}
	}

	foreach(i, ans){
		foreach(j, i){
			output(j);
		}
		outendl();
	}
	return 0;
}

C++: #include<iostream>
using namespace std;
int graph[105][105];
int main()
{
	int n;
	cin>>n;
	for(int i=0;i<n;i++)
	{
		for(int j=0;j<n;j++)
			graph[i][j]=0;
	}
	for(int i=1;i<=n;i++)
	{
		int v;
		cin>>v;
		int num;
		cin>>num;
		while(num--)
		{
			int aa;
			cin>>aa;
			graph[v-1][aa-1]=1;
			//cout<<v-1<<" "<<aa<<endl;
		}
	}
	for(int i=0;i<n;i++)
	{
		for(int j=0;j<n;j++)
		{
			if(j>0)
			cout<<" ";
			cout<<graph[i][j];
		}
		cout<<endl;
	}
	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
  int a[101][101]={};
  int n,u,k,v;
  cin>>n;
  for(int i=0;i<n;i++){
    cin>>u>>k;
    for(int j=0;j<k;j++){
      cin>>v;
      a[u][v]=1;
    }
  }
  for(int i=1;i<=n;i++){
    for(int j=1;j<n;j++)
      cout<<a[i][j]<<' ';
    cout<<a[i][n]<<endl;
  }
  return 0;
}

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

int main(){
   int M[100][100];
   int n;
   cin >> n;

   for(int i=0; i<n; i++)
      for(int j=0; j<n; j++)
         M[i][j]=0;

   int u, k, v;
   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++)
         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<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<bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
#define rrep(i,n) for(int i=n-1; i>=0; i--)

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
typedef long double lb;

const int INF=1<<27;
const int MOD=(int)1e9+7;

int main(void)
{
    int n, u, v, k, a[101][101]={0}, adj[101];

    cin >> n;
    rep(i,n){
        cin >> u >> k;
        rep(i,k){
            cin >> v;
            a[u][v] = 1;
        }
    }

    rep(i,n){rep(j,n) cout << a[i+1][j+1] << ' '; cout << endl;}
    return 0;
}

C++: #include <stdio.h>
#include <iostream>
#include <string>
using namespace std;
int main(){
	int n;
	cin >> n;

	int G[100][100] = {};
	for(int i=0; i<n; i++){
		int u,k;
		cin >> u >> k;
		for(int l=0; l<k; l++){
			int v;
			cin >> v;
			G[u-1][v-1] = 1;
		}
	}

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

	return 0;
}

C++: #include<stdio.h>
#include<cstdlib>

#define MAX 100

int main(){
  int i, j, n, m, a, b[MAX+1][MAX+1];

  
  scanf("%d", &n);

  for(i = 1; i < n+1; i++){
    for(j = 1; j < n+1; j++){
      b[i][j] = 0;
    }
  }
  for(i = 1; i <= n; i++){
    scanf("%d %d", &m, &m);
    for(j = 1; j <= m; j++){
      scanf("%d", &a);
      //printf("b[%d][%d]:1\n", i, a);
      b[i][a] = 1;
    }
  }

  
  for(i = 1; i < n+1; i++){
    for(j = 1; j < n; j++){
      printf("%d ", b[i][j]);
    }
    printf("%d\n", b[i][n]);
    }

  
  return 0;
}

C++: #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll = long long;

int main(){
    int n;cin>>n;
    int adj[n][n];
    rep(i,n)rep(j,n)adj[i][j]=0;
    rep(i,n){
        int node,k,id;
        scanf("%d %d",&node,&k);
        node--;
        rep(j,k){
            scanf("%d",&id);
            id--;
            adj[node][id]=1;
        }
    }
    rep(i,n){
        rep(j,n){
            if(j!=0)printf(" ");
            printf("%d",adj[i][j]);
        }
        printf("\n");
    }
}

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

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

C++: #include <stdio.h>
int main(){
  int i, j;
  int n, u, k, v;
  int A[101][101];
  for( i = 0 ; i < n ; i++ ){
    for( j = 0 ; j < n ; j++ ){
      A[i][j]=0;
    }
  }
  scanf("%d", &n);
  for( i = 0 ; i < n ; i++ ){
    scanf("%d", &u);
    scanf("%d", &k);
    for( j = 0 ; j < k ; j++ ){
      scanf("%d", &v);
      A[u-1][v-1]=1;
    }
  }
  for( i = 0 ; i < n ; i++ ){
    for( j = 0 ; j < n ; j++){
      printf("%d",A[i][j]);
      if( j < n - 1 ){
	printf(" ");
      }
    }
    printf("\n");
  }
  return 0;
}

C++: #include <iostream>

using namespace std;

const int N = 100 + 1;

int main() {
    int A[N][N] = {{0}};

    int n;
    cin >> n;
    for (int i = 0; i < n; ++i) {
        int u;
        cin >> u;

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

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

    return 0;
}