UVA 1262 Password (编码与解码)

太久没码代码了，，，码力爆炸。。各种奇怪的手抖。。。

简单的做法就是暴力枚举从1到k

注意字母的查重，我采用dfs依个判断每个字母的做法。

#include <iostream>
#include <vector>
#include <cstdio>
#include <algorithm>
#include <cstring>

using namespace std;

vector<char> v[5];
char g1[6][6], g2[6][6];
char ans[6];

void check(char ch, int c) {
	for(int i = 0; i < 6; ++i) {
		if(g2[i][c] == ch) {
			v[c].push_back(ch);
			return;
		}
	}
}

void solve(int k, int d) {
	if(d >= 4) {
		ans[d] = v[d][k - 1];
		return;
	}
	for(int i = 0; i < v[d].size(); ++i) {
		int l = i, r = i + 1;
		int sum = 1;
		for(int j = d + 1; j < 5; ++j) {
			sum *= v[j].size();
		}
		//printf("sum = %d\n", sum);
		if(l*sum < k && k <= r*sum) {
			ans[d] = v[d][l];
			//printf("ans[%d] = %c\n", d, ans[d]);
			solve(k - l*sum, d + 1);
		}
	}
}

int main() {
/*
	freopen("in.txt", "r", stdin);
	freopen("out.txt", "w", stdout);
*/
	int t;
	cin >> t;
	while(t--) {
        memset(ans, 0, sizeof(ans));
        for(int i = 0; i < 5; ++i) v[i].clear();
		int k;
		cin >> k;
		for(int i = 0; i < 6; ++i) cin >> g1[i];
		for(int i = 0; i < 6; ++i) cin >> g2[i];
		for(int i = 0; i < 5; ++i) {
			for(int j = 0; j < 6; ++j) {
				check(g1[j][i], i);
			}
		}
		bool ok = true;
		int sum = 1;
		for(int i = 0; i < 5; ++i) {
			sort(v[i].begin(), v[i].end());
			v[i].erase(unique(v[i].begin(), v[i].end()), v[i].end());
		}
		for(int i = 0; i < 5; ++i) {
			if(v[i].size() == 0) ok = false;
			sum *= v[i].size();
		}
		if(k > sum) ok = false;
		if(ok) {
			/*
			for(int i = 0; i < 5; ++i) {
				for(int j = 0; j < v[i].size(); ++j) {
					cout << v[i][j];
				}
				cout << endl;
			}
			*/
			solve(k, 0);
			ans[5] = 0;
			cout << ans << endl;
		}
		else puts("NO");
	}
	return 0;
}