description stringlengths 171 4k | code stringlengths 94 3.98k | normalized_code stringlengths 57 4.99k |
|---|---|---|
Little Dima misbehaved during a math lesson a lot and the nasty teacher Mr. Pickles gave him the following problem as a punishment.
Find all integer solutions x (0 < x < 10^9) of the equation:x = b·s(x)^{a} + c,
where a, b, c are some predetermined constant values and function s(x) determines the sum of all digits... | a, b, c = map(int, input().split())
MAXNUM = 10**9 + 1
ans = ""
ansCount = 0
def s(x):
result = 0
while x > 0:
result += x % 10
x = x // 10
return result
for i in range(1, 82):
num = b * i**a + c
if num > 0 and num < MAXNUM and s(num) == i:
ans = ans + str(num) + " "
... | ASSIGN VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR BIN_OP BIN_OP NUMBER NUMBER NUMBER ASSIGN VAR STRING ASSIGN VAR NUMBER FUNC_DEF ASSIGN VAR NUMBER WHILE VAR NUMBER VAR BIN_OP VAR NUMBER ASSIGN VAR BIN_OP VAR NUMBER RETURN VAR FOR VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR BIN_OP BIN_OP VAR BIN_OP... |
Little Dima misbehaved during a math lesson a lot and the nasty teacher Mr. Pickles gave him the following problem as a punishment.
Find all integer solutions x (0 < x < 10^9) of the equation:x = b·s(x)^{a} + c,
where a, b, c are some predetermined constant values and function s(x) determines the sum of all digits... | def sumdig(n):
if n < 0:
return pow(10, 18)
else:
a = 0
for x in str(n):
a += int(x)
return a
a, b, c = map(int, input().split(" "))
sums = []
for sx in range(1, 81):
if sumdig(b * sx**a + c) == sx:
sums.append(sx)
total = 0
string = ""
for element in su... | FUNC_DEF IF VAR NUMBER RETURN FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR NUMBER FOR VAR FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR RETURN VAR ASSIGN VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR STRING ASSIGN VAR LIST FOR VAR FUNC_CALL VAR NUMBER NUMBER IF FUNC_CALL VAR BIN_OP BIN_OP VAR BIN_OP VAR VAR VAR VAR EXPR FU... |
Little Dima misbehaved during a math lesson a lot and the nasty teacher Mr. Pickles gave him the following problem as a punishment.
Find all integer solutions x (0 < x < 10^9) of the equation:x = b·s(x)^{a} + c,
where a, b, c are some predetermined constant values and function s(x) determines the sum of all digits... | def Digitsum(x):
tot = 0
if x <= 0:
return 1
while x:
tot += x % 10
x //= 10
return tot
a, b, c = list(map(int, input().split()))
ans = []
for i in range(0, 82):
x = b * i**a + c
if 0 < x < 10**9 and i == Digitsum(x):
ans.append(x)
print(len(ans))
print(" ".join... | FUNC_DEF ASSIGN VAR NUMBER IF VAR NUMBER RETURN NUMBER WHILE VAR VAR BIN_OP VAR NUMBER VAR NUMBER RETURN VAR ASSIGN VAR VAR VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR LIST FOR VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR BIN_OP BIN_OP VAR BIN_OP VAR VAR VAR IF NUMBER VAR BIN_OP NUMBER NUMBER V... |
Little Dima misbehaved during a math lesson a lot and the nasty teacher Mr. Pickles gave him the following problem as a punishment.
Find all integer solutions x (0 < x < 10^9) of the equation:x = b·s(x)^{a} + c,
where a, b, c are some predetermined constant values and function s(x) determines the sum of all digits... | import sys
a, b, c = (int(i) for i in input().split(" "))
def calculate(a, b, c, s):
return b * s**a + c
def dig_sum(x):
line = str(x).strip("-")
sum = 0
for i in list(line):
sum += int(i)
return sum
res = []
for i in range(1, 82):
x = calculate(a, b, c, i)
if dig_sum(x) == i:... | IMPORT ASSIGN VAR VAR VAR FUNC_CALL VAR VAR VAR FUNC_CALL FUNC_CALL VAR STRING FUNC_DEF RETURN BIN_OP BIN_OP VAR BIN_OP VAR VAR VAR FUNC_DEF ASSIGN VAR FUNC_CALL FUNC_CALL VAR VAR STRING ASSIGN VAR NUMBER FOR VAR FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR RETURN VAR ASSIGN VAR LIST FOR VAR FUNC_CALL VAR NUMBER NUMBER ASSI... |
Little Dima misbehaved during a math lesson a lot and the nasty teacher Mr. Pickles gave him the following problem as a punishment.
Find all integer solutions x (0 < x < 10^9) of the equation:x = b·s(x)^{a} + c,
where a, b, c are some predetermined constant values and function s(x) determines the sum of all digits... | def sum(n):
s = 0
while n > 0:
r = n % 10
n = n // 10
s += r
return s
a, b, c = map(int, input().split())
f = []
for i in range(1, 81):
x = b * pow(i, a) + c
if x > 1000000000:
break
if sum(x) == i:
f.append(x)
print(len(f))
for i in range(len(f)):
p... | FUNC_DEF ASSIGN VAR NUMBER WHILE VAR NUMBER ASSIGN VAR BIN_OP VAR NUMBER ASSIGN VAR BIN_OP VAR NUMBER VAR VAR RETURN VAR ASSIGN VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR LIST FOR VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR BIN_OP BIN_OP VAR FUNC_CALL VAR VAR VAR VAR IF VAR NUMBER IF FUNC_CALL VAR ... |
Little Dima misbehaved during a math lesson a lot and the nasty teacher Mr. Pickles gave him the following problem as a punishment.
Find all integer solutions x (0 < x < 10^9) of the equation:x = b·s(x)^{a} + c,
where a, b, c are some predetermined constant values and function s(x) determines the sum of all digits... | x = input()
arr = x.split(" ")
a = int(arr[0])
b = int(arr[1])
c = int(arr[2])
ans = set()
for i in range(1, 82):
temp = b * i**a + c
temp1 = 0
temp2 = temp
while temp > 0:
temp1 = temp1 + int(temp % 10)
temp = int(temp / 10)
if temp2 > 0 and temp2 < 1000000000 and temp1 == i:
... | ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR STRING ASSIGN VAR FUNC_CALL VAR VAR NUMBER ASSIGN VAR FUNC_CALL VAR VAR NUMBER ASSIGN VAR FUNC_CALL VAR VAR NUMBER ASSIGN VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR BIN_OP BIN_OP VAR BIN_OP VAR VAR VAR ASSIGN VAR NUMBER ASSIGN VAR VAR WHILE VAR NUM... |
Little Dima misbehaved during a math lesson a lot and the nasty teacher Mr. Pickles gave him the following problem as a punishment.
Find all integer solutions x (0 < x < 10^9) of the equation:x = b·s(x)^{a} + c,
where a, b, c are some predetermined constant values and function s(x) determines the sum of all digits... | import sys
sys.setrecursionlimit(10000)
a, b, c = [int(x) for x in sys.stdin.readline().strip().split()]
count = 0
def sum_digits(d):
s = 0
while d:
s += d % 10
d = d // 10
return s
arr = []
count = 0
for i in range(1, 81):
k = b * i**a + c
if 0 < k < 10**9 and sum_digits(k) == ... | IMPORT EXPR FUNC_CALL VAR NUMBER ASSIGN VAR VAR VAR FUNC_CALL VAR VAR VAR FUNC_CALL FUNC_CALL FUNC_CALL VAR ASSIGN VAR NUMBER FUNC_DEF ASSIGN VAR NUMBER WHILE VAR VAR BIN_OP VAR NUMBER ASSIGN VAR BIN_OP VAR NUMBER RETURN VAR ASSIGN VAR LIST ASSIGN VAR NUMBER FOR VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR BIN_OP BIN_OP ... |
Little Dima misbehaved during a math lesson a lot and the nasty teacher Mr. Pickles gave him the following problem as a punishment.
Find all integer solutions x (0 < x < 10^9) of the equation:x = b·s(x)^{a} + c,
where a, b, c are some predetermined constant values and function s(x) determines the sum of all digits... | def sx(number):
res = 0
if number[0] == "-":
return 0
for i in range(len(number)):
res += int(number[i])
return res
input_str = input()
a, b, c = (
int(input_str.split()[0]),
int(input_str.split()[1]),
int(input_str.split()[2]),
)
results = []
for s in range(1, 81):
res... | FUNC_DEF ASSIGN VAR NUMBER IF VAR NUMBER STRING RETURN NUMBER FOR VAR FUNC_CALL VAR FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR VAR RETURN VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR VAR VAR FUNC_CALL VAR FUNC_CALL VAR NUMBER FUNC_CALL VAR FUNC_CALL VAR NUMBER FUNC_CALL VAR FUNC_CALL VAR NUMBER ASSIGN VAR LIST FOR VAR FUNC_CAL... |
Little Dima misbehaved during a math lesson a lot and the nasty teacher Mr. Pickles gave him the following problem as a punishment.
Find all integer solutions x (0 < x < 10^9) of the equation:x = b·s(x)^{a} + c,
where a, b, c are some predetermined constant values and function s(x) determines the sum of all digits... | a, b, c = map(int, input().split())
def s(x):
xStr = str(x)
sum = 0
for c in xStr:
sum += int(c)
return sum
rightSide = []
M = 9 * 9 + 1
for k in range(1, M):
rightSide.append(b * k**a + c)
myList = []
sol = 0
for x in rightSide:
if x > 0 and x < int(1000000000.0) and x == b * s(x) *... | ASSIGN VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR FUNC_DEF ASSIGN VAR FUNC_CALL VAR VAR ASSIGN VAR NUMBER FOR VAR VAR VAR FUNC_CALL VAR VAR RETURN VAR ASSIGN VAR LIST ASSIGN VAR BIN_OP BIN_OP NUMBER NUMBER NUMBER FOR VAR FUNC_CALL VAR NUMBER VAR EXPR FUNC_CALL VAR BIN_OP BIN_OP VAR BIN_OP VAR VAR VAR ASSIGN ... |
Little Dima misbehaved during a math lesson a lot and the nasty teacher Mr. Pickles gave him the following problem as a punishment.
Find all integer solutions x (0 < x < 10^9) of the equation:x = b·s(x)^{a} + c,
where a, b, c are some predetermined constant values and function s(x) determines the sum of all digits... | a, b, c = list(map(int, input().split()))
ans = []
def sum2(n):
return sum([int(x) for x in str(n)])
for s in range(1, 82):
x = b * s**a + c
if x > 0 and sum2(x) == s and x < 10**9:
ans.append(x)
print(len(ans))
print(" ".join(map(str, ans))) | ASSIGN VAR VAR VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR LIST FUNC_DEF RETURN FUNC_CALL VAR FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR FOR VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR BIN_OP BIN_OP VAR BIN_OP VAR VAR VAR IF VAR NUMBER FUNC_CALL VAR VAR VAR VAR BIN_OP NUMBER NUMBER EXPR FUNC_CALL... |
Little Dima misbehaved during a math lesson a lot and the nasty teacher Mr. Pickles gave him the following problem as a punishment.
Find all integer solutions x (0 < x < 10^9) of the equation:x = b·s(x)^{a} + c,
where a, b, c are some predetermined constant values and function s(x) determines the sum of all digits... | from sys import stdin
def bin_pow(a, n):
if n == 0:
return 1
if n % 2:
return a * bin_pow(a * a, (n - 1) // 2)
else:
return bin_pow(a * a, n // 2)
INF = 10**9
def main():
line = stdin.readline
a, b, c = map(int, line().split())
answers = []
for s in range(81):
... | FUNC_DEF IF VAR NUMBER RETURN NUMBER IF BIN_OP VAR NUMBER RETURN BIN_OP VAR FUNC_CALL VAR BIN_OP VAR VAR BIN_OP BIN_OP VAR NUMBER NUMBER RETURN FUNC_CALL VAR BIN_OP VAR VAR BIN_OP VAR NUMBER ASSIGN VAR BIN_OP NUMBER NUMBER FUNC_DEF ASSIGN VAR VAR ASSIGN VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR L... |
Little Dima misbehaved during a math lesson a lot and the nasty teacher Mr. Pickles gave him the following problem as a punishment.
Find all integer solutions x (0 < x < 10^9) of the equation:x = b·s(x)^{a} + c,
where a, b, c are some predetermined constant values and function s(x) determines the sum of all digits... | load = [int(i) for i in input().split()]
def digit_sum(x):
res = 0
while x > 0:
res += x % 10
x //= 10
return res
a = load[0]
b = load[1]
c = load[2]
sol = []
for i in range(1, 90):
tmp = b * i**a + c
if i == digit_sum(tmp) and tmp < 10**9:
sol.append(tmp)
print(len(sol))... | ASSIGN VAR FUNC_CALL VAR VAR VAR FUNC_CALL FUNC_CALL VAR FUNC_DEF ASSIGN VAR NUMBER WHILE VAR NUMBER VAR BIN_OP VAR NUMBER VAR NUMBER RETURN VAR ASSIGN VAR VAR NUMBER ASSIGN VAR VAR NUMBER ASSIGN VAR VAR NUMBER ASSIGN VAR LIST FOR VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR BIN_OP BIN_OP VAR BIN_OP VAR VAR VAR IF VAR FU... |
Little Dima misbehaved during a math lesson a lot and the nasty teacher Mr. Pickles gave him the following problem as a punishment.
Find all integer solutions x (0 < x < 10^9) of the equation:x = b·s(x)^{a} + c,
where a, b, c are some predetermined constant values and function s(x) determines the sum of all digits... | def sum_digits3(n):
r = 0
while n:
r, n = r + n % 10, n // 10
return r
a, b, c = input().split(" ")
a = int(a)
b = int(b)
c = int(c)
la = []
for i in range(82, 0, -1):
k = b * i**a + c
if k < 0:
break
if sum_digits3(k) == i and k < 10**9:
la.append(k)
print(len(la))
la ... | FUNC_DEF ASSIGN VAR NUMBER WHILE VAR ASSIGN VAR VAR BIN_OP VAR BIN_OP VAR NUMBER BIN_OP VAR NUMBER RETURN VAR ASSIGN VAR VAR VAR FUNC_CALL FUNC_CALL VAR STRING ASSIGN VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR VAR ASSIGN VAR LIST FOR VAR FUNC_CALL VAR NUMBER NUMBER NUMBER ASSIGN VAR BIN... |
Little Dima misbehaved during a math lesson a lot and the nasty teacher Mr. Pickles gave him the following problem as a punishment.
Find all integer solutions x (0 < x < 10^9) of the equation:x = b·s(x)^{a} + c,
where a, b, c are some predetermined constant values and function s(x) determines the sum of all digits... | a, b, c = map(int, input().split())
ans = []
for i in range(1, 91, 1):
x = b * pow(i, a) + c
if x > 999999999:
break
if x > 0:
var = x
fval = 0
while var > 0:
fval += var % 10
var //= 10
if fval == i:
ans.append(x)
print("{}".format... | ASSIGN VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR LIST FOR VAR FUNC_CALL VAR NUMBER NUMBER NUMBER ASSIGN VAR BIN_OP BIN_OP VAR FUNC_CALL VAR VAR VAR VAR IF VAR NUMBER IF VAR NUMBER ASSIGN VAR VAR ASSIGN VAR NUMBER WHILE VAR NUMBER VAR BIN_OP VAR NUMBER VAR NUMBER IF VAR VAR EXPR FUNC_CALL VAR VAR ... |
Little Dima misbehaved during a math lesson a lot and the nasty teacher Mr. Pickles gave him the following problem as a punishment.
Find all integer solutions x (0 < x < 10^9) of the equation:x = b·s(x)^{a} + c,
where a, b, c are some predetermined constant values and function s(x) determines the sum of all digits... | def s(x):
if x < 0:
return -100000
if x == 0:
return 0
else:
return x % 10 + s(x // 10)
a, b, c = map(int, input().split())
r = []
for i in range(1, 82):
if s(b * i**a + c) == i and b * i**a + c < 1000000000:
r += [b * i**a + c]
print(len(r))
print(" ".join(map(str, r))... | FUNC_DEF IF VAR NUMBER RETURN NUMBER IF VAR NUMBER RETURN NUMBER RETURN BIN_OP BIN_OP VAR NUMBER FUNC_CALL VAR BIN_OP VAR NUMBER ASSIGN VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR LIST FOR VAR FUNC_CALL VAR NUMBER NUMBER IF FUNC_CALL VAR BIN_OP BIN_OP VAR BIN_OP VAR VAR VAR VAR BIN_OP BIN_OP VAR BI... |
Little Dima misbehaved during a math lesson a lot and the nasty teacher Mr. Pickles gave him the following problem as a punishment.
Find all integer solutions x (0 < x < 10^9) of the equation:x = b·s(x)^{a} + c,
where a, b, c are some predetermined constant values and function s(x) determines the sum of all digits... | def bnp(bs, pw):
res = 1
while pw:
if pw & 1:
res *= bs
res %= int(1000000000.0 + 7)
bs *= bs
bs %= int(1000000000.0 + 7)
pw //= 2
return res % int(1000000000.0 + 7)
a, b, c = map(int, input().split())
res = []
for n in range(1, 82):
u = b * bnp(... | FUNC_DEF ASSIGN VAR NUMBER WHILE VAR IF BIN_OP VAR NUMBER VAR VAR VAR FUNC_CALL VAR BIN_OP NUMBER NUMBER VAR VAR VAR FUNC_CALL VAR BIN_OP NUMBER NUMBER VAR NUMBER RETURN BIN_OP VAR FUNC_CALL VAR BIN_OP NUMBER NUMBER ASSIGN VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR LIST FOR VAR FUNC_CALL VAR NUMBE... |
Little Dima misbehaved during a math lesson a lot and the nasty teacher Mr. Pickles gave him the following problem as a punishment.
Find all integer solutions x (0 < x < 10^9) of the equation:x = b·s(x)^{a} + c,
where a, b, c are some predetermined constant values and function s(x) determines the sum of all digits... | def find_digit_sum(x):
s = 0
while x > 0:
s += x % 10
x //= 10
return s
def exponent_mod(n, p, prime_const=1000000000 + 7):
res = 1
if n == 0:
return 0
while p > 0:
if p % 2 == 1:
res = res * n % prime_const
p //= 2
n = n * n % prime_... | FUNC_DEF ASSIGN VAR NUMBER WHILE VAR NUMBER VAR BIN_OP VAR NUMBER VAR NUMBER RETURN VAR FUNC_DEF BIN_OP NUMBER NUMBER ASSIGN VAR NUMBER IF VAR NUMBER RETURN NUMBER WHILE VAR NUMBER IF BIN_OP VAR NUMBER NUMBER ASSIGN VAR BIN_OP BIN_OP VAR VAR VAR VAR NUMBER ASSIGN VAR BIN_OP BIN_OP VAR VAR VAR RETURN VAR FUNC_DEF ASSIGN... |
Little Dima misbehaved during a math lesson a lot and the nasty teacher Mr. Pickles gave him the following problem as a punishment.
Find all integer solutions x (0 < x < 10^9) of the equation:x = b·s(x)^{a} + c,
where a, b, c are some predetermined constant values and function s(x) determines the sum of all digits... | [a, b, c] = [int(x) for x in input().split()]
ans = []
for i in range(1, 82):
x = b * i**a + c
if x >= 1000000000:
continue
sum = 0
while x > 0:
sum += x % 10
x //= 10
if sum == i:
ans.append(b * i**a + c)
ans.sort()
print(len(ans))
print(*ans) | ASSIGN LIST VAR VAR VAR FUNC_CALL VAR VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR LIST FOR VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR BIN_OP BIN_OP VAR BIN_OP VAR VAR VAR IF VAR NUMBER ASSIGN VAR NUMBER WHILE VAR NUMBER VAR BIN_OP VAR NUMBER VAR NUMBER IF VAR VAR EXPR FUNC_CALL VAR BIN_OP BIN_OP VAR BIN_OP VAR VAR VAR E... |
Little Dima misbehaved during a math lesson a lot and the nasty teacher Mr. Pickles gave him the following problem as a punishment.
Find all integer solutions x (0 < x < 10^9) of the equation:x = b·s(x)^{a} + c,
where a, b, c are some predetermined constant values and function s(x) determines the sum of all digits... | a, b, c = map(int, input().split())
ans = set()
for s in range(82):
x = s**a * b + c
if 0 < x < 10**9 and sum(int(i) for i in list(str(x))) == s:
ans.add(x)
s += 1
print(len(ans), *ans) | ASSIGN VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR NUMBER ASSIGN VAR BIN_OP BIN_OP BIN_OP VAR VAR VAR VAR IF NUMBER VAR BIN_OP NUMBER NUMBER FUNC_CALL VAR FUNC_CALL VAR VAR VAR FUNC_CALL VAR FUNC_CALL VAR VAR VAR EXPR FUNC_CALL VAR VAR VAR NUMBER EXPR FUNC_CALL V... |
Little Dima misbehaved during a math lesson a lot and the nasty teacher Mr. Pickles gave him the following problem as a punishment.
Find all integer solutions x (0 < x < 10^9) of the equation:x = b·s(x)^{a} + c,
where a, b, c are some predetermined constant values and function s(x) determines the sum of all digits... | a, b, c = map(int, input().split())
ans = []
c0 = 0
for i in range(1, 83):
val = b * pow(i, a) + c
st = str(val)
if val < 0 or val >= 1000000000:
continue
c1 = 0
for j in st:
c1 += int(j)
if c1 == i:
ans.append(val)
c0 += 1
print(c0)
print(*ans) | ASSIGN VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR LIST ASSIGN VAR NUMBER FOR VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR BIN_OP BIN_OP VAR FUNC_CALL VAR VAR VAR VAR ASSIGN VAR FUNC_CALL VAR VAR IF VAR NUMBER VAR NUMBER ASSIGN VAR NUMBER FOR VAR VAR VAR FUNC_CALL VAR VAR IF VAR VAR EXPR FUNC_CALL VA... |
Little Dima misbehaved during a math lesson a lot and the nasty teacher Mr. Pickles gave him the following problem as a punishment.
Find all integer solutions x (0 < x < 10^9) of the equation:x = b·s(x)^{a} + c,
where a, b, c are some predetermined constant values and function s(x) determines the sum of all digits... | a, b, c = input().split()
a, b, c = int(a), int(b), int(c)
def S(x):
if x < 0:
return 0
else:
x = str(x)
s = 0
for char in x:
s += int(char)
return s
cnt = 0
lis = []
for x in range(1, 82):
y = b * x**a + c
if S(y) == x and y < 10**9:
lis.a... | ASSIGN VAR VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL VAR VAR FUNC_CALL VAR VAR FUNC_DEF IF VAR NUMBER RETURN NUMBER ASSIGN VAR FUNC_CALL VAR VAR ASSIGN VAR NUMBER FOR VAR VAR VAR FUNC_CALL VAR VAR RETURN VAR ASSIGN VAR NUMBER ASSIGN VAR LIST FOR VAR FUNC_CALL VAR NUMBER NUMBER ASSIG... |
Little Dima misbehaved during a math lesson a lot and the nasty teacher Mr. Pickles gave him the following problem as a punishment.
Find all integer solutions x (0 < x < 10^9) of the equation:x = b·s(x)^{a} + c,
where a, b, c are some predetermined constant values and function s(x) determines the sum of all digits... | def su(n):
s = 0
while n:
s += n % 10
n //= 10
return s
a, b, c = map(int, input().split())
l = []
for i in range(1, 82):
t = b * i**a + c
if t > 0 and su(t) == i and t < 10**9:
l += [t]
l = set(l)
l = list(l)
t = max(len(l), 0)
print(t)
if t == 0:
exit()
l.sort()
for i... | FUNC_DEF ASSIGN VAR NUMBER WHILE VAR VAR BIN_OP VAR NUMBER VAR NUMBER RETURN VAR ASSIGN VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR LIST FOR VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR BIN_OP BIN_OP VAR BIN_OP VAR VAR VAR IF VAR NUMBER FUNC_CALL VAR VAR VAR VAR BIN_OP NUMBER NUMBER VAR LIST VAR ASSI... |
Little Dima misbehaved during a math lesson a lot and the nasty teacher Mr. Pickles gave him the following problem as a punishment.
Find all integer solutions x (0 < x < 10^9) of the equation:x = b·s(x)^{a} + c,
where a, b, c are some predetermined constant values and function s(x) determines the sum of all digits... | a, b, c = map(int, input().split())
ans = []
for i in range(1, 82):
x = b * pow(i, a) + c
cnt = 0
for j in str(x):
try:
cnt += int(j)
except:
break
if cnt == i and x <= 10**9:
ans.append(x)
print(len(ans))
print(*ans) | ASSIGN VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR LIST FOR VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR BIN_OP BIN_OP VAR FUNC_CALL VAR VAR VAR VAR ASSIGN VAR NUMBER FOR VAR FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR IF VAR VAR VAR BIN_OP NUMBER NUMBER EXPR FUNC_CALL VAR VAR EXPR FUNC_CALL VAR FUNC_CAL... |
Little Dima misbehaved during a math lesson a lot and the nasty teacher Mr. Pickles gave him the following problem as a punishment.
Find all integer solutions x (0 < x < 10^9) of the equation:x = b·s(x)^{a} + c,
where a, b, c are some predetermined constant values and function s(x) determines the sum of all digits... | def sumDigit(n):
ans = 0
if n <= 0:
return ans
while n:
ans += n % 10
n //= 10
return ans
a, b, c = map(int, input().split())
ans = []
can = 82
for i in range(1, 82):
temp = b * int(pow(i, a)) + c
if sumDigit(temp) == i and temp > 0 and temp < int(1000000000.0):
... | FUNC_DEF ASSIGN VAR NUMBER IF VAR NUMBER RETURN VAR WHILE VAR VAR BIN_OP VAR NUMBER VAR NUMBER RETURN VAR ASSIGN VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR LIST ASSIGN VAR NUMBER FOR VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR BIN_OP BIN_OP VAR FUNC_CALL VAR FUNC_CALL VAR VAR VAR VAR IF FUNC_CALL V... |
Little Dima misbehaved during a math lesson a lot and the nasty teacher Mr. Pickles gave him the following problem as a punishment.
Find all integer solutions x (0 < x < 10^9) of the equation:x = b·s(x)^{a} + c,
where a, b, c are some predetermined constant values and function s(x) determines the sum of all digits... | def s(x):
if x < 0:
return 0
a = str(x)
res = 0
for item in a:
res += int(item)
return res
a, b, c = map(int, input().split())
ans = []
for i in range(1, 100):
x = b * i**a + c
if x >= 10**9 or x <= 0:
continue
if s(x) == i:
ans.append(x)
ans.sort()
prin... | FUNC_DEF IF VAR NUMBER RETURN NUMBER ASSIGN VAR FUNC_CALL VAR VAR ASSIGN VAR NUMBER FOR VAR VAR VAR FUNC_CALL VAR VAR RETURN VAR ASSIGN VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR LIST FOR VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR BIN_OP BIN_OP VAR BIN_OP VAR VAR VAR IF VAR BIN_OP NUMBER NUMBER VA... |
Little Dima misbehaved during a math lesson a lot and the nasty teacher Mr. Pickles gave him the following problem as a punishment.
Find all integer solutions x (0 < x < 10^9) of the equation:x = b·s(x)^{a} + c,
where a, b, c are some predetermined constant values and function s(x) determines the sum of all digits... | a, b, c = list(map(int, input().split()))
sx = 1
resitve = []
def s(x):
return sum(map(int, list(str(x))))
while sx <= 81:
rez = sx**a * b + c
if rez > 10**9:
break
if rez > 0 and rez < 10**9 and s(rez) == sx:
resitve.append(rez)
sx += 1
print(len(resitve))
if len(resitve) > 0:
... | ASSIGN VAR VAR VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR NUMBER ASSIGN VAR LIST FUNC_DEF RETURN FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL VAR FUNC_CALL VAR VAR WHILE VAR NUMBER ASSIGN VAR BIN_OP BIN_OP BIN_OP VAR VAR VAR VAR IF VAR BIN_OP NUMBER NUMBER IF VAR NUMBER VAR BIN_OP NUMBER NUMBER... |
Little Dima misbehaved during a math lesson a lot and the nasty teacher Mr. Pickles gave him the following problem as a punishment.
Find all integer solutions x (0 < x < 10^9) of the equation:x = b·s(x)^{a} + c,
where a, b, c are some predetermined constant values and function s(x) determines the sum of all digits... | def s(x):
return sum([int(d) for d in str(x)])
a, b, c = map(int, input().split())
solutions = []
if a == 1:
for x in range(1, 550001):
if x == b * s(x) ** a + c:
solutions.append(x)
else:
power = 1
while b * power**a + c < 10**9:
x = b * power**a + c
if x > 0 and p... | FUNC_DEF RETURN FUNC_CALL VAR FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR ASSIGN VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR LIST IF VAR NUMBER FOR VAR FUNC_CALL VAR NUMBER NUMBER IF VAR BIN_OP BIN_OP VAR BIN_OP FUNC_CALL VAR VAR VAR VAR EXPR FUNC_CALL VAR VAR ASSIGN VAR NUMBER WHILE BIN_OP BIN_OP VAR ... |
Little Dima misbehaved during a math lesson a lot and the nasty teacher Mr. Pickles gave him the following problem as a punishment.
Find all integer solutions x (0 < x < 10^9) of the equation:x = b·s(x)^{a} + c,
where a, b, c are some predetermined constant values and function s(x) determines the sum of all digits... | ID = input().split()
a = int(ID[0])
b = int(ID[1])
c = int(ID[2])
ans = []
for i in range(1, 82, 1):
x = b * i**a + c
if x > 0 and x < 1000000000:
y = x
z = 0
while y > 0:
z += y % 10
y //= 10
if z == i:
ans.append(x)
print(len(ans))
for x in a... | ASSIGN VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR VAR NUMBER ASSIGN VAR FUNC_CALL VAR VAR NUMBER ASSIGN VAR FUNC_CALL VAR VAR NUMBER ASSIGN VAR LIST FOR VAR FUNC_CALL VAR NUMBER NUMBER NUMBER ASSIGN VAR BIN_OP BIN_OP VAR BIN_OP VAR VAR VAR IF VAR NUMBER VAR NUMBER ASSIGN VAR VAR ASSIGN VAR NUMBER WHILE VAR NU... |
Little Dima misbehaved during a math lesson a lot and the nasty teacher Mr. Pickles gave him the following problem as a punishment.
Find all integer solutions x (0 < x < 10^9) of the equation:x = b·s(x)^{a} + c,
where a, b, c are some predetermined constant values and function s(x) determines the sum of all digits... | ans = []
def SUM(x):
ans = 0
while x > 0:
ans += x % 10
x //= 10
return ans
a, b, c = map(int, input().split())
for i in range(1, 82):
x = b * pow(i, a) + c
if x >= 1000000000:
break
elif SUM(x) == i:
ans.append(str(x))
print(len(ans))
print(" ".join(ans)) | ASSIGN VAR LIST FUNC_DEF ASSIGN VAR NUMBER WHILE VAR NUMBER VAR BIN_OP VAR NUMBER VAR NUMBER RETURN VAR ASSIGN VAR VAR VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR FOR VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR BIN_OP BIN_OP VAR FUNC_CALL VAR VAR VAR VAR IF VAR NUMBER IF FUNC_CALL VAR VAR VAR EXPR FUNC_CALL VAR FUNC_C... |
Little Dima misbehaved during a math lesson a lot and the nasty teacher Mr. Pickles gave him the following problem as a punishment.
Find all integer solutions x (0 < x < 10^9) of the equation:x = b·s(x)^{a} + c,
where a, b, c are some predetermined constant values and function s(x) determines the sum of all digits... | a, b, c = list(map(int, input().split()))
limit = 10**9
def sum_num(tmp):
ret = 0
while tmp > 0:
ret += tmp % 10
tmp //= 10
return ret
p = []
for i in range(1, 82):
tmp = b * i**a + c
if sum_num(tmp) == i and tmp <= limit:
p.append(tmp)
print(len(p))
for i in p:
print... | ASSIGN VAR VAR VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR BIN_OP NUMBER NUMBER FUNC_DEF ASSIGN VAR NUMBER WHILE VAR NUMBER VAR BIN_OP VAR NUMBER VAR NUMBER RETURN VAR ASSIGN VAR LIST FOR VAR FUNC_CALL VAR NUMBER NUMBER ASSIGN VAR BIN_OP BIN_OP VAR BIN_OP VAR VAR VAR IF FUNC_CALL VAR VAR VAR ... |
Little Dima misbehaved during a math lesson a lot and the nasty teacher Mr. Pickles gave him the following problem as a punishment.
Find all integer solutions x (0 < x < 10^9) of the equation:x = b·s(x)^{a} + c,
where a, b, c are some predetermined constant values and function s(x) determines the sum of all digits... | def getsum(num):
sum = 0
while num > 0:
rem = num % 10
sum += rem
num = int(num / 10)
return sum
arr = list(map(int, input().split()))
a = arr[0]
b = arr[1]
c = arr[2]
ans = []
for i in range(100):
x = b * i**a + c
if x <= 0 or x >= 1000000000:
continue
sm = get... | FUNC_DEF ASSIGN VAR NUMBER WHILE VAR NUMBER ASSIGN VAR BIN_OP VAR NUMBER VAR VAR ASSIGN VAR FUNC_CALL VAR BIN_OP VAR NUMBER RETURN VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR VAR NUMBER ASSIGN VAR VAR NUMBER ASSIGN VAR VAR NUMBER ASSIGN VAR LIST FOR VAR FUNC_CALL VAR NUMBER ASSIGN ... |
Little Dima misbehaved during a math lesson a lot and the nasty teacher Mr. Pickles gave him the following problem as a punishment.
Find all integer solutions x (0 < x < 10^9) of the equation:x = b·s(x)^{a} + c,
where a, b, c are some predetermined constant values and function s(x) determines the sum of all digits... | a, b, c = [int(x) for x in input().split()]
roots = []
for i in range(1, 81 + 1):
x = b * i**a + c
if x > 0:
if x < 1000000000:
t = x // 10
s = x % 10
while t > 0:
s += t % 10
t //= 10
if s == i:
roots.append... | ASSIGN VAR VAR VAR FUNC_CALL VAR VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR LIST FOR VAR FUNC_CALL VAR NUMBER BIN_OP NUMBER NUMBER ASSIGN VAR BIN_OP BIN_OP VAR BIN_OP VAR VAR VAR IF VAR NUMBER IF VAR NUMBER ASSIGN VAR BIN_OP VAR NUMBER ASSIGN VAR BIN_OP VAR NUMBER WHILE VAR NUMBER VAR BIN_OP VAR NUMBER VAR NUMBER IF VA... |
Little Dima misbehaved during a math lesson a lot and the nasty teacher Mr. Pickles gave him the following problem as a punishment.
Find all integer solutions x (0 < x < 10^9) of the equation:x = b·s(x)^{a} + c,
where a, b, c are some predetermined constant values and function s(x) determines the sum of all digits... | def s(x):
tmp = x
ans = 0
while tmp > 0:
ans += tmp % 10
tmp //= 10
return ans
def main(a, b, c):
ans = []
for i in range(82):
x = b * i**a + c
if 0 < x < 10**9 and s(x) == i:
ans.append(x)
print(len(ans))
for i in ans:
print(i, end="... | FUNC_DEF ASSIGN VAR VAR ASSIGN VAR NUMBER WHILE VAR NUMBER VAR BIN_OP VAR NUMBER VAR NUMBER RETURN VAR FUNC_DEF ASSIGN VAR LIST FOR VAR FUNC_CALL VAR NUMBER ASSIGN VAR BIN_OP BIN_OP VAR BIN_OP VAR VAR VAR IF NUMBER VAR BIN_OP NUMBER NUMBER FUNC_CALL VAR VAR VAR EXPR FUNC_CALL VAR VAR EXPR FUNC_CALL VAR FUNC_CALL VAR VA... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | from sys import stdin
input = lambda: stdin.readline().strip()
ipnut = input
for i in range(int(input())):
n = int(input())
a = list(map(int, input().split()))
def isp(i):
if i == 0 or i == n - 1:
return False
if a[i - 1] < a[i] and a[i + 1] < a[i]:
return True
... | ASSIGN VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR VAR FOR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR FUNC_DEF IF VAR NUMBER VAR BIN_OP VAR NUMBER RETURN NUMBER IF VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER ... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | def read_int():
return int(input())
def read_ints():
return map(int, input().split(" "))
t = read_int()
for case_num in range(t):
n = read_int()
a = list(read_ints())
def is_hill(i):
return a[i] > max(a[i - 1], a[i + 1])
def is_valley(i):
return a[i] < min(a[i - 1], a[i + 1... | FUNC_DEF RETURN FUNC_CALL VAR FUNC_CALL VAR FUNC_DEF RETURN FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR STRING ASSIGN VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_DEF RETURN VAR VAR FUNC_CALL VAR VAR BIN_OP VAR NUMBER VAR BIN_OP VAR NUMBER FUNC_DEF RETUR... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | def count(a, b, c, d, e):
ans = 0
if b > a and b > c:
ans += 1
if b < a and b < c:
ans += 1
if c < b and c < d:
ans += 1
if c > b and c > d:
ans += 1
if d < c and d < e:
ans += 1
if d > c and d > e:
ans += 1
return ans
for i in range(int(... | FUNC_DEF ASSIGN VAR NUMBER IF VAR VAR VAR VAR VAR NUMBER IF VAR VAR VAR VAR VAR NUMBER IF VAR VAR VAR VAR VAR NUMBER IF VAR VAR VAR VAR VAR NUMBER IF VAR VAR VAR VAR VAR NUMBER IF VAR VAR VAR VAR VAR NUMBER RETURN VAR FOR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FU... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | t = int(input())
for e in range(t):
n = int(input())
l = input().split()
for i in range(n):
l[i] = int(l[i])
ma = 0
c = 0
m = 0
l1 = [-1]
for i in range(1, n - 1):
if l[i] > l[i - 1] and l[i] > l[i + 1]:
c = c + 1
m = m + 1
l1.append("H... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR VAR FUNC_CALL VAR VAR VAR ASSIGN VAR NUMBER ASSIGN VAR NUMBER ASSIGN VAR NUMBER ASSIGN VAR LIST NUMBER FOR VAR FUNC_CALL VAR NUMBER BIN_OP VAR N... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | import sys
data = sys.stdin.read().split("\n")[::-1]
def input():
return data.pop()
def is_bad(arr, i):
return (
i > 0
and i < len(arr) - 1
and (
arr[i] > arr[i - 1]
and arr[i] > arr[i + 1]
or arr[i] < arr[i - 1]
and arr[i] < arr[i + 1... | IMPORT ASSIGN VAR FUNC_CALL FUNC_CALL VAR STRING NUMBER FUNC_DEF RETURN FUNC_CALL VAR FUNC_DEF RETURN VAR NUMBER VAR BIN_OP FUNC_CALL VAR VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER FUNC_DEF ASSIGN VAR NUMBER FOR VAR FUNC_CALL VAR BI... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | t = int(input())
while t > 0:
t -= 1
n = int(input())
a = input().split()
a = [int(i) for i in a]
intimidation = 0
hov = [(False) for i in range(n)]
for i in range(1, n - 1):
if a[i] < a[i - 1] and a[i] < a[i + 1]:
hov[i] = True
intimidation += 1
if a[... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR WHILE VAR NUMBER VAR NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR VAR VAR VAR ASSIGN VAR NUMBER ASSIGN VAR NUMBER VAR FUNC_CALL VAR VAR FOR VAR FUNC_CALL VAR NUMBER BIN_OP VAR NUMBER IF VAR VAR VAR BIN_OP VAR NUMBER VAR ... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | import sys
input = sys.stdin.buffer.readline
def ishill(b, a):
if a == 0 or a == len(b) - 1:
return 0
if b[a] > b[a - 1] and b[a] > b[a + 1]:
return 1
elif b[a] < b[a - 1] and b[a] < b[a + 1]:
return 1
else:
return 0
a = int(input())
for x in range(a):
b = int(in... | IMPORT ASSIGN VAR VAR FUNC_DEF IF VAR NUMBER VAR BIN_OP FUNC_CALL VAR VAR NUMBER RETURN NUMBER IF VAR VAR VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER RETURN NUMBER IF VAR VAR VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER RETURN NUMBER RETURN NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FOR VAR FUNC_CALL ... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | for i in range(int(input())):
n = int(input())
arr = list(map(int, input().split()))
ans = 0
c = 0
ma = 0
for i in range(1, n - 1):
c = arr[i]
cntn = 0
for j in range(max(1, i - 1), min(i + 2, n - 1)):
if arr[j - 1] > arr[j] and arr[j + 1] > arr[j]:
... | FOR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR NUMBER ASSIGN VAR NUMBER ASSIGN VAR NUMBER FOR VAR FUNC_CALL VAR NUMBER BIN_OP VAR NUMBER ASSIGN VAR VAR VAR ASSIGN VAR NUMBER FOR VAR FUNC_CALL VAR FUNC... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | import sys
input = sys.stdin.readline
t = int(input())
for tests in range(t):
n = int(input())
A = list(map(int, input().split()))
A.append(A[-1])
A.append(A[0])
X = [0] * n
for i in range(1, n - 1):
if A[i - 1] < A[i] and A[i] > A[i + 1]:
X[i] = 1
elif A[i - 1] > A[... | IMPORT ASSIGN VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR EXPR FUNC_CALL VAR VAR NUMBER EXPR FUNC_CALL VAR VAR NUMBER ASSIGN VAR BIN_OP LIST NUMBER VAR FOR VAR FUNC_CALL VAR NUMBER BIN_... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | def f(i, j, k):
return (
a[i] < a[j] > a[k] or a[i] > a[j] < a[k]
if 0 <= i < n and 0 <= j < n and 0 <= k < n
else 0
)
for _ in range(int(input())):
n = int(input())
a = list(map(int, input().split()))
m = sum(f(i - 1, i, i + 1) for i in range(n))
o = 0
for i in ran... | FUNC_DEF RETURN NUMBER VAR VAR NUMBER VAR VAR NUMBER VAR VAR VAR VAR VAR VAR VAR VAR VAR VAR VAR VAR VAR VAR NUMBER FOR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR BIN_OP VA... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | from sys import stdin
def readGenerator():
while True:
tokens = stdin.readline().strip().split(" ")
for t in tokens:
yield t
reader = readGenerator()
def readWord():
return next(reader)
def readInt():
return int(next(reader))
def readFloat():
return float(next(reade... | FUNC_DEF WHILE NUMBER ASSIGN VAR FUNC_CALL FUNC_CALL FUNC_CALL VAR STRING FOR VAR VAR EXPR VAR ASSIGN VAR FUNC_CALL VAR FUNC_DEF RETURN FUNC_CALL VAR VAR FUNC_DEF RETURN FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_DEF RETURN FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_DEF RETURN FUNC_CALL VAR FUNC_DEF RETURN VAR NUMBER BIN_OP VAR FU... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | for _ in range(int(input())):
n = int(input())
l = [int(x) for x in input().split()]
m = [0] * n
a3 = 0
a2 = 0
a1 = 0
for i in range(1, n - 1):
if l[i] > l[i - 1] and l[i] > l[i + 1]:
m[i] = 2
a1 = 1
if i > 1 and m[i - 1] == 1 and m[i - 2] == 2:
... | FOR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR BIN_OP LIST NUMBER VAR ASSIGN VAR NUMBER ASSIGN VAR NUMBER ASSIGN VAR NUMBER FOR VAR FUNC_CALL VAR NUMBER BIN_OP VAR NUMBER IF VAR VAR VAR BIN_OP VAR NUMBER VAR VA... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | def bad(a, b, c):
return a < b and a < c or a > b and a > c
for tt in range(int(input())):
n = int(input())
l = list(map(int, input().split()))
ans = 0
cnt = 0
b = [(0) for i in range(n)]
for i in range(1, n - 1):
b[i] = bad(l[i], l[i - 1], l[i + 1])
cnt += b[i]
ans = c... | FUNC_DEF RETURN VAR VAR VAR VAR VAR VAR VAR VAR FOR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR NUMBER ASSIGN VAR NUMBER ASSIGN VAR NUMBER VAR FUNC_CALL VAR VAR FOR VAR FUNC_CALL VAR NUMBER BIN_OP VAR ... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | n = 0
def is_hv(a, j):
return (
1
if 0 < j < n - 1
and (a[j] < a[j - 1] and a[j] < a[j + 1] or a[j] > a[j - 1] and a[j] > a[j + 1])
else 0
)
t = int(input())
for i in range(t):
input()
a = list(map(int, input().split()))
n = len(a)
c = 0
b = [0] * n
fo... | ASSIGN VAR NUMBER FUNC_DEF RETURN NUMBER VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER NUMBER NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR EXPR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | ans = []
for _ in range(int(input())):
n = int(input())
u = list(map(int, input().split()))
p = [0] * n
cnt = 0
for i in range(1, n - 1):
if u[i - 1] > u[i] < u[i + 1]:
p[i] = 1
cnt += 1
elif u[i - 1] < u[i] > u[i + 1]:
p[i] = 2
cnt += ... | ASSIGN VAR LIST FOR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR BIN_OP LIST NUMBER VAR ASSIGN VAR NUMBER FOR VAR FUNC_CALL VAR NUMBER BIN_OP VAR NUMBER IF VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR N... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | temp = int(input())
for eqw in range(temp):
t = int(input())
li = list(map(int, input().split(" ")))
if t < 3:
print("0")
continue
temp = [0]
for i in range(1, t - 1):
if li[i] > li[i + 1] and li[i] > li[i - 1]:
temp.append(1)
elif li[i] < li[i + 1] and li... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR STRING IF VAR NUMBER EXPR FUNC_CALL VAR STRING ASSIGN VAR LIST NUMBER FOR VAR FUNC_CALL VAR NUMBER BIN_OP VAR NUMBER IF VAR VAR VAR BIN_OP VAR NUMBER... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | def readInts():
return list(map(int, input().split()))
def readInt():
return int(input())
t = readInt()
for _ in range(t):
n = readInt()
a = readInts()
b = [a[i] for i in range(n)]
ans = 0
dlt = 0
for i in range(1, n - 1):
if a[i - 1] > a[i] < a[i + 1]:
ans += 1
... | FUNC_DEF RETURN FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR FUNC_DEF RETURN FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR VAR VAR VAR FUNC_CALL VAR VAR ASSIGN VAR NUMBER ASSIGN VAR NUMBER FOR VAR FUNC_CALL VAR NUMB... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | def hv_test(a, b, c):
if a < b > c or a > b < c:
return True
else:
return False
t = int(input())
for _ in range(t):
n = int(input())
arr = list(map(lambda x: int(x), input().split()))
is_hv = [0] * n
ans = 0
if n > 2:
i = 1
while i < n - 1:
if hv... | FUNC_DEF IF VAR VAR VAR VAR VAR VAR RETURN NUMBER RETURN NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR BIN_OP LIST NUMBER VAR ASSIGN VAR NUMBER IF VAR NUMBER ASSIG... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | from sys import stdin
input = stdin.readline
t = int(input())
def check(a, i):
if i == 0 or i == len(a) - 1:
return 0
return (a[i] - a[i - 1]) * (a[i] - a[i + 1]) > 0
for _ in range(t):
n = int(input())
a = list(map(int, input().split()))
res = 0
cnt = 0
for i in range(1, len(a)... | ASSIGN VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_DEF IF VAR NUMBER VAR BIN_OP FUNC_CALL VAR VAR NUMBER RETURN NUMBER RETURN BIN_OP BIN_OP VAR VAR VAR BIN_OP VAR NUMBER BIN_OP VAR VAR VAR BIN_OP VAR NUMBER NUMBER FOR VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CAL... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | t = int(input())
for _ in range(t):
def main():
n = int(input())
nums = list(map(int, input().split()))
if n <= 4:
return print(0)
def hill(p):
return nums[p] > nums[p - 1] and nums[p] > nums[p + 1]
def valley(p):
return nums[p] < nums[p... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR FUNC_DEF ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR IF VAR NUMBER RETURN FUNC_CALL VAR NUMBER FUNC_DEF RETURN VAR VAR VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER FUNC_DEF RETURN VAR VA... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | for _ in range(int(input())):
n = int(input())
a = [int(i) for i in input().split()]
hills_and_valleys = [0] * n
for ind in range(1, n - 1):
if (
a[ind - 1] < a[ind]
and a[ind + 1] < a[ind]
or a[ind - 1] > a[ind]
and a[ind + 1] > a[ind]
):
... | FOR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR BIN_OP LIST NUMBER VAR FOR VAR FUNC_CALL VAR NUMBER BIN_OP VAR NUMBER IF VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER VAR VAR ... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | t = int(input())
def check2(i):
if i + 1 < n:
if a[i - 2] > a[i] < a[i + 1] or a[i - 2] < a[i] > a[i + 1]:
if dp[i] == 0:
return -1
else:
return 0
elif dp[i] == 1:
return 1
else:
return 0
return 0
def che... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_DEF IF BIN_OP VAR NUMBER VAR IF VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER IF VAR VAR NUMBER RETURN NUMBER RETURN NUMBER IF VAR VAR NUMBER RETURN NUMBER RETURN NUMBER RETURN NUMBER FUNC_DEF IF BIN_OP VAR NUMBER NUMB... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | def solve(a):
hv = set()
tot = 0
for i in range(1, len(a) - 1):
if a[i] > a[i - 1] and a[i] > a[i + 1] or a[i] < a[i - 1] and a[i] < a[i + 1]:
hv.add(i)
tot += 1
Max = 0
for i in range(len(a)):
left = 0
right = 0
if i - 1 >= 0:
if i... | FUNC_DEF ASSIGN VAR FUNC_CALL VAR ASSIGN VAR NUMBER FOR VAR FUNC_CALL VAR NUMBER BIN_OP FUNC_CALL VAR VAR NUMBER IF VAR VAR VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER EXPR FUNC_CALL VAR VAR VAR NUMBER ASSIGN VAR NUMBER FOR VAR FUNC_CALL VAR FUNC_CALL ... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | from sys import stdin
input = stdin.readline
def get_unit_score(l, i):
if i <= 0 or i + 1 >= len(l):
return 0
return l[i - 1] > l[i] and l[i + 1] > l[i] or l[i - 1] < l[i] and l[i + 1] < l[i]
def solve():
n = int(input())
l = [int(a) for a in input().split()]
scores = [get_unit_score(l,... | ASSIGN VAR VAR FUNC_DEF IF VAR NUMBER BIN_OP VAR NUMBER FUNC_CALL VAR VAR RETURN NUMBER RETURN VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER VAR VAR FUNC_DEF ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR VAR VAR FUNC_CALL FUNC_CALL VAR ... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | t = int(input().strip())
for _ in range(t):
n = int(input().strip())
a = list(map(int, input().strip().split()))
d = [((a[i] < a[i + 1]) - (a[i] > a[i + 1])) for i in range(n - 1)]
vh = [(d[i] * d[i + 1]) for i in range(n - 2)]
D = vh.count(-1)
if D < 2:
print(0)
continue
if ... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL FUNC_CALL VAR ASSIGN VAR BIN_OP VAR VAR VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER VAR FUNC_CALL VAR BIN_OP VAR NUMBER ASSIG... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | import sys
input = sys.stdin.readline
for _ in range(int(input())):
n = int(input())
a = list(map(int, input().split()))
cnt = 0
change = [False] * n
ans = 0
for i in range(1, n - 1):
p = 0
if a[i - 1] > a[i] < a[i + 1]:
cnt += 1
change[i] = True
... | IMPORT ASSIGN VAR VAR FOR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR NUMBER ASSIGN VAR BIN_OP LIST NUMBER VAR ASSIGN VAR NUMBER FOR VAR FUNC_CALL VAR NUMBER BIN_OP VAR NUMBER ASSIGN VAR NUMBER IF VAR ... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | for _ in range(int(input())):
n = int(input())
a = list(map(int, input().split()))
b = [0] * n
cur = 0
for i in range(1, n - 1):
if a[i] < a[i + 1] and a[i] < a[i - 1]:
b[i] = 1
if a[i] > a[i + 1] and a[i] > a[i - 1]:
b[i] = 1
cur += b[i]
ans = cur... | FOR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR BIN_OP LIST NUMBER VAR ASSIGN VAR NUMBER FOR VAR FUNC_CALL VAR NUMBER BIN_OP VAR NUMBER IF VAR VAR VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER AS... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | import sys
input = sys.stdin.readline
def check(i):
if i == 0 or i == n - 1:
return False
if a[i] > a[i - 1] and a[i] > a[i + 1]:
return True
if a[i] < a[i - 1] and a[i] < a[i + 1]:
return True
return False
for nt in range(int(input())):
n = int(input())
a = list(map... | IMPORT ASSIGN VAR VAR FUNC_DEF IF VAR NUMBER VAR BIN_OP VAR NUMBER RETURN NUMBER IF VAR VAR VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER RETURN NUMBER IF VAR VAR VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER RETURN NUMBER RETURN NUMBER FOR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL ... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | (
lambda r, c: [
(
lambda p, n: (
lambda m: print(
sum(c(p, q) for p, q in zip(m, m[1:]))
- max(
(
c(p, q) + c(q, r) + c(r, s) - min(c(r + q, s), c(p, q + r))
f... | EXPR FUNC_CALL FUNC_CALL FUNC_CALL FUNC_CALL VAR BIN_OP FUNC_CALL VAR FUNC_CALL VAR VAR VAR VAR VAR FUNC_CALL VAR VAR VAR NUMBER FUNC_CALL VAR BIN_OP BIN_OP BIN_OP FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR VAR FUNC_CALL VAR FUNC_CALL VAR BIN_OP VAR VAR VAR FUNC_CALL VAR VAR BIN_OP VAR VAR VAR VAR VA... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | t = int(input())
for test in range(t):
n = int(input())
a = [int(i) for i in input().split()]
tot = 0
m_dim = 0
def ishill(it):
if it > 0 and it < n - 1:
if (
a[it] < a[it - 1]
and a[it] < a[it + 1]
or a[it] > a[it - 1]
... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR NUMBER ASSIGN VAR NUMBER FUNC_DEF IF VAR NUMBER VAR BIN_OP VAR NUMBER IF VAR VAR VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER VAR VAR VAR BIN... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | t = int(input())
for q in range(t):
n = int(input())
mass = [int(x) for x in input().split()]
answer = 0
Max_izm = 0
for i in range(n - 4):
a = 0
b = 0
c = 0
if (mass[i + 1] - mass[i]) * (mass[i + 1] - mass[i + 2]) > 0:
if i == 0:
answer +=... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR NUMBER ASSIGN VAR NUMBER FOR VAR FUNC_CALL VAR BIN_OP VAR NUMBER ASSIGN VAR NUMBER ASSIGN VAR NUMBER ASSIGN VAR NUMBER IF BIN_OP BIN_OP VAR BIN_OP V... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | def Int_check(a, b, c):
if a < b and b > c:
return 1
elif a > b and b < c:
return 1
else:
return 0
t = int(input())
for z in range(t):
n = int(input())
l = [int(i) for i in input().split()]
if n >= 5:
Int = 0
Red = 0
b = Int_check(l[0], l[1], l[2... | FUNC_DEF IF VAR VAR VAR VAR RETURN NUMBER IF VAR VAR VAR VAR RETURN NUMBER RETURN NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR VAR VAR FUNC_CALL FUNC_CALL VAR IF VAR NUMBER ASSIGN VAR NUMBER ASSIGN VAR NUMBER ASSIGN VAR FUNC_CALL... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | T = int(input())
for _ in range(T):
N = int(input())
A = list(map(int, input().split()))
if N == 1:
ans = 0
elif N == 2:
ans = 0
else:
res = 0
for i in range(1, N - 1):
if (A[i - 1] - A[i]) * (A[i] - A[i + 1]) < 0:
res += 1
ans = re... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR IF VAR NUMBER ASSIGN VAR NUMBER IF VAR NUMBER ASSIGN VAR NUMBER ASSIGN VAR NUMBER FOR VAR FUNC_CALL VAR NUMBER BIN_OP VAR NUMBER IF BIN_OP BIN_OP VAR... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | def sgn(x):
return (x > 0) - (x < 0)
t = int(input())
for _ in range(t):
n = int(input())
a = list(map(int, input().split()))
a = [a[0]] * 2 + a + [a[-1]] * 2
it = []
ita = it.append
chg = 0
for i in range(2, n + 2):
ita(a[i - 1] < a[i] > a[i + 1] or a[i - 1] > a[i] < a[i + 1])... | FUNC_DEF RETURN BIN_OP VAR NUMBER VAR NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR BIN_OP BIN_OP BIN_OP LIST VAR NUMBER NUMBER VAR BIN_OP LIST VAR NUMBER NUMBER ASSIGN VAR LIST... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | def ispeak(a, i, n):
if i == 0 or i == n - 1:
return 0
elif a[i] > a[i - 1] and a[i] > a[i + 1] or a[i] < a[i - 1] and a[i] < a[i + 1]:
return 1
return 0
def answer(n, a):
if n <= 3:
return 0
peak = [(0) for i in range(n)]
p = 0
for i in range(1, n - 1):
if ... | FUNC_DEF IF VAR NUMBER VAR BIN_OP VAR NUMBER RETURN NUMBER IF VAR VAR VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER RETURN NUMBER RETURN NUMBER FUNC_DEF IF VAR NUMBER RETURN NUMBER ASSIGN VAR NUMBER VAR FUNC_CALL VAR VAR ASSIGN VAR NUMBER FOR VAR FUNC_CA... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | def hv(l, i):
if l[i] > l[i - 1] and l[i] > l[i + 1]:
return 1
elif l[i] < l[i - 1] and l[i] < l[i + 1]:
return 1
else:
return 0
for _ in range(int(input())):
n = int(input())
l = list(map(int, input().split()))
if n <= 4:
print(0)
else:
l1 = []
... | FUNC_DEF IF VAR VAR VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER RETURN NUMBER IF VAR VAR VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER RETURN NUMBER RETURN NUMBER FOR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL F... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | from sys import stdin, stdout
def ii():
return int(stdin.readline().strip())
def si():
return stdin.readline().strip()
def li():
return list(map(int, stdin.readline().strip().split()))
def mi():
return map(int, stdin.readline().strip().split())
def tool1(a, b, c, d, e):
l = []
if b > c... | FUNC_DEF RETURN FUNC_CALL VAR FUNC_CALL FUNC_CALL VAR FUNC_DEF RETURN FUNC_CALL FUNC_CALL VAR FUNC_DEF RETURN FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL FUNC_CALL VAR FUNC_DEF RETURN FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL FUNC_CALL VAR FUNC_DEF ASSIGN VAR LIST IF VAR VAR VAR VAR VAR VAR VAR VAR EXPR FUNC_CALL V... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | import sys
input = sys.stdin.readline
def check(i):
global ar, n
if i <= 0 or i >= n - 1:
return 0
elif ar[i] > ar[i - 1] and ar[i] > ar[i + 1]:
return 1
elif ar[i] < ar[i - 1] and ar[i] < ar[i + 1]:
return 1
else:
return 0
for _ in range(int(input())):
n = i... | IMPORT ASSIGN VAR VAR FUNC_DEF IF VAR NUMBER VAR BIN_OP VAR NUMBER RETURN NUMBER IF VAR VAR VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER RETURN NUMBER IF VAR VAR VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER RETURN NUMBER RETURN NUMBER FOR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL ... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | from sys import stdin, stdout
for _ in range(int(stdin.readline())):
n = int(stdin.readline())
a = [int(i) for i in stdin.readline().split()]
ct = 0
v = [(0) for i in range(n)]
for i in range(1, n - 1):
if a[i] > a[i + 1] and a[i] > a[i - 1]:
ct += 1
v[i] = 1
... | FOR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR NUMBER ASSIGN VAR NUMBER VAR FUNC_CALL VAR VAR FOR VAR FUNC_CALL VAR NUMBER BIN_OP VAR NUMBER IF VAR VAR VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER VAR NU... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | for _ in range(int(input())):
n = int(input())
a = list(map(int, input().split()))
def isHV(i):
if i <= 0 or i >= n - 1:
return 0
elif a[i] < a[i - 1] and a[i] < a[i + 1]:
return 1
elif a[i] > a[i - 1] and a[i] > a[i + 1]:
return 1
else:
... | FOR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR FUNC_DEF IF VAR NUMBER VAR BIN_OP VAR NUMBER RETURN NUMBER IF VAR VAR VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER RETURN NUMBER IF VAR VAR VAR BIN_OP VAR NU... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | from sys import stdin, stdout
def input():
return stdin.readline().strip()
def read_int_list():
return list(map(int, input().split()))
def read_int_tuple():
return tuple(map(int, input().split()))
def read_int():
return int(input())
def is_hv(A, i):
if not 0 <= i - 1 < i + 1 < len(A):
... | FUNC_DEF RETURN FUNC_CALL FUNC_CALL VAR FUNC_DEF RETURN FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR FUNC_DEF RETURN FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR FUNC_DEF RETURN FUNC_CALL VAR FUNC_CALL VAR FUNC_DEF IF NUMBER BIN_OP VAR NUMBER BIN_OP VAR NUMBER FUNC_CALL VAR VAR RETURN NUMBER IF VA... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | def check(i, n, l):
if i == 0 or i == n - 1:
return False
return l[i] > l[i - 1] and l[i] > l[i + 1] or l[i] < l[i - 1] and l[i] < l[i + 1]
def solve(case):
n = int(input())
l = list(map(int, input().split()))
t = []
for i in range(1, n - 1):
if l[i] > l[i - 1] and l[i] > l[i +... | FUNC_DEF IF VAR NUMBER VAR BIN_OP VAR NUMBER RETURN NUMBER RETURN VAR VAR VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER FUNC_DEF ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR LIST FOR... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | from sys import stdin, stdout
input = stdin.readline
t = int(input())
for _ in range(t):
n = int(input())
a = [int(x) for x in input().split()]
count = 0
diff = 0
marks = set()
for i in range(1, n - 1):
if a[i] > a[i - 1] and a[i] > a[i + 1]:
marks.add(i)
count +... | ASSIGN VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR NUMBER ASSIGN VAR NUMBER ASSIGN VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR NUMBER BIN_OP VAR NUMBER IF VAR VAR VAR BIN_OP VAR NUMBER VAR... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | t = int(input())
def get_score(b):
score = 0
for i in range(len(b) - 1):
if b[i] * b[i + 1] < 0:
score += 1
return score
for _ in range(t):
n = int(input())
a = [int(v) for v in input().split()]
a = [a[0]] * 2 + a + [a[-1]] * 2
b = [(a2 - a1) for a1, a2 in zip(a[:-1],... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_DEF ASSIGN VAR NUMBER FOR VAR FUNC_CALL VAR BIN_OP FUNC_CALL VAR VAR NUMBER IF BIN_OP VAR VAR VAR BIN_OP VAR NUMBER NUMBER VAR NUMBER RETURN VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VA... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | import sys
def solve(n, arr):
if n <= 4:
return 0
a = [(0) for i in range(n)]
ans = 0
c = 0
for i in range(1, n - 1):
if (
arr[i] > arr[i - 1]
and arr[i] > arr[i + 1]
or arr[i] < arr[i - 1]
and arr[i] < arr[i + 1]
):
... | IMPORT FUNC_DEF IF VAR NUMBER RETURN NUMBER ASSIGN VAR NUMBER VAR FUNC_CALL VAR VAR ASSIGN VAR NUMBER ASSIGN VAR NUMBER FOR VAR FUNC_CALL VAR NUMBER BIN_OP VAR NUMBER IF VAR VAR VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER ASSIGN VAR VAR NUMBER VAR NUMB... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | def is_hill(left, middle, right):
if middle > max(left, right):
return True
if middle < min(left, right):
return True
def is_triplet_in_border(middle, length):
if middle - 1 < 0:
return False
if middle + 1 >= length:
return False
return True
def solve(arr):
hi... | FUNC_DEF IF VAR FUNC_CALL VAR VAR VAR RETURN NUMBER IF VAR FUNC_CALL VAR VAR VAR RETURN NUMBER FUNC_DEF IF BIN_OP VAR NUMBER NUMBER RETURN NUMBER IF BIN_OP VAR NUMBER VAR RETURN NUMBER RETURN NUMBER FUNC_DEF ASSIGN VAR NUMBER VAR FUNC_CALL VAR FUNC_CALL VAR VAR FOR VAR FUNC_CALL VAR NUMBER BIN_OP FUNC_CALL VAR VAR NUMB... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | from sys import stdin, stdout
nmbr = lambda: int(stdin.readline())
lst = lambda: list(map(int, stdin.readline().split()))
def fnp(v, p1, p2):
if p1 >= n or p2 >= n:
return 0
if v < a[p1] > a[p2] or v > a[p1] < a[p2]:
return 1
return 0
def fnb(p2, p1, v):
if p1 < 0 or p2 < 0:
... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR FUNC_DEF IF VAR VAR VAR VAR RETURN NUMBER IF VAR VAR VAR VAR VAR VAR VAR VAR VAR VAR RETURN NUMBER RETURN NUMBER FUNC_DEF IF VAR NUMBER VAR NUMBER RETURN NUMBER IF VAR VAR VAR VAR VAR VAR VAR VAR VAR VAR RETURN NUM... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | def is_hv(i):
if i == 0 or i == n - 1:
return 0
elif a[i] > a[i - 1] and a[i] > a[i + 1]:
return 1
elif a[i] < a[i - 1] and a[i] < a[i + 1]:
return 1
else:
return 0
for _ in range(int(input())):
n = int(input())
a = list(map(int, input().split()))
hv = [0] *... | FUNC_DEF IF VAR NUMBER VAR BIN_OP VAR NUMBER RETURN NUMBER IF VAR VAR VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER RETURN NUMBER IF VAR VAR VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER RETURN NUMBER RETURN NUMBER FOR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSI... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | for _ in range(int(input())):
n = int(input())
a = list(map(int, input().split()))
res = 0
b = [0] * n
for i in range(1, n - 1):
if a[i] > a[i - 1] and a[i] > a[i + 1] or a[i] < a[i - 1] and a[i] < a[i + 1]:
res += 1
b[i] = 1
d = 0
for i in range(1, n - 1):
... | FOR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR ASSIGN VAR NUMBER ASSIGN VAR BIN_OP LIST NUMBER VAR FOR VAR FUNC_CALL VAR NUMBER BIN_OP VAR NUMBER IF VAR VAR VAR BIN_OP VAR NUMBER VAR VAR VAR BIN_OP VAR NUMBER VA... |
You are given a sequence of $n$ integers $a_1$, $a_2$, ..., $a_n$. Let us call an index $j$ ($2 \le j \le {{n-1}}$) a hill if $a_j > a_{{j+1}}$ and $a_j > a_{{j-1}}$; and let us call it a valley if $a_j < a_{{j+1}}$ and $a_j < a_{{j-1}}$.
Let us define the intimidation value of a sequence as the sum of the number of h... | import sys
input = sys.stdin.readline
t = int(input())
for t1 in range(t):
n = int(input())
l = list(map(int, input().split(" ")))
arr = [""] * n
for i in range(1, n - 1):
if l[i] > l[i - 1] and l[i] > l[i + 1]:
arr[i] = "h"
if l[i] < l[i - 1] and l[i] < l[i + 1]:
... | IMPORT ASSIGN VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FOR VAR FUNC_CALL VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL FUNC_CALL VAR STRING ASSIGN VAR BIN_OP LIST STRING VAR FOR VAR FUNC_CALL VAR NUMBER BIN_OP VAR NUMBER IF VAR VAR VAR BIN_OP VAR NUMBER VAR VA... |
Vasilisa the Wise from a far away kingdom got a present from her friend Helga the Wise from a farther away kingdom. The present is a surprise box, yet Vasilisa the Wise doesn't know yet what the surprise actually is because she cannot open the box. She hopes that you can help her in that.
The box's lock is constructed... | s = input()
s = sorted(s)
count = 1
ans = []
for i in range(1, len(s)):
if s[i] == s[i - 1]:
count += 1
else:
ans.append(count)
count = 1
ans.append(count)
ans.sort()
if len(ans) == 1:
print(1)
if len(ans) == 2:
if ans[0] == 1:
print(1)
else:
print(2)
if len(a... | ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR VAR ASSIGN VAR NUMBER ASSIGN VAR LIST FOR VAR FUNC_CALL VAR NUMBER FUNC_CALL VAR VAR IF VAR VAR VAR BIN_OP VAR NUMBER VAR NUMBER EXPR FUNC_CALL VAR VAR ASSIGN VAR NUMBER EXPR FUNC_CALL VAR VAR EXPR FUNC_CALL VAR IF FUNC_CALL VAR VAR NUMBER EXPR FUNC_CALL VAR NUMBER IF F... |
Vasilisa the Wise from a far away kingdom got a present from her friend Helga the Wise from a farther away kingdom. The present is a surprise box, yet Vasilisa the Wise doesn't know yet what the surprise actually is because she cannot open the box. She hopes that you can help her in that.
The box's lock is constructed... | import itertools
class Cube:
def __init__(self, v):
self.s = v
def rotate_h(self):
s = self.s
self.s = s[0:1] + s[2:5] + s[1:2] + s[5:6]
def rotate_v1(self):
s = self.s
self.s = s[1:2] + s[5:6] + s[2:3] + s[0:1] + s[4:5] + s[3:4]
def rotate_v2(self):
... | IMPORT CLASS_DEF FUNC_DEF ASSIGN VAR VAR FUNC_DEF ASSIGN VAR VAR ASSIGN VAR BIN_OP BIN_OP BIN_OP VAR NUMBER NUMBER VAR NUMBER NUMBER VAR NUMBER NUMBER VAR NUMBER NUMBER FUNC_DEF ASSIGN VAR VAR ASSIGN VAR BIN_OP BIN_OP BIN_OP BIN_OP BIN_OP VAR NUMBER NUMBER VAR NUMBER NUMBER VAR NUMBER NUMBER VAR NUMBER NUMBER VAR NUMBE... |
[Image]
-----Input-----
The input consists of four lines, each line containing a single digit 0 or 1.
-----Output-----
Output a single digit, 0 or 1.
-----Example-----
Input
0
1
1
0
Output
0 | def r():
return input() == "1"
def w(x):
print("1" if x else "0")
def a(x, y):
return x and y
def x(x, y):
return x or y
def o(x, y):
return x != y
m = r()
n = r()
p = r()
q = r()
w(o(a(o(m, n), x(p, q)), x(a(n, p), o(q, m)))) | FUNC_DEF RETURN FUNC_CALL VAR STRING FUNC_DEF EXPR FUNC_CALL VAR VAR STRING STRING FUNC_DEF RETURN VAR VAR FUNC_DEF RETURN VAR VAR FUNC_DEF RETURN VAR VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR EXPR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR VAR ... |
[Image]
-----Input-----
The input consists of four lines, each line containing a single digit 0 or 1.
-----Output-----
Output a single digit, 0 or 1.
-----Example-----
Input
0
1
1
0
Output
0 | ls = [int(input()) for i in range(4)]
A = ls[0] ^ ls[1]
B = ls[2] or ls[3]
C = ls[1] and ls[2]
D = ls[0] ^ ls[3]
print((A and B) ^ (C or D)) | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL VAR NUMBER ASSIGN VAR BIN_OP VAR NUMBER VAR NUMBER ASSIGN VAR VAR NUMBER VAR NUMBER ASSIGN VAR VAR NUMBER VAR NUMBER ASSIGN VAR BIN_OP VAR NUMBER VAR NUMBER EXPR FUNC_CALL VAR BIN_OP VAR VAR VAR VAR |
[Image]
-----Input-----
The input consists of four lines, each line containing a single digit 0 or 1.
-----Output-----
Output a single digit, 0 or 1.
-----Example-----
Input
0
1
1
0
Output
0 | a, b, c, d = int(input()), int(input()), int(input()), int(input())
e = a ^ b and (c or d)
f = b and c or a ^ d
print(e ^ f) | ASSIGN VAR VAR VAR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR BIN_OP VAR VAR VAR VAR ASSIGN VAR VAR VAR BIN_OP VAR VAR EXPR FUNC_CALL VAR BIN_OP VAR VAR |
[Image]
-----Input-----
The input consists of four lines, each line containing a single digit 0 or 1.
-----Output-----
Output a single digit, 0 or 1.
-----Example-----
Input
0
1
1
0
Output
0 | a = int(input())
b = int(input())
c = int(input())
d = int(input())
ee = a ^ b
ff = c | d
gg = b & c
hh = a ^ d
iii = ee & ff
jjj = gg | hh
r = iii ^ jjj
print(r) | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR BIN_OP VAR VAR ASSIGN VAR BIN_OP VAR VAR ASSIGN VAR BIN_OP VAR VAR ASSIGN VAR BIN_OP VAR VAR ASSIGN VAR BIN_OP VAR VAR ASSIGN VAR BIN_OP VAR VAR ASSIGN V... |
[Image]
-----Input-----
The input consists of four lines, each line containing a single digit 0 or 1.
-----Output-----
Output a single digit, 0 or 1.
-----Example-----
Input
0
1
1
0
Output
0 | a = int(input())
b = int(input())
c = int(input())
d = int(input())
n = a * 8 + b * 4 + c * 2 + d
a = "0101000011011011"
print(a[n]) | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR BIN_OP BIN_OP BIN_OP BIN_OP VAR NUMBER BIN_OP VAR NUMBER BIN_OP VAR NUMBER VAR ASSIGN VAR STRING EXPR FUNC_CALL VAR VAR VAR |
[Image]
-----Input-----
The input consists of four lines, each line containing a single digit 0 or 1.
-----Output-----
Output a single digit, 0 or 1.
-----Example-----
Input
0
1
1
0
Output
0 | import itertools
def op(a, b, x):
if x == 0:
return a | b
elif x == 1:
return a ^ b
else:
return a & b
def main():
a = int(input())
b = int(input())
c = int(input())
d = int(input())
p = 1, 0, 2
e = op(a, b, p[0])
f = op(c, d, p[1])
g = op(b, c, p[... | IMPORT FUNC_DEF IF VAR NUMBER RETURN BIN_OP VAR VAR IF VAR NUMBER RETURN BIN_OP VAR VAR RETURN BIN_OP VAR VAR FUNC_DEF ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR NUMBER NUMBER NUMBER ASSIGN VAR FU... |
[Image]
-----Input-----
The input consists of four lines, each line containing a single digit 0 or 1.
-----Output-----
Output a single digit, 0 or 1.
-----Example-----
Input
0
1
1
0
Output
0 | def solveC(x):
y = [x[0] or x[1], x[2] ^ x[3], x[1] and x[2], x[0] or x[3]]
z = [y[0] and y[1], y[2] ^ y[3]]
return z[0] or z[1]
x = [0, 0, 0, 0]
for i in range(4):
x[i] = int(input())
if x == [0, 1, 1, 0]:
print(0)
elif x == [0, 0, 0, 0]:
print(0)
elif x == [0, 1, 0, 0]:
print(0)
elif x =... | FUNC_DEF ASSIGN VAR LIST VAR NUMBER VAR NUMBER BIN_OP VAR NUMBER VAR NUMBER VAR NUMBER VAR NUMBER VAR NUMBER VAR NUMBER ASSIGN VAR LIST VAR NUMBER VAR NUMBER BIN_OP VAR NUMBER VAR NUMBER RETURN VAR NUMBER VAR NUMBER ASSIGN VAR LIST NUMBER NUMBER NUMBER NUMBER FOR VAR FUNC_CALL VAR NUMBER ASSIGN VAR VAR FUNC_CALL VAR FU... |
[Image]
-----Input-----
The input consists of four lines, each line containing a single digit 0 or 1.
-----Output-----
Output a single digit, 0 or 1.
-----Example-----
Input
0
1
1
0
Output
0 | x1 = int(input())
x2 = int(input())
x3 = int(input())
x4 = int(input())
i = str(x1) + str(x2) + str(x3) + str(x4)
o1 = 1 if x1 | x2 == 0 else 0
r1 = 1 if x3 ^ x4 == 1 else 0
a1 = 1 if x2 & x3 == 0 else 0
o2 = 1 if x1 | x4 == 1 else 0
a10 = 1 if o1 & r1 == 0 else 0
r10 = 1 if a1 ^ o2 == 1 else 0
ans = 1 if a10 | r10 == ... | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR BIN_OP BIN_OP BIN_OP FUNC_CALL VAR VAR FUNC_CALL VAR VAR FUNC_CALL VAR VAR FUNC_CALL VAR VAR ASSIGN VAR BIN_OP VAR VAR NUMBER NUMBER NUMBER ASSIGN VAR BI... |
[Image]
-----Input-----
The input consists of four lines, each line containing a single digit 0 or 1.
-----Output-----
Output a single digit, 0 or 1.
-----Example-----
Input
0
1
1
0
Output
0 | a = int(input())
b = int(input())
c = int(input())
d = int(input())
res = (a ^ b and (c or d)) ^ (b and c or a ^ d)
print(1 if res else 0) | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR BIN_OP BIN_OP VAR VAR VAR VAR VAR VAR BIN_OP VAR VAR EXPR FUNC_CALL VAR VAR NUMBER NUMBER |
[Image]
-----Input-----
The input consists of four lines, each line containing a single digit 0 or 1.
-----Output-----
Output a single digit, 0 or 1.
-----Example-----
Input
0
1
1
0
Output
0 | s = input() + input() + input() + input()
if s == "0000":
print(0)
if s == "0001":
print(1)
if s == "0010":
print(0)
if s == "0011":
print(1)
if s == "0100":
print(0)
if s == "0101":
print(0)
if s == "0110":
print(0)
if s == "0111":
print(0)
if s == "1000":
print(1)
if s == "1001":
... | ASSIGN VAR BIN_OP BIN_OP BIN_OP FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR IF VAR STRING EXPR FUNC_CALL VAR NUMBER IF VAR STRING EXPR FUNC_CALL VAR NUMBER IF VAR STRING EXPR FUNC_CALL VAR NUMBER IF VAR STRING EXPR FUNC_CALL VAR NUMBER IF VAR STRING EXPR FUNC_CALL VAR NUMBER IF VAR STRING EXPR FUNC_CALL VAR... |
[Image]
-----Input-----
The input consists of four lines, each line containing a single digit 0 or 1.
-----Output-----
Output a single digit, 0 or 1.
-----Example-----
Input
0
1
1
0
Output
0 | iIn1 = int(input())
iIn2 = int(input())
iIn3 = int(input())
iIn4 = int(input())
print((iIn1 ^ iIn2) & (iIn3 | iIn4) ^ (iIn2 & iIn3 | iIn1 ^ iIn4)) | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR EXPR FUNC_CALL VAR BIN_OP BIN_OP BIN_OP VAR VAR BIN_OP VAR VAR BIN_OP BIN_OP VAR VAR BIN_OP VAR VAR |
[Image]
-----Input-----
The input consists of four lines, each line containing a single digit 0 or 1.
-----Output-----
Output a single digit, 0 or 1.
-----Example-----
Input
0
1
1
0
Output
0 | def AND(x, y):
return x & y
def OR(x, y):
return x | y
def XOR(x, y):
return x ^ y
f1 = XOR
f2 = OR
f3 = AND
def main():
a, b, c, d = tuple(int(input()) for __ in range(4))
one = f3(f1(a, b), f2(c, d))
two = f2(f3(b, c), f1(a, d))
print(f1(one, two))
main() | FUNC_DEF RETURN BIN_OP VAR VAR FUNC_DEF RETURN BIN_OP VAR VAR FUNC_DEF RETURN BIN_OP VAR VAR ASSIGN VAR VAR ASSIGN VAR VAR ASSIGN VAR VAR FUNC_DEF ASSIGN VAR VAR VAR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR VAR FUNC_CALL VAR NUMBER ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR VAR VAR FUNC_CALL VAR VAR VAR ASSIGN VAR FUN... |
[Image]
-----Input-----
The input consists of four lines, each line containing a single digit 0 or 1.
-----Output-----
Output a single digit, 0 or 1.
-----Example-----
Input
0
1
1
0
Output
0 | import itertools
arr = [0, 0, 0, 0]
for i in range(4):
arr[i] = int(input())
def __OR__(x, y):
return x ^ y
def __AND__(x, y):
return x & y
def __XOR__(x, y):
return x | y
perm = list(itertools.permutations([0, 1, 2, 3]))[0]
res = __OR__(
__AND__(__OR__(arr[perm[0]], arr[perm[1]]), __XOR__(... | IMPORT ASSIGN VAR LIST NUMBER NUMBER NUMBER NUMBER FOR VAR FUNC_CALL VAR NUMBER ASSIGN VAR VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_DEF RETURN BIN_OP VAR VAR FUNC_DEF RETURN BIN_OP VAR VAR FUNC_DEF RETURN BIN_OP VAR VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR LIST NUMBER NUMBER NUMBER NUMBER NUMBER ASSIGN VAR FUNC_CALL VAR ... |
[Image]
-----Input-----
The input consists of four lines, each line containing a single digit 0 or 1.
-----Output-----
Output a single digit, 0 or 1.
-----Example-----
Input
0
1
1
0
Output
0 | A = []
for i in range(4):
A.append(int(input()))
a = A[0] ^ A[1]
b = A[2] | A[3]
c = A[1] & A[2]
d = A[0] ^ A[3]
e = a & b
f = c | d
print(e ^ f) | ASSIGN VAR LIST FOR VAR FUNC_CALL VAR NUMBER EXPR FUNC_CALL VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR BIN_OP VAR NUMBER VAR NUMBER ASSIGN VAR BIN_OP VAR NUMBER VAR NUMBER ASSIGN VAR BIN_OP VAR NUMBER VAR NUMBER ASSIGN VAR BIN_OP VAR NUMBER VAR NUMBER ASSIGN VAR BIN_OP VAR VAR ASSIGN VAR BIN_OP VAR VAR EXPR FUNC_CALL V... |
[Image]
-----Input-----
The input consists of four lines, each line containing a single digit 0 or 1.
-----Output-----
Output a single digit, 0 or 1.
-----Example-----
Input
0
1
1
0
Output
0 | a = int(input())
b = int(input())
c = int(input())
d = int(input())
def f1(a, b):
return a ^ b
def f2(a, b):
return a | b
def f3(a, b):
return a & b
r1 = f1(a, b)
r2 = f2(c, d)
r3 = f3(b, c)
r4 = f1(a, d)
r5 = f3(r1, r2)
r6 = f2(r3, r4)
res = f1(r5, r6)
print(res) | ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR ASSIGN VAR FUNC_CALL VAR FUNC_CALL VAR FUNC_DEF RETURN BIN_OP VAR VAR FUNC_DEF RETURN BIN_OP VAR VAR FUNC_DEF RETURN BIN_OP VAR VAR ASSIGN VAR FUNC_CALL VAR VAR VAR ASSIGN VAR FUNC_CALL VAR VAR VAR ASSIG... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.