def remove_repeated_blocks(content_list: list[str], line_count: int) -> list[str]:
    """删除相邻重复的代码块，保留第一次出现的内容。"""
    if line_count <= 0:
        return content_list

    result = []
    seen = set()
    i = 0

    while i < len(content_list):
        block = tuple(line.strip() for line in content_list[i:i + line_count])

        if len(block) < line_count:
            result.extend(content_list[i:])
            break

        if block in seen:
            i += line_count
            continue

        seen.add(block)
        result.extend(content_list[i:i + line_count])
        i += line_count

    return result

for i in range(15):
    print("hello")

filename = "data.txt"
data = "Hello, World!"

with open(filename, "a") as file:
    file.write(data)

primes=[]
products=[]

def prime(num):
    if num > 1:
        for i in range(2,num):
            if (num % i) == 0:
                return False
        else:
            primes.append(num)
            return True

for n in range(30,1000):
    if len(primes) >= 20:
        break;
    else:
        prime(n)

for previous, current in zip(primes[::2], primes[1::2]):
    products.append(previous * current)
    
print (products)

magnitude = lambda bits: 1_000_000_000_000_000_000 % (2 ** bits)
sign = lambda bits: -1 ** (1_000_000_000_000_000_000 // (2 ** bits))

print("64 bit sum:", magnitude(64) * sign(64))
print("32 bit sum:", magnitude(32) * sign(32))
print("16 bit sum:", magnitude(16) * sign(16))

#84 48 13 20 61 20 33 97 34 45 6 63 71 66 24 57 92 74 6 25 51 86 48 15 64 55 77 30 56 53 37 99 9 59 57 61 30 97 50 63 59 62 39 32 34 4 96 51 8 86 10 62 16 55 81 88 71 25 27 78 79 88 92 50 16 8 67 82 67 37 84 3 33 4 78 98 39 64 98 94 24 82 45 3 53 74 96 9 10 94 13 79 15 27 56 66 32 81 77
# xor a list of integers to find the lonely integer
res = a[0]
    for i in range(1,len(a)):
        res = res ^ a[i]