Cod sursa(job #314828)
Utilizator | Data | 13 mai 2009 10:39:33 | |
---|---|---|---|
Problema | Algoritmul lui Dijkstra | Scor | 0 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<stdio.h>
#include<stdlib.h>
int n,m;
struct nod{ short val;
short dist;
struct nod* urm;
}*d[50000];
int main(void)
{
freopen("dijkstra.in","r",stdin);
freopen("dijkstra.out","w",stdout);
scanf("%d %d",&n,&m);
int i;
printf("%d",sizeof(struct nod*));
return 0;
}