#include <bits/stdc++.h>
using namespace std;
string b;
unordered_map <string,int> mp;
int n;
void dfs(string a){
string l=a;
for(int i=0;i<n;i++){
if(a[i]=='0')
l[i]='1';
else
l[i]='0';
if(l==b){
cout<<"TAK";
exit(0);
}
if(mp[l]==0){
mp[l]=1;
dfs(l);
}
l[i]=a[i];
}
}
int main() {
int k;
string a;
cin>>n>>k>>a>>b;
for(int i=1;i<=k;i++){
string x;
cin>>x;
mp[x]=-1;
}
dfs(a);
cout<<"NIE";
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |