text
stringlengths 37
1.41M
|
|---|
#-*-coding:utf-8-*-
import sys
input=sys.stdin.readline
def main():
S = input().rstrip()
s_dict={}
for s in S:
if s not in s_dict:
tmp={s:1}
s_dict.update(tmp)
else:
count=s_dict[s]
count+=1
s_dict[s]=count
for i,v in s_dict.items():
if v % 2 !=0:
print("No")
exit()
else:
continue
print("Yes")
if __name__=="__main__":
main() |
str = input()
if len(str)%2 == 1:
print('No')
else:
for i in range(0,len(str),2):
moji = str[i:i+2]
# print(moji)
if moji != 'hi':
ans = 1
break
else:
ans = 0
if ans==1:
print('No')
else:
print('Yes') |
A1, A2 = input().split()
if A1 == "H":
print(A2)
else:
if A2 == "H":
print("D")
else:
print("H") |
#!/usr/bin/env python3
import sys
YES = "Yes" # type: str
NO = "No" # type: str
def solve(c: "List[List[int]]"):
from itertools import product
for a1, b1 in product(range(101), repeat=2):
a2 = c[1][0] - b1
a3 = c[2][0] - b1
b2 = c[0][1] - a1
b3 = c[0][2] - a1
if a2 < 0 or a3 < 0 or b2 < 0 or b3 < 0:
continue
a = [a1, a2, a3]
b = [b1, b2, b3]
if all((a[i]+b[j])==c[i][j] for i, j in product(range(3), repeat=2)):
return YES
return NO
# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
c = [[int(next(tokens)) for _ in range(3)] for _ in range(3)] # type: "List[List[int]]"
print(solve(c))
def test():
import doctest
doctest.testmod()
if __name__ == '__main__':
#test()
main()
|
def move(up,bottom,right,left,front,back,direction):
if direction == "N":
return (front,back,right,left,bottom,up)
elif direction == "S":
return (back,front,right,left,up,bottom)
elif direction == "E":
return (left,right,up,bottom,front,back)
elif direction == "W":
return (right,left,bottom,up,front,back)
up,front,right,left,back,bottom = input().split()
direction = list(input())
for i in range(len(direction)):
up,bottom,right,left,front,back = move(up,bottom,right,left,front,back,direction[i])
print(up) |
def func(h):
if h == 1:
h = 0
return 1
else:
return 1 + 2 * func(h//2)
h = int(input())
print(func(h)) |
str = input() *2
pattern = input()
if pattern in str:
print("Yes")
else:
print("No") |
num = input()
length, res = len(num), 0
big, small = "9", "1"
for dig_len in range(1, length + 1, 2):
if int(big) < int(num):
res += int(big) - int(small) + 1
big += "99"
small += "00"
else:
res += int(num) - int(small) + 1
print(res)
|
x,a,b = input().split()
x = int(x)
a = int(a)
b = int(b)
if abs(x-a) <= abs(x-b) :
print("A")
else :
print("B") |
N, A, B, C, D = [int(_) for _ in input().split()]
S = input()
if "##" in S[A-1:C] or "##" in S[B-1:D]:
print("No")
elif C < D:
print("Yes")
elif "..." in S[B-2:D+1]:
print("Yes")
else:
print("No")
|
x=int(input())
if x <= 6:
print(1)
exit()
cnt = (x//11)*2
x %= 11
if x <= 0:
print(cnt)
elif x <= 6:
print(cnt+1)
else:
print(cnt+2) |
n = list(int(i) for i in input().split())
n.sort()
if n[0] == 5 and n[1] == n[0] and n[2] == 7:
print("YES")
else:
print("NO")
|
def ri():
return int(input())
def rii():
return [int(v) for v in input().split()]
def solve():
N = ri()
ans = ""
while N:
N, r = divmod(N - 1, 26)
ans = chr(ord("a") + r) + ans
print(ans)
if __name__ == "__main__":
solve() |
s_list = list(input())
result = None
for s_uni in range(ord('a'), ord('z') + 1):
if not chr(s_uni) in s_list:
result = chr(s_uni)
break
if result:
print(result)
else:
print('None')
|
from copy import deepcopy
# 多次元配列を作成する
def make_multi_list(initial, degree):
ans = [initial for _ in range(degree[-1])]
for d in reversed(degree[:-1]):
ans = [deepcopy(ans) for _ in range(d)]
return ans
N, T = map(int, input().split())
AB = []
for i in range(N):
a, b = map(int, input().split())
AB.append((a, b))
AB.sort()
ans = 0
dp = make_multi_list(0, [3005, 3005])
for i in range(N):
a, b = AB[i]
for j in range(T):
# iを使わないパターン
dp[i + 1][j] = max(dp[i + 1][j], dp[i][j])
# iを使うパターン
nj = j + a
if nj < T:
dp[i + 1][nj] = max(dp[i + 1][nj], dp[i][j] + b)
now = dp[i][T - 1] + b
ans = max(ans, now)
print(ans)
|
def main():
number = int(input())
queue = ["a"]
for i in range(number - 1):
now_queue = []
for now in queue:
limit = ord(max(now)) + 2
for j in range(ord("a"), limit):
now_queue.append(now + chr(j))
queue = now_queue
for q in queue:
print(q)
if __name__ == '__main__':
main()
|
S = input()
ans = 'No'
t = 'C'
for i in range(len(S)):
if t == 'C' and S[i] == t:
t = 'F'
elif t == 'F' and S[i] == t:
ans = 'Yes'
print(ans) |
str1 = input().split()
str2 = input().split()
m1 = str1[0]
d1 = str1[1]
m2 = str2[0]
d2 = str2[1]
if m1 == m2:
return_value = '0'
else:
return_value = '1'
print(return_value) |
def gcd(a, b, c):
x = gcd2(a, b)
y = gcd2(b, c)
return gcd2(x, y)
def gcd2(x, y):
if y == 0:
return x
else:
return gcd2(y,x%y)
def main():
K = int(input())
ans = 0
for p in range(1, K+1):
for s in range(p, K+1):
for k in range(s, K+1):
if p == s == k:
ans += p
elif p == s or s == k or p == k:
ans += 3 * gcd(p, s, k)
else:
ans += 6 * gcd(p, s, k)
print(ans)
if __name__=='__main__':
main() |
s=input()
if s==s[::-1]:
if s[:(len(s)-1)//2] == s[:(len(s)-1)//2:-1]:
ss=s[(len(s)+3)//2-1:len(s)]
if ss == ss[::-1]:
print('Yes')
else:
print('No')
else:
print('No')
else:
print('No') |
from collections import deque
class Dice:
def __init__(self, top, down, right, left, up, bottom):
self.top = top
self.bottom = bottom
self.up = up
self.down = down
self.left = left
self.right = right
def roll(self, command):
for c in list(command):
if c == 'N':
self.up, self.top, self.down, self.bottom = self.top, self.down, self.bottom, self.up
elif c == 'S':
self.up, self.top, self.down, self.bottom = self.bottom, self.up, self.top, self.down
elif c == 'E':
self.left, self.top, self.right, self.bottom = self.bottom, self.left, self.top, self.right
elif c == 'W':
self.left, self.top, self.right, self.bottom = self.top, self.right, self.bottom, self.left
def pip(self):
return self.top
if __name__ == '__main__':
seq = list(map(int, input().split()))
dice = Dice(*seq)
dice.roll(input())
print(dice.pip())
|
def solve():
X = int(input())
p = int(X / 100)
q = X % 100
if 0 <= q <= 5 * p:
print(1)
else:
print(0)
if __name__ == "__main__":
solve() |
dat = []
import collections
for i in range(3):
a,b = map(int, input().split())
dat.append(a)
dat.append(b)
c = collections.Counter(dat)
res = []
for k in c:
res.append(c[k])
res.sort()
if res == [1,1,2,2]:
print("YES")
else:
print("NO") |
s = input()
t = input()
f = True
for (s1, s2) in [(s, t), (t, s)]:
d = dict()
for c1, c2 in zip(s1, s2):
if c1 not in d:
d[c1] = c2
elif d[c1] != c2:
f = False
break
if f:
print('Yes')
else:
print('No')
|
#!/usr/bin/env python3
import sys
import fractions
## 最小公倍数(LCM)
def lcm(x, y):
return (x * y) // fractions.gcd(x, y)
def solve(N: int, M: int, S: str, T: str):
X = lcm(N,M)
i = j = 0
while i < N and j < M:
if S[i] == T[j]:
i += X//M
j += X//N
continue
else:
print(-1)
return
print(X)
return
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
M = int(next(tokens)) # type: int
S = next(tokens) # type: str
T = next(tokens) # type: str
solve(N, M, S, T)
if __name__ == '__main__':
main()
|
s = str(input())
t = str(input())
isOK = False
for i in range(1,len(s)+1):
if s==t[-i:]+t[:-i]:
isOK = True
break
if isOK:
print('Yes')
else:
print('No') |
class Dice:
def __init__(self, list):
self.list = list #listのinput
def roll_n(self):
self.list = [self.list[1], self.list[5], self.list[2], self.list[3], self.list[0], self.list[4]]
def roll_s(self):
self.list = [self.list[4], self.list[0], self.list[2], self.list[3], self.list[5], self.list[1]]
def roll_e(self):
self.list = [self.list[3], self.list[1], self.list[0], self.list[5], self.list[4], self.list[2]]
def roll_w(self):
self.list = [self.list[2], self.list[1], self.list[5], self.list[0], self.list[4], self.list[3]]
def print0(self):
print(self.list[0])
list = list(map(int, input().split()))
direct = input()
instance = Dice(list)
for i in direct:
if i == 'N':
instance.roll_n()
if i == 'S':
instance.roll_s()
if i == 'E':
instance.roll_e()
if i == 'W':
instance.roll_w()
instance.print0()
|
a,b,c = [int(x) for x in input().split()]
res = "YES"
if a > c:
res = "NO"
if a + b < c:
res = "NO"
print(res) |
dic = {}
for b in range(1,5):
for f in range(1,4):
for r in range(1,11):
dic[(b,f,r)] = 0
n = int(raw_input())
for k in range(n):
b,f,r,v = map(int,raw_input().split())
dic[(b,f,r)] += v
j = 0
for b in range(1,5):
for f in range(1,4):
ls = []
for r in range(1,11):
ls.append(dic[(b,f,r)])
print ' ' + ' '.join(map(str,ls))
else:
if j < 3:
print '#'*20
j +=1 |
a = input()
b = input()
l = max(len(a), len(b))
for i,j in zip(a.zfill(l), b.zfill(l)):
if int(i) > int(j):
print("GREATER")
break
elif int(i) < int(j):
print("LESS")
break
else:
print("EQUAL")
|
A, B = list(map(int,input().split()))
def gcd_(a, b):
if a < b: a, b = b, a
if b == 0: return a
return gcd_(b, a % b)
def lcm_(x,y):
return (x * y) // gcd_(x, y)
print(lcm_(A, B)) |
def test():
x, y = map(int, input().split())
if y&1:
print("No")
return
print("Yes" if 2*x<=y<= 4*x else "No")
test() |
ring_str=input()
key=input()
ring_str+=ring_str
if key in ring_str:
print('Yes')
else:
print('No')
|
n = list(input())
i = len(n) - 1
if n[i] == '3':
print('bon')
elif n[i] == '0' or n[i] == '1' or n[i] == '6' or n[i] == '8':
print('pon')
else:
print('hon')
|
x=int(input())
if x == 0 or x == 1 : print("1")
else :
i=0
b=1
c=1
while i<(x-1) :
d=b+c
c=b
b=d
i=i+1
print(b)
|
S = input()
T = input()
N = len(S)
check = False
for i in range(N):
S = S[-1] + S[:-1]
if S == T:
check = True
print("Yes" if check else "No") |
s = input()
c = 0
while True:
t = input()
if t == 'END_OF_TEXT': break
for w in t.lower().split():
if w == s:
c += 1
print(c) |
n = int(input()); x = 0
for i in range(1, n): x += (n-1)//i
print(x) |
def add_mult(i, count, N, K):
if count > N:
return i
am1 = add_mult(i*2, count + 1, N, K)
am2 = add_mult(i+K, count + 1, N, K)
return min(am1, am2)
def main():
N = int(input())
K = int(input())
print(add_mult(1, 1, N, K))
main()
|
from re import match
if match("^A[a-z]+C[a-z]+$", input()):
print('AC')
else:
print('WA') |
s = input().split()
if(int(s[0]) + int(s[1])>=10):
print('error')
else :
print(int(s[0]) + int(s[1])) |
s=input().split()
a=int(s[0])
b=int(s[2])
c=s[1]
while (c!='?'):
if(c=='+'):print(a+b)
elif(c=='-'):print(a-b)
elif(c=='*'):print(a*b)
elif(c=='/'):print(int(a/b))
s=input().split()
a=int(s[0])
b=int(s[2])
c=s[1] |
import sys
count = [0 for _ in range(26)]
for line in sys.stdin:
array = line
char = ["" for _ in range(len(array))]
for i in range(len(array)):
char[i] = array[i:i+1]
for c in char:
for i in range(26):
if c == chr(i+ord("A")) or c == chr(i+ord("a")):
count[i] += 1
for i in range(26):
print("{0} : {1}".format(chr(i+ord("a")), count[i])) |
x,y=1,10**9+7
for i in range(1,int(input())+1):x=x*i%y
print(x) |
# coding: utf-8
# Here your code !
N=int(input())
dict={}
for i in range(N):
a,b=input().split()
if a=="insert":
dict[b]=i
else:
if b in dict:
print("yes")
else:
print("no") |
X = int(input())
count = 0
step = 0
while X > step:
count += 1
step += count
print(count)
|
S=input()
ans="No"
for i in range(len(S)):
if "AC" == S[i:i+2]:
ans="Yes"
break
print(ans)
|
a,b = map(int, input().split())
if a>0 or (b<0 and (b-a)%2==1) :
print('Positive')
elif a==0 or b==0 or (a<0 and b>0):
print('Zero')
else:
print('Negative') |
# -*- coding: utf-8 -*-
import math
#入力
A, B, C = map(int, input().split())
if A <= C and C <= B :
print ("Yes")
else :
print ("No")
|
while True:
H, W = map(int, input().split())
if (H, W) == (0, 0):
break
[print("#"*W+"\n") if i == H-1 else print("#"*W) for i in range(H)] |
def swap(a, b ,item):
c = item[a]
item[a] = item[b]
item[b] = c
AB = input().split()
a = int(AB[0])
b = int(AB[1])
while a!=0 or b!=0:
if a>b:
swap(0, 1, AB)
print(int(AB[0]), int(AB[1]))
AB = input().split()
a = int(AB[0])
b = int(AB[1]) |
import math
N = int(input())
lcm = int(input()) #T0
for i in range(N-1):
x = int(input())
lcm = lcm * x // math.gcd(lcm,x)
print(lcm) |
import string
s = str(input())
low = string.ascii_lowercase
fin = ''
for i in range(len(low)):
if low[i] not in s:
fin += low[i]
if len(fin) == 0:
print('None')
else:
print(fin[0]) |
N = int(input())
N %= 10
ans = 0
if N == 3:
ans = 'bon'
elif N in [0,1,6,8]:
ans = 'pon'
else:
ans = 'hon'
print(ans)
|
pre = input()
re = input()
ten = 0
for i in range(3):
if pre[i]==re[i]:
ten += 1
print(ten) |
s = ""
while True:
try:
s += input().lower()
except:
break
dic = {}
orda = ord("a")
ordz = ord("z")
for c in s:
if orda <= ord(c) <= ordz:
try:
dic[c] += 1
except:
dic[c] = 1
for i in range(orda,ordz + 1):
c = chr(i)
try:
print("%s : %d" % (c, dic[c]))
except:
print("%s : %d" % (c, 0)) |
import sys
def gcd(a, b):
if b == 0:
return a
else:
return gcd(b, a % b)
def lcm(a, b):
return a * b // gcd(a, b)
def main():
for i in sys.stdin.readlines():
a, b = [int(x) for x in i.split()]
print(gcd(a, b), lcm(a, b))
if __name__ == '__main__':
main() |
while True:
(x,y) = [int(i) for i in input().rstrip().split(' ')]
if x == y == 0:
break
if(x < y):
print('{0} {1}'.format(x,y))
else:
print('{0} {1}'.format(y,x)) |
def resolve():
n = int(input())
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
divisors = make_divisors(n)
min_pair = 10**19
for i in divisors:
pair_i = n//i
min_pair = min(min_pair, ((i-1)+(pair_i-1)))
print(min_pair)
resolve() |
cards={}
for m in 'SHCD':
for n in range(13):
if m not in cards:
cards[m] = {}
cards[m][n+1] = False
c = input()
for i in range(int(c)):
m, n = input().split()
cards[m][int(n)] = True
for m in 'SHCD':
for n in range(13):
if not cards[m][n+1]:
print(m, n+1)
|
operand = input().split()
stack = []
for op in operand:
if op.isdigit():
stack.append(op)
else:
val1 = stack.pop()
val2 = stack.pop()
stack.append(str(eval(val2 + op + val1)))
print (stack[0]) |
import copy
n = int(input())
if n == 1:
print(1)
exit()
l_2 = 0
l_1 = 2
l_0 = 1
for i in range(2, n+1):
l_2 = copy.deepcopy(l_1)
l_1 = copy.deepcopy(l_0)
l_0 = l_1 + l_2
print(l_0) |
import math
from decimal import Decimal
hour_len, minute_len, hour, minute = list(map(int, input().split()))
degree_hm = abs(((hour * 60 + minute) * 0.5) - (minute * 6))
rad_hm = math.radians(degree_hm) # 長針は1分で0.5deg、短針は1分で6deg
cos_hm = math.cos(rad_hm)
a_double = hour_len ** 2 + minute_len ** 2 - (2 * hour_len * minute_len * cos_hm)
ans = math.sqrt(a_double)
print( f"{ans:.20f}" ) |
import math
a, b = [str(x) for x in input().split()]
ab = int(a+b)
ab = math.sqrt(ab)
if(ab.is_integer()):
print('Yes')
else:
print('No')
|
import string
import sys
text = sys.stdin.read().lower()
for char in string.ascii_lowercase:
print(char, ':', text.count(char))
|
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
a = list(map(int, input().split()))
if 7 == a[0]:
if 5 == a[1] and 5 == a[2]:
print("YES", end="\n")
else:
print("NO", end="\n")
elif 5 == a[0]:
if (7 == a[1] and 5 == a[2]) or (5 == a[1] and 7 == a[2]):
print("YES", end="\n")
else:
print("NO", end="\n")
else:
print("NO", end="\n") |
n = int(input())
al = []
for _ in range(n):
a = int(input())
al.append(a)
if all(a % 2 == 0for a in al):
print("second")
else:
print("first") |
n = int(input())
def fib(n):
if(n==0): return 1
elif(n==1): return 1
elif(n>1):
a,b = 1,1
for i in range(n-1):
a,b = b,a+b
return b
print(fib(n))
|
a = int(input())
b = int(input())
l = [a, b]
if not 1 in l:
print('1')
elif not 2 in l:
print('2')
else:
print('3') |
def col_count(A,N,M):
col = [[0,0,0] for _ in range(N+1)]
for i in range(N):
for j in range(3):
col[i+1][j] = col[i][j]
for j in range(3):
if col[i][j] == A[i]:
col[i+1][j] += 1
break
output = 1
for i in range(N):
cnt = 0
for j in range(3):
if col[i][j] == A[i]:
cnt += 1
output *= cnt
output %= M
return output
def main():
N = int(input())
A = list(map(int,input().split()))
M = 10**9+7
print(col_count(A,N,M))
if __name__ == "__main__":
main()
|
n = sorted(input().split())
if n == ['1', '4', '7', '9']:
print('YES')
else:
print('NO') |
class UnionFind:
# 初期化
def __init__(self, n_nodes):
# 親要素のノード番号を格納する.
# self.parent[x] == x の時，そのノードは根.
self.parent = [i for i in range(n_nodes)]
# 木の高さを格納する．
self.rank = [0] * n_nodes
# 検索. 根を返す.
def find(self, x):
if self.parent[x] == x:
return x
else:
# 一度調べた値は，根に繋ぎ直す.
self.parent[x] = self.find(self.parent[x])
return self.parent[x]
# 併合.
# 木の高さが低くなるように.
# 親要素の書き換えは少ない方がいい
def unite(self, x, y):
# 根を探す．
x = self.find(x)
y = self.find(y)
# 根が同じ場合はそのまま
if x == y:
return
# 木の高さを比較し，低い方を高い方の根に貼る.
if self.rank[x] > self.rank[y]:
self.parent[y] = x
else:
self.parent[x] = y
if self.rank[x] == self.rank[y]:
self.rank[y] += 1
# 同じ集合に属するか判定
def check(self, x, y):
return self.find(x) == self.find(y)
N, M = map(int, input().split())
p = list(map(int, input().split()))
tree = UnionFind(N)
for _ in range(M):
x, y = map(int, input().split())
tree.unite(x - 1, y - 1)
ans = 0
for i in range(N):
if tree.check(i, p[i] - 1):
ans += 1
print(ans)
|
# -*- coding: utf-8 -*-
numbers = [int(e) for e in input().split()]
numList = [1, 4, 7, 9]
if numbers[0] in numList:
numin = numList.index(numbers[0])
del numList[numin]
if numbers[1] in numList:
numin = numList.index(numbers[1])
del numList[numin]
if numbers[2] in numList:
numin = numList.index(numbers[2])
del numList[numin]
if numbers[3] in numList:
numin = numList.index(numbers[3])
print('YES')
else:
print('NO')
else:
print('NO')
else:
print('NO')
else:
print('NO') |
situdo = input()
if int(situdo) >= 30:
print("Yes")
else:
print("No")
|
l = int(input())
l = float(l / 3)
print(l ** 3)
|
import copy
class Dice:
def __init__(self, eyes):
self._top = eyes[0]
self._front = eyes[1]
self._right = eyes[2]
self._left = eyes[3]
self._back = eyes[4]
self._bottom = eyes[5]
@property
def eye(self):
return self._top
def roll(self, direction):
old = copy.copy(self)
if direction == 'N':
self._top = old._front
self._front = old._bottom
self._back = old._top
self._bottom = old._back
elif direction == 'S':
self._top = old._back
self._front = old._top
self._back = old._bottom
self._bottom = old._front
elif direction == 'W':
self._top = old._right
self._right = old._bottom
self._left = old._top
self._bottom = old._left
elif direction == 'E':
self._top = old._left
self._right = old._top
self._left = old._bottom
self._bottom = old._right
else:
raise ValueError('NEWS箱推し')
eyes = input().split()
dice = Dice(eyes)
direction_text = input()
for d in direction_text:
dice.roll(d)
print(dice.eye)
|
R = float(input())
if R >= 30:
print("Yes")
else:
print("No") |
t=input()
if t[-1]=='s':
ans=t+"es"
else:
ans=t+"s"
print(ans) |
S = input()
if len(S)==2:
print(S)
else:
S_list = [list for list in S]
S_list.reverse()
print(''.join(S_list)) |
from math import (pi,cos,sqrt,radians)
def main():
A,B,H,M = map(int, input().split())
# 長針、短針の0時0分からの角度を求める
HTheta = H/12 * 360 + 1/12 * (M/60) * 360
MTheta = M/60 * 360
# |長針-短針|で角度θを求める
Theta = abs(HTheta - MTheta)
# θ=180ならA+Bを出力して終了
if Theta == 180:
print(A + B)
return
# 予言定理を求める
print(sqrt(A*A + B*B - 2*A*B*cos(radians(Theta))))
main() |
n = int(input())
max_cnt = 0
max_num = 1
#1からnまでの数を調べる
for i in range(1, n + 1):
count = 0
num = i
#iが2で割りきれるまで割る
while i % 2 == 0 :
count += 1
i = i//2
#割り切れる回数を更新
if max_cnt < count :
max_cnt = count
max_num = num
print(max_num) |
def main():
n=int(input())
for _ in range(n):
if int(input())%2==1:
print("first")
return
print("second")
main() |
n = input()
if n[0] == '7' or n[1] == '7' or n[2] == '7':
ans = 'Yes'
else:
ans = 'No'
print(ans) |
N = int(input())
S = list(input())
check = 0
for i in range(N-1):
if S[i] != "*":
if S[i:i+3] == ["A","B","C"]:
check += 1
S[i:i+3] = ["*"]*3
print(check) |
num = input()
num1,num2 = num.split(' ')
num1 = int(num1)
num2 = int(num2)
if num1 > 9 or num2 > 9:
print('-1')
else:
print (num1 * num2) |
N=int(input())
for a in range(1,10):
for b in range(1,10):
if a*b==N:
print('Yes')
exit()
print('No') |
# -*- coding: utf-8 -*-
# B - バイナリハックイージー
s = input()
listAns = []
set1 = ['0', '1']
set2 = ['B']
listS = list(s)
# print(listS)
for i in listS:
if i in set1:
listAns.append(i)
elif i in set2:
if len(listAns) != 0:
listAns.pop()
ans = "".join(listAns)
print(ans) |
s = int(input())
a, b = s // 100, s % 100
x = "YY" if a == 0 or a > 12 else "MM"
y = "YY" if b == 0 or b > 12 else "MM"
if x != y:
print(x + y)
else:
print("NA" if x == "YY" else "AMBIGUOUS")
|
total = int(input())
initial = int(input())
if initial > total:
initial = total
a = int(input())
b = int(input())
count = 0
for i in range(initial):
count+= a
for c in range(total - initial):
count+=b
print(count)
|
s = input()
flg = True
while len(s) > 0:
if s.startswith("hi"):
s = s[2::]
else:
flg = False
break
if flg:
print("Yes")
else:
print("No") |
import math
while 1:
# input the students number
n = input()
if n == 0:
break
# input the points
s = map(float, raw_input().split())
# get the average of points
ave = 0
for i in s:
ave += i
ave = ave / len(s)
# get the standard deviation
alpha = 0
for i in s:
alpha += (i - ave)*(i - ave)
alpha = math.sqrt( alpha/len(s) )
# print
print alpha |
"""
1. The initial character of S is an uppercase A.
2. There is exactly one occurrence of C between the third character from the beginning and the second to last character (inclusive).
3. All letters except the A and C mentioned above are lowercase.
"""
import collections
def f(r): return r[0] == 'A' and collections.Counter(r[2:-1])['C'] == 1 and all([l in set(['A', 'C']) or l.lower() ==l for l in r ])
print 'AC' if f(raw_input()) else 'WA' |
s = str(input())
we = ["Sunny","Cloudy","Rainy"]
ans = 0
for i in range(3):
if(we[i]==s):
ans = i
break
print(we[(i+1)%3]) |
X = int(input())
ans = 0
W = 360
while(True):
W -= X
ans += 1
if W == 0:
break
if W < 0:
W += 360
print(ans) |
# -*- coding: utf-8 -*-
def insertionSort(A, n, g):
cnt = 0
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
def shellSort(A, n):
cnt = 0
m = 1
G = []
while True:
if n < int((3 ** m - 1) / 2):
m -= 1
break
else:
G.append(int((3 ** m - 1) / 2))
m += 1
G.reverse()
for i in range(m):
cnt += insertionSort(A, n, G[i])
print_line(A, G, m, cnt)
def print_line(A, G, m, cnt):
print(m)
for i in range(len(G)):
if i == len(G) - 1:
print(G[i])
else:
print("{0}".format(G[i]), end=' ')
print(cnt)
for i in range(len(A)):
print(A[i])
A = []
n = int(input())
for i in range(n):
A.append(int(input()))
shellSort(A, n)
|
count=int(raw_input())
for i in range(0,count):
a,b,c=map(int,raw_input().split())
if pow(a,2)+pow(b,2)==pow(c,2):
print 'YES'
elif pow(a,2)+pow(c,2)==pow(b,2):
print 'YES'
elif pow(b,2)+pow(c,2)==pow(a,2):
print 'YES'
else:
print 'NO' |
"""2020/7/2再挑戦"""
#幅優先探索 親の頂点と色を覚えておく。親の色を除く＋1ずつ足していく。color_maxを超えたら余りをとる。
from collections import deque
N = int(input())
connection ={i:set() for i in range(1,N+1)}
connection_parent =[]
for i in range(1,N):
a,b = (int(i) for i in input().split())
connection[a].add(b)
connection[b].add(a)
connection_parent.append(b)
#最小の色数
c =[]
for i in connection.values():
c.append(len(i))
color_min =max(c)
#幅優先探索
start =1
color={i:0 for i in range(1,N+1)} #P:今の頂点と次への辺の色を記録(tuple)。
passed =set() # 通過した記録
dq =deque([start]) #スタートは1でいいのか？
color[start] =0
while len(dq) >0:
now =dq.popleft()
passed.add(now)
c1 =color[now]
for next in connection[now]:
if next not in passed:
c1 +=1
c1 %=color_min
color[next] =c1 #0 <=c <= color_min-1のため ＋１
dq.append(next)
print(color_min)
for i in connection_parent:
print(color[i] +1) |
A,B,C = map (int, input ().split ())
S = int (input ())
if A>B>C or A>C>B:
for i in range (S):
A = A*2
print (A+B+C)
elif B>A>C or B>C>A:
for i in range (S):
B = B*2
print (A+B+C)
else:
for i in range (S):
C = C*2
print (A+B+C) |
if __name__ == '__main__':
k = int(input())
s = input()
ans = ""
if len(s) > k:
ans = s[0:k] + "..."
else:
ans = s
print(ans)
|
from decimal import Decimal
W, H, x, y = map(int, input().split())
if W == 2*x and H == 2*y:
print(Decimal(W*H/2), 1)
else:
print(Decimal(W*H/2), 0)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.