UVA 776

#include <bits/stdc++.h>
using namespace std; typedef long long ll; typedef unsigned long long ull; const int mod = 1e9 + 7, N = 1e5 + 1, inf = INT_MAX;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define ep emplace_back
//#define int ll

int n = 1, m = 0, cur, idx = 0, max_digit[111], ans[111][111];
char x, a[111][111];
bool visited[111][111];
string s;

int cnt(int x)
{
    int ans = 0;
    while (x)
    {
        x /= 10;
        ans++;
    }
    return ans;
}

void dfs(int i, int j)
{
    if (visited[i][j])
    {
        return;
    }
    if (i == 0 || j == 0 || i > n || j > m)
    {
        return;
    }
    if (a[i][j] != cur)
    {
        return;
    }
    ans[i][j] = idx;
    visited[i][j] = 1;
    dfs(i, j + 1);
    dfs(i + 1, j);
    dfs(i - 1, j);
    dfs(i, j - 1);
    dfs(i - 1, j + 1);
    dfs(i + 1, j - 1);
    dfs(i + 1, j + 1);
    dfs(i - 1, j - 1);
}

signed main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    while (getline(cin, s) && s != "")
    {
        idx = 0;
        memset(visited, 0, sizeof visited);
        memset(max_digit, 0, sizeof max_digit);
        n = 1, m = 0;
        stringstream z(s);
        while (z >> x)
        {
            a[n][++m] = x;
        }
        while (getline(cin, s) && s != "" && s != "%")
        {
            stringstream z(s);
            n++;
            int pos = 0;
            while (z >> x)
            {
                a[n][++pos] = x;
            }
        }
        for (int i = 1; i <= n; i++)
        {
            for (int j = 1; j <= m; j++)
            {
                if (!visited[i][j])
                {
                    ++idx;
                    cur = a[i][j];
                    dfs(i, j);
                }
            }
        }
        for (int j = 1; j <= m; j++)
        {
            for (int i = 1; i <= n; i++)
            {
                if (i == 1) max_digit[j] = cnt(ans[i][j]);
                else max_digit[j] = max(max_digit[j], cnt(ans[i][j]));
            }
        }
        for (int i = 1; i <= n; i++)
        {
            for (int j = 1; j <= m; j++)
            {
                for (int k = 1; k <= max_digit[j] - cnt(ans[i][j]); k++)
                {
                    cout << ' ';
                }
                cout << ans[i][j];
                if (j < m) cout << ' ';
            }
            cout << endl;
        }
        cout << "%\n";
    }
    return 0;
}