연쇄 행렬 곱셈

목차

없음

본문내용

#include <stdio.h>
int minmult();
void order(int i, int j);
int minimum(int i, int j);
int k;
int M[7][7];
int P[6][7];
const int d[7] = {5, 2, 3, 4, 6, 7, 8};
void main()
{
int min;
min = minmult();
printf("The least number of multiplication is %d\n", min);

참고 자료

없음