Skip to main content

Featured

C Program to Check Prime Number Using Efficient Logic

  Introduction A prime number is a number that has exactly two distinct positive divisors: 1 and itself. In this program, we check whether a given number is prime or not using a simple and efficient logic. This type of program is commonly used in mathematics, competitive programming, and basic algorithm learning for beginners in C programming. Problem Statement The task is to write a C program that determines whether a given integer is a prime number or not. The program takes a single integer input from the user and analyzes its divisibility. If the number has no divisors other than 1 and itself, it should be identified as a prime number; otherwise, it is not prime. This problem is important in number theory and has practical relevance in areas such as cryptography, data validation, and algorithm design.  Algorithm / Logic Explanation To check whether a number is prime, we need to verify that it is not divisible by any number other than 1 and itself. The algorithm follows a si...

C Program: Final Sum of Max Row and Min Column

C Program: Final Sum of Max Row and Min Column

๐Ÿ”ท C Program: Final Sum of Max Row and Min Column

#include <stdio.h>

int main()
{
    int n, m;
    printf("Enter the number of rows (N): ");
    scanf("%d", &n);
    printf("Enter the number of coloumns (M): ");
    scanf("%d", &m);

    int a[n][m];

    printf("Enter the elements of the array:\n");
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            scanf("%d", &a[i][j]);
        }
    }

    int max_row_sum = 0;
    for (int i = 0; i < n; i++)
    {
        int row_sum = 0;
        for (int j = 0; j < m; j++)
        {
            row_sum += a[i][j];
        }
        if (i == 0 || row_sum > max_row_sum)
        {
            max_row_sum = row_sum;
        }
    }

    int min_col_sum = 0;
    for (int j = 0; j < m; j++)
    {
        int col_sum = 0;
        for (int i = 0; i < n; i++)
        {
            col_sum += a[i][j];
        }
        if (j == 0 || col_sum < min_col_sum)
        {
            min_col_sum = col_sum;
        }
    }

    int final_sum = max_row_sum + min_col_sum;
    printf("\nsum of row with highest sum: %d\n", max_row_sum);
    printf("sum of column with lowest sum: %d\n", min_col_sum);
    printf("Final sum (Largest row sum + smallest column sum): %d\n", final_sum);

    return 0;
}
  

๐Ÿ“˜ Explanation:

This C program works on a 2D array (matrix) and calculates two things:

๐Ÿ”น Maximum Row Sum: The sum of the row which has the highest total.
๐Ÿ”น Minimum Column Sum: The sum of the column which has the smallest total.

๐Ÿ”น After collecting user input into the matrix, it traverses each row to find the maximum row sum.
๐Ÿ”น Then it traverses each column to find the minimum column sum.
๐Ÿ”น It adds both to compute the final_sum and displays all three values: max row sum, min col sum, and their sum.

๐Ÿ” Sample Output:

Enter the number of rows (N): 3
Enter the number of coloumns (M): 3
Enter the elements of the array:
1 2 3
4 5 6
7 8 9

sum of row with highest sum: 24
sum of column with lowest sum: 12
Final sum (Largest row sum + smallest column sum): 36
    

๐Ÿท️ Keywords:

2D array in C, row sum, column sum, max row, min column, matrix manipulation in C, matrix row column sum program

Comments

Popular Posts

๐ŸŒ™