|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 |
#include <cstdlib> #include <iostream> #include <fstream> using namespace std; int nodi,narchi; int main() { ifstream in ("input.txt"); ofstream out ("output.txt"); in >>nodi>>narchi; int adiacenza [nodi+1][nodi+1]; for(int i=1;i<nodi+1;i++) for(int j=1;j<nodi+1;j++) adiacenza [i][j] =0; for(int i=0;i<narchi;i++) { int u,v; in >> u >> v >> adiacenza[u][v]; adiacenza[v][u]=adiacenza[u][v]; } for(int i=1;i<nodi+1;i++){ for(int j=1;j<nodi+1;j++) if(j==nodi) out<<adiacenza[i][j]; else out<<adiacenza[i][j]<<" "; out<<"n";} return 0; } |
