1.
用指向一维数组的指针变量即二维数组的行指针作为函数参数,实现矩阵转置。按如下函数原型编程计算并输出m×n阶矩阵的转置矩阵。其中,m和n的值由用户从键盘输入。已知m和n的值都不超过10。 void Transpose(int (*a)[N], int (*at)[M], int m, int n); void InputMatrix(int (*a)[N], int m, int n); void PrintMatrix(int (*at)[M], int n, int m); 输入提示信息:"Input m, n:" 输入格式:"%d,%d" 输入提示信息:"Input %d*%d matrix:\n" 输出提示信息和格式:"The transposed matrix is:\n" 输出格式:"%d\t"
#include <stdio.h>
#define M 10
#define N 10
void Transpose (int (*a)[N], int (*at)[M], int m, int n);
void InputMatrix (int (*a)[N], int m, int n);
void PrintMatrix (int (*at)[M], int n, int m);
int main (void)
{
int m, n;
printf ("Input m, n:");
scanf ("%d,%d", &m, &n);
int matrix1[M][N];
int matrix2[N][M];
printf ("Input %d*%d matrix:\n", m, n);
InputMatrix (matrix1, m, n);
Transpose (matrix1, matrix2, m, n);
printf("The transposed matrix is:\n");
PrintMatrix (matrix2, n, m);
return 0;
}
void
Transpose (int (*a)[N], int (*at)[M], int m, int n)
{
int i, j;
for (i = 0; i < m; i ++)
{
for (j = 0; j < n; j ++)
{
*(*(at + j) + i) = *(*(a + i) + j);
}
}
}
void
InputMatrix (int (*a)[N], int m, int n)
{
int i, j;
for (i = 0; i < m; i ++)
{
for (j = 0; j < n; j ++)
{
scanf ("%d", (*(a + i) + j));
}
}
}
void
PrintMatrix (int (*at)[M], int n, int m)
{
int i, j;
for (i = 0; i < n; i ++)
{
for (j = 0; j < m; j ++)
{
printf ("%d\t", *(*(at + i) + j));
}
printf ("\n");
}
}
2.
按如下函数原型编程计算并输出n×n阶矩阵的转置矩阵。其中,n由用户从键盘输入。已知n值不超过10。 void Transpose(int *a, int n); void Swap(int *x, int *y); void InputMatrix(int *a, int n); void PrintMatrix(int *a, int n); 输入提示信息:"Input n:" 输入格式:"%d" 输入提示信息:"Input %d*%d matrix:\n" 输出提示信息:"The transposed matrix is:\n" 输出格式:"%d\t"
#include <stdio.h>
#define N 10
void Transpose (int (*a)[N], int n);
void Swap (int *x, int *y);
void InputMatrix (int (*a)[N], int n);
void PrintMatrix (int (*a)[N], int n);
int main (void)
{
int n;
printf ("Input n:");
scanf ("%d", &n);
int matrix[N][N];
printf ("Input %d*%d matrix:\n", n, n);
InputMatrix (matrix, n);
Transpose (matrix, n);
printf ("The transposed matrix is:\n");
PrintMatrix (matrix, n);
return 0;
}
void
Transpose (int (*a)[N], int n)
{
int i, j;
for (i = 0; i < n; i ++)
{
for (j = i; j < n; j ++)
{
Swap (&a[i][j], &a[j][i]);
}
}
}
void
Swap (int *x, int *y)
{
int tmp = *x;
*x = *y;
*y = tmp;
}
void
InputMatrix (int (*a)[N], int n)
{
int i, j;
for (i = 0; i < n; i ++)
{
for (j = 0; j < n; j ++)
{
scanf ("%d", &a[i][j]);
}
}
}
void
PrintMatrix (int (*a)[N], int n)
{
int i, j;
for (i = 0; i < n; i ++)
{
for (j = 0; j < n; j ++)
{
printf ("%d\t", *(*(a + i) + j));
}
printf ("\n");
}
}
3.
输入m个学生(最多为30人)n门课程(最多为5门)的成绩,然后计算并打印每个学生各门课的总分和平均分。其中,m和n的值由用户从键盘输入。 标签:第11章 通过上机运行程序并观察运行结果,分析下面程序错误的原因并改正之。
|
#include <stdio.h>
#define STUD 30 /* 最多可能的学生人数 */
#define COURSE 5 /* 最多可能的考试科目数 */
void Total(int (*pScore)[COURSE], int sum[], float aver[], int m, int n);
void Print(int (*pScore)[COURSE], int sum[], float aver[], int m, int n);
int main (void)
{
int i, j, m, n, score[STUD][COURSE], sum[STUD];
float aver[STUD];
printf("How many students?");
scanf("%d", &m);
printf("How many courses?");
scanf("%d", &n);
printf("Input scores:\n");
for (i = 0; i < m; i++)
{
for (j = 0; j < n; j++)
{
scanf("%d", &score[i][j]);
}
}
Total(*score, sum, aver, m, n);
Print(*score, sum, aver, m, n);
return 0;
}
void Total(int (*pScore)[COURSE], int sum[], float aver[], int m, int n)
{
int i, j;
for (i = 0; i < m; i++)
{
*(sum + i) = 0;
for (j = 0; j < n; j++)
{
*(sum + i) = *(sum + i) + *(pScore[i] + j);
}
aver[i] = (float) *(sum + i) / n;
}
}
void Print(int (*pScore)[COURSE], int sum[], float aver[], int m, int n)
{
int i, j;
printf("Result:\n");
for (i = 0; i < m; i ++)
{
for (j = 0; j < n; j++)
{
printf("%4d\t", *(pScore[i] + j));
}
printf("%5d\t%6.1f\n", sum[i], aver[i]);
}
}
4.
用动态数组编程输入任意m个班学生(每班n个学生)的某门课的成绩,计算最高分,并指出具有该最高分成绩的学生是第几个班的第几个学生。其中,m和n的值由用户从键盘任意输入(不限定m和n的上限值)。 输入提示信息: "Input array size m,n:" "Input %d*%d array:\n" 输入格式:"%d,%d" 输出提示信息和格式:"maxScore = %d, class = %d, number = %d\n"
#include <stdlib.h>
#include <stdio.h>
int main (void)
{
int m, n;
printf ("Input array size m,n:");
scanf ("%d,%d", &m, &n);
int **score = (int **)malloc (sizeof (int *) * m);
if (score == NULL)
{
printf ("Erro Memory!");
exit (1);
}
int iMax = 0;
int iClass = 0;
int iNumber = 0;
printf ("Input %d*%d array:\n", m, n);
int i, j;
for (i = 0; i < m; i ++)
{
score[i] = (int *)malloc (sizeof (int) * n);
for (j = 0; j < n; j ++)
{
scanf ("%d", &score[i][j]);
if (iMax < score[i][j])
{
iClass = i + 1;
iNumber = j + 1;
iMax = score[i][j];
}
}
}
printf ("maxScore = %d, class = %d, number = %d\n", iMax, iClass, iNumber);
return 0;
}