Submission #11,750

2024-11-09 00:51:35

python3

Accepted 50/50

17ms

3320 KiB

import math


def find_multiple_with_x_digits(n, x):
    start = 10 ** (x - 1)  # Az x számjegyű legkisebb szám
    # Keressük az első olyan többszöröst, amely nagyobb vagy egyenlő a start értéknél
    multiple = ((start + n - 1) // n) * n
    return multiple


def main():
    for _ in range(3):
        a, b, c = map(int, input().split())
        lcm = math.lcm(a, b)
        if len(str(lcm)) > c:
            print("-1")
        else:
            print(find_multiple_with_x_digits(lcm, c))


main()

	Sum	Test	Verdict		Time	Memory
base	50/50
		1	Accepted	0/0	16ms	3144 KiB
		2	Accepted	0/0	17ms	3124 KiB
		3	Accepted	3/3	16ms	3144 KiB
		4	Accepted	3/3	16ms	3124 KiB
		5	Accepted	3/3	17ms	3128 KiB
		6	Accepted	3/3	14ms	3312 KiB
		7	Accepted	3/3	16ms	3132 KiB
		8	Accepted	3/3	16ms	3128 KiB
		9	Accepted	3/3	16ms	3108 KiB
		10	Accepted	3/3	16ms	3128 KiB
		11	Accepted	3/3	16ms	3016 KiB
		12	Accepted	3/3	14ms	2980 KiB
		13	Accepted	4/4	16ms	3132 KiB
		14	Accepted	4/4	17ms	3136 KiB
		15	Accepted	4/4	16ms	3120 KiB
		16	Accepted	4/4	17ms	3320 KiB
		17	Accepted	4/4	16ms	3128 KiB