-
Notifications
You must be signed in to change notification settings - Fork 0
/
628.cpp
70 lines (67 loc) · 1.43 KB
/
628.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
//the input constraints aren't clear in the description of the problem
#include <bits/stdc++.h>
using namespace std;
#define SZ(v) (int)v.size()
#define ALL(v) v.begin(),v.end()
#define ALLR(v) v.rbegin(),v.rend()
#define FN(s,c) (int)s.find(c)
#define FOR(i,e) for (int i = 0; i < e; i++)
#define MFOR(i,s,e) for (int i = s; i <= e; i++)
#define ROF(i,s) for (int i = s-1; i >= 0; i--)
#define MROF(i,s,e) for (int i = s; i >= e; i--)
#define IT(it,v) for(it=v.begin();it!=v.end();it++)
#define TI(it,v) for(it=v.rbegin();it!=v.rend();it++)
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define FILL(a,v) memset(a,v,sizeof(a))
typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> II;
/*************************************************/
int n;
vector<string> dic;
string rule;
void rec(int curr, string s) {
if (curr == SZ(rule)) {
cout << s << endl;
return;
}
if (rule[curr] == '#') {
FOR(i,SZ(dic))
{
rec(curr + 1, s + dic[i]);
}
} else {
for (char i = '0'; i <= '9'; ++i) {
rec(curr + 1, s + i);
}
}
}
int main() {
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
while (cin >> n) {
cout << "--" << endl;
dic.clear();
FOR(i,n)
{
string s;
cin >> s;
dic.PB(s);
}
int m;
cin >> m;
FOR(i,m)
{
string s;
cin >> rule;
rec(0, "");
}
}
return 0;
}