text
stringlengths 37
1.41M
|
|---|
def merge(a, left, mid, right):
""" merge list a[left:mid] and a[mid:right], assuming the lists is sorted
"""
global cnt
inf = 10 ** 9
left_a = a[left:mid] + [inf]
right_a = a[mid:right] + [inf]
i, j = 0, 0
for k in range(left, right):
if left_a[i] <= right_a[j]:
a[k] = left_a[i]
i += 1
else:
a[k] = right_a[j]
j += 1
cnt += 1
def merge_sort(a, left, right):
""" split list a[left:right-1] into two lists and merge
"""
if left + 1 < right:
mid = (left + right)//2
merge_sort(a, left, mid)
merge_sort(a, mid, right)
merge(a, left, mid, right)
n = int(input())
a = list(map(int, input().split()))
cnt = 0
merge_sort(a, 0, n)
print(' '.join(str(n) for n in a))
print(cnt)
|
s = list(input())
t = list(input())
s.sort()
t.sort(reverse=True)
l = [''.join(s),''.join(t)]
if l == sorted(l) and l[0]!=l[1]:
print('Yes')
else:
print('No') |
if __name__ == "__main__":
A, B = list(map(int, input().split()))
num_of_tap = 0
num_of_hole = 1
while(num_of_hole < B):
num_of_tap += 1
num_of_hole = (A-1)*(num_of_tap-1) + A
print(num_of_tap) |
def rating_goal(R: float, G: float)->float:
return 2*G - R
if __name__ == "__main__":
R = int(input())
G = int(input())
ans = rating_goal(R, G)
print(ans)
|
n = input()
number = ''
for i in n:
# print(f"i = {i}")
if i == '1':
i = '9'
elif i == '9':
i = '1'
number += i
print(int(number))
|
line=input().split()
x=int(line[0])
y=int(line[1])
def gcd(x,y):
r=x%y
while(r>0):
x=y
y=r
r=x%y
return y
print (gcd(x,y))
|
import fileinput
for line in fileinput.input():
tokens = list(map(int, line.strip().split()))
a, b, c = tokens[0], tokens[1], tokens[2]
if a < b and b < c:
print("Yes")
else:
print("No") |
def insertionSort(*args):
l = list(args)
print ' '.join(map(str, l))
for i in range(1, n):
v = l[i]
j = i - 1
while j >= 0 and l[j] > v:
l[j + 1] = l[j]
j -= 1
l[j + 1] = v
print ' '.join(map(str, l))
n = input()
l = map(int, raw_input().split())
insertionSort(*l) |
def multi(a,b):
return a * b
if __name__ == "__main__":
a,b = input().split(" ")
a = int(a)
b = int(b)
print(multi(a,b)) |
s = str(input())
C = 0
F = 0
for i in s:
if C == 0 and i == 'C':
C = 1
elif C == 1 and i == 'F':
F = 1
if F == 1:
print('Yes')
else:
print('No') |
def grouping_2(N: int)->int:
return N // 3
if __name__ == "__main__":
N = int(input())
ans = grouping_2(N)
print(ans)
|
#!/usr/bin/env python3
# https://atcoder.jp/contests/abc130/tasks/abc130_a
x, a = [int(x) for x in input().split()]
print(0) if x < a else print(10)
|
x=int(input())
if x>=1200:
ans="ARC"
else:
ans="ABC"
print(ans)
|
s=input()
if s[0]==s[1] and s[1] !=s[2] and s[2]==s[3]:
print("Yes")
elif s[0]!=s[1] and s[1] == s[2] and s[0]==s[3]:
print("Yes")
elif s[0]!=s[1] and s[0] == s[2] and s[1]==s[3]:
print("Yes")
else:
print("No") |
s = input()
n = len(s)
front = (n-1) // 2
rear = (n+2) // 2
sf = s[:front]
sr = s[rear:]
srev = s[::-1]
sfrev = sf[::-1]
srrev = sr[::-1]
if sfrev == sf and srrev == sr and srev == s:
print('Yes')
else:
print('No') |
N = int(input())
one = 1
two = 1
for _ in range(1, N):
three = one + two
one, two = two, three
print(two)
|
while True:
n = int(input())
if n == 0:
break
scr = list(map(int, input().split()))
avg = sum(scr) / n
v = 0
for scri in scr:
v += ((scri - avg) ** 2 ) / n
a = v ** 0.5
print(a)
|
from math import *
a, b, h, m = [int(_) for _ in input().split()]
print((a**2 + b**2 - 2*a*b * cos(radians(h*330 + m*5.5))) ** 0.5) |
class dice:
directions = ['S', 'E', 'N', 'W']
def __init__(self, strlabels):
label = strlabels.split()
self.top = label[0]
self.side = label[1:5]
self.side[2], self.side[3] = self.side[3], self.side[2]
self.down = label[5]
#print(self.top, self.side, self.down)
def roll(self, direction):
tmp = self.top
self.top = self.side[(self.directions.index(direction)+2)%4]
self.side[(self.directions.index(direction)+2)%4] = self.down
self.down = self.side[self.directions.index(direction)]
self.side[self.directions.index(direction)] = tmp
#print(self.top, self.side, self.down)
def pFace(self, initial):
if initial == 'u':
print(self.top)
elif initial == 'd':
print(self.down)
else:
print(self.side[directions.index(direction)])
dice1 = dice(input())
for direction in input():
dice1.roll(direction)
dice1.pFace('u') |
T = list(input())
tlen = len(T)
for i in range(0, tlen):
if T[i] == '?':
T[i] = 'D'
print(*T,sep='') |
a,b,c,d=map(int,input().split())
A=a*b
B=c*d
if A>=B:
print(A)
elif A<B:
print(B)
|
def is_ok(arg):
# 条件を満たすかどうか？問題ごとに定義
c = 0
for x in a:
c += -(-x//arg) - 1
return c <= k
def meguru_bisect(ng, ok):
while (abs(ok - ng) > 1):
mid = (ok + ng) // 2
if is_ok(mid):
ok = mid
else:
ng = mid
return ok
n,k = map(int,input().split())
a = list(map(int,input().split()))
print(meguru_bisect(0,10**9+1)) |
h = int(input())
cnt = 0
num = 1
while h > 0:
cnt += num
h = h // 2
num *= 2
print(cnt) |
def replacing_integer():
# 入力
N, K = map(int, input().split())
# 処理
now_num = N % K
while True:
if abs(now_num - K) <= now_num:
now_num = abs(now_num - K)
else:
return now_num
result = replacing_integer()
print(result) |
# encoding: utf-8
import sys
from collections import deque
class Solution:
@staticmethod
def doubly_linked_list():
# write your code here
array_length = int(input())
task_deque = deque()
_input = sys.stdin.readlines()
for i in range(array_length):
l_arg = _input[i].split()
action = l_arg[0]
if len(l_arg) > 1:
value = l_arg[-1]
# print(action, 'v', value)
if action == 'insert':
task_deque.appendleft(value)
elif action == 'deleteFirst':
task_deque.popleft()
elif action == 'deleteLast':
task_deque.pop()
elif action == 'delete':
try:
task_deque.remove(value)
except Exception as e:
pass
print(" ".join(task_deque))
if __name__ == '__main__':
solution = Solution()
solution.doubly_linked_list() |
# coding: utf-8
# Here your code !
ret = []
for i in range(10):
ret.append(int(input()))
ret.sort()
print(ret[-1])
print(ret[-2])
print(ret[-3]) |
s = input()
res = ''
for i, elem in enumerate(s):
if i % 2 == 0:
res += elem
print(res) |
# Written by Shagoto
s = input()
i = 0
check = True
while(i < len(s)):
if(i % 2 == 0 and s[i] == "L"):
check = False
break
elif(i % 2 == 1 and s[i] == "R"):
check = False
break
i += 1
if(check):
print("Yes")
else:
print("No") |
s=str(input())
temp=0
for i in range(len(s)):
if s[i]=="A" and i<=len(s)-2:
if s[i+1]=="C":
temp=1
if temp==1:
print("Yes")
else:
print("No") |
import sys
def gcd(a,b):
if a==b:
return a
while(b>0):
a,b = b,a%b
if b==0:
return a
def lcm(a,b):
n=1
m=1
while(n*a!=m*b):
if n*a>m*b:
m+=1
elif n*a<m*b:
n+=1
return n*a
lines = sys.stdin.readlines()
for line in lines:
line = line.split(" ")
inp = []
for i in line:
inp.append(int(i))
inp.sort()
a = inp[0]
b = inp[1]
print("%d %d" % (gcd(a,b),lcm(a,b))) |
A = input()
# 文字列において、全ての文字が大文字かどうか判定するには str.isupper()
# 文字列において、全ての文字が小文字かどうか判定するには str.islower()
ans = ''
if A.isupper(): ans = 'A'
else: ans = 'a'
print(ans) |
x=int(input())
n=x//11
x=x-11*n
if x==0:
print(2*n)
elif 1<=x<=6:
print(1+2*n)
else:
print(2+2*n)
|
#!/usr/bin/env python3
import sys
MOD = 1000000007 # type: int
class Factorial:
def __init__(self,MOD):
self.MOD = MOD
self.factorials = [1,1] # 階乗を求めるためのキャッシュ
self.invModulos = [0,1] # n^-1のキャッシュ
self.invFactorial_ = [1,1] # (n^-1)!のキャッシュ
def calc(self,n):
if n <= -1:
print("Invalid argument to calculate n!")
print("n must be non-negative value. But the argument was " + str(n))
exit()
if n < len(self.factorials):
return self.factorials[n]
nextArr = [0]*(n+1-len(self.factorials))
initialI = len(self.factorials)
prev = self.factorials[-1]
m = self.MOD
for i in range(initialI,n+1):
prev = nextArr[i-initialI] = prev * i%m
self.factorials += nextArr
return self.factorials[n]
def inv(self,n):
if n <= -1:
print("Invalid argument to calculate n^(-1)")
print("n must be non-negative value. But the argument was " + str(n))
exit()
p = self.MOD
pi = n%p
if pi < len(self.invModulos):
return self.invModulos[pi]
nextArr = [0]*(n+1-len(self.invModulos))
initialI = len(self.invModulos)
for i in range(initialI,min(p,n+1)):
next = -self.invModulos[p%i]*(p//i)%p
self.invModulos.append(next)
return self.invModulos[pi]
def invFactorial(self,n):
if n <= -1:
print("Invalid argument to calculate (n^(-1))!")
print("n must be non-negative value. But the argument was " + str(n))
exit()
if n < len(self.invFactorial_):
return self.invFactorial_[n]
self.inv(n) # To make sure already calculated n^-1
nextArr = [0]*(n+1-len(self.invFactorial_))
initialI = len(self.invFactorial_)
prev = self.invFactorial_[-1]
p = self.MOD
for i in range(initialI,n+1):
prev = nextArr[i-initialI] = (prev * self.invModulos[i%p])%p
self.invFactorial_ += nextArr
return self.invFactorial_[n]
class Combination:
def __init__(self,MOD):
self.MOD = MOD
self.factorial = Factorial(MOD)
def choose_k_from_n(self,n,k):
if k < 0 or n < k:
return 0
k = min(k,n-k)
f = self.factorial
return f.calc(n)*f.invFactorial(max(n-k,k))*f.invFactorial(min(k,n-k))%self.MOD
def solve(n: int, k: int):
c = Combination(MOD)
sum = 0
for i in range(min(n,k+1)-1,-1,-1):
c1 = c.choose_k_from_n(n,i)
c2 = c.choose_k_from_n(n-1,i)
sum = (sum + c1*c2)%MOD
print(sum)
return
# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
n = int(next(tokens)) # type: int
k = int(next(tokens)) # type: int
solve(n, k)
if __name__ == '__main__':
main()
|
l=input().split()
r=''
for i in l:
r+=i[0].upper()
print(r)
|
A=[]
S=input()
if len(S)==3:
for i in S[::-1]:
A.append(i)
print("{}{}{}".format(A[0],A[1],A[2]))
else:
print(S) |
#!/usr/bin/env python3
n = int(input())
print(int((n - 1) / 2) if n % 2 == 1 else int(n / 2) - 1)
|
if __name__ == "__main__":
nums =map( int, raw_input().split())
if nums[0] < nums[1]:
if nums[1] < nums[2]:
print "Yes"
else:
print "No"
else:
print "No" |
#coding:utf-8
def cal(a, b, op):
if op=="+":
return a + b
elif op == "-":
return a - b
elif op == "*":
return a * b
elif op == "/":
return a//b
else:
return -1
while True:
buff = input().split()
a = int(buff[0])
b = int(buff[2])
op = buff[1]
if op == "?":
break
print(cal(a, b, op)) |
import sys
input = lambda: sys.stdin.readline().rstrip()
X = int(input())
if X == 7 or X == 5 or X == 3:
print('YES')
else:
print('NO') |
S=list(input())
S[3]="8"
print(*S,sep="")
|
N = int(input())
for i in [2**x for x in range(0, 9)]:
if i <= N:
r = i
print(r)
|
N = int(input())
print(0)
s = input()
if s=="Vacant":
exit()
left=0
right=N
l_state = r_state = s
while True:
center = (left+right)//2
print(center)
s = input()
if s == "Vacant":
exit()
if ((center-left)%2) ^ (s!=l_state):
right = center
r_state = s
else:
left = center
l_state = s
|
s = input()
t = input()
x = []
y = []
for i in range(len(s)):
if s[i] not in x:
x.append(s[i])
if t[i] not in y:
y.append(t[i])
for i in range(len(x)):
s = s.replace(x[i], str(i))
for i in range(len(y)):
t = t.replace(y[i], str(i))
if s == t:
print("Yes")
else:
print("No") |
N, A, B, C, D = map(int, input().split())
S = input()
if C < D:
if "##" in S[A - 1:C] or "##" in S[B - 1:D]:
print("No")
else:
print("Yes")
else:
if "..." in S[B - 2:D + 1] and "##" not in S[A - 1:C] and "##" not in S[B - 1:D]:
print("Yes")
else:
print("No")
|
cnt = 0
n = int(input())
S = list(map(int, input().split()))
def mergeSort(S, left, right):
if left+1 < right:
mid = (left + right) // 2
mergeSort(S, left, mid)
mergeSort(S, mid, right)
merge(S, left, mid, right)
def merge(S, left, mid, right):
L = S[left:mid] + [10**10]
R = S[mid:right] + [10**10]
i,j = 0,0
global cnt
for k in range(left, right):
cnt += 1
if L[i] <= R[j]:
S[k] = L[i]
i += 1
else:
S[k] = R[j]
j += 1
mergeSort(S, 0, len(S))
print (' '.join(map(str,S)))
print (cnt)
|
S = input().split()
print('YES' if S[0][-1] == S[1][0] and S[1][-1] == S[2][0] else 'NO') |
for i in range(3000):
a = input().split()
x = int(a[0])
y = int(a[1])
if x + y == 0:
break
elif x < y:
print(x,y)
elif y < x:
print(y,x)
else:
print(x,y)
|
str = list(input())
for _ in range(int(input())):
cmd = input().split()
a, b = map(int, cmd[1:3])
if cmd[0] == 'print':
for i in range(a, b + 1):
print(str[i], end='')
print('')
if cmd[0] == 'reverse':
str = str[:a] + list(reversed(str[a:b + 1])) + str[b + 1:]
if cmd[0] == 'replace':
p = cmd[3]
str = str[:a] + list(p) + str[b + 1:] |
S=input()
chk = [False, False, False]
if S[0]=="A":
chk[0]=True
ind = 0
for i in range(2, len(S)-1):
if S[i]=="C":
chk[1]=True
ind=i
chk[2]=True
for i in range(len(S)):
if i==ind or i==0:
continue
if S[i].isupper():
chk[2]=False
if chk[0] and chk[1] and chk[2]:
print("AC")
else:
print("WA") |
def merge(A, left, mid, right):
inf = float('inf')
L = A[left:mid]+[inf]
R = A[mid:right] + [inf]
i = j = 0
for k in range(left,right):
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
return right - left
def mergeSort(A, left, right, count = 0):
if left+1 < right:
mid = (left + right)//2
count = mergeSort(A, left, mid, count)
count = mergeSort(A, mid, right, count)
count += merge(A, left, mid, right)
return count
n = int(input())
A = list(map(int, input().split()))
ans = mergeSort(A, 0, n)
s = list(map(str, A))
print(' '.join(s))
print(ans)
|
from collections import defaultdict
def readInt():
return int(input())
def readInts():
return list(map(int, input().split()))
def readChar():
return input()
def readChars():
return input().split()
n = readInt()
a = 1
for i in range(2,n+1):
a = (a*i)%(10**9+7)
print(a) |
X = int(input())
if X >= 2000:
print(1)
elif X < 100:
print(0)
else:
limit, mods = divmod(X, 100)
if mods / limit <= 5:
print(1)
else:
print(0) |
n = int(input())
s = input()
t = s[:len(s)//2]
if 2*t == s:
print("Yes")
else:
print("No") |
X = input()
N = len(X)
stack = []
for x in X:
if x == "S":
stack.append(x)
else:
if len(stack) == 0 or stack[-1] == "T":
stack.append(x)
else:
stack.pop()
print(len(stack)) |
X = int(input())
ans = 'YES' if X == 3 or X == 5 or X == 7 else 'NO'
print(ans) |
l = list(list(input()) for _ in range(3))
ans = ''
for i in range(3):
ans += l[i][i]
print(ans) |
n = int(input())
word_list = []
flag = True
for i in range(n):
word = input()
if word_list == []:
word_list.append(word)
else:
if (word_list[-1][-1] == word[0]) and (word not in word_list):
word_list.append(word)
else:
flag = False
break
if flag:
print('Yes')
else:
print('No') |
#!/usr/bin/env python3
import sys
try:
from typing import List
except ImportError:
pass
def solve(H: int, W: int, a: "List[List[int]]"):
ans = [] # type: List[List[int]]
p = 0
for i in range(H):
if i % 2 == 0:
js = range(W)
else:
js = reversed(range(W))
for j in js:
if a[i][j] % 2 == 1:
p ^= 1
nexti = i
nextj = j + (1 if i % 2 == 0 else -1)
if nextj == -1:
nexti += 1
nextj = 0
elif nextj == W:
nexti += 1
nextj = W - 1
if p:
ans.append([i, j, nexti, nextj])
if p:
del ans[-1]
print(len(ans))
for i, j, nexti, nextj in ans:
print(i + 1, j + 1, nexti + 1, nextj + 1)
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
H = int(next(tokens)) # type: int
W = int(next(tokens)) # type: int
a = [[int(next(tokens)) for _ in range(W)] for _ in range(H)] # type: "List[List[int]]"
solve(H, W, a)
if __name__ == '__main__':
main()
|
import math
r = float(input())
print("%.10f %.10f"%(r*r*math.pi, 2*r*math.pi))
|
import math
r = int(input())
pi = int(math.pi)
a = (pi * (r)**2)
ans = a / pi
print(int(ans))
|
p = int(input())
c1 = int(input())
change = p % 500
if (change == 0) or (c1 > change):
print("Yes")
else:
print("No") |
A,B = map(str,input().split())
dic = {'A':1,'B':2,'C':3,'D':4,'E':5,'F':6}
An = dic[A]
Bn = dic[B]
if An == Bn:
print('=')
if An < Bn:
print('<')
if An > Bn:
print('>') |
N = input()
ints = (i for i in map(int, input().split()) if i % 2 == 0)
ints = (i % 3 == 0 or i % 5 == 0 for i in ints)
print('APPROVED' if all(ints) else 'DENIED') |
S = input()
n = len(S)
for i in range(n-1):
if S[i:i+2] == "AC":
print("Yes")
exit()
print("No") |
def is_prime(x):
if x < 2:
return False
i = 2
while i * i <= x:
if x % i == 0:
return False
i += 1
return True
upper = 55555
count = {i: [] for i in range(5)}
for i in range(2, upper + 1):
if is_prime(i):
count[i % 5].append(i)
N = int(input())
ans = count[1][:N]
print(' '.join([str(a) for a in ans])) |
while True:
x=input()
if x=="0":
break
cnt = 0
for i in x:
num = int(i)
cnt += num
print(cnt) |
dic = {}
for i in range(int(input())):
cmd, arg = input().split()
if cmd == "insert":
dic[arg] = 0
else:
if arg in dic:
print("yes")
else:
print("no") |
N,A,B,C = int(input()), input(), input(), input()
ans = 0
for a,b,c in zip(A,B,C):
if a == b and b ==c: continue
elif a==b or b==c or c==a: ans += 1
elif a != b and b != c and c != a: ans += 2
print(ans) |
A, B, C = map(int, input().split())
if A+B == C or A+C == B or A == B+C:
print('Yes')
else:
print('No') |
import math
a,b,x = map(int, input().split())
x = x/a
if a*b>x*2:
print(90-math.degrees(math.atan(2*x/b**2)))
if a*b<x*2:
d = a*b-x
print(math.degrees(math.atan(2*d/a**2)))
if a*b == x*2:
print(45) |
if __name__ == "__main__":
n = int(input())
taro, hanako = 0, 0
for _ in range(n):
tw, hw = input().split()
if tw > hw:
taro += 3
elif tw < hw:
hanako += 3
else:
taro += 1
hanako += 1
print(taro, hanako) |
#!/usr/bin/env python3
import sys
import bisect
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
def solve(N: int):
tokens = iterate_tokens()
colors_top = []
for i in range(N):
new = int(next(tokens))
if colors_top:
b = bisect.bisect_right(colors_top, -new)
if b == len(colors_top):
colors_top.append(-new)
else:
colors_top[b] = -new
else:
colors_top.append(-new)
print(len(colors_top))
return
# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
solve(N)
if __name__ == '__main__':
main()
|
from math import gcd
def lcm(a, b):
return a * b // gcd(a, b)
A, B = map(int, input().split())
print(lcm(A, B)) |
n = input()
n = n.replace('9', 'x').replace('1', '9').replace('x', '1')
print(n)
'''
n = list(input())
for i in range(3):
if n[i] == '1':
n[i] = '9'
elif n[i] == '9':
n[i] = '1'
print("".join(n))
'''
|
import math
a, b, x = map(float, input().split())
vol = a * a * b
if x <= vol/2:
height = (x * 2.0) / (b * a)
ans = math.atan(b / height) * 180 / math.pi
else:
height = ((vol - x) * 2.0) / (a * a)
ans = math.atan(height / a) * 180 / math.pi
print(ans) |
def check(ar):
h = 0
for bottom, up in ar:
if h + bottom < 0:
return False
h += up
return True
if __name__ == "__main__":
N = int(input())
pos = []
neg = []
equal = 0
for _ in range(N):
cnt = 0
bottom = 0
for s in input():
if s == "(":
cnt += 1
else:
cnt -= 1
bottom = min(bottom, cnt)
equal += cnt
if cnt >= 0:
pos.append((bottom, cnt))
else:
cnt = -cnt
bottom += cnt
neg.append((bottom, cnt))
pos.sort(reverse=True)
neg.sort(reverse=True)
if check(pos) and check(neg) and equal == 0:
print("Yes")
else:
print("No") |
n=int(input())
if n % 2 == 0:
temp = int(n/2)
print(temp ** 2)
else:
temp = n//2
print(temp*(temp+1)) |
#前回のコンテスト名を入力
last_contest = input()
#ABCだったらARC、そうでなかったらABC
if last_contest == "ABC":
print("ARC")
else:
print("ABC")
|
import sys
# \n
def input():
return sys.stdin.readline().rstrip()
def main():
N=int(input())
A=list(map(int,input().split()))
AS =sorted(A)
right = AS[N//2]
left = AS[N//2 -1]
for a in A:
if a<=left:
print(right)
else:
print(left)
if __name__ == "__main__":
main()
|
n=int(input())
ans="second"
for i in range(n):
if int(input())%2:ans="first"
print(ans) |
import numpy
a, b, x = map(int, input().split())
if a * b / 2 < x / a:
theta = numpy.arctan(2 * (b / a - x / a ** 3))
else:
theta = numpy.arctan(a * b ** 2 / 2 / x)
theta = numpy.rad2deg(theta)
print(theta)
|
def check():
A = list(map(int, input().split()))
if A.count(5)!=2 or A.count(7)!=1:
return 'NO'
return 'YES'
print(check()) |
def ask(q):
print(q, flush=True)
inp = input()
if inp == "Vacant":
exit()
return inp
n = int(input())
l = ask(0)
r = ask(n-1)
left = 0
right = n-1
for _ in range(18):
mid = (right + left) // 2
m = ask(mid)
if l == m and (mid - left) % 2 == 1:
right = mid
r = m
elif l != m and (mid - left) % 2 == 0:
right = mid
r = m
else:
left = mid
l = m
|
#!/usr/bin/env python3
n = int(input())
n /= 3
print(n**3) |
import sys
def gcd(a, b):
if b == 0:
return a
return gcd(b, a % b)
for line in sys.stdin.readlines():
a, b = map(int, line.split())
print(gcd(a, b), a * b // gcd(a, b)) |
# coding: utf-8
import sys
def main(argv=sys.argv):
a = int(input())
b = int(input())
h = int(input())
print((a + b) * h // 2)
return 0
if __name__ == '__main__':
sys.exit(main()) |
x = int(input())
while x:
s = 0
while x:
s += x%10
x//=10
print (s)
x = int(input()) |
while True:
y,x=map(int, input().split())
if x==y==0: break
print(('#'*x+'\n')*y) |
S=input()
n="N" in S
w="W" in S
e="E" in S
s="S" in S
if (n == s) and (e == w):
print("Yes")
else:
print("No")
|
class Point:
def __init__(self, x, y):
super().__init__()
self.x = x
self.y = y
def solve(p1, p2):
s_x = p1.x + (p2.x - p1.x) * (1/3)
s_y = p1.y + (p2.y - p1.y) * (1/3)
t_x = p1.x + (p2.x - p1.x) * (2/3)
t_y = p1.y + (p2.y - p1.y) * (2/3)
u_x = (p2.x + p1.x) * (1/2) + (p1.y - p2.y) * (1/6) * pow(3, 1/2)
u_y = (p2.y + p1.y) * (1/2) + (p2.x - p1.x) * (1/6) * pow(3, 1/2)
s = Point(s_x, s_y)
t = Point(t_x, t_y)
u = Point(u_x, u_y)
return [s, u, t]
if __name__ == "__main__":
n = int(input())
P = [Point(0, 0), Point(100, 0)]
for i in range(n):
TMP = []
for j in range(len(P) - 1):
TMP.append(P[j])
TMP += solve(P[j], P[j+1])
TMP.append(P[-1])
P = TMP
for p in P:
print('{} {}'.format(p.x, p.y))
|
#!/usr/bin/env python3
def main():
N = int(input())
AB = [list(map(int, input().split())) for i in range(N)]
AB.sort(key=lambda x: x[1])
work = 0
ans = 'Yes'
for i in range(N):
work += AB[i][0]
if work > AB[i][1]:
ans = 'No'
break
print(ans)
if __name__ == "__main__":
main()
|
a=int(input())
if 1<=a<=10:
print(a+a**2+a**3) |
def main():
line = input()
s1 = []
s2 = []
sum = 0
for i, s in enumerate(line):
if s == "\\":
# 谷の位置をスタックに積む
s1.append(i)
elif s == "/" and len(s1) > 0:
# 山で対応する谷があるなら、面積に追加
j = s1.pop()
sum += i - j # 谷から山の距離を水たまりの面積に追加
# jより前に位置する水たまりの面積を追加
a = i - j
while len(s2) > 0 and s2[-1][0] > j:
a += s2.pop()[1]
# (水たまりの左端の位置, 水たまりの面積)のタプルをスタックに積む
s2.append((j, a))
print(sum)
print(len(s2), end="")
for x in s2:
print(f" {x[1]}", end="")
print()
if __name__ == "__main__":
main()
|
a,b,x=map(int,raw_input().split())
if a<=x and x<=b+a:
print "YES"
else:
print "NO" |
def call(n):
res = []
for i in range(1, n + 1):
if i % 3 == 0:
res.append(str(i))
elif '3' in str(i):
res.append(str(i))
print(' ' + ' '.join(res))
call(int(input())) |
l=list(input())
ll=list(input())
if (l[0]==ll[2] and l[1]==ll[1] and l[2]==ll[0]):
print('YES')
else:
print('NO')
|
def isprime(n):
for i in range(2, n + 1):
if n % i == 0:
return False
if i * i > n:
break
return True
n = int(input())
s = []
for i in range(2, 55556):
if isprime(i) and i % 5 == 1:
s.append(i)
if len(s) == n:
break
print(*s)
|
list_w = []
flag = 0
N = int(input())
for i in range(N):
W = input()
list_w.append(W)
if i >=1 and list_w[-2][-1] != W[0]:
flag = 1
if len(set(list_w)) != N or flag == 1:
print('No')
else:
print('Yes')
|
n = int(input())
if n%2!=0:
print(0)
else:
k=10
q = 0
while k<=n:
q += n//k
k *= 5
print(q) |
prices = [ int(p) for p in input().split(" ") ]
N = int(input())
total_price = 0
p1 = {"0.25": prices[0], "0.5": prices[1], "1": prices[2], "2": prices[3]}
p2 = {"0.25": prices[0] * 8, "0.5":prices[1] * 4, "1":prices[2] * 2, "2":prices[3]}
min_price = sorted(p2.items(), key=lambda x:x[1])
for item in min_price:
if N >= float(item[0]):
buy_num = int(N / float(item[0]))
total_price += p1[item[0]] * buy_num
N -= int(float(item[0]) * buy_num)
#print(total_price, buy_num, N)
if N == 0:
break
print(total_price)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.