cf#644 F Spy-string

You are given n strings a1,a2,…,an: all of them have the same length m. The strings consist of lowercase English letters.

Find any string s of length m such that each of the given n strings differs from s in at most one position. Formally, for each given string ai, there is no more than one position j such that ai[j]≠s[j].

Note that the desired string s may be equal to one of the given strings ai, or it may differ from all the given strings.

For example, if you have the strings abac and zbab, then the answer to the problem might be the string abab, which differs from the first only by the last character, and from the second only by the first.

Input
The first line contains an integer t (1≤t≤100) — the number of test cases. Then t test cases follow.

Each test case starts with a line containing two positive integers n (1≤n≤10) and m (1≤m≤10) — the number of strings and their length.

Then follow n strings ai, one per line. Each of them has length m and consists of lowercase English letters.

Output
Print t answers to the test cases. Each answer (if it exists) is a string of length m consisting of lowercase English letters. If there are several answers, print any of them. If the answer does not exist, print “-1” (“minus one”, without quotes).

input
5
2 4
abac
zbab
2 4
aaaa
bbbb
3 3
baa
aaa
aab
2 2
ab
bb
3 1
a
b
c

output
abab
-1
aaa
ab
z

//大意是寻找一个字符串与给的字符串都不能相差2个及2个以上的字符。
方法是暴力枚举，以给的第一个字符串为基准

#include<bits/stdc++.h>
using namespace std;
int main(){
	int t,n,m;
	cin>>t;
	string s[15];
	while(t--){
		cin>>n>>m;
		for(int i=0;i<n;i++){
			cin>>s[i];
		}
		string ans=s[0];
		int flag=0;
		for(int i=0;i<m;i++){
			for(char j='a';j<='z';j++){
				ans[i]=j;
				int sum,flag2=1;
				for(int k=0;k<n;k++){
					sum=0;
					for(int z=0;z<m;z++){
						if(ans[z]!=s[k][z]) sum++;//寻找不一样的字符
					}
					if(sum>=2){
						flag2=0;
						ans[i]=s[0][i];//这句话不可少 
						break;
					}
				}
				if(flag2){//如果当前的字符串符合条件，flag2没变过是1
					cout<<ans<<endl;
					flag=1;
				}
				if(flag) break;
			}
			if(flag) break;
		}
		if(flag==0) cout<<-1<<endl;
	}
	return 0;
}