text
stringlengths 37
1.41M
|
|---|
b = input()
number1 = ['A','T']
number2 = ['C','G']
print(number1[number1.index(b)-1]) if b in number1 else print(number2[number2.index(b)-1])
|
numbers = input()
numbers = numbers.split(" ")
ball_number = int(numbers[0])
person_number = int(numbers[1])
result = 0
if person_number > 1:
result = ball_number - person_number
print(result)
|
s = input()
ans=""
for i in s :
ans +="x"
print(ans)
|
# -*- coding: utf-8 -*-
import sys
import os
import math
def distance(v0, v1, p):
n = len(v0)
s = 0
for i in range(n):
diff = abs(v0[i] - v1[i])
s += diff ** p
return s ** (1/p)
def chebyshev(v0, v1):
n = len(v0)
ret = 0
for i in range(n):
diff = abs(v0[i] - v1[i])
if diff > ret:
ret = diff
return ret
n = int(input())
v0 = list(map(float, input().split()))
v1 = list(map(float, input().split()))
print(distance(v0, v1, 1))
print(distance(v0, v1, 2))
print(distance(v0, v1, 3))
print(chebyshev(v0, v1))
|
def divisors(n):
divs = []
i = 1
while i*i <= n:
if n % i == 0:
divs.append((i, n//i))
i += 1
return divs
def resolve():
N = int(input())
factors = divisors(N)
ans = float("inf")
for x, y in factors:
ans = min(ans, (x-1)+(y-1))
print(ans)
if '__main__' == __name__:
resolve()
|
s=input()
data=[]
for i in range(len(s)):
if s[i]=='0':
data.append('0')
elif s[i]=='1':
data.append('1')
else:
if len(data)==0:
continue
else:
data.pop()
print(*data,sep='')
|
S = input()
MOD = 10 ** 9 + 7
A = 0
AB = 0
ABC = 0
cnt = 1
for s in S:
if s == "A":
A = (A + cnt) % MOD
elif s == "B":
AB = (A + AB) % MOD
elif s == "C":
ABC = (AB + ABC) % MOD
else:
A, AB, ABC = (A * 3 + cnt) % MOD, (AB * 3 + A) % MOD, (ABC * 3 + AB) % MOD
cnt = (cnt * 3) % MOD
# print(A, AB, ABC, cnt)
print(ABC)
|
S = input()
if S[0] == 'R' and S[1] == 'R' and S[2] == 'R':
ans = 3
elif (S[0] == 'R' and S[1] == 'R' and S[2] == 'S') or (S[0] == 'S' and S[1] == 'R' and S[2] == 'R'):
ans = 2
elif S[0] == 'S' and S[1] == 'S' and S[2] == 'S':
ans = 0
else:
ans = 1
print(ans)
|
#!/usr/bin/env python
# coding: utf-8
# In[1]:
s = input()
# In[6]:
s_ = s.replace("BC","D")
cnt = 0
ans = 0
for i in range(len(s_)):
if s_[i] == "A":
cnt += 1
elif s_[i] == "D":
ans += cnt
else:
cnt = 0
print(ans)
# In[ ]:
|
s = input()
p = int(s)
x = 1
numbers = []
while (x <= p):
x *= 2
numbers.append(x)
if p == 1:
answer = 1
else:
y = numbers.pop()
answer = numbers.pop()
print(answer)
|
class Dice():
def __init__(self, nums):
self.nums = nums
self.top, self.front, self.right = 0, 1, 2
def move(self, op):
for c in op:
if c == 'N':
self.top, self.front = self.front, 5 - self.top
elif c == 'S':
self.top, self.front = 5 - self.front, self.top
elif c == 'E':
self.top, self.right = 5 - self.right, self.top
else:
self.top, self.right = self.right, 5 - self.top
dice = Dice([int(n) for n in input().split()])
dice.move(input())
print(dice.nums[dice.top])
|
number = input().split(" ")
X = int(number[0])
A = int(number[1])
if X >= A:
print(10)
else:
print(0)
|
s = input()
n = len(s)
# ๅ
จไฝใๅๆใใฉใใ
if s != s[::-1]:
print('No')
# 1ๆๅญ็ฎใใ(N-1)/2ๆๅญ็ฎใพใงใใใชใๆๅญๅใๅๆใใฉใใ
elif s[:(n-1)//2] != s[:(n-1)//2][::-1]:
print('No')
# Sใฎ(N+3)/2ๆๅญ็ฎใใNๆๅญ็ฎใพใงใใใชใๆๅญๅใๅๆใใฉใใ
elif s[(n+3)//2-1:] != s[(n+3)//2-1:][::-1]:
print('No')
else:
print('Yes')
|
# -*-coding:utf-8
lineNum = int(input())
for i in range(lineNum):
line = input()
tokens = list(map(int, line.strip().split()))
tokens.sort()
a, b, c = tokens[0], tokens[1], tokens[2]
if pow(a,2)+pow(b,2) == pow(c,2):
print('YES')
else:
print('NO')
|
def main():
n = int(input())
# t, a = map(int, input().split())
# h = list(map(int, input().split()))
# s = input()
if n == 25:
print("Christmas")
elif n== 24:
print("Christmas Eve")
elif n==23:
print("Christmas Eve Eve")
elif n==22:
print("Christmas Eve Eve Eve")
if __name__ == '__main__':
main()
|
def linearSearch(S,t):
L = S + [t]
i = 0
while L[i] != t: i += 1
if i == len(L)-1: return 0
else : return 1
if __name__=='__main__':
n=input()
S=input().split()
q=input()
T=input().split()
cnt = 0
for t in T: cnt += linearSearch(S,t)
print(cnt)
|
if __name__ == '__main__':
a = input()
b = input()
asort=''.join(sorted(a))
bsort=''.join(sorted(b,reverse=True))
if asort <bsort:
print("Yes")
else:
print("No")
|
a,b=raw_input().split()
if a== "H":
print b
elif a== "D" and b== "H":
b="D"
print b
elif a== "D" and b=="D":
b= "H"
print b
|
N = int(input())
A = list(map(int, input().split()))
even = []
approved = 0
for i in A:
if i % 2 == 0:
even.append(i)
for x in even:
if x % 3 == 0 or x % 5 == 0:
approved += 1
if approved == len(even):
print("APPROVED")
else:
print("DENIED")
|
def d(a):
return int(a)
N=int(input())
answer=""
for i in range(N):
if answer!="":
answer+="\n"
a=input().split()
a.sort(key=d)
if int(a[0])**2+int(a[1])**2==int(a[2])**2:
answer+="YES"
else:
answer+="NO"
print(answer)
|
s = input()
if 'A' in s and 'B' in s: print('Yes')
else: print('No')
|
s=str(input())
ac=s.count("a")
bc=s.count("b")
cc=s.count("c")
if len(s)==1:
print("YES")
exit()
if len(s)==2:
if max(ac,bc,cc)==2:
print("NO")
else:
print("YES")
exit()
if (len(s)+2)//3<max(ac,bc,cc):
print("NO")
else:
print("YES")
|
N = input()
sum_n = 0
for n in N:
num = int(n)
sum_n += num
if(sum_n % 9 == 0):
print("Yes")
else:
print("No")
|
def right(a,b,a1,a2,a3,a4,a5,a6):
b1=a6
b2=a5
b3=a4
b4=a3
b5=a2
b6=a1
if a>b:
tmp_a=a
a=b
b=tmp_a
if [a,b]==[a1,a2]:
right_side=[a3,b3]
elif [a,b]==[a1,a3]:
right_side=[a5,b5]
elif [a,b]==[a1,a4]:
right_side=[a2,b2]
elif [a,b]==[a1, a5]:
right_side=[a4,b4]
elif [a,b]==[a2, a3]:
right_side=[a1,b1]
elif [a, b]==[a2, a4]:
right_side=[a6,b6]
elif [a,b]==[a2,a6]:
right_side=[a3,b3]
elif [a,b]==[a3, a5]:
right_side=[a1,b1]
elif [a,b]==[a3, a6]:
right_side=[a5,b5]
elif [a, b]==[a4, a5]:
right_side=[a6,b6]
elif [a,b]==[a4,a6]:
right_side=[a2,b2]
elif [a,b]==[a5,a6]:
right_side=[a4,b4]
return right_side
initial=list( map(int,input().split()))
num_of_q=int(input())
for i in range(0, num_of_q):
a=list(map(int, input().split()))
flag=0
if a[0]>a[1]:
flag=1
answer=right(*a,*initial)
print(answer[flag])
|
# -*- coding: utf-8 -*-
def answer(s):
if s.endswith('s'):
print(s + 'es')
else:
print(s + 's')
answer(input())
|
# -*- coding: utf-8 -*-
import sys
import os
N = int(sys.stdin.readline())
lines = sys.stdin.readlines()
d = {}
for s in lines:
command, word = s.split()
if command == 'insert':
d[word] = True
elif command == 'find':
if word in d.keys():
print('yes')
else:
print('no')
|
x, a, b = (int(i) for i in input().split())
da = abs(x-a)
db = abs(x-b)
if da < db:
print('A')
else:
print('B')
|
def main():
N = input()
ans = "000"
if len(N) == 1:
ans = "ABC00" + N
elif len(N) == 2:
ans = "ABC0" + N
else:
ans = "ABC" + N
print(ans)
if __name__ == "__main__":
main()
|
s_list = input()
t_list = input()
n = len(s_list)
if s_list == t_list[:-1]:
print('Yes')
else:
print('No')
|
from collections import deque
line = input()
s1 = deque()
s2 = deque()
n = len(line)
total_area = 0
for i in range(n):
if line[i] == "\\":
s1.append(i)
elif line[i] == "/":
if s1: # if s1 is not empty
j = s1.pop()
area = i - j
total_area += area
if s2 and j < s2[-1][0]: # integrate the area of ponds
while s2 and j < s2[-1][0]:
pre_pond = s2.pop()[1]
area += pre_pond
s2.append([j,area])
print(total_area)
if total_area!=0:
print("{} ".format(len(s2)) + " ".join([str(x[1]) for x in s2]))
else:
print(0)
|
s = list(str(input()))
d = dict.fromkeys(s)
if len(s) == len(d):
print('yes')
else:
print('no')
|
s = input()
if s == s.upper():
print("A")
else:
print("a")
|
N = input()
tmp = 0
for s in N:
tmp += int(s)
if tmp%9 == 0:
print("Yes")
else:
print("No")
|
N = input()
if len(N)<=3:
print("ABC")
else:
print("ABD")
|
x = 0
while True:
x += 1
n = input()
if int(n) == 0:
break
print("Case " + str(x) + ": " + n)
|
class Process:
def __init__(self, data):
self.name = data[0]
self.time = int(data[1])
def process(self, quantum):
if self.time <= quantum:
time, self.time = self.time, 0
return time
self.time -= quantum
return quantum
def isProcessed(self):
return self.time == 0
def getName(self):
return self.name
def main():
n, q = map(int, input().split())
queue = []
for _ in range(n):
queue.append(Process(input().split()))
elapsed = 0
while len(queue) > 0:
p = queue.pop(0)
elapsed += p.process(q)
if p.isProcessed():
print('{} {}'.format(p.getName(), elapsed))
else:
queue.append(p)
if __name__ == '__main__':
main()
|
s=list(input())
t=list(input())
s.sort()
t.sort(reverse=True)
if s<t:print('Yes')
else:print('No')
|
# coding: utf-8
while True :
line = list( map(int, input().split(' ')))
line.sort()
if(line[0] == 0 and line[1] == 0) :
break;
print('{0} {1}'.format(line[0], line[1]))
|
#! python3
# stack.py
symbols = input().split(' ')
stack = []
def calc(op):
global stack
if op == '+':
return stack.pop()+stack.pop()
elif op == '-':
return -1 * stack.pop()+stack.pop()
elif op == '*':
return stack.pop()*stack.pop()
for s in symbols:
if s in ['+', '-', '*']:
stack.append(calc(s))
else:
stack.append(int(s))
print(stack.pop())
|
class Edge:
def __init__(self, from_node, to_node, weight):
self.from_node = from_node
self.to_node = to_node
self.weight = weight
def bellman_ford(N, edges, start, goal):
# Weight Maximization
MIN_INF = - 10**15
d = [MIN_INF for _ in range(N)]
d[start] = 0
for loop in range(N):
updated = False
goal_updated = False
for edge in edges:
new_d = edge.weight + d[edge.from_node]
if d[edge.to_node] < new_d:
d[edge.to_node] = new_d
updated = True
if edge.to_node == goal:
goal_updated = True
if not updated:
return d[goal]
if loop == N - 1:
if not goal_updated:
return d[goal]
# exists a positive loop which connected to the goal node.
return None
def main():
N, M = list(map(int, input().split(' ')))
edges = list()
for _ in range(M):
a, b, c = list(map(int, input().split(' ')))
from_node = a - 1
to_node = b - 1
weight = c
edges.append(Edge(from_node, to_node, weight))
start, goal = 0, N - 1
result = bellman_ford(N, edges, start, goal)
if result is None:
print('inf')
else:
print(result)
if __name__ == '__main__':
main()
|
#ๅ่ใซใใใ่งฃ็ญ
S = input()
i= 0
ans = 0
moji1 = ""
moji2 = ""
while i < len(S):
if i == 0:
moji1 = S[i]
ans += 1
else:
moji2 = moji2 + S[i]
if moji1 != moji2:
ans += 1
moji1 = moji2
moji2 = ""
else:
moji2 = moji2 + S[i]
i += 1
print(ans)
|
n = int(input())
k = int(input())
x = int(input())
y = int(input())
cost = 0
if n > k:
for i in range(k):
cost += x
for j in range(k, n):
cost += y
print(cost)
elif n <= k:
for i in range(n):
cost += x
print(cost)
|
s = int(input())
s = input().rstrip().split(' ')
result = 0
def half(num):
count = 0
while ((num % 2) == 0) :
num = num / 2
count += 1
return count
for num in s:
num = int(num)
count = half(num)
if not result:
result = count
if count == 0:
result = 0
break
if count < result:
result = count
print(result)
|
def main():
numbers = list(map(int, input().split()))
answer = 0
if numbers[0] == numbers[1]:
answer = numbers[2]
elif numbers[1] == numbers[2]:
answer = numbers[0]
else:
answer = numbers[1]
print(answer)
if __name__ == '__main__':
main()
|
a=int(input())
if a==1:
print("Hello World")
else:
b=[int(input()) for i in range(2)]
print(sum(b))
|
A = int(input())
B = int(input())
if (A > B):
print("GREATER")
elif (A < B):
print("LESS")
elif (A == B):
print("EQUAL")
|
s=input()
if len(s)&1:
print('No')
exit()
for i in list(s[i*2:i*2+2] for i in range(len(s)//2)):
if i!='hi':
print('No')
exit()
print('Yes')
|
S = input()
for i, s in enumerate(list(S), 1):
if (i % 2 == 0 and s == 'R') or (i % 2 == 1 and s == 'L'):
print('No')
break
else:
print('Yes')
|
def pretty_sequence(sequence):
n = len(sequence)
for i in range(n-1):
print(format(sequence[i]) + ' ', end='')
print(sequence[n - 1])
n = int(input())
sequence = [int(x) for x in input().split(' ')]
def selectionsort(seq, x):
count = 0
for i in range(x):
minj = i
for j in range(i, x):
if seq[j] < seq[minj]:
minj = j
if seq[i] != seq[minj]:
tmp_val = seq[i]
seq[i] = seq[minj]
seq[minj] = tmp_val
count += 1
return seq, count
sequence, count = selectionsort(sequence, n)
pretty_sequence(sequence)
print(count)
|
D = ['SAT', 'FRI', 'THU', 'WED', 'TUE', 'MON', 'SUN']
S = input()
for i, d in enumerate(D):
if d == S:
print(i+1)
exit()
|
nums = []
while True:
in_line = raw_input().split()
h = int(in_line[0])
w = int(in_line[1])
if h == 0 and w == 0:
break
else:
nums.append([h,w])
for num in nums:
for i in range(0,num[0]):
if i%2 == 0:
if num[1]%2 == 1:
print "#."*(num[1]/2) + "#"
else:
print "#."*(num[1]/2)
else:
if num[1]%2 == 1:
print ".#"*(num[1]/2) + "."
else:
print ".#"*(num[1]/2)
print ""
|
s = {'a': input(), 'b': input(), 'c': input()}
now = 'a'
while s[now] != '':
next = s[now][0]
s[now] = s[now][1:]
now = next
print(now.upper())
|
s = input()
ans = "Yes" if ((s[2] == s[3]) and (s[4] == s[5])) else "No"
print(ans)
|
# -*- coding: utf-8 -*-
"""
Created on Wed Sep 30 01:58:33 2020
@author: liang
"""
import math
x = int(input())
ans = x // 11 *2 + math.ceil(x%11/6)
print(ans)
|
s = input()
ans = ''
for si in s:
if si=='0': ans+='0'
elif si=='1': ans+='1'
else: ans=ans[:-1]
print(ans)
|
x = [input() for i in range(2)]
if x[0][0] == x[1][2] and x[0][1] == x[1][1] and x[1][0] == x[0][2]:
print('YES')
else:
print('NO')
|
a,b,c=(int(x) for x in input().split())
if ( a < c < b ) or ( a == b ==c ):
print('Yes')
else:
print('No')
|
N = int(input())
A = {a for a in input().split()}
if len(A) == N:
print("YES")
else:
print("NO")
|
a=input()
b=input()
l='123'
l=l.replace(a,'')
l=l.replace(b,'')
print(l)
|
def inverse_mod(a, mod=10**9+7):
""" Calculate inverse of the integer a modulo mod.
"""
return pow(a, mod-2, mod)
def combination_mod(n, r, mod=10**9+7):
""" Calculate nCr modulo mod.
"""
r = min(r, n-r)
numerator = denominator = 1
for i in range(r):
numerator = numerator * (n - i) % mod
denominator = denominator * (i + 1) % mod
return numerator * inverse_mod(denominator, mod) % mod
def create_inverses_table(n, mod=10**9+7):
""" Create table for inverses of the integers 0 to n modulo mod.
"""
inv_table = [0] + [1] * n
for x in range(2, n+1):
inv_table[x] = -(mod//x) * inv_table[mod % x] % mod
return inv_table
def solve():
n_blocks, n_colors, n_max_pairs = map(int, input().split())
if n_colors == 1:
return int(n_blocks - n_max_pairs == 1)
mod = 998244353
inverses = create_inverses_table(max(n_colors, n_max_pairs), mod)
e1 = n_colors * pow(n_colors-1, n_blocks-1, mod) % mod
e2 = 1
total = e1 * e2
for k in range(1, n_max_pairs+1):
e1 = e1 * inverses[n_colors - 1] % mod
e2 = e2 * (n_blocks - k) * inverses[k] % mod
total += e1 * e2
total %= mod
return total
def main():
print(solve())
if __name__ == "__main__":
main()
|
# -*- coding: utf-8 -*-
a, b = map(str, input().split())
print('H' if a == b else 'D')
|
word=input().rstrip()
flag=0
if word[2]==word[3]:
if word[4]==word[5]:
flag=1
if flag:
print("Yes")
else:
print("No")
|
a, b = [int(i) for i in input().split()]
if a > 0:
print("Positive")
elif a == 0:
print("Zero")
else:
if b >= 0:
print("Zero")
else:
if (b - a) % 2 == 0:
print("Negative")
else:
print("Positive")
|
mountain=[]
for s in range(0,10):
mountain.append(int(input()))
mountain.sort(reverse=True)
for s in range(0,3):
print(mountain[s])
|
S = input()
mod = 10**9 + 7
dic = {'': 1, 'A': 0, 'B': 0, 'C': 0}
for s in S:
if s == 'A':
dic[s] += dic['']
elif s == 'B':
dic[s] += dic['A']
elif s == 'C':
dic[s] += dic['B']
elif s == '?':
dic['C'] = dic['C'] * 3 + dic['B']
dic['B'] = dic['B'] * 3 + dic['A']
dic['A'] = dic['A'] * 3 + dic['']
dic[''] *= 3
dic[''] %= mod
dic['A'] %= mod
dic['B'] %= mod
dic['C'] %= mod
print(dic['C']%mod)
|
from collections import deque
s = deque(input())
cnt = 0
while len(s) > 1:
if s[0] == s[-1]:
s.pop()
s.popleft()
elif s[0] == "x" and s[-1] != "x":
s.append("x")
cnt += 1
elif s[0] != "x" and s[-1] == "x":
s.appendleft("x")
cnt += 1
else:
print(-1)
exit()
print(cnt)
|
a = input()
if a[0] == a[1] and a[0] == a[2]:
print('No')
else:
print('Yes')
|
a, b = map(int, input().split())
if a >= -1000 and b <= 1000:
if a < b:
print("a < b", end="\n")
elif a > b:
print("a > b", end="\n")
elif a == b:
print("a == b", end="\n")
|
import sys
keyword = input().lower()
count = 0
for line in sys.stdin:
count += sum([1 for word in line.lower().split() if word == keyword])
print(count)
|
l= list(map(int, input().split()))
if l[0]*l[1]%2 ==0:
print("Even")
else:
print("Odd")
|
N = int(raw_input())
taro_point = 0
hanako_point = 0
for n in range(N):
str_card = raw_input().split()
if str_card[0] > str_card[1]:
taro_point += 3
elif str_card[0] < str_card[1]:
hanako_point += 3
else:
taro_point += 1
hanako_point += 1
print '%d %d' % (taro_point, hanako_point)
|
n=int(input())
a=0
m=n
if n==0:
print("No")
else:
while n>0:
a=a+n%10
n=n//10
if m%a==0:
print("Yes")
else:
print("No")
|
S = input()
for k in range(1,len(S)):
if S[k-1:k+1] == "AC":
print("Yes")
exit(0)
print("No")
|
def merge(targ,first,mid,last):
left = targ[first:mid] + [10 ** 9 + 1]
right = targ[mid:last] + [10 ** 9 + 1]
leftcnt = rightcnt = 0
global ans
for i in range(first,last):
ans += 1
#print(left,right,left[leftcnt],right[rightcnt],targ,ans)
if left[leftcnt] <= right[rightcnt]:
targ[i] = left[leftcnt]
leftcnt += 1
else:
targ[i] = right[rightcnt]
rightcnt += 1
def mergesort(targ,first,last):
if first +1 >= last:
pass
else:
mid = (first + last) // 2
mergesort(targ,first,mid)
mergesort(targ,mid,last)
merge(targ,first,mid,last)
ans = 0
num = int(input())
targ = [int(n) for n in input().split(' ')]
mergesort(targ,0,num)
print(" ".join([str(n) for n in targ]))
print(ans)
|
x=int(input())
if x == 3:
print("YES")
elif x == 5:
print("YES")
elif x == 7:
print("YES")
else:
print("NO")
|
a=int(input())
if a%2==0:
ans=int((a/2)**2)
else:
ans=int(((a-1)/2)*((a+1)/2))
print(ans)
|
def main():
S = list(str(input()))
N = len(S)
for i in range(N):
if S[i] == '7':
print('Yes')
return
print('No')
main()
|
s = input()
for w in s:
cnt = s.count(w)
if cnt > 1:
ans = 'no'
break
else:
ans = 'yes'
print(ans)
|
class Node(object):
def __init__(self, num, prev = None, nxt = None):
self.num = num;
self.prev = prev;
self.nxt = nxt;
class Double_Linked_List(object):
def __init__(self):
self.first = self.last = None;
def insert(self, num):
node = Node(num);
if self.first is not None:
self.first.prev = node;
node.nxt = self.first;
self.first = node;
else:
self.first = node;
self.last = node;
def delete(self, num):
current = self.first;
while current is not None:
if current.num == num:
prev = current.prev;
nxt = current.nxt;
if prev is not None:
current.prev = None;
prev.nxt = nxt;
if nxt is not None:
current.nxt = None;
nxt.prev = prev;
if nxt is None:
self.last = prev;
if prev is None:
self.first = nxt;
break;
else:
current = current.nxt;
def delete_first(self):
if self.first is not None:
nxt = self.first.nxt;
if nxt is not None:
self.first.nxt = None;
nxt.prev = None;
self.first = nxt;
else:
self.first = None;
self.last = None;
def delete_last(self):
if self.last is not None:
prev = self.last.prev;
if prev is not None:
self.last.prev = None;
prev.nxt = None;
self.last = prev;
else:
self.first = None;
self.last = None;
def get_content(self):
ret = [];
append = ret.append;
current = self.first;
while current is not None:
append(current.num);
current = current.nxt;
return " ".join(ret);
def main():
from sys import stdin
double_linked_list = Double_Linked_List();
count = int(input());
delete_first = double_linked_list.delete_first;
delete_last = double_linked_list.delete_last;
delete = double_linked_list.delete;
insert = double_linked_list.insert;
for i in range(count):
command = stdin.readline().strip().split();
if command[0] == "insert":
insert(command[1]);
if command[0] == "delete":
delete(command[1]);
elif command[0] == "deleteFirst":
delete_first();
elif command[0] == "deleteLast":
delete_last();
print(double_linked_list.get_content());
main();
|
a, b = (int(x) for x in input().split())
print("%d %d" % (int(a/b), a % b), "{:.5f}".format(a/b))
|
import math
n = int(input())
gcd = math.gcd(2, n)
lcm = 2 * n // gcd
print(lcm)
|
num = input().split()
if int(num[1]) >= int(num[0]):
print(num[0])
else:
print(int(num[0])-1)
|
S=str(input())
cnt=0
for i in range(2,len(S)-1):
if S[i] =='C':
cnt+=1
if cnt==1:
if S[0]=='A':
T = S.replace("C","").replace("A","")
if T.islower():
print("AC")
exit()
print("WA")
|
class SimpleCalculator:
def calc(self, a, op, b):
if op == '+':
print a + b
elif op == '-':
print a - b
elif op == '*':
print a * b
elif op == '/':
print a / b
if __name__ == "__main__":
sc = SimpleCalculator()
while True:
a, op, b = map(str, raw_input().split())
if op == "?":
break
sc.calc(int(a), op, int(b))
|
n = int(input())
#n = int(lines.pop())
dictionary = dict()
for i in range(n):
command,data = input().split()
#command,data = lines.pop().split()
if command == 'insert':
dictionary[data] = 1
else:
if data in dictionary:
print('yes')
else:
print('no')
|
X = int(input())
# print('YES' if X == 7 or X == 5 or X == 3 else 'NO')
print(['NO', 'YES'][[7, 5, 3].count(X)])
|
S = input()
x = S.count('x')
if x>=8:
ans ='NO'
else:
ans ='YES'
print(ans)
|
x, a, b = map(lambda x: int(x), input().split())
if b <= a:
print('delicious')
elif x >= b - a:
print('safe')
else:
print('dangerous')
|
n = int(input())
k = int(input())
x = int(input())
y = int(input())
price = 0
for i in range(1,n+1):
if i < k+1:
price += x
else:
price += y
print(price)
|
import math
from decimal import Decimal
A,B,X = map(Decimal, input().split())
s = X / A
if s == A*B:
print(0)
exit()
if s > A * B / 2:
Bu = 2 * s / A - B
s -= A*Bu
B -= Bu
A2 = 2 * s / B
print(math.degrees(math.atan(B/(A2))))
|
S = input()
T = input()
ans = "No"
if "".join(sorted(S)) < "".join(sorted(T, reverse=True)):
ans = "Yes"
print(ans)
|
def main():
n = input()
F = [0]*(n+1)
number = fibonacci(n,F)
print number
def fibonacci(n,F):
if n == 0 or n == 1:
F[n] = 1
return 1
if F[n] != 0:
return F[n]
else:
F[n] = fibonacci(n-2,F)+fibonacci(n-1,F)
return F[n]
if __name__ == "__main__":
main()
|
n=int(input())
if n>=3:
print(n//3)
else:
print(0)
|
def myAnswer(S:str) -> str:
if(S == "keyence"):return "YES"
for i in range(len(S)-1):
for j in range(i+1,len(S)):
if(S[:i]+S[j:] == "keyence"):
return "YES"
return "NO"
def modelAnswer():
return
def main():
S = (input())
print(myAnswer(S))
if __name__ == '__main__':
main()
|
A=input()
B=input()
flag="EQUAL"
if len(A)!=len(B):
if(len(A)>len(B)):
print("GREATER")
else:
print("LESS")
else:
for i in range(len(A)):
if A[i] > B[i]:
flag="GREATER"
break
elif A[i] < B[i]:
flag="LESS"
break
print(flag)
|
S = input()
Ss = '{}s'.format(S) if not S.endswith('s') else '{}es'.format(S)
print(Ss)
|
def main():
s1,s2,s3 = map(str,input().split())
ans = False
if s1[len(s1)-1] == s2[0]:
if s2[len(s2)-1]==s3[0]:
ans = True
print("YES" if ans else "NO")
if __name__ == '__main__':
main()
|
l1 = input('').split()
a = int(l1[0])
b = int(l1[1])
c = int(l1[2])
if (a+b)>= c:
print('Yes')
else:
print('No')
|
def main():
S = input()
L = len(S)
def check(s):
return s == s[::-1]
cond = check(S)
cond = cond and check(S[:L // 2])
cond = cond and check(S[(L + 1) // 2:])
print('Yes' if cond else 'No')
if __name__ == '__main__':
main()
|
n = str(input())
dic = {"SUN":7,
"MON":6,
"TUE":5,
"WED":4,
"THU":3,
"FRI":2,
"SAT":1}
print(dic[str(n)])
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.