Kayaks

#include <cctype>
#include <iostream>
#include <vector>

using namespace std;


int main() {
    int n, m;
    cin >> n >> m;

    int positions[9];

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            char c;
            cin >> c;

            if (isdigit(c)) {
                positions[c - '1'] = m - j - 1;
            }
        }
    }

    vector<int> ranks_by_distance(m, 0);

    for (int i = 0; i < m; i++) {
        if (i > 0) {
            ranks_by_distance[i] = ranks_by_distance[i - 1];
        }

        for (int j = 0; j < 9; j++) {
            if (positions[j] == i) {
                ranks_by_distance[i] += 1;
                break;
            }
        }
    }

    for (int i = 0; i < 9; i++) {
        cout << ranks_by_distance[positions[i]] << endl;
    }

    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED