7.6 แบบฝึกหัด

#include <stdio.h>

int sales[100][100];

int main()
{
    int days, menus;
    scanf("%d %d", &days, &menus);
    for (int r = 0; r < days; r++) {
        for (int c = 0; c < menus; c++) {
            scanf("%d", &sales[r][c]);
        }
    }
    int best_day = 0, best_day_total = -1;
    for (int r = 0; r < days; r++) {
        int total = 0;
        for (int c = 0; c < menus; c++) {
            total += sales[r][c];
        }
        if (total > best_day_total) {
            best_day = r;
            best_day_total = total;
        }
    }
    int best_menu = 0, best_menu_total = -1;
    for (int c = 0; c < menus; c++) {
        int total = 0;
        for (int r = 0; r < days; r++) {
            total += sales[r][c];
        }
        if (total > best_menu_total) {
            best_menu = c;
            best_menu_total = total;
        }
    }
    printf("%d %d\n", best_day + 1, best_day_total);
    printf("%d %d\n", best_menu + 1, best_menu_total);
    return 0;
}

#include <stdio.h>

int a[100][100];

int main()
{
    int n;
    scanf("%d", &n);
    for (int r = 0; r < n; r++) {
        for (int c = 0; c < n; c++) {
            scanf("%d", &a[r][c]);
        }
    }
    long long main_sum = 0, anti_sum = 0;
    for (int i = 0; i < n; i++) {
        main_sum += a[i][i];
        anti_sum += a[i][n - 1 - i];
    }
    long long cross = main_sum + anti_sum;
    if (n % 2 == 1) {
        cross -= a[n / 2][n / 2];
    }
    printf("%lld\n%lld\n%lld\n", main_sum, anti_sum, cross);
    return 0;
}

#include <stdio.h>

char photo[100][101];

int main()
{
    int rows, cols;
    scanf("%d %d", &rows, &cols);
    for (int r = 0; r < rows; r++) {
        scanf("%s", photo[r]);
    }
    for (int c = 0; c < cols; c++) {
        for (int r = rows - 1; r >= 0; r--) {
            printf("%c", photo[r][c]);
        }
        printf("\n");
    }
    return 0;
}

#include <stdio.h>

