poj1125.txt

1位全加器 可以进行1位的二进制码的加法 想进行改进 改为4位或8位的全加器代码

#include <stdio.h>
 #include <string.h>
 #define max 102
 int main(){
     int i, j, t, u, v, w, k, m, n, D[max][max], v2, p, ok;
     while(scanf("%d", &m), m){
         ok = 0;
         for(i = 0; i < max; i++)
             for(j = 0; j < max; j++)
                 D[i][j] = max;
         for(u = 1; u <= m; u++){
             scanf("%d", &t);
             for(i = 1; i <= t; i++){
                 scanf("%d%d", &v, &w);
                 D[u][v] = w;
             }
         }
         for(k = 1; k <= m; k++)
             for(i = 1; i <= m; i++)
                 for(j = 1; j <= m; j++)
                     if(D[i][k] + D[k][j] < D[i][j] && i != j)
                         D[i][j] = D[i][k] + D[k][j];
         v2 = max;
         for(i = 1; i <= m; i++){
             v = 0;
             for(j = 1; j <= m; j++)
                 if(i != j && D[i][j] > v)v = D[i][j];
             if(v != max){
                 ok = 1;
                 if(v < v2){
                     v2 = v;
                     p = i;
                 }
             }
         }
         printf("%d %d\n", p, v2);
     }
     return 0;
 }