Code: Select all
4
1 1 D
2 3 D
3 1 A
5 2 A
SLOW
AGAIN
BOY
TAIL
BEAR
4
1 1 D
2 3 D
3 1 A
5 2 A
SLOW
AGAIN
BLOW
TAIL
BEAR
4
1 1 D
2 3 D
3 1 A
5 2 A
BAAA
ABAA
AABA
AAAB
AABB
4
1 1 D
2 3 D
3 1 A
5 2 A
ASDFBW
ADFES
ASE
HREDF
VHNWA
3
1 1 D
1 1 A
6 1 A
AAAA
AAAAA
BBBBB
BBBBC
2
1 1 D
3 2 D
AA
AAA
AAAA
0
Code: Select all
Trial 1: BOY
Trial 2: SLOW BLOW
Trial 3: BAAA ABAA AABA AAAB AABB
Trial 4: Impossible
Trial 5: BBBBB BBBBC
Trial 6: AAA AAAA
I noticed this line, I wonder why it was omitted from this problem statement:
Every maximal horizontal or vertical sequence of two or more letters must be a word in the input.
I iterate through each set of N words and try to fill the slots in the 10 by 10 grid. I assume each word must be used exactly once.
I also noticed there are words in the input with a length greater than 10 but less than 20, I assumed these words won't fit in any slot.