Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- void InitScan(int**mat, int m, int n)
- {
- for(int i=0; i<m; i++){
- printf("Input %d wiersz\n",i+1);
- for(int j = 0; j<n; j++){
- printf("mat[%d][%d]= ", i, j);
- scanf("%d", &mat[i][j]);
- }
- }
- }
- void Print (int **mat, int m, int n)
- {
- for(int i=0; i<m; i++){
- for(int j=0; j<n; j++){
- printf("mat[%d][%d] = %d ", i, j, mat[i][j]);
- }
- printf("\n");
- }
- }
- void PrintColumn (int **mat, int m, int n)
- {
- for(int j=0; j<n; j++){
- for(int i=0; i<m; i++){
- printf("mat[%d][%d] = %d ", i, j, mat[i][j]);
- }
- printf("\n");
- }
- }
- int *MaxColumn(int **mat, int m, int n)
- {
- int *max = (int*) calloc (n, sizeof(int));
- for(int j=0; j < n; j++)
- {
- max[j] = mat[0][j];
- for(int i=1; i < m; i++)
- {
- if(mat[i][j] > max[j]) max[j] = mat[i][j];
- }
- }
- return max;
- }
- void printTab(int *a, int n)
- {
- for(int j=0; j<n; j++)
- printf("%d ",a[j]);
- printf("\n");
- }
- int minTab(int *a, int n)
- {
- int min = a[0];
- for(int j=1; j<n; j++)
- if(a[j] < min) min = a[j];
- return min;
- }
- int main()
- {
- int m, n;
- printf("Wprowadz m - ilosc wierszy, n - ilosc kolumn: ");
- scanf("%d%d",&m,&n);
- int **mat=(int**) malloc(m* sizeof (int*));
- for(int i = 0; i < m; i++)
- mat[i] = (int*) malloc(n* sizeof(int));
- printf("\n");
- InitScan(mat,m,n);
- printf("\n");
- PrintColumn(mat,m,n);
- int *wyn = MaxColumn(mat,m,n);
- printTab(wyn, n);
- free(wyn);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement