| | 89 | == 行列A == |
| | 90 | {{{ |
| | 91 | 0 1 0 0 |
| | 92 | 2 0 0 0 |
| | 93 | 0 0 0 3 |
| | 94 | 0 0 4 0 |
| | 95 | }}} |
| | 96 | |
| | 97 | == 行列B == |
| | 98 | {{{ |
| | 99 | 1 2 3 4 |
| | 100 | 5 6 7 8 |
| | 101 | 9 10 11 12 |
| | 102 | 13 14 15 16 |
| | 103 | }}} |
| | 104 | |
| | 105 | == C言語バージョン == |
| | 106 | {{{ |
| | 107 | |
| | 108 | #include <stdio.h> |
| | 109 | main() |
| | 110 | { |
| | 111 | static int mat1[4][4] = { |
| | 112 | { 1, 0, 0, 0 }, |
| | 113 | { 0, 1, 0, 0 }, |
| | 114 | { 0, 0, 1, 0 }, |
| | 115 | { 0, 0, 0, 1 }, |
| | 116 | }; |
| | 117 | static int mat2[4][4] = { |
| | 118 | { 1, 2, 3, 4 }, |
| | 119 | { 5, 6, 7, 8 }, |
| | 120 | { 9, 10, 11, 12 }, |
| | 121 | { 13, 14, 15, 16 }, |
| | 122 | }; |
| | 123 | static int result[4][4]; |
| | 124 | |
| | 125 | int i, j, k; |
| | 126 | int s; |
| | 127 | int cnt, mask, m1, m2; |
| | 128 | |
| | 129 | /* 行列の乗算 */ |
| | 130 | for( i = 0; i < 4; i++ ) { |
| | 131 | for( j = 0; j < 4; j++ ) { |
| | 132 | s = 0; |
| | 133 | for( k = 0; k < 4; k++ ) { |
| | 134 | mask = 1; |
| | 135 | m1 = mat1[i][k]; /* 被乗数 */ |
| | 136 | m2 = mat2[k][j]; /* 乗数 */ |
| | 137 | /* 本来は下のループで32回繰り返すべきだが、 |
| | 138 | 乗数が32未満なので、計算時間短縮のため5回だけとした */ |
| | 139 | for( cnt = 0; cnt < 5; cnt++ ) { |
| | 140 | if( m2 & mask ) { |
| | 141 | s += m1; |
| | 142 | } |
| | 143 | mask <<= 1; |
| | 144 | m1 <<= 1; |
| | 145 | } |
| | 146 | } |
| | 147 | result[i][j] = s; |
| | 148 | } |
| | 149 | } |
| | 150 | |
| | 151 | /* 結果の表示 */ |
| | 152 | for( i = 0; i < 4; i++ ) { |
| | 153 | for( j = 0; j < 4; j++ ) { |
| | 154 | printf("%3d", result[i][j]); |
| | 155 | } |
| | 156 | printf("\n"); |
| | 157 | } |
| | 158 | } |
| | 159 | }}} |
| | 160 | |
| | 161 | == テンプレート == |