Cod sursa(job #2385039)
Utilizator | Eugenie Daniel Posdarascu eudanip | Data | 21 martie 2019 15:35:41 |
---|---|---|---|
Problema | Algoritmul lui Dijkstra | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include<stdio.h>
#include<cassert>
int n, m, a, b, c;
int main () {
freopen("dijkstra.in","r",stdin);
freopen("dijkstra.out","w",stdout);
scanf("%d%d", &n, &m);
assert(1 <= n && n <= 50000);
assert(1 <= m && m <= 250000);
for(int i = 1; i <= m; i++) {
scanf("%d%d%d", &a, &b, &c);
assert(1 <= a && a <= n);
assert(1 <= b && b <= n);
assert(0 <= c && c <= 20000);
}
return 0;
}