矩阵加减乘法是常见的线性代数运算,在C语言中可以通过数组和循环实现。下面是简单的C语言代码示例:
矩阵加法:
```c
#include <stdio.h>
void matrix_add(int A[][3], int B[][3], int C[][3], int n) {
int i, j;
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
C[i][j] = A[i][j] + B[i][j];
}
}
}
int main() {
int A[3][3] = {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}};
int B[3][3] = {{9, 8, 7}, {6, 5, 4}, {3, 2, 1}};
int C[3][3];
int i, j;
matrix_add(A, B, C, 3);
printf("A + B = \n");
for (i = 0; i < 3; i++) {
for (j = 0; j < 3; j++) {
printf("%d ", C[i][j]);
}
printf("\n");
}
return 0;
}
```
矩阵减法:
```c
#include <stdio.h>
void matrix_sub(int A[][3], int B[][3], int C[][3], int n) {
int i, j;
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
C[i][j] = A[i][j] - B[i][j];
}
}
}
int main() {
int A[3][3] = {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}};
int B[3][3] = {{9, 8, 7}, {6, 5, 4}, {3, 2, 1}};
int C[3][3];
int i, j;
matrix_sub(A, B, C, 3);
printf("A - B = \n");
for (i = 0; i < 3; i++) {
for (j = 0; j < 3; j++) {
printf("%d ", C[i][j]);
}
printf("\n");
}
return 0;
}
```
矩阵乘法:
```c
#include <stdio.h>
void matrix_mul(int A[][3], int B[][3], int C[][3], int n) {
int i, j, k;
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
C[i][j] = 0;
for (k = 0; k < n; k++) {
C[i][j] += A[i][k] * B[k][j];
}
}
}
}
int main() {
int A[3][3] = {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}};
int B[3][3] = {{9, 8, 7}, {6, 5, 4}, {3, 2, 1}};
int C[3][3];
int i, j;
matrix_mul(A, B, C, 3);
printf("A * B = \n");
for (i = 0; i < 3; i++) {
for (j = 0; j < 3; j++) {
printf("%d ", C[i][j]);
}
printf("\n");
}
return 0;
}
```
上述示例中的矩阵都是3x3的,可以根据实际情况进行修改。