<commit_before>'''
Created on Sep 12, 2012

@author: mchrzanowski
'''

from itertools import permutations
from ProjectEulerPrime import ProjectEulerPrime


def main():

    prime_object = ProjectEulerPrime()

    primes_sorted_by_size = dict()

    digits = tuple(str(i) for i in xrange(1, 10))
<commit_msg>comments!<commit_after>'''
Created on Sep 12, 2012

@author: mchrzanowski
'''

from itertools import permutations
from ProjectEulerPrime import ProjectEulerPrime


def main():

    # the strategy here is to first find
    # all the primes composed of digits 1-9
    # (with at most one of each digit) and to sort
    # them by size.
    # We then try all the various ways
    # of adding up to 9 by adding variously-sized groups
    # (ie, groups of 1 prime, 2 primes, .... 6 primes)
    # There can only be at most 6 as primes must end with
    # an odd number (thus, 5 numbers), and then there's 2.

    prime_object = ProjectEulerPrime()

    primes_sorted_by_size = dict()

    digits = tuple(str(i) for i in xrange(1, 10))

{'fraction_non_alphanumeric': 0.08502415458937199, 'fraction_numerical': 0.02608695652173913, 'mean_word_length': 3.427350427350427, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '1747028', 'n_tokens_mistral': 369, 'n_tokens_neox': 317, 'n_words': 132}