forked from mejibyte/live-archive
-
Notifications
You must be signed in to change notification settings - Fork 0
/
todd.cpp
78 lines (64 loc) · 1.34 KB
/
todd.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
70
71
72
73
74
75
76
77
78
// DecT.cc
// sol to Decorations problem
// T Feil
#include <string>
#include <iostream>
using namespace std;
int n, l, m, board[600],newboard[600],matches[600][600];
string beads[600];
bool PreSuf(string s1, string s2, int s){
bool OK = true;
for(int i=0;i<s-1;i++)
if(s1[i] != s2[1+i]) OK = false;
return OK;
}
void initBoard(int m, int s){
for(int i=0;i<m;i++)
board[i]=1;
//now find all patterns where suff==pref
//store results in matches[][]
for(int i=0;i<m;i++)
for(int j=0;j<m;j++)
matches[i][j]=0;
for(int i=0;i<m;i++)
for(int j=0;j<m;j++)
if(PreSuf(beads[i],beads[j],s))
matches[i][j]=1;
}
void FillIn(int i){
int count=0;
for(int k=0;k<m;k++)
if(matches[i][k])
count += board[k];
newboard[i]=count;
}
int main(){
int s, sum;
cin>>n>>l>>m;
while(n>0){
cin>>beads[0];
s = beads[0].length();
for(int i=1;i<m;i++)
cin>>beads[i];
if (l < s)
sum = 0;
else if(s==1){
sum=1;
for(int i=0;i<l;i++) sum *= m;
}
else{
initBoard(m,s);
for(int j=s+1;j<=l;j++){
for(int i=0;i<=m;i++)
FillIn(i); //board[i]<-?
for(int i=0;i<m;i++) board[i]=newboard[i];
}
sum=0;
for(int i=0;i<m;i++)
sum += board[i];
}
cout<<sum<<endl;
cin>>n>>l>>m;
}
return 0;
}