char board[100][101];
int dr[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
int dc[8] = {-1, 0, 1, -1, 1, -1, 0, 1};

int main()
{
    int rows, cols;
    scanf("%d %d", &rows, &cols);
    for (int r = 0; r < rows; r++) {
        scanf("%s", board[r]);
    }
    for (int r = 0; r < rows; r++) {
        for (int c = 0; c < cols; c++) {
            if (board[r][c] == '*') {
                printf("*");
            } else {
                int mines = 0;
                for (int d = 0; d < 8; d++) {
                    int nr = r + dr[d];
                    int nc = c + dc[d];
                    if (nr >= 0 && nr < rows && nc >= 0 && nc < cols && board[nr][nc] == '*') {
                        mines++;
                    }
                }
                printf("%d", mines);
            }
        }
        printf("\n");
    }
    return 0;
}

#include <stdio.h>

char map[100][101];
int dr[4] = {-1, 1, 0, 0};
int dc[4] = {0, 0, -1, 1};

int main()
{
    int rows, cols;
    scanf("%d %d", &rows, &cols);
    for (int r = 0; r < rows; r++) {
        scanf("%s", map[r]);
    }
    int coast = 0;
    for (int r = 0; r < rows; r++) {
        for (int c = 0; c < cols; c++) {
            if (map[r][c] == '#') {
                for (int d = 0; d < 4; d++) {
                    int nr = r + dr[d];
                    int nc = c + dc[d];
                    if (nr < 0 || nr >= rows || nc < 0 || nc >= cols || map[nr][nc] == '.') {
                        coast++;
                    }
                }
            }
        }
    }
    printf("%d\n", coast);
    return 0;
}

#include <stdio.h>

int a[100][100], b[100][100];

int main()
{
    int n, m, p;
    scanf("%d %d %d", &n, &m, &p);
    for (int i = 0; i < n; i++) {
        for (int k = 0; k < m; k++) {
            scanf("%d", &a[i][k]);
        }
    }
    for (int k = 0; k < m; k++) {
        for (int j = 0; j < p; j++) {
            scanf("%d", &b[k][j]);
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < p; j++) {
            long long sum = 0;
            for (int k = 0; k < m; k++) {
                sum += (long long)a[i][k] * b[k][j];
            }
            printf("%lld", sum);
            if (j < p - 1) {
                printf(" ");
            }
        }
        printf("\n");
    }
    return 0;
}

#include <stdio.h>

char garden[100][101];

int main()
{
    int rows, cols;
    scanf("%d %d", &rows, &cols);
    for (int r = 0; r < rows; r++) {
        scanf("%s", garden[r]);
    }
    int plots = 0, largest = 0;
    for (int r = 0; r < rows; r++) {
        for (int c = 0; c < cols; c++) {
            int top_free = (r == 0 || garden[r - 1][c] != '#');
            int left_free = (c == 0 || garden[r][c - 1] != '#');
            if (garden[r][c] == '#' && top_free && left_free) {
                plots++;
                int width = 0;
                while (c + width < cols && garden[r][c + width] == '#') {
                    width++;
                }
                int height = 0;
                while (r + height < rows && garden[r + height][c] == '#') {
                    height++;
                }
                if (width * height > largest) {
                    largest = width * height;
                }
            }
        }
    }
    printf("%d %d\n", plots, largest);
    return 0;
}

#include <stdio.h>

char forest[100][101], next_forest[100][101];
int dr[4] = {-1, 1, 0, 0};
int dc[4] = {0, 0, -1, 1};

int main()
{
    int rows, cols, minutes;
    scanf("%d %d %d", &rows, &cols, &minutes);
    for (int r = 0; r < rows; r++) {
        scanf("%s", forest[r]);
    }
    for (int t = 0; t < minutes; t++) {
        for (int r = 0; r < rows; r++) {
            for (int c = 0; c < cols; c++) {
                next_forest[r][c] = forest[r][c];
                if (forest[r][c] == '*') {
                    next_forest[r][c] = '.';
                } else if (forest[r][c] == '#') {
                    for (int d = 0; d < 4; d++) {
                        int nr = r + dr[d];
                        int nc = c + dc[d];
                        if (nr >= 0 && nr < rows && nc >= 0 && nc < cols && forest[nr][nc] == '*') {
                            next_forest[r][c] = '*';
                        }
                    }
                }
            }
        }
        for (int r = 0; r < rows; r++) {
            for (int c = 0; c < cols; c++) {
                forest[r][c] = next_forest[r][c];
            }
        }
    }
    for (int r = 0; r < rows; r++) {
        printf("%s\n", forest[r]);
    }
    return 0;
}

#include <stdio.h>

long long prefix[501][501];

int main()
{
    int rows, cols;
    scanf("%d %d", &rows, &cols);
    for (int r = 1; r <= rows; r++) {
        for (int c = 1; c <= cols; c++) {
            int people;
            scanf("%d", &people);
            prefix[r][c] = people + prefix[r - 1][c] + prefix[r][c - 1] - prefix[r - 1][c - 1];
        }
    }
    int questions;
    scanf("%d", &questions);
    for (int i = 0; i < questions; i++) {
        int r1, c1, r2, c2;
        scanf("%d %d %d %d", &r1, &c1, &r2, &c2);
        printf("%lld\n", prefix[r2][c2] - prefix[r1 - 1][c2] - prefix[r2][c1 - 1] + prefix[r1 - 1][c1 - 1]);
    }
    return 0;
}

#include <stdio.h>

char line[1001][1002];
int prefix[1001][1001];

int main()
{
    int rows, cols, k;
    scanf("%d %d %d", &rows, &cols, &k);
    for (int r = 1; r <= rows; r++) {
        scanf("%s", line[r]);
        for (int c = 1; c <= cols; c++) {
            int ripe = line[r][c - 1] - '0';
            prefix[r][c] = ripe + prefix[r - 1][c] + prefix[r][c - 1] - prefix[r - 1][c - 1];
        }
    }
    int best = -1, best_r = 0, best_c = 0;
    for (int r = 1; r + k - 1 <= rows; r++) {
        for (int c = 1; c + k - 1 <= cols; c++) {
            int r2 = r + k - 1, c2 = c + k - 1;
            int sum = prefix[r2][c2] - prefix[r - 1][c2] - prefix[r2][c - 1] + prefix[r - 1][c - 1];
            if (sum > best) {
                best = sum;
                best_r = r;
                best_c = c;
            }
        }
    }
    printf("%d\n%d %d\n", best, best_r, best_c);
    return 0;
}