1840.cpp

哈尔滨工业大学ACM 竞赛网上在线试题集锦的源代码

/*  This Code is Submitted by wywcgs for Problem 1840 on 2005-10-05 at 16:43:11 */ 
#include <stdio.h>
#include <string.h>
#define  MAX  128

int main()
{
	long a[MAX][MAX], b[MAX][MAX], c[MAX][MAX];
	int Ma, Na, Mc, Nc, test;
	int i, j, k, space, l, X, t;
	
	scanf("%d", &test);
	for(l = 0; l < test; l++) {
		scanf("%d", &X);
		for(t = 0; t < X; t++) {
			scanf("%d %d", &Ma, &Na);
			for(i = 0; i < Ma; i++) {
				for(j = 0; j < Na; j++) {
					scanf("%ld", &a[i][j]);
				}
			}
			if(t != 0) {
				memset(b, 0, sizeof(b));
				for(i = 0; i < Mc; i++) {
					for(j = 0; j < Na; j++) {
						for(k = 0; k < Nc; k++) {
							b[i][j] += c[i][k] * a[k][j];
						}
					}
				}
				for(i = 0; i < Mc; i++) {
					for(j = 0; j < Na; j++) {
						c[i][j] = b[i][j];
					}
				}
			} else {
				for(i = 0; i < Ma; i++) {
					for(j = 0; j < Na; j++) {
						c[i][j] = a[i][j];
					}
				}
				Mc = Ma;
			}
			Nc = Na;
		}
		for(i = 0; i < Mc; i++) {
			space = 0;
			for(j = 0; j < Nc; j++) {
				if(space != 0) {
					putchar(' ');
				}
				space++;
				printf("%ld", c[i][j]);
			}
			putchar('\n');
		}
		putchar('\n');
	}
	
	return 0;
}