text
stringlengths 37
1.41M
|
|---|
N = int(input())
town = {}
for i in range(N): # 地名をキーとした辞書に、[店番号、点数]を付加する
place, score = input().split()
tmp = [i+1, int(score)]
if place in town:
town[place].append(tmp)
else:
town[place] = [tmp]
index = list(town.keys())
index.sort()
for _ in index:
tmp = town[_]
tmp = sorted(tmp, reverse=True, key=lambda x: x[1])
for num in tmp:
print(num[0])
|
a = []
for i in range(3):
a.append(list(map(int, input().split())))
n = int(input())
b = []
for i in range(n):
b.append(int(input()))
card = [[0, 0, 0], [0, 0, 0], [0, 0, 0]]
for i in range(n):
for j in range(3):
for k in range(3):
if a[j][k] == b[i]:
card[j][k] = True
yes = "Yes"
no = 'No'
answer = no
for i in range(3):
if card[0][i] and card[1][i] and card[2][i]:
answer = yes
for i in range(3):
if card[i][0] and card[i][1] and card[i][2]:
answer = yes
if card[0][0] and card[1][1] and card[2][2]:
answer = yes
if card[0][2] and card[1][1] and card[2][0]:
answer = yes
print(answer)
|
import sys
import itertools
def is_prime(x):
if x == 2:
return True
pred = lambda v: v * v <= x
it = itertools.chain((2,), itertools.count(3, 2))
return not any(not (x % i) for i in itertools.takewhile(pred, it))
def resolve(in_):
X = int(next(in_))
for i in itertools.count(X):
if is_prime(i):
return i
def main():
answer = resolve(sys.stdin)
print(answer)
if __name__ == '__main__':
main()
|
inp = input().split(' ')
a = [int(s) for s in inp]
mi = min(a[:2])
ma = max(a[:2])
if mi <= a[2] <= ma:
print('Yes')
else:
print('No')
|
a = input()
test = ''
for i in range(len(a)):
if a[i] == '0':
test += '0'
elif a[i] == '1':
test += '1'
else:
if len(a) == 0:
pass
else:
test = test[:-1]
print(test)
|
g1 = [1,3,5,7,8,10,12]
g2 = [4,6,9,11]
g3 = [2]
x,y = map(int, input().split())
print('Yes' if (x in g1 and y in g1) or (x in g2 and y in g2) or (x in g3 and y in g3) else 'No')
|
import math
R = int(input())
circum = R * 2 * math.pi
print(circum)
|
class Dice:
def __init__(self,dice):
self.dice = dice
def dice_num(self,a,b):
if (a==2 and b == 4) or (a==3 and b==1) or (a==4 and b==3) or (a==1 and b== 2):
return self.dice[0]
elif (a==2 and b == 0) or (a==0 and b==3) or (a==3 and b==5) or (a==5 and b== 2):
return self.dice[1]
elif (a==4 and b == 0) or (a==0 and b==1) or (a==5 and b==4) or (a==1 and b== 5):
return self.dice[2]
elif (a==0 and b == 4) or (a==4 and b==5) or (a==5 and b==1) or (a==1 and b== 0):
return self.dice[3]
elif (a==2 and b == 5) or (a==3 and b==0) or (a==0 and b==2) or (a==5 and b== 3):
return self.dice[4]
else:
return self.dice[5]
dice = list(map(int,input().split()))
n = int(input())
for _ in range(n):
a,b = map(int,input().split())
a_num = dice.index(a)
b_num = dice.index(b)
dice_2 = Dice(dice)
print(dice_2.dice_num(a_num,b_num))
|
# -*- coding:utf-8 -*-
def selection_sort(num_list):
num_swap = 0
for i in range(len(num_list)):
mini = i
for j in range(i, len(num_list)):
if num_list[j] < num_list[mini]:
mini = j
if i != mini:
num_list[i], num_list[mini] = num_list[mini], num_list[i]
num_swap = num_swap + 1
return num_swap, num_list
def show_list(list):
i = 0;
while(i < len(list)-1):
print(list[i], end=" ")
i = i + 1
print(list[i])
num = int(input())
num_list = [int(x) for i, x in enumerate(input().split()) if i < num]
num_swap, num_list = selection_sort(num_list)
show_list(num_list)
print(num_swap)
|
import math
def count(n, r):
return math.factorial(n) // math.factorial(n - r)
def main():
N, M = map(int, input().split())
if (N == 0 and M == 0) or (N == 1 and M == 1):
ans = 0
elif N == 0 or N == 1:
y = count(M, 2)
ans = y
elif M == 0 or M == 1:
x = count(N, 2)
ans = x
else:
x = count(N, 2)
y = count(M, 2)
ans = x + y
print(int(ans/2))
main()
|
a, b = map(int, input().split())
c = int(a) * int(b)
if c%2 == 0:
print("Even")
else:
print("Odd")
|
N = int(input())
S = str(input())
count = 0
for n in range(N-1):
if S[n:n+3] == "ABC":
count += 1
print(count)
|
def printComparison(a, b):
"""
a: int
b: int
outputs the comparison result of a and b
>>> printComparison(1, 2)
a < b
>>> printComparison(4, 3)
a > b
>>> printComparison(5, 5)
a == b
>>> printComparison(-20, -10)
a < b
"""
operator = ''
if a > b:
operator = '>'
elif a < b:
operator = '<'
else:
operator = '=='
print('a', operator, 'b')
if __name__ == '__main__':
ival = input().split(' ')
printComparison(int(ival[0]), int(ival[1]))
|
from sys import stdin
n = int(stdin.readline())
d = {}
for i in range(n):
cmd = stdin.readline()
if cmd.startswith('insert'):
s = cmd[7:-1]
d[s] = True
elif cmd.startswith('find'):
s = cmd[5:-1]
print('yes' if s in d else 'no')
|
A = list(input())
B = list(input())
C = list(input())
s = A.pop(0)
while True:
if A == [] and s == 'a':
print('A')
exit()
elif B == [] and s == 'b':
print('B')
exit()
elif C == [] and s == 'c':
print('C')
exit()
if s == 'a':
s = A.pop(0)
elif s == 'b':
s = B.pop(0)
elif s == 'c':
s = C.pop(0)
|
if input()=='1':
print('Hello World')
exit()
print(int(input())+int(input()))
|
a,b = list(map(int, input().split()))
if a <= 0 <= b:
print('Zero')
elif a <= b < 0 and (b-a) % 2 == 0:
print('Negative')
else:
print('Positive')
|
H,W = map(int,input().split())
A = [input().split() for i in range(H)]
X = "#"*(W+2)
#print(H,W,A)
for i in range(H):
A[i][0] = "#" + A[i][0] +"#"
print(X)
for i in range(H):
print(A[i][0])
print(X)
|
cnt=0
radi=0
x=int(input())
while True:
cnt+=1
radi+=x
radi%=360
if radi==0:
print(cnt)
break
|
s = input(); l = len(s)
if l%2==0:
a = 'hi'*(l//2)
if a== s: print('Yes')
else: print('No')
else: print('No')
|
a,b = map(int, input().split())
if a <= 0 <= b:
print("Zero")
elif (a>0 and b>0) or (abs(b-a)%2==1):
print("Positive")
else:
print("Negative")
|
import math
r = float(input())
s = '{:.6f}'.format(r * r * math.pi)
l = '{:.6f}'.format(2 * r * math.pi)
print(s,l)
|
def math(A,B):
if B%A ==0:
print(A+B)
else:
print(B-A)
A,B = tuple(map(int, input().split()))
math(A,B)
|
S=input()
if S=='25':
print("Christmas")
if S=='24':
print("Christmas Eve")
if S=='23':
print("Christmas Eve Eve")
if S=='22':
print("Christmas Eve Eve Eve")
|
#!/usr/bin/env python3
n,k=map(int,input().split())
odd = 0
for i in range(1,n+1):
a=0
while k > i*2**a:
a+=1
odd += 2**-a
print(odd/n)
|
num = input().split()
num_i = [int(s) for s in num]
if(num_i[1] >= num_i[0]):
print(num_i[0])
else:
print(num_i[0]-1)
|
board = []
def detect():
if sum([board[0], board[4], board[8]]) == 0:
return True
if sum([board[2], board[4], board[6]]) == 0:
return True
for i in range(3):
if sum([board[i], board[i + 3], board[i + 6]]) == 0:
return True
for i in range(0, 3 * 3, 3):
if sum([board[i], board[i + 1], board[i + 2]]) == 0:
return True
return False
for i in range(3):
row = [int(v) for v in input().rstrip().split()]
board.extend(row)
N = int(input().rstrip())
for i in range(N):
b = int(input().rstrip())
try:
j = board.index(b)
board[j] = 0
except ValueError:
pass
r = 'Yes' if detect() else 'No'
print(r)
|
hen_list=list(map(int,input().split()))
print(['No','Yes'][hen_list.count(hen_list[0])==3])
|
def f(a, b):
if len(a) != len(b):
return 'GREATER' if len(a) > len(b) else 'LESS'
for u,v in zip(a,b):
if int(u) < int(v):
return 'LESS'
elif int(u) > int(v):
return 'GREATER'
return 'EQUAL'
print f(raw_input(), raw_input())
|
S={abc:list(input()) for abc in "abc"}
s="a"
while S[s]:
s=S[s].pop(0)
print(s.upper())
|
x=int(input())
if 0<=x<=1:
if x==1:
print("0")
else:
print("1")
|
import math
import itertools
# 与えられた数値の桁数と桁値の総和を計算する.
def calc_digit_sum(num):
digits = sums = 0
while num > 0:
digits += 1
sums += num % 10
num //= 10
return digits, sums
n = int(input())
distances = []
for _ in range(n):
points = list(map(int, input().split()))
distances.append(points)
total = 0
routes = list(itertools.permutations(range(n), n))
for route in routes:
distance = 0
for index in range(len(route)-1):
idx1 = route[index]
idx2 = route[index+1]
distance += math.sqrt((distances[idx1][0] - distances[idx2][0]) ** 2 + (distances[idx1][1] - distances[idx2][1]) ** 2)
total += distance
print(total / len(routes))
|
N = input()
for n in N:
if int(n) == 7:
print('Yes')
exit()
print('No')
|
s = input()
l = len(s)
ss = ""
for x in range(l):
ss = ss+'x'
print(ss)
|
class Dice():
def __init__(self):
self.num = [0 for _ in range(6)]
def set_num(self, n0, n1, n2, n3, n4, n5):
self.num[0] = n0
self.num[1] = n1
self.num[2] = n2
self.num[3] = n3
self.num[4] = n4
self.num[5] = n5
def roll(self, order):
tmp = self.num.copy()
if order == "N":
self.set_num(tmp[1], tmp[5], tmp[2], tmp[3], tmp[0], tmp[4])
elif order == "S":
self.set_num(tmp[4], tmp[0], tmp[2], tmp[3], tmp[5], tmp[1])
elif order == "E":
self.set_num(tmp[3], tmp[1], tmp[0], tmp[5], tmp[4], tmp[2])
elif order == "W":
self.set_num(tmp[2], tmp[1], tmp[5], tmp[0], tmp[4], tmp[3])
elif order == "rot_Clock":
self.set_num(tmp[0], tmp[2], tmp[4], tmp[1], tmp[3], tmp[5])
else:
print("Error: 不正な入力です")
def get_top_num(self):
return self.num[0]
# Input)()
init_num = [int(_) for _ in input().split()]
n_question = int(input())
# Main
dice = Dice()
dice.set_num(init_num[0], init_num[1], init_num[2], init_num[3], init_num[4], init_num[5])
for i in range(n_question):
n_top, n_front = map(int, input().split())
index_n_top = dice.num.index(n_top)
index_n_front = dice.num.index(n_front)
# print(f"(Init{i}) n_top: {n_top}, n_front: {n_front}")
# print(f"(Init{i}) dice: {dice.num}")
# print(f"(Init{i}) index_n_top: {index_n_top}, index_n_front: {index_n_front}")
# print()
while index_n_top != 0:
if index_n_top in [0, 1, 4, 5]:
dice.roll("N")
index_n_top = dice.num.index(n_top)
index_n_front = dice.num.index(n_front)
# print("roll N")
# print(f"-> index_n_top: {index_n_top}, index_n_front: {index_n_front}")
else:
dice.roll("E")
index_n_top = dice.num.index(n_top)
index_n_front = dice.num.index(n_front)
# print("roll E")
# print(f"-> index_n_top: {index_n_top}, index_n_front: {index_n_front}")
while index_n_front != 1:
dice.roll("rot_Clock")
index_n_top = dice.num.index(n_top)
index_n_front = dice.num.index(n_front)
# print("roll C")
# print(f"-> index_n_top: {index_n_top}, index_n_front: {index_n_front}")
print(dice.num[2])
|
n=int(input())
x='second'
for i in range(n):
a=int(input())
if a%2==1:
x='first'
break
print(x)
|
X,Y=input().split()
strings="A","B","C","D","E","F"
if X==Y:
print("=")
elif Y<X:
print(">")
else:
print("<")
|
t=int(input())
if t==0:
print("1")
elif t==1:
print("0")
|
s=input()
n=len(s)
odd=[s[i] for i in range(0,n,2)]
even=[s[i] for i in range(1,n,2)]
if "L" in odd:
print("No")
elif "R" in even:
print("No")
else:
print("Yes")
|
def multiple_of_ten(number):
while number % 10 != 0:
number += 1
return number
def max_difference_between_two_lst(lst1, lst2):
difference_lst = []
for i in range(len(lst1)):
number1 = lst1[i]
number2 = lst2[i]
difference_lst.append(abs(number1 - number2))
max_difference = max(difference_lst)
return max_difference
def main():
time_lst = []
for _ in range(5):
time_lst.append(int(input()))
new_time_lst = []
for i in range(5):
time = time_lst[i]
new_time_lst.append(multiple_of_ten(time))
max_difference = max_difference_between_two_lst(time_lst, new_time_lst)
fastest = sum(new_time_lst) - max_difference
print(fastest)
if __name__ == '__main__':
main()
|
S = list(input())
if S[-1] == 's':
S.append('e')
S.append('s')
else:
S.append('s')
strS = ''.join(S)
print(strS)
|
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
???????????????
"""
inputstr = input().strip()
cmdnum = int(input().strip())
for i in range(cmdnum) :
cmd = input().strip().split()
if cmd[0] == "print":
start = int(cmd[1])
end = int(cmd[2]) + 1
print(inputstr[start:end])
if cmd[0] == "reverse":
start = int(cmd[1])
end = int(cmd[2]) + 1
prev = inputstr[:start]
revr = inputstr[start:end]
next = inputstr[end:]
inputstr = prev + revr[::-1] + next
if cmd[0] == "replace":
start = int(cmd[1])
end = int(cmd[2]) + 1
inputstr = inputstr[:start] + cmd[3] + inputstr[end:]
|
a,b = map(int,input().split())
if a%3 == b%3 == 1 or a%3 == b%3 == 2:
print('Impossible')
else:
print('Possible')
|
inputs = input().split(' ')
inputs = list(map(int,inputs))
W = inputs[0]
H = inputs[1]
x = inputs[2]
y = inputs[3]
r = inputs[4]
if r <= x and x <= W-r and r <= y and y <= H-r :
print('Yes')
else :
print('No')
|
n = int( raw_input( ) )
dic = {}
output = []
for i in range( n ):
cmd, word = raw_input( ).split( " " )
if "insert" == cmd:
dic[ word ] = True
elif "find" == cmd:
try:
dic[ word ]
output.append( "yes" )
except KeyError:
output.append( "no" )
print( "\n".join( output ) )
|
n=int(input())
list={}
list1=[]
for i in range(n):
a,b=map(str,input().split())
if a=="insert":
list.setdefault(b,i)
if a=="find":
if b in list:
list1.append("yes")
else:
list1.append("no")
for i in list1:
print(i)
|
a, b = tuple(input().split())
def judge():
def sub_judge1():
if a == 'H':
return True
else:
return False
def sub_judge2():
if b == 'H':
return True
else:
return False
if sub_judge2():
return sub_judge1()
else:
return not sub_judge1()
if judge():
print('H')
else:
print('D')
|
x, y = map(int, input().split())
list_1 = [1, 3, 5, 7, 8, 10, 12]
list_2 = [4, 6, 9, 11]
list_3 = [2]
if x in list_1:
tmp = list_1
elif x in list_2:
tmp = list_2
else:
tmp = list_3
if y in tmp:
ans = 'Yes'
else:
ans = 'No'
print(ans)
|
print(sum(i for i in range(1, int(input()) + 1) if i % 3 != 0 and i % 5 != 0))
|
n = int(input())
A = [int(input()) for i in range(n)]
def getG(n):
gn = 1
G = [1]
while 3*gn + 1 < n:
gn = G[-1]*3 + 1
G.append(gn)
return G[::-1]
def insertionSort(A, n, g, cnt):
for i in range(g, n):
v = A[i]
j = i - g
while j >= 0 and A[j] > v:
A[j+g] = A[j]
j = j - g
cnt += 1
A[j+g] = v
return A, cnt
def shellSort(A, n):
G = getG(n)
m = len(G)
cnt = 0
for i in range(m):
A, cnt_l = insertionSort(A, n, G[i], cnt)
cnt = cnt_l
return A, m, G, cnt
A, m, G, cnt = shellSort(A, n)
print(m)
print(" ".join([str(s) for s in G]))
print(cnt)
for a in A:
print(a)
|
N = int(input())
S = input()
answer = ""
# アルファベットは26文字,Zの次はAにループするのでoed()で
# UniCode変換後にNを足し、それを%26を行った値を足す
for word in S:
answer += chr( ord("A") + (ord(word)-ord("A")+N)%26 )
print(answer)
# //////////////////////////////////////////////////
# // ループさせる問題はループの個数の除算分で制御する //
# // 今回はAに,Aと文字の差にずらした分を26で除算する //
# // ord()←→chr()でそれぞれUniCodeを経て変換可能 //
# /////////////////////////////////////////////////
|
n=input()
ans=0
for i in n:
if i=='9':
ans+=1
print('Yes' if ans>0 else 'No')
|
n = int(input())
max_diff = - 10 ** 9
min_n = int(input())
for i in range(1, n):
n = int(input())
max_diff = max(max_diff, n - min_n)
min_n = min(min_n, n)
print(max_diff)
|
from collections import defaultdict
d = defaultdict(list)
for i in range(3):
a,b = map(int, input().split())
d[a].append(b)
d[b].append(a)
a = sorted([len(d[i]) for i in range(1,5)])
if a == [1,1,2,2]:
print("YES")
else:print("NO")
# print(a)
|
a,b,c = map(int,input().split())
if a==b and b!=c:
print('Yes')
elif a==c and a!=b:
print('Yes')
elif b==c and b!=a:print('Yes')
else:print('No')
|
import math
def lcm(x, y):
return (x * y) // math.gcd(x, y)
N, M = map(int, input().split())
S = input()
T = input()
L = lcm(N, M)
d = {}
s = set()
for i in range(N):
d[str(i * (L // N))] = S[i]
s.add(str(i * (L // N)))
for i in range(M):
key = str(i * (L // M))
if key in s:
if d[key] != T[i]:
print(-1)
exit()
print(L)
|
s = list(input().split())
if s.count(s[0]) == 3:
print('Yes')
else:
print('No')
|
s = input().split()
a = int(s[0])
b = int(s[1])
if a >= 13:
print(b)
elif a <= 5:
print("0")
else:
print(int(b / 2))
|
s = list(input())
flag = True
for i in range(len(s)):
if i % 2 == 0:
if s[i] == "L":
flag = False
break
else:
if s[i] == "R":
flag = False
break
if flag:
print("Yes")
else:
print("No")
|
n = input()
def f(x):
return sum(list(map(int, list(n))))
if int(n) % f(n) == 0:
print('Yes')
else:
print('No')
|
def bubble(A):
#标记是否需要继续冒泡
flag =True;
n=len(A)
i=0
while flag:
flag=False
for j in range(n-1,i,-1):
if A[j][1]<A[j-1][1]:
A[j],A[j-1]=A[j-1],A[j]
flag=True
i+=1
#选择排序法
def selection(A):
n=len(A)
for i in range(n):
minj=i
for j in range(i,n):
if A[j][1]<A[minj][1]:
minj=j
if i!=minj:
A[i],A[minj]=A[minj],A[i]
n=int(input())
ss=[x for x in input().split()]
ss2=ss.copy()
bubble(ss)
for i in range(len(ss)-1):
print(ss[i],end=' ')
print(ss[-1])
print('Stable')
selection(ss2)
for i in range(len(ss2)-1):
print(ss2[i],end=' ')
print(ss2[-1])
if ss==ss2:
print('Stable')
else:
print('Not stable')
|
def prime_factorization(n):
"""
nを素因数分解
:param n:
:return:素因数分解結果 [(素数S1, count S1),(素数S2, count S2), ...]
"""
from math import sqrt
if (n == 0): return []
if (n == 1): return [(1, 1)]
res = []
for i in range(2, int(sqrt(n)) + 1):
if n == 1: break
cnt = 0
while n % i == 0:
cnt += 1
n = n // i
if cnt > 0:
res.append((i, cnt))
if n > 1:
res.append((n, 1))
return res
class ModFactorial:
"""
階乗, 組み合わせ, 順列の計算
"""
def __init__(self, n, MOD=10 ** 9 + 7):
"""
:param n: 最大の要素数.
:param MOD:
"""
kaijo = [0] * (n + 10)
gyaku = [0] * (n + 10)
kaijo[0] = 1
kaijo[1] = 1
for i in range(2, len(kaijo)):
kaijo[i] = (i * kaijo[i - 1]) % MOD
gyaku[0] = 1
gyaku[1] = 1
for i in range(2, len(gyaku)):
gyaku[i] = pow(kaijo[i], MOD - 2, MOD)
self.kaijo = kaijo
self.gyaku = gyaku
self.MOD = MOD
def nCm(self, n, m):
return (self.kaijo[n] * self.gyaku[n - m] * self.gyaku[m]) % self.MOD
def nPm(self, n, m):
return (self.kaijo[n] * self.gyaku[n - m]) % self.MOD
def factorial(self, n):
return self.kaijo[n]
N, M = [int(_) for _ in input().split()]
if M == 1:
print(1)
exit()
primes = [v for _, v in prime_factorization(M)]
MOD = 10 ** 9 + 7
mf = ModFactorial(max(primes) + 1 + N, MOD)
ans = 1
for cnt in primes:
ans = ans * mf.nCm(cnt + N - 1, N - 1)
ans = ans % MOD
print(ans)
|
x = int(input())
k = 2
while k*x%360!=0:
k += 1
print(k)
|
import math
a = int(input())
b = int(input())
h = int(input())
S = math.floor((a + b) * h / 2)
print(S)
|
S = input().split()
if S[0]==S[1]:
print('H')
else:
print('D')
|
print("", *(i for i in range(3, int(input()) + 1) if i % 3 == 0 or "3" in str(i)))
|
n=int(input())
result=[]
for i in range(1,n+1):
if i %3==0:
result.append(i)
else:
k=i
for j in range(1,5):
if k%10==3:
result.append(i)
break
else:
k=k//10
else:
continue
print("",*result)
|
from sys import stdin
input = stdin.readline
a = input().rstrip()
if a.isupper():
print("A")
else:
print("a")
|
s = input()
if len(s) % 2 == 1:
print("No")
exit()
while s:
if s[:2] == "hi":
s = s[2:]
else:
print("No")
exit()
print("Yes")
|
#!/usr/bin/env python
# coding: utf-8
# In[3]:
H,W = map(int, input().split())
C = []
for _ in range(H):
tmp = input()
C.append(tmp)
C.append(tmp)
for i in range(len(C)):
print(C[i])
# In[ ]:
|
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
divisors.sort()
return divisors
n=int(input())
div=make_divisors(n)
# print(div)
ans=0
for i in range(len(div)):
m=div[i]
m=n//div[i]-1
if m!=0:
if n//m==n%m:
ans+=m
print(ans)
|
def selection_sort(a, n):
counter = 0
for i in range(n):
minj = i
for j in range(i, n):
if a[j] < a[minj]:
minj = j
if i != minj:
counter += 1
tmp = a[i]
a[i] = a[minj]
a[minj] = tmp
return counter
def print_list_split_whitespace(a):
for x in a[:-1]:
print(x, end=' ')
print(a[-1])
n = int(input())
a = input().split()
for i in range(n):
a[i] = int(a[i])
counter = selection_sort(a, n)
print_list_split_whitespace(a)
print(counter)
|
input()
A = list(map(int, input().split()))
B = set()
for a in A:
B.add(a)
if len(A) == len(B):
print('YES')
else:
print('NO')
|
s = input()
print('Yes') if s[0] == '9' or s[1] == '9' else print('No')
|
import string
ans = ''.join(map(lambda s: s[0], input().split()))
for s, S in zip(string.ascii_lowercase, string.ascii_uppercase):
ans = ans.replace(s, S)
print(ans)
|
N = int(input())
for n in range(7):
if 2 ** n <= N:
ans = 2 ** n
print(ans)
|
s=str(input())
l=[s[0],s[1],s[2],s[3]]
l.sort()
if l[0]==l[1] and l[2]==l[3] and l[0]!=l[2]:
print("Yes")
else:
print("No")
|
input = int(input().strip())
hour = input // 3600
min = (input - 3600*hour) // 60
sec = input - 3600 * hour - 60 * min
print (":".join([str(hour), str(min), str(sec)]))
|
n = int(input())
wordlist = []
for i in range(n):
word = str(input())
if word in wordlist:
print('No')
exit()
if wordlist and wordlist[-1][-1] != word[0]:
print('No')
exit()
wordlist.append(word)
print('Yes')
|
import sys
from fractions import Fraction
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
N, K = LI()
kakuritu = []
for i in range(1,N+1):
count = 0
while i < K:
i *= 2
count += 1
kakuritu.append(N*(2**count))
result = 0
for kaku in kakuritu:
result += Fraction(1, kaku)
print(result.numerator / result.denominator)
|
def is_much_money(num_of_coin, yen):
if num_of_coin * 500 >= yen:
return "Yes"
else:
return "No"
if __name__ == "__main__":
num_of_coin, yen = input().split()
judgement = is_much_money(int(num_of_coin), int(yen))
print(judgement)
|
import math
def GCD(a):
gcd = a[0]
N = len(a)
for i in range(1, N):
gcd = math.gcd(gcd, a[i])
return gcd
# 素因数分解
def fact(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append([i, cnt])
if temp!=1:
arr.append([temp, 1])
if arr==[]:
arr.append([n, 1])
return arr
n = int(input())
A = list(map(int, input().split()))
hst = [0] * (max(A) + 1)
for a in A:
F = fact(a)
for f in F:
hst[f[0]] += 1
if hst[f[0]] > 1 and f[0] != 1:
# ここでpairwise じゃないことが確定する
if GCD(A) == 1:
print("setwise coprime")
else:
print("not coprime")
exit()
print("pairwise coprime")
|
h = int(input())
power = 0
while True:
if 2**power <= h < 2**(power+1):
break
else:
power += 1
layer = power + 1
ans = int(2**layer) - 1
print(ans)
|
from collections import deque
def main():
stack = deque()
diagram = input()
square = []
for index, value in enumerate(diagram):
if value == '\\':
stack.append(-index)
elif value == '/':
if len(stack) > 0:
tmp = []
while True:
tmp.append(stack.pop())
if tmp[-1] <= 0:
stack.append(sum(tmp[:-1]) + index + tmp[-1])
break
if len(stack) == 1:
square.append(stack.pop())
square.extend([i for i in stack if i > 0])
print(sum(square))
if sum(square) == 0:
print(0)
else:
print('{} {}'.format(len(square), ' '.join([str(i) for i in square])))
if __name__ == '__main__':
main()
|
def insertionSort(A, n, g, cnt):
for i in range(g, n):
v = A[i]
j = i - g
while j >= 0 and A[j] > v:
A[j+g] = A[j]
j = j - g
cnt += 1
A[j+g] = v
return [cnt, A]
def shellSort(A, n):
cnt = 0
a = 1
G = []
while a <= n:
G.append(a)
a = 3*a + 1
m = len(G)
G = G[::-1]
for i in range(0, m):
cnt, A = insertionSort(A, n, G[i], cnt)
return [m, G, cnt, A]
if __name__ == "__main__":
n = int(input())
A = [int(input()) for _ in range(n)]
m, G, cnt, A = shellSort(A, n)
print(m)
print(*G)
print(cnt)
for i in A:
print(i)
|
def is_operator(ele):
if ele == "+" or ele == "-" or ele == "*":
return True
else:
return False
def calc_reverse_polish_notation(A):
stack = []
for i in A:
if is_operator(i):
a = stack.pop()
b = stack.pop()
ans = eval("{0} {1} {2}".format(b, i, a))
stack.append(ans)
else:
stack.append(i)
return stack.pop()
A = list(map(str,input().split()))
print(calc_reverse_polish_notation(A))
|
def main():
S = int(input())
y3 = (S+10**9-1)//10**9
x3 = 10**9 * y3 - S
print(0, 0, 10**9, 1, x3, y3)
if __name__ == '__main__':
main()
|
N = int(input())
A = [int(input()) for _ in range(N)]
count = 0
def insertion_sort(N, A, gap):
for i in range(gap, N):
value = A[i] # 対象を取得する
j = i - gap # 一つ前の値を取得する
while j >= 0 and A[j] > value:
A[j+gap] = A[j] # 一つずつ後ろにずらしていく
j -= gap
global count
count += 1
A[j+gap] = value # 挿入する
def shell_sort(N, A):
m = 0
G = []
num = 0
# 3n+1(n = 0,1,2)の配列を作成する
for i in range(0,N):
num = num * 3 + 1
if num > N:
break
G.append(num)
m += 1
G.reverse()
for i in range(0, m):
insertion_sort(N, A, G[i])
print(str(m))
print(' '.join(map(str, G)))
print(str(count))
for i in range(N):
print(str(A[i]))
shell_sort(N, A)
|
A,B,C = map(int,input().split())
res = "NO"
if A == 5 or A == 7:
if B == 5 or B == 7:
if C == 5 or C == 7:
if A+B+C == 17:
res = "YES"
print(res)
|
from sys import stdin
def main():
def find(parent, i):
t = parent[i]
if t == -1:
return i
t = find(parent, t)
parent[i] = t
return t
def unite(parent, i, j):
i = find(parent, i)
j = find(parent, j)
if i == j:
return
parent[i] = j
from builtins import int, map, range
readline = stdin.readline
n, k, l = map(int, readline().split())
roads = [-1] * n
rails = [-1] * n
for i in range(k):
p, q = map(int, readline().split())
unite(roads, p - 1, q - 1)
for i in range(l):
p, q = map(int, readline().split())
unite(rails, p - 1, q - 1)
d = {}
for i in range(n):
t = (find(roads, i), find(rails, i))
if t in d:
d[t] += 1
else:
d[t] = 1
print(*[d[(find(roads, i), find(rails, i))] for i in range(n)])
main()
|
x = raw_input()
x_list = x.split(" ")
x_list = map(int, x_list)
max = min = mid = 0
for i in range(1,3):
if x_list[max] < x_list[i]:
mid = max
max = i
elif x_list[min] > x_list[i]:
mid = min
min = i
else:
mid = i
print("%d %d %d" %(x_list[min], x_list[mid], x_list[max]))
|
N = int(input())
T = ("3","5","7")
from collections import deque
que = deque(list(T))
ans = 0
while que:
num = que.pop()
if int(num) > N:
continue
if len(set(num)) == 3:
ans += 1
for t in T:
que.append(num + t)
print(ans)
|
string = input()
string_length = len(string)
print(string[0] + "%d" % (string_length - 2) + string[string_length - 1])
|
while True:
line = input()
if line == '0':
break
n = 0
for c in line:
n += int(c)
print(n)
|
n=int(input())
if n==1:print(1)
else:print((n+1)//2/n)
|
#!/usr/bin/env python3
x = int(input())
print("YES") if x == 7 or x == 5 or x == 3 else print("NO")
|
def main():
end, start, divisor = [int(i) for i in input().split()]
a = start//divisor - (end-1)//divisor
print(a)
main()
|
# 参考 : https://at274.hatenablog.com/entry/2020/01/15/060000
from functools import reduce
import math
def lcm(x, y):
return (x * y) // math.gcd(x, y)
def lcm_list(numbers): # リストを投げると全要素のlcmが返ってくる
return reduce(lcm, numbers, 1)
N, M = map(int, input().split())
A = list(map(int, input().split()))
# 最初、Aの要素は全て偶数。2で割ったものに置き換え
A = [a // 2 for a in A]
# 全ての要素について、２で割れる回数が同じでないと題意は満たせない
count_div_2 = None
for a in A:
cnt = 0
while a % 2 == 0:
a //= 2
cnt += 1
# 1個目は無条件で保存
if count_div_2 is None:
count_div_2 = cnt
# 2個目からチェック
elif cnt != count_div_2:
print(0)
exit()
# my_lcm = Aの全要素の最小公倍数。 この奇数倍が題意を満たす。
# my_lcmがMを超えていたら1つも作れない
my_lcm = lcm_list(A)
if my_lcm > M:
print(0)
exit()
tmp = M // my_lcm
# my_lcmの1,2,...tmp倍まで使えるが、偶数は使えない
# tmp=1or2なら1個, 3or4なら2個, 5or6なら3個,...
ans = (tmp + 1) // 2
print(ans)
|
s = input().split()
a=s[0]
b=s[1]
if (a=='H')^(b=='H'):
print('D')
else:
print('H')
|
import sys
S = input()
N = len(S)
def is_palindrome(s):
return s == s[::-1]
if not is_palindrome(S):
print('No')
sys.exit()
if not is_palindrome(S[0:int((N - 1) / 2)]):
print('No')
sys.exit()
if not is_palindrome(S[int((N + 3) / 2 - 1):]):
print('No')
sys.exit()
print('Yes')
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.