Editing 1190 - Sipet (section)

== Rezolvare ==
<syntaxhighlight lang="python" line>
def is_prime(num):
    if num < 2:
        return False
    for i in range(2, int(num ** 0.5) + 1):
        if num % i == 0:
            return False
    return True

def next_prime(num):
    while True:
        num += 1
        if is_prime(num):
            return num

def main():
    with open("sipet.in", "r") as fin:
        T = int(fin.readline())
        queries = [tuple(map(int, line.split())) for line in fin]

    primes = [2, 3, 5]
    results = []

    for N, p1 in queries:
        p2 = next_prime(p1)
        p3 = next_prime(p2)

        remaining_coins = N - p1 - p2 - p3

        # Calculate the number of coins for each pile
        x = (remaining_coins // p1) + 1
        y = (remaining_coins // p2) + 1
        z = (remaining_coins // p3) + 1

        # Calculate the number of satchels
        S = min(x, y, z)
        
        # Calculate the remaining coins after distributing them into piles
        remaining_coins -= (S - 1) * min(p1, p2, p3)

        # Calculate the number of coins donated to the church
        r = max(remaining_coins, 0)

        results.append((S, x, y, z, r))

    with open("sipet.out", "w") as fout:
        for result in results:
            fout.write(" ".join(map(str, result)) + "\n")

if __name__ == "__main__":
    main()

</syntaxhighlight>