191672025-11-27 17:15:53birozsKedves számokpypy3Wrong answer 16/5046ms19652 KiB
N = input()
def kedves(N):
    if N[0] > "3":
        x = 2 ** (len(N))
    elif N[0] < "3":
        x = 2 ** (len(N)-1)
    else:
        j = 1
        while j < len(N) and N[j] == "0":
            j += 1
        x = 2 ** (len(N)-1)
        z = 1
        for i in range(j,len(N)):
            if N[i] > "3":
                z = z * (2 ** (len(N) - i))
                break
            elif N[i] in ["1","2"]:
                z = z * (2 ** (len(N) - i - 1))
                break
            elif N[i] == "3":
                z = z * 2
            elif N[i] == "0":
                z += z-1
        x = x + z
    return(x)

print(kedves(N))
SubtaskSumTestVerdictTimeMemory
subtask10/0
1Accepted43ms19632 KiB
2Accepted39ms19432 KiB
subtask24/4
3Accepted41ms19376 KiB
4Accepted41ms19364 KiB
5Accepted45ms19560 KiB
6Accepted43ms19576 KiB
7Accepted46ms19548 KiB
subtask312/12
8Accepted41ms19376 KiB
9Accepted41ms19364 KiB
10Accepted45ms19560 KiB
11Accepted43ms19576 KiB
12Accepted46ms19548 KiB
13Accepted39ms19408 KiB
14Accepted43ms19408 KiB
15Accepted43ms19576 KiB
16Accepted39ms19408 KiB
17Accepted39ms19420 KiB
18Accepted45ms19360 KiB
19Accepted43ms19432 KiB
20Accepted37ms19428 KiB
21Accepted39ms19508 KiB
subtask40/10
22Accepted39ms19432 KiB
23Accepted43ms19524 KiB
24Accepted37ms19388 KiB
25Accepted43ms19576 KiB
26Accepted45ms19428 KiB
27Accepted39ms19424 KiB
28Accepted45ms19492 KiB
29Accepted37ms19436 KiB
30Accepted39ms19428 KiB
31Accepted39ms19436 KiB
32Accepted43ms19472 KiB
33Wrong answer43ms19416 KiB
34Accepted39ms19516 KiB
subtask50/10
35Accepted39ms19432 KiB
36Accepted43ms19524 KiB
37Accepted37ms19388 KiB
38Accepted43ms19576 KiB
39Accepted45ms19428 KiB
40Accepted39ms19424 KiB
41Accepted45ms19492 KiB
42Accepted37ms19436 KiB
43Accepted39ms19428 KiB
44Accepted39ms19436 KiB
45Accepted43ms19472 KiB
46Wrong answer43ms19416 KiB
47Accepted39ms19516 KiB
48Accepted39ms19436 KiB
49Accepted43ms19388 KiB
50Accepted39ms19440 KiB
51Accepted43ms19580 KiB
52Accepted39ms19420 KiB
53Accepted43ms19440 KiB
54Accepted43ms19576 KiB
55Accepted39ms19580 KiB
56Accepted39ms19428 KiB
57Accepted45ms19432 KiB
58Wrong answer43ms19572 KiB
59Accepted39ms19408 KiB
60Wrong answer39ms19436 KiB
61Wrong answer45ms19428 KiB
62Accepted45ms19440 KiB
63Accepted39ms19520 KiB
64Accepted39ms19436 KiB
65Accepted43ms19436 KiB
subtask60/14
66Accepted39ms19464 KiB
67Accepted39ms19652 KiB
68Accepted41ms19376 KiB
69Accepted41ms19364 KiB
70Accepted45ms19560 KiB
71Accepted43ms19576 KiB
72Accepted46ms19548 KiB
73Accepted39ms19408 KiB
74Accepted43ms19408 KiB
75Accepted43ms19576 KiB
76Accepted39ms19408 KiB
77Accepted39ms19420 KiB
78Accepted45ms19360 KiB
79Accepted43ms19432 KiB
80Accepted37ms19428 KiB
81Accepted39ms19508 KiB
82Accepted39ms19432 KiB
83Accepted43ms19524 KiB
84Accepted37ms19388 KiB
85Accepted43ms19576 KiB
86Accepted45ms19428 KiB
87Accepted39ms19424 KiB
88Accepted45ms19492 KiB
89Accepted37ms19436 KiB
90Accepted39ms19428 KiB
91Accepted39ms19436 KiB
92Accepted43ms19472 KiB
93Wrong answer43ms19416 KiB
94Accepted39ms19516 KiB
95Accepted39ms19436 KiB
96Accepted43ms19388 KiB
97Accepted39ms19440 KiB
98Accepted43ms19580 KiB
99Accepted39ms19420 KiB
100Accepted43ms19440 KiB
101Accepted43ms19576 KiB
102Accepted39ms19580 KiB
103Accepted39ms19428 KiB
104Accepted45ms19432 KiB
105Wrong answer43ms19572 KiB
106Accepted39ms19408 KiB
107Wrong answer39ms19436 KiB
108Wrong answer45ms19428 KiB
109Accepted45ms19440 KiB
110Accepted39ms19520 KiB
111Accepted39ms19436 KiB
112Accepted43ms19436 KiB
113Accepted39ms19372 KiB
114Accepted43ms19432 KiB
115Accepted43ms19432 KiB
116Accepted46ms19472 KiB
117Accepted43ms19576 KiB
118Accepted39ms19428 KiB
119Accepted39ms19432 KiB
120Accepted43ms19376 KiB
121Accepted43ms19588 KiB
122Accepted39ms19580 KiB
123Accepted39ms19392 KiB
124Accepted37ms19496 KiB
125Accepted46ms19388 KiB
126Accepted43ms19488 KiB
127Wrong answer39ms19400 KiB
128Accepted39ms19544 KiB
129Accepted45ms19380 KiB
130Wrong answer43ms19568 KiB
131Accepted39ms19436 KiB