Pagini recente » Cod sursa (job #2210350) | Cod sursa (job #2945991) | Cod sursa (job #357676) | Cod sursa (job #2731194) | Cod sursa (job #2538077)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ( "ubuntzei.in" );
ofstream fout ( "ubuntzei.out" );
int n, m;
int nr_prieteni, prieten[20];
int dist[]
struct nod {
int vecin, dist;
nod() {
vecin = 0;
dist = 0;
}
nod ( int a, int b ) {
vecin = a;
dist = b;
}
};
vector<nod>g[2010];
int main() {
fin >> n >> m;
fin >> nr_prieteni;
for ( int i = 1; i <= nr_prieteni; i++ )
fin >> prieten[i];
for ( int i = 1; i <= m; i++ ) {
int x, y, z;
fin >> x >> y >> z;
g[x].push_back ( nod ( y, z ) );
g[y].push_back ( nod ( x, z ) );
}
return 0;
}