Submission #18,737

2025-11-02 07:21:10

python3

Accepted 70/70

17ms

3320 KiB

N = int(input())
T = list(map(int,input().split()))
def DecToTre(x):
    harmas = ""
    if x == 0:
        return 0
    else:
        while x > 0:
            harmas = str(x % 3) + harmas
            x = x // 3
        return harmas

sor = 0
hely = 0
for i in range(N):
    if T[i] == 0:
        sor += 1
        hely = hely * 3
    elif T[i] == 1:
        sor += 1
        hely = hely * 3 + 1
    elif T[i] == 2:
        sor += 1
        hely = hely * 3 + 2
    elif T[i] == 3:
        sor -= 1
        hely = hely // 3
    elif T[i] == 4:
        hely = hely - 1
    else:
        hely = hely + 1
print(sor)
print(DecToTre(hely))

	Sum	Test	Verdict		Time	Memory
base	70/70
		1	Accepted	0/0	17ms	3124 KiB
		2	Accepted	0/0	17ms	3120 KiB
		3	Accepted	2/2	16ms	3320 KiB
		4	Accepted	3/3	16ms	3312 KiB
		5	Accepted	3/3	16ms	3172 KiB
		6	Accepted	3/3	17ms	3112 KiB
		7	Accepted	3/3	16ms	3320 KiB
		8	Accepted	3/3	17ms	3124 KiB
		9	Accepted	3/3	16ms	3124 KiB
		10	Accepted	3/3	16ms	3316 KiB
		11	Accepted	3/3	16ms	3320 KiB
		12	Accepted	3/3	17ms	3120 KiB
		13	Accepted	3/3	16ms	2952 KiB
		14	Accepted	3/3	16ms	3016 KiB
		15	Accepted	4/4	17ms	2924 KiB
		16	Accepted	4/4	14ms	2948 KiB
		17	Accepted	4/4	16ms	3132 KiB
		18	Accepted	4/4	17ms	3096 KiB
		19	Accepted	4/4	16ms	3152 KiB
		20	Accepted	4/4	16ms	3076 KiB
		21	Accepted	4/4	16ms	3148 KiB
		22	Accepted	4/4	16ms	3140 KiB
		23	Accepted	3/3	16ms	3152 KiB