/**
* Copyright (c) 2001,2002 Yoon, Hyunho <hhyoon@kldp.org>
* http://mooo.org
* ----------------------------------------------------------------------
*
* LICENSE
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
#include <stdio.h>
/* 배열의 크기 */
#define SIZE 5
int main()
{ int i, j, k;
/* 두개의 2차원 배열을 선언 */
int array1[SIZE][SIZE] = { { 1, 2, 5, 2, 3 },
{ 2, 7, 3, 9, 3 },
{ 2, 3, 8, 3, 2 },
{ 5, 1, 2, 8, 4 },
{ 5, 6, 3, 8, 2 } };
int array1[SIZE][SIZE] = { { 7, 2, 3, 4, 3 },
{ 9, 2, 3, 2, 3 },
{ 5, 3, 6, 3, 4 },
{ 3, 9, 2, 3, 7 },
{ 5, 1, 7, 3, 9 } };
/* 행렬 곱을 구해 저장할 배열 */
int multi[SIZE][SIZE] = { 0, };
for (i = 0; i < SIZE; i++)
for (j = 0; j < SIZE; j++)
/* 행렬의 곱 계산 */
for (k = 0; k < SIZE; k++)
multi[i][j] += array1[i][k] * array2[k][j];
/* 계산된 행렬 출력 */
for (i = 0; i < SIZE; i++) {
for (j = 0; j < SIZE; j++)
printf("%4d ", multi[i][j]);
printf("\n");
}
return 0;
}