- MysGln 的博客
20241102
- @ 2024-11-2 16:39:18
Python OUCC
A
def main():
a,b = map(int,input().split())
total = a * 10 + b
res = total // 19
print(res)
if __name__ == "__main__":
main()
B
def main():
need = int(input())
res = 123456789
for i in range(3):
n, p = map(int,input().split())
res = min((n + need-1)//n * p, res)
print(res)
if __name__ == "__main__":
main()
C
def main():
num = int(input().strip())
if num < 0:
print("-",end="")
num *= -1
# string[start:end:step]
res = int(str(num)[::-1])
print(res)
if __name__ == "__main__":
main()
D
a = [int(t) for t in input().split()]
a.sort()
d1 = a[1] - a[0]
d2 = a[2] - a[1]
if d1 == d2:
print(a[2] + d1)
elif d1 == 2 * d2:
print(a[1] - d2)
else:
print(a[2] - d1)
E
a, b, c, d = map(int, input().split())
T = [int(i) for i in input().split()]
def check(a, b, p):
if p % (a + b) == 0:
return 0
if p % (a + b) <= a:
return 1
else:
return 0
for i in range(3):
ok = check(a, b, T[i]) + check(c, d, T[i])
if ok == 1:
print("one")
elif ok == 2:
print("both")
else:
print("none")
F
a = [int(i) for i in input().split()]
a.sort()
print(a[0] * a[2])
G
a, b, c = map(int, input().split())
def max_value(m, n):
return m if m > n else n
result = max_value(b - a, c - b) - 1
print(result)
H
def main():
a, b = map(int, input().split())
Mx = 10**9
# print(a,b)
if a == 1:
print(1)
return
# print(a, b)
limit = 0
while Mx >= a:
Mx = Mx // a
limit += 1
if b <= limit:
print(a ** b)
else:
print(-1)
if __name__ == "__main__":
main()
two
def main():
a, b = map(int, input().split())
Mx = 10**9
# print(a,b)
if a == 1:
print(1)
return
# print(a, b)
limit = 0
while Mx != 0:
Mx = Mx // a
limit += 1
if b <= limit:
print(a ** b)
else:
print(-1)
if __name__ == "__main__":
main()