Algorithm
An African crossword is a rectangular table n × m in size. Each cell of the table contains exactly one letter. This table (it is also referred to as grid) contains some encrypted word that needs to be decoded.
To solve the crossword you should cross out all repeated letters in rows and columns. In other words, a letter should only be crossed out if and only if the corresponding column or row contains at least one more letter that is exactly the same. Besides, all such letters are crossed out simultaneously.
When all repeated letters have been crossed out, we should write the remaining letters in a string. The letters that occupy a higher position follow before the letters that occupy a lower position. If the letters are located in one row, then the letter to the left goes first. The resulting word is the answer to the problem.
You are suggested to solve an African crossword and print the word encrypted there.
The first line contains two integers n and m (1 ≤ n, m ≤ 100). Next n lines contain m lowercase Latin letters each. That is the crossword grid.
Print the encrypted word on a single line. It is guaranteed that the answer consists of at least one letter.
3 3
cba
bcd
cbc
abcd
5 5
fcofd
ooedo
afaoa
rdcdf
eofsf
codeforces
Code Examples
#1 Code Example with C++ Programming
Code -
C++ Programming
#include <cstdio>
#include <vector>
int main(){
int n(0), m(0); scanf("%d %d\n", &n, &m);
std::vector<std::vector < char> > grid(n, std::vector<char>(m,'#'));
std::vector<std::vector < char> > mock(n, std::vector<char>(m,'#'));
for(int row = 0; row < n; row++){for(int col = 0; col < m; col++){scanf("%c", &grid[row][col]);}scanf("\n");}
for(int row = 0; row < n; row++){for(int col = 0; col < m; col++){mock[row][col] = grid[row][col];}}
for(int row = 0; row < n; row++){
for(int col = 0; col < m; col++){
bool cross = 0;
for(int nextCol = col + 1; nextCol < m; nextCol++){if(grid[row][col] == grid[row][nextCol]){cross = 1; mock[row][nextCol] = '#';}}
for(int nextRow = row + 1; nextRow < n; nextRow++){if(grid[row][col] == grid[nextRow][col]){cross = 1; mock[nextRow][col] = '#';}}
if(cross){mock[row][col] = '#';}
}
}
for(int row = 0; row < n; row++){
for(int col = 0; col < m; col++){
if(mock[row][col] != '#'){printf("%c", mock[row][col]);}
}
}
return 0;
}Input
cba
bcd
cbc
Output
Demonstration
Codeforces Solution-B. African Crossword-Solution in C, C++, Java, Python