text
stringlengths 37
1.41M
|
|---|
N = int(input())
A = int(input())
ret = 'No'
for a in range(A+1):
if N%500==a:
ret='Yes'
break
print(ret)
|
N = int(input())
s = input()
count = 0
for c in s:
if c == "R":
count += 1
if count > N//2:
print("Yes")
else:
print("No")
|
import math
a,b,c = ((float(x) for x in input().split()))
S = a*b*math.sin(math.radians(c))/2
x = math.sqrt(a**2 + b**2 - 2*a*b*math.cos(math.radians(c)))
L = a + b + x
h = b*math.sin(math.radians(c))
print(S)
print(L)
print(h)
|
a,b,c = map(int, input().split())
if a==b and b==c and c==a:print("No")
elif a!=b and b!=c and c!=a:print("No")
else:print("Yes")
|
nums=list(map(int,input().split()))
if nums[2] > nums[1] and nums[1] > nums[0]:
print("Yes")
else:
print("No")
|
from collections import deque
X = input()
stack = deque([X[0]])
for i in range(1, len(X)):
if X[i] == 'S':
stack.appendleft(X[i])
if X[i] == 'T':
if stack:
check = stack.popleft()
if check == 'T':
stack.appendleft(check)
stack.appendleft(X[i])
else:
stack.appendleft(X[i])
print(len(stack))
|
import sys
STEP = 2
def insert_sort(array, step, cnt):
for i in range(step, len(array)):
v = array[i]
j = i - step
while (j >= 0) and (array[j] > v):
array[j + step] = array[j]
j = j - step
cnt += 1
array[j + step] = v
return cnt
def shell_sort(array):
cnt = 0
v = int(len(array)/STEP)
step_list = []
while v > 0:
step_list.append(v)
v = int(v/STEP)
if len(step_list) == 0:
step_list.append(1)
for step in step_list:
cnt = insert_sort(array, step, cnt)
return (cnt, step_list)
def list_to_string(array):
s = ""
for n in array:
s += str(n) + " "
return s.strip()
def main():
num = int(sys.stdin.readline().strip())
array = [int(sys.stdin.readline().strip()) for i in range(0, num)]
c = shell_sort(array)
print str(len(c[1]))
print list_to_string(c[1])
print str(c[0])
for n in array:
print str(n)
if __name__ == "__main__":
main()
|
a,b=input().split()
print('Yes' if int(int((int(a+b))**0.5)**2)==int(a+b) else 'No')
|
word, num = input(), 0
while True:
sentence = input()
if sentence=="END_OF_TEXT":
break
word_list = sentence.lower().replace(".", " ").split()
for i in word_list:
if word==i:
num += 1
print(num)
|
#グラフのパスを全探索する関数(再帰)
def dfs(now_node, depth):#deptt:今まで列挙した頂点数
if seen[now_node]:#探索済みであった場合はreturn
return 0
if depth == N:#全ての頂点を通っていた場合、1を返す
return 1
seen[now_node] = True #今から探索するノードを探索済みにする
connect_nodes = graph[now_node]
ans = 0
for node in connect_nodes:#全ての遷移先をチェックする
ans += dfs(node, depth+1)
seen[now_node] = False # 探索済みフラグを折る(ポイント)
return ans
N, M = map(int, input().split())
edges = [list(map(int, input().split())) for i in range(M)]#辺の集合
graph =[[] for i in range(N+1)]#隣接リスト
for edge in edges:
graph[edge[0]].append(edge[1])
graph[edge[1]].append(edge[0])
#訪問済みかどうかを表すリストを用意
seen = [False for i in range(N+1)]
seen[0] = True
print(dfs(1, 1))
|
n = int(input())
s = set()
for _ in range(n):
instruction, word = input().split()
if instruction == 'insert':
s.add(word)
else:
if word in s:
print('yes')
else:
print('no')
|
s = input()
if s.count('R')==2 and s[1]!='R':
print(1)
else:
print(s.count('R'))
|
A, B = map(int, input().split())
#最大公約数
def gcd(x, y):
while y:
x, y = y, x % y
return x
#最小公倍数
def lcm(x, y):
return x * y // gcd(x, y)
print(lcm(A, B))
|
s = input()
n = len(s)
sl = s[:n//2]
sr = s[n//2+1:]
if sl == sr and sr == sr[::-1]:
print('Yes')
else:
print('No')
|
s = "hi"
S = input()
flag = False
for i in range(5):
if S==s:
flag=True
break
s = s+"hi"
if flag:
print("Yes")
else:
print("No")
|
import math
x = int(input())
if 360 % x == 0:
print(360 // x)
else:
common = 360 * x // math.gcd(360, x)
ans = common // x
print(ans)
|
a, b, c, d = list(map(int, input().split()))
if abs(c - a) <= d or (abs(c - b) <= d and abs(b - a) <= d):
print("Yes")
else:
print("No")
|
N=int(input())
for i in range(N+1):
if int(i*1.08)==N:
print(i)
break
if all(int(i*1.08)!=N for i in range(N+1))==True:
print(":(")
|
#!/usr/bin/env python3
s = input()
for i in range(3):
if s[i] == s[i+1]:
print("Bad")
s = 0
break
if s != 0:
print("Good")
|
import itertools
def is_triangle(list_L):
if (list_L[0] + list_L[1] > list_L[2]) and (list_L[1] + list_L[2] > list_L[0]) and (list_L[2] + list_L[0] > list_L[1]) :
return True
else :
return False
def is_uniqueL(list_L):
return len(list_L) == len(set(list_L))
N = int(input())
L = map(int,input().split())
comb_L = list(itertools.combinations(L, 3))
sum = 0
for a_comb_L in comb_L :
if is_uniqueL(a_comb_L) == True and is_triangle(a_comb_L) == True:
sum += 1
print(sum)
|
def i():
return int(input())
def i2():
return map(int,input().split())
def s():
return str(input())
def l():
return list(input())
def intl():
return list(int(k) for k in input().split())
n = i()
m = float("Inf")
for i in range( 1,int(n**(1/2))+1 ):
if n%i == 0:
note = len(str(max(i,n//i)))
if note < m:
m = note
print(m)
|
def main():
dic1 = {}
dic2 = {}
S = list(input().rstrip())
T = list(input().rstrip())
for s, t in zip(S, T):
if s not in dic1:
dic1[s] = t
elif dic1[s] != t:
print('No')
exit()
if t not in dic2:
dic2[t] = s
elif dic2[t] != s:
print('No')
exit()
print('Yes')
if __name__ == '__main__':
main()
|
# -*- coding: utf-8 -*-
def input_int():
return int(input())
def answer():
n = input_int()
count = 0
for a in range(1, n):
b = (n - 1) // a
if b >= a:
count += (b - a) * 2
count += 1
else:
continue
print(count)
answer()
|
a,b = input().split(' ')
a=int(a)
b=int(b)
if (a == b):
print("a == b")
elif (a < b):
print("a < b")
else:
print("a > b")
|
def insertionSort(A, n, gap):
cnt = 0
for i in range(gap, n):
v = A[i]
j = i - gap
while j >= 0 and A[j] > v:
cnt += 1
A[j + gap] = A[j]
j = j - gap
A[j + gap] = v
return cnt
def shellSort(A, n):
if len(A) == 1:
print(1,1,0,A[0],sep='\n')
return
cnt = 0
G = []
m = 1
while (3**m - 1) // 2 < n:
G.append((3**m - 1) // 2)
m += 1
m -= 1
print(m)
for i in range(m):
cnt += insertionSort(A, n, G[m - i - 1])
print(*G[::-1])
print(cnt)
print(*A, sep='\n')
N = int(input())
A = list([int(input()) for i in range(N)])
shellSort(A, N)
|
import sys
def input(): return sys.stdin.readline().rstrip()
class Sieve: #区間[2,n]の値の素因数分解 O(nloglogn+logn)
def __init__(self,n): #nは計算対象としてありうる最大の値
self.primes=[]
self.f=[0]*(n+1) #ふるい（素数ならその値）
self.f[0]=self.f[1]=-1
self.f_lis = [0]*(n+1)
for i in range(2,n+1): #素数リスト作成
if self.f[i]: continue
self.primes.append(i)
self.f[i]=i
for j in range(i*i,n+1,i):
if not self.f[j]:
self.f[j]=i #最小の素因数を代入
def prime_fact(self,A): #素因数分解 {2:p,3:q,5:r,...}
for x in A:
while x!=1:
p=self.f[x]
x//=p
if x % p > 0:
if self.f_lis[p] > 0: return False
self.f_lis[p] += 1
return True
import math
from functools import reduce
def gcd_all(numbers):#gcd(A)
return reduce(math.gcd, numbers)
def main():
n = int(input())
A = list(map(int,input().split()))
Sieve_a = Sieve(max(A)+1)
if Sieve_a.prime_fact(A):
print("pairwise coprime")
elif gcd_all(A) == 1:
print("setwise coprime")
else:
print("not coprime")
if __name__=='__main__':
main()
|
N = int(input())
S = input()
white_sum = 0
for i in range(N):
if S[i] == '#':
continue
else:
white_sum += 1
left_black = 0
right_white = white_sum
min_sum = white_sum
for i in range(N):
if S[i] == '#':
left_black += 1
else:
right_white -= 1
min_sum = min(min_sum, left_black + right_white)
print(min_sum)
|
def shuffle():
h = int(input())
for i in range(h):
s.append(s[0])
del s[0]
while True:
s = list(input())
if s == ['-']:
break
m = int(input())
for i in range(m):
shuffle()
print(''.join(s))
|
n=int(input())
if n%2==1:
print("0")
exit()
count=0
for i in range(1,30):
count+=n//(2*5**i)
print(count)
|
al = ord(input())
if al >= ord("a"):
print("a")
else:
print("A")
|
import re
n, a, b, c, d = map(int, input().split())
road = input()
if c < d:
if re.search('##', road[a:d]) is None:
print('Yes')
else:
print('No')
elif c > d:
if re.search('##', road[a:]) is None and re.search('\.\.\.', road[b-2:d+1]) is not None:
print('Yes')
else:
print('No')
|
def read_int():
return int(input().strip())
def read_ints():
return list(map(int, input().strip().split(' ')))
def solve():
N = read_int()
L = read_ints()
L.sort()
answer = 0
for i in range(2, N):
for j in range(1, i):
start, end = -1, j
while end-start > 1:
mid = start+(end-start)//2
if L[i]-L[j] < L[mid]: # valid
end = mid
else:
start = mid
answer += j-end
return answer
if __name__ == '__main__':
print(solve())
|
n = int(input())
dic = {}
for x in range(n):
a = input()
dic.setdefault(a,0)
dic[a] += 1
dic2 = sorted(dic.items(),key=lambda x:x[1],reverse=True)
max_word = [k for k,v in dic2 if v == dic2[0][1] ]
max_word.sort()
for x in max_word:
print(x)
|
c=input()
a='aiueo'
lst=list(a)
count=0
for i in lst:
if c==i:
count+=1
if count>0:
print('vowel')
else:
print('consonant')
|
def main():
H, W = map(int, input().split())
board = list()
for i in range(H):
board.append(list(input()))
stat = [[False for i in range(W)] for j in range(H)]
go = True
i = j = 0
stat[i][j] = True
while go:
if (i < H) and (j + 1 < W) and board[i][j + 1] == "#":
j = j + 1
stat[i][j] = True
elif (i + 1 < H) and (j < W) and board[i + 1][j] == "#":
i = i + 1
stat[i][j] = True
else:
break
ans = True
for i in range(H):
for j in range(W):
if board[i][j] == "#" and stat[i][j] == False:
ans = False
if ans:
print("Possible")
else:
print("Impossible")
if __name__ == "__main__":
main()
|
s = input()
if s[0] == 'A':
sub = s[2:-1]
if sub.count('C') == 1:
if all(c.islower() for c in s[1:].replace('C','')):
print('AC')
exit()
print('WA')
|
n = int(input())
a = n // 100
b = n % 100
check = a > 20 or b / 5 <= a
print("1" if check else "0")
|
#!/usr/bin/env python
# -*- coding: utf-8 -*-
import sys
def merge(A, left, mid, right):
global count
L = A[left:mid] + [1e9]
R = A[mid:right] + [1e9]
i, j = 0, 0
for k in range(left, right):
count += 1
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
return None
def merge_sort(A, left, right):
if left + 1 < right:
mid = (left + right) // 2
merge_sort(A, left, mid)
merge_sort(A, mid, right)
merge(A, left, mid, right)
if __name__ == '__main__':
_input = sys.stdin.readlines()
array_length = int(_input[0])
array = list(map(int, _input[1].split()))
assert array_length == len(array)
count = 0
merge_sort(A=array, left=0, right=array_length)
print(*array)
print(count)
|
#! /usr/bin/env python
# -*- coding: utf-8 -*-
height, width = map(int, raw_input().split())
print("%d %d") % (height * width, (height + width) * 2)
|
s = input().rstrip()
p = input().rstrip()
line = s + s
print("Yes") if p in line else print("No")
|
h = int(input())
w = int(input())
n = int(input())
if h >= w:
if n%h == 0:
print(str(n//h))
else:
print(str(n//h+1))
else:
if n%w == 0:
print(str(n//w))
else:
print(str(n//w+1))
|
def main():
x, y = (int(x) for x in input().split())
prod = x*y
if (prod % 2):
print("Odd", sep="")
else:
print("Even", sep="")
if __name__ == '__main__':
main()
|
import networkx as X
n,m=map(int,input().split())
g=X.Graph()
for i in range(n):g.add_node(i+1)
for i in range(m):x,y,z=map(int,input().split());g.add_edge(x,y)
print(X.number_connected_components(g))
|
#! python3
# doubly_linked_list.py
from collections import deque
keys = deque([])
n = int(input())
for i in range(n):
command = input()
if command == 'deleteFirst':
keys.popleft()
elif command == 'deleteLast':
keys.pop()
else:
command, x = command.split(' ')
if command == 'insert':
keys.appendleft(int(x))
elif command == 'delete':
if int(x) in keys:
keys.remove(int(x))
print(' '.join([str(k) for k in keys]))
|
s = input()
print(s.replace(s[3], '8', 1))
|
import string
N = int(input())
alph = string.ascii_lowercase
ans = []
A = [0]
def search():
if len(A) == N:
ans.append(tuple(A))
return
mx = max(A)
for i in range(mx + 2):
A.append(i)
search()
A.pop()
return
search()
for a in ans:
print(''.join(alph[i] for i in a))
|
import sys
def flush() : sys.stdout.flush()
def main():
N = int(input())
print(0)
flush()
sex = input()
if sex == "Vacant":
exit()
even_sex = sex
def isOK(mid):
print(mid)
flush()
sex = input()
if sex == "Vacant":
exit()
elif mid%2 == 0:
if even_sex == sex: return True
else:return False
else:
if even_sex != sex: return True
else: return False
def bin_search():
l = 0
r = N
while l!=r:
mid = l + (r-l)//2
if isOK(mid):
l = mid
else:
r = mid
bin_search()
if __name__ == "__main__":
main()
|
ans = 0
position = []
for i in range(5):
x = int(input())
position.append(x)
k = int(input())
distance_list = []
for i in range(5):
for j in range(5):
if i != j:
distance = abs(position[i] - position[j])
distance_list.append(distance)
y = max(distance_list)
if y <= k:
print('Yay!')
else:
print(':(')
|
N = input()
str1 = N[0]
str2 = N[1]
str3 = N[2]
str = str3 + str2 + str1
if (N == str):
print("Yes")
else:
print("No")
|
import math
n = int(input())
x = int(math.sqrt(n))
print(x**2)
|
import math
def lcm(x, y):
return (x * y) // math.gcd(x, y)
A, B, C, D = map(int,input().split())
Cres = B//C - (A-1)//C
Dres = B//D - (A-1)//D
CDres = B//lcm(C,D) - (A-1)//lcm(C,D)
print(B-A+1-(Cres + Dres - CDres))
|
Sa = list(input())
Sb = list(input())
Sc = list(input())
turn = Sa
ans ="A"
while turn != []:
card =turn[0]
turn.pop(0)
if card =="a":
turn =Sa
ans ="A"
elif card =="b":
turn =Sb
ans ="B"
else:
turn =Sc
ans ="C"
print(ans)
|
s = input()
n = len(s)
s2 = s[:(n-1)//2]
s3 = s[((n+3)//2)-1:]
if (s == s[::-1]) & (s2 == s2[::-1]) & (s3 == s3[::-1]):
print("Yes")
else:
print("No")
|
n = int(input())
li = [int(x) for x in input().split()]
def skews(n,li):
li = sorted(li)
li = [l for i,l in enumerate(li) if i%2==0]
return sum(li)
print(skews(n,li))
|
num = input().split()
num_i = [int(s) for s in num]
a, b, c, d = num_i
if((abs(a-b) <= d) and (abs(c-b)) <= d):
print('Yes')
elif((abs(a-c)) <= d):
print('Yes')
else:
print('No')
|
x=list(map(int,input().split()))
if abs(x[0]-x[2])<=x[3] or (abs(x[0]-x[1])<=x[3] and abs(x[2]-x[1])<=x[3]):
print("Yes")
else:
print("No")
|
s=input()
a,b=map(int,s.split())
d=""
if(a>b):
d=">"
elif(a==b):
d="=="
else:
d="<"
print("a %s b"%(d))
|
#C - Build Stairs
N = int(input())
H = list(map(int,input().split()))
target = H[0]
target_max = 0
result = 'Yes'
for i in range(1,N):
if (H[i] < target - 1) or (target_max > H[i]):
result = 'No'
break
elif H[i] == target - 1:
target -= 1
else:
target = H[i] - 1
target_max = max(target,target_max)
print(result)
|
import collections
def get_ans(strings, n):
ans = 0
for i in range(n):
counter = collections.defaultdict(int)
for k in strings:
counter[k[i]] += 1
ans += len(strings) - max(counter.values())
return ans
if __name__ == '__main__':
n = int(input())
strings = []
for _ in range(3):
strings.append(input())
print(get_ans(strings, n))
|
num = input()
last = num[-1]
if last=="3":
print("bon")
elif last == "0" or last =="1" or last =="6" or last =="8":
print("pon")
else:
print("hon")
|
import sys
from collections import Counter
def prime_factorize(n):
ans = []
while not n%2:
ans.append(2)
n //= 2
mod = 3
while mod**2 <= n:
if n%mod == 0:
ans.append(mod)
n //= mod
else:
mod += 2
if n != 1:
ans.append(n)
counter = Counter(ans)
return counter
def main():
input = sys.stdin.readline
mod = pow(10,9)+7
n = int(input())
a = [int(x) for x in input().split()]
prime_list = dict()
for i in range(n):
primes = prime_factorize(a[i])
for key, value in primes.items():
if key in prime_list:
if prime_list[key] < value:
prime_list[key] = value
else:
prime_list[key] = value
L = 1
for key, value in prime_list.items():
L *= pow(key, value, mod)
L %= mod
ans = 0
for i in range(n):
ans += (L*pow(a[i], mod-2, mod))%mod
ans %= mod
print(ans)
if __name__ == "__main__":
main()
|
a,b = input().split()
a = int(a)
b = int(b)
sign = "=="
if (a < b) : sign = "<"
if (a > b) : sign = ">"
print("a",sign,"b")
|
N=int(input())
if N%2==1:
print(0)
else:
score=0
while N>=10:
score+=N//10
N=N//5
print(score)
|
n = int(input())
m = n//2
if n % 2 ==1:
print(m*(m+1))
elif n % 2 ==0:
print(m**2)
|
import math
r = float(input())
print("{} {}".format(r*r*math.pi,r*2*math.pi))
|
n = int(input())
answer = 1
for index in range(1, n+1):
answer = (answer * index) % (10 ** 9 + 7)
print(answer)
|
def actual(H, W, A):
answer = ''
answer += '#' * (W + 2) + '\n'
for a in A:
answer += f'#{a}#\n'
answer += '#' * (W + 2)
return answer
H, W = map(int, input().split())
A = [input() for _ in range(H)]
print(actual(H, W, A))
|
A = input()
B = input()
ans = '123'
print(ans.replace(A, '').replace(B, ''))
|
def root(list_parent, x):
if(list_parent[x] == x):
return x
else:
list_parent[x] = root(list_parent, list_parent[x])
return list_parent[x]
def unite(list_parent, x, y):
x = root(list_parent, x)
y = root(list_parent, y)
if(x == y):
return list_parent
if x > y:
list_parent[y] = x
else:
list_parent[x] = y
return list_parent
def main():
N, M = map(int, input().split())
list_parent = []
for i in range(N):
list_parent.append(i)
for i in range(M):
A, B = map(int, input().split())
list_parent = unite(list_parent, A-1, B-1)
set_root = set()
for i in list_parent:
root_i = root(list_parent, i)
if root_i not in set_root:
set_root.add(root_i)
print(len(set_root) - 1)
if __name__ == "__main__":
main()
|
s = input()
odd_s = list(s[0::2])
even_s = list(s[1::2])
to = ['R', 'U', 'D']
te = ['L', 'U', 'D']
if set(odd_s).issubset(to) and set(even_s).issubset(te):
print('Yes')
else:
print('No')
|
N=int(input())
if N%9==0:print("Yes")
else:print("No")
|
# coding: utf-8
# Your code here!
# coding: utf-8
# 自分の得意な言語で
# Let's チャレンジ！！
S=input()
if "7" in S:
print("Yes")
else:
print("No")
|
def answer(s: str) -> str:
result = ''
for c in s:
if c == 'B':
result = result[:-1]
else:
result += c
return result
def main():
s = input()
print(answer(s))
if __name__ == '__main__':
main()
|
from collections import deque
n=int(input())
l=deque()
for loop in range(n):
command=input()
if command=='deleteFirst':
l.popleft()
elif command=='deleteLast':
l.pop()
else:
com,num=command.split()
if com=='insert':
l.appendleft(num)
elif com=='delete':
try:l.remove(num)
except:pass
print(*l)
|
def exchange(a, b, c):
if a % 2 == 1 or b % 2 == 1 or c % 2 == 1:
return 0
if a == b == c:
return -1
return exchange((b + c) / 2, (c + a) / 2, (a + b) / 2) + 1
def main():
a, b, c = map(int, input().split())
ans = exchange(a, b, c)
print(ans)
if __name__ == "__main__":
main()
|
# -*- coding: utf-8 -*-
s = str(input())
n = len(s) - 1
answer = 0
for i in range(2 ** n):
operation = [""] * n
for j in range(n):
if (i >> j) & 1:
operation[n - 1 -j] = "+"
formula = ""
for p_n, p_o in zip(s, operation + [""]):
formula += (p_n + p_o)
answer += eval(formula)
print(answer)
|
S = input()
print('No' if S == 'A' * len(S) or S == 'B' * len(S) else 'Yes')
|
s = input()
rs = ''.join(list(reversed(s)))
print("Yes") if s == rs else print("No")
|
s = input()
year = int(s[:4])
month = int(s[5:7])
date = int(s[8:10])
if year <= 2019:
if month <= 4:
print('Heisei')
else:
print('TBD')
else:
print('TBD')
|
n = int(input())
if (n % 2 == 1):
count = (n // 2) + 1
else:
count = n // 2
print("{:.10f}".format(count/n))
|
N = int(input())
ans = 0
if N <= 2:
ans = 2
else:
if N%2 == 0:
ans = N
else:
ans = N*2
print(ans)
|
def print_puddle(puddle):
n = len(puddle)
if n > 0:
print(n, end=' ')
else:
print(n)
for i in range(n):
if i != n - 1:
print(puddle[i][1], end=' ')
else:
print(puddle[i][1])
def solve(A):
left = []
puddle = []
sum_all = 0
for i, a in enumerate(A):
if a == '\\':
left.append(i)
elif a == '/' and len(left) > 0:
left_i = left.pop()
a = i - left_i
sum_paddle = i - left_i
sum_all += a
while len(puddle) and puddle[-1][0] > left_i:
tmp = puddle.pop()
sum_paddle += tmp[1]
puddle.append((left_i, sum_paddle))
print(sum_all)
print_puddle(puddle)
def main():
A = list(input())
solve(A)
if __name__ == "__main__":
main()
|
l = input().split()
l = list(map(int, l))
a,b,c = l[0],l[1],l[2]
if a<b<c:
print("Yes")
else:
print("No")
|
from collections import defaultdict
from itertools import combinations
N = int(input())
dic = defaultdict(list)
for _ in range(N):
s = input()
if s[0] in "MARCH":
dic[s[0]].append(s)
cmb = combinations(dic.keys(),3)
ans = 0
for a,b,c in cmb:
ans += len(dic[a])*len(dic[b])*len(dic[c])
print(ans)
|
h, w = map(int, input().split())
board = [[i for i in input()] for _ in range(h)]
def check(i, j):
if (j-1 >= 0):
if(board[i][j-1] == "#"):
return False
if (j+1 < w):
if(board[i][j+1] == "#"):
return False
if (i-1 >= 0):
if(board[i-1][j] == "#"):
return False
if (i+1 < h):
if(board[i+1][j] == "#"):
return False
return True
def main():
for i in range(h):
for j in range(w):
if (board[i][j] == "#"):
if(check(i,j)):
return "No"
return "Yes"
if __name__ == '__main__':
print(main())
|
s=input()
ans="No"
for a in range(len(s)-1):
if s[a]=="A" and s[a+1]=="C":
ans="Yes"
print(ans)
|
def test():
x=input()
x=x.split()
if x == ['5','5','7']:
print("YES")
elif x == ['5','7','5']:
print("YES")
elif x == ['7','5','5']:
print("YES")
else:
print("NO")
test()
|
# ABC082 B - Two Anagrams
s=list(str(input()))
t=list(str(input()))
s.sort()
t.sort(reverse=True)
S=(''.join(s))
T=(''.join(t))
if S < T:
print("Yes")
else:
print("No")
|
text = input()
print(text[0] + str(len(text)-2) + text[-1])
|
a = [int(str) for str in input().split()]
b = [int(str) for str in input().split()]
if a[0] == b[0]:
print(0)
else:
print(1)
|
N=int(input())
L=[2,1]
for i in range(N):
L.append(L[len(L)-1]+L[len(L)-2])
print(L[len(L)-2])
|
C1 = input()
#print(C1)
C2 = input()
#print(C1[4])
if (C1[2] == C2[0]) and (C1[1] == C2[1]) and (C1[0] == C2[2]):
print("YES")
else:
print("NO")
|
while True:
a,b = map(int, raw_input().split())
if a + b ==0:
break
else:
for i in range(a):
print b*'#'
print ""
|
print('No' if input().find('AC') < 0 else 'Yes')
|
s = input()
word = []
for i in s:
if (i not in word):
word.append(i)
else:
print('no')
exit()
print('yes')
|
N = list(input().split())
N.sort()
if N[0]+N[2]+N[3]+N[1] == '1794':
print('YES')
else:
print('NO')
|
S = input()
N = len(S)
for i in range(N):
for j in range(i, N):
if S[i] == "C" and S[j] == "F":
print("Yes")
exit()
print("No")
|
N = input()
print('Yes' if (N[0] == N[1] == N[2]) or (N[1] == N[2] == N[3]) else 'No')
|
n = int(input())
judge = [3,5,7]
if n in judge:
print('YES')
else:
print('NO')
|
import math
X = int(input())
ans = 1
Y = math.floor(math.sqrt(X))
for i in range(2, Y+1):
for j in range(2, 10):
a = i**j
if a <= X:
ans = max(ans, a)
print(ans)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.