Kayaks

#include <stdio.h>
#include <iostream>
#include <memory.h>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;

#define sqr(a) ((a) * (a))
#define pi 3.1415926535897932384626433832795

#define TASK "i"
//#define CONTEST 1

string s;
int n, m;
int sc[10];
int field[50][50];

void Load()
{
	cin >> n >> m;

	for(int i = 0; i < n; i++)
	{
		cin >> s;
		for(int j = 0; j < m; j++)
		{
			if(isdigit(s[j]))
				field[i][j] = stoi(string(1,s[j]));
			else
				field[i][j] = 0;
		}
	}

}

void Solve()
{
	int place = 9;
	for(int j = 0; j < m-1; j++)
	{
		bool ok = false;
		for(int i = 0; i < n; i++)
		{
			if(field[i][j+1] == 0 && field[i][j] != 0)
			{
				sc[field[i][j]] = place;
				ok = true;
			}
		}

		if (ok) place--;
	}

	int mi = 1000;
	for(int i = 1; i <= 9; i++)
	{
		if(mi > sc[i]) mi = sc[i];
	}

	for(int i = 1; i <= 9; i++)
	{
		sc[i] = sc[i] - mi + 1;
	}
	
	for(int i = 1; i <= 9; i++)
		cout << sc[i] << endl;

}                 

int main()
{
#ifdef CONTEST
	freopen(TASK".in", "r", stdin);
	freopen(TASK".out", "w", stdout);
#endif
	
	Load();
	Solve();

	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