蓝桥杯 关联矩阵

 1 #include <bits/stdc++.h> 
 2 using namespace std;
 3 int a[110][1010];
 4 int main() {  
 5     int n, m;
 6     cin >> n >> m;
 7     for (int i = 1; i <= m; i++) { //遍历m条边 
 8         int j, k;
 9         cin >> j >> k; //输入这条边的起点和终点 
10         a[j][i] = 1;
11         a[k][i] = -1;
12     }
13     for (int i = 1; i <= n; i++) {
14         for (int j = 1; j <= m; j++) {
15             cout << a[i][j] << " ";
16         }
17         cout << endl;
18     }        
19     return 0;
20 }