NYT-Spelling-Bee-Solver/stats.py at master · izzyleung/NYT-Spelling-Bee-Solver · GitHub

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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
#!/usr/bin/env python3

import sys

from collections import defaultdict


def main():
    words = [w.strip() for w in sys.stdin.readlines()]

    initial_counts, length_counts, two_letters = defaultdict(dict), {}, {}
    points, max_word_len, num_pangrams, num_perfects = 0, 0, 0, 0

    for word in words:
        # It's a pangram
        if word.startswith('* '):
            # Strip the first 2 chars
            word = word[2:]
            # Add the bouns 7 points to the points total
            points += 7
            # Increase the total amount of pangrams
            num_pangrams += 1
            # Perfect Pangram — A pangram that uses each letter only once
            if len(word) == 7:
                num_perfects += 1

        # Update points total
        if len(word) == 4:
            # 4 letter words are worth 1 point each
            points += 1
        else:
            # Longer words earn 1 point per letter
            points += len(word)
            # Update `max_word_len` for outputting results later
            max_word_len = max(max_word_len, len(word))

        word_initial, word_len, first_two = word[0], len(word), word[:2]
        initial_info = initial_counts[word_initial]
        initial_info[word_len] = initial_info.get(word_len, 0) + 1
        length_counts[word_len] = length_counts.get(word_len, 0) + 1
        two_letters[first_two] = two_letters.get(first_two, 0) + 1

    puzzle_stats = [
        f'WORDS: {len(words)}',
        f'POINTS: {points}',
    ]

    pangram_stat = f'PANGRAMS: {num_pangrams}'
    if num_perfects > 0:
        pangram_stat += f' ({num_perfects} Perfect)'
    puzzle_stats.append(pangram_stat)
    # BINGO — All seven letters in the puzzle are used to start at least one word in the word list.
    if len(initial_counts) == 7:
        puzzle_stats.append('BINGO')

    # Print the stats
    print(', '.join(puzzle_stats), '\n')

    word_lengths = list(sorted(length_counts.keys()))
    # Print the table header
    print(f"   {' '.join(str(i).rjust(3) for i in word_lengths)}   Σ")

    word_initials = sorted(initial_counts.keys())
    # Print the info for each letter
    for c in word_initials:
        counts = []
        for i in word_lengths:
            counts.append(initial_counts[c].get(i, 0))
        total = sum(counts)

        cells = [(str(i) if i != 0 else '-').rjust(3) for i in counts]
        print(f'{c}: {" ".join(cells)}   {str(total)}')
    # Print the info on each word size
    counts = []
    for i in word_lengths:
        count = 0
        for c in initial_counts.keys():
            count += initial_counts[c].get(i, 0)
        counts.append(count)
    total = sum(counts)

    cells = [(str(i) if i != 0 else '-').rjust(3) for i in counts]
    print(f'Σ: {" ".join(cells)}   {str(total)}', '\n')

    # Print two letter list
    two_letters_stats = defaultdict(list)
    for first_two, count in two_letters.items():
        word_initial = first_two[0]
        two_letters_stats[word_initial].append(f'{first_two}-{count}')

    print('Two letter list:', '\n')
    for word_initial in word_initials:
        print(' '.join(sorted(two_letters_stats[word_initial])))


if __name__ == '__main__':
    main()