UVA Solution 232 - Crossword Answers - Solution in C++ | Volume 2

UVA Solution 232 - Crossword Answers - Solution in C++ | Volume 2

UVA Online Judge Solution 232- Crossword Answers| Volume 2
UVA Problem Link - https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=4&page=show_problem&problem=168

Problem Name: Crossword Answers
Problem Number : UVA - 232
Online Judge : UVA Online Judge Solution
Volume: 2
Solution Language : C plus plus

UVA Solution 232 Code in CPP:

#include <stdio.h>

int main() {
    int n, m, i, j, cases = 0;
    char map[20][20];
    while(scanf("%d %d", &n, &m) == 2) {
        for(i = 0; i < n; i++) {
            scanf("%s", map[i]);
        }
        if(cases)
            puts("");
        printf("puzzle #%d:\n", ++cases);

        int num[20][20] = {}, cnt = 0;
        for(i = 0; i < n; i++) {
            for(j = 0; j < m; j++) {
                if(i-1 < 0 || map[i-1][j] == '*' || j-1 < 0 || map[i][j-1] == '*') {
                    if(map[i][j] != '*')
                        num[i][j] = ++cnt;
                }
            }
        }
        puts("Across");
        for(i = 0; i < n; i++) {
            int g = 0;
            for(j = 0; j < m; j++) {
                if(map[i][j] != '*') {
                    if(g == 0)
                        printf("%3d.", num[i][j]);
                    putchar(map[i][j]);
                    g = 1;
                } else {
                    if(g) {
                        puts("");
                        g = 0;
                    }
                }
            }
            if(g)   puts("");
        }
        puts("Down");
        for(i = 0; i < n; i++) {
            for(j = 0; j < m; j++) {
                if((i-1 < 0 || map[i-1][j] == '*') && map[i][j] != '*') {
                    int ti = i;
                    printf("%3d.", num[i][j]);
                    while(ti < n && map[ti][j] != '*')
                        putchar(map[ti++][j]);
                    puts("");
                }
            }
        }
    }
    return 0;
}