import anytree as at
import random as rm

# Generate a tree with node_count many nodes. Each has a number key that shows when it was made and a randomly selected color, red or white.
def random_tree(node_count):
    
    # Generates the list of nodes
    nodes = []
    for i in range(node_count):
        test = rm.randint(1,2)
        if test == 1:
            nodes.append(at.Node(str(i),color="white"))
        else:
            nodes.append(at.Node(str(i),color="red"))
    
    #Creates the various main branches
    for i in range(node_count):
        for j in range(i, len(nodes)):
            test = rm.randint(1,len(nodes))
            if test == 1 and nodes[j].parent == None and (not nodes[i] == nodes[j]):
                nodes[j].parent = nodes[i]
    
    #Collects all the main branches into a single tree with the first node being the root
    for i in range(1, node_count):
        if nodes[i].parent == None and (not nodes[i] == nodes[0]):
            nodes[i].parent = nodes[0]

    return nodes[0]

import itertools

def compute_permutations(string):
    # Generate all permutations of the string
    permutations = itertools.permutations(string)

    # Convert each permutation tuple to a string
    permutations = [''.join(permutation) for permutation in permutations]

    return permutations

# Prompt the user for a string
string = input("Enter a string: ")

# Compute permutations
permutations = compute_permutations(string)

# Display the permutations
print("Permutations:")
for permutation in permutations:
    print(permutation)

prime_lists=[] # a list to store the prime numbers

def prime(n): # define prime numbers
    if n <= 1:
        return False
    # divide n by 2... up to n-1
    for i in range(2, n):
        if n % i == 0:  # the remainder should'nt be a 0
            return False
    else:
        prime_lists.append(n)
        return True



for n in range(30,1000):  # calling function and passing starting point =30 coz we need primes >30
    prime(n)

check=0 # a var to limit the output  to 10 only
for n in prime_lists:
    for x in prime_lists:
        val=  n *x
        if (val > 1000 ):
            check=check +1
        if (check <10) :
            print("the num is:", val , "=",n , "* ", x )
        break

print("hello world")

#Original
def output_json_log_data_to_file(filename, record_dictionary_list):
    with open(filename, 'w') as outputFile:
        for record in record_dictionary_list:
            json.dump(record, outputFile)
            outputFile.write('\n')


#Atomic
def output_json_log_data_to_file(filename, record_dictionary_list):
    # Use atomic file operations to prevent race conditions with readers
    # Write to temporary file first, then atomically rename to target file
    tmp_filename = filename + '.tmp'
    with open(tmp_filename, 'w') as outputFile:
        for record in record_dictionary_list:
            json.dump(record, outputFile)
            outputFile.write('\n')
    # Atomic rename - this prevents readers from seeing partial writes
    shutil.move(tmp_filename, filename)

def calculate_values():
    value1 = 10
    value2 = 20
    return value1, value2

result1, result2 = calculate_values()
print("Result 1:", result1)
print("Result 2:", result2)