/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Wrong Answer 1ms 516.0 KiB
#2 Wrong Answer 6ms 284.0 KiB

Code

#include <stdio.h>
#include <string.h>
void solve() {
    int N, M;
    scanf("%d %d", &N, &M);
    char T[N][M + 1];
    int max_score = 0;
    for (int i = 0; i < N; i++) {
        scanf("%s", T[i]);
    }
    for (int j = 0; j < M; j++) {
        int freq[26] = {0}, max_freq = 0;
        for (int i = 0; i < N; i++) {
            freq[T[i][j] - 'a']++;
            if (freq[T[i][j] - 'a'] > max_freq) {
                max_freq = freq[T[i][j] - 'a'];
            }
        }
        max_score += max_freq;
    }
    printf("%d\n", max_score);
}
int main() {
    int Tc;
    scanf("%d", &Tc);
    while (Tc--) {
        solve();
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1164 Simple character matching game
Contest
Brain Booster #8
Language
C99 (GCC 13.2.0)
Submit At
2025-02-17 15:44:24
Judged At
2025-02-17 15:44:24
Judged By
Score
0
Total Time
6ms
Peak Memory
516.0 KiB