H - African Crossword

CodeForces - 90B

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.

Input
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.

Output
Print the encrypted word on a single line. It is guaranteed that the answer consists of at least one letter.

Example
Input
3 3
cba
bcd
cbc
Output
abcd
Input
5 5
fcofd
ooedo
afaoa
rdcdf
eofsf
Output
codeforces

題意：解碼花枫，去掉一行和一列中重復字母，剩下的字母為答案。

解法：暴力踱葛，枚舉每一個元素戈二，對其同行同列的數(shù)遍歷主届，去掉相同的數(shù)。

代碼：

#include<iostream>
using namespace std;
char a[101][101];
int b[101][101]={0,};
int main()
{
    int n,m;
    cin>>n>>m;
    for(int i=0;i<n;i++)
        for(int j=0;j<m;j++)
            cin>>a[i][j];
    for(int i=0;i<n;i++)
        for(int j=0;j<m;j++){
            for(int k=j+1;k<m;k++)
                if(a[i][j]==a[i][k]){
                    b[i][j]=1;
                    b[i][k]=1;
                    break;
                }
            for(int k=i+1;k<n;k++)
                if(a[i][j]==a[k][j]){
                    b[i][j]=1;
                    b[k][j]=1;
                    break;
                }
            if(b[i][j]==1)
                continue;
            cout<<a[i][j];
        }
}