problem_id
stringlengths 8
8
| id
int64 107k
56M
| submission_code
stringlengths 13
515k
|
|---|---|---|
abc084_b | 15,690,349 | a,b=map(int,input().split())
s=input()
n=len(s)
l=list("0123456789")
f=0
for i in range(a):
if s[i] in l:
f+=1
if s[a]=="-":
f+=1
for i in range(b):
if s[-1-i] in l:
f+=1
print("Yes" if f==n else "No")
|
abc084_b | 14,210,653 | a, b = map(int, input().split())
s = input()
flag = True
for i in range(a):
if s[i] == '-':
flag = False
break
if s[a] != '-':
flag = False
for i in range(a + 1, a + b + 1):
if s[i] == '-':
flag = False
break
if flag:
print('Yes')
else:
print('No') |
abc084_b | 12,238,468 | # -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1
def main():
A,B=map(int,input().split())
S=input().split('-')
YesNo(len(S[0])==A and len(S[1])==B)
if __name__ == '__main__':
main()
|
abc084_b | 3,908,689 | A,B=map(int, input().split())
S=input()
if S[A]=="-":
st=S.split("-")
n=st[0];m=st[1]
if n.isdigit() and m.isdigit():
print("Yes")
else:
print("No")
else:
print("No")
|
abc084_b | 13,711,893 | a,b=map(int,input().split())
s=input()
s1=s[:a]
s2=s[(a+1):]
if s1.isdecimal()==True and s2.isdecimal()==True and s[a]=="-":
print("Yes")
else:
print("No")
|
abc084_b | 20,436,193 | a, b = map(int, input().split())
s = input()
if s[a] != '-':
print('No')
exit(0)
cnt = 0
for c in s:
if c == '-':
cnt += 1
print('Yes' if cnt == 1 else 'No') |
abc084_b | 16,530,617 | # B - Postal Code
A,B = map(int,input().split())
S = input()
if str.isdecimal(S[:A]) and S[A]=='-' and str.isdecimal(S[A+1:]):
print('Yes')
else:
print('No') |
abc084_b | 24,088,051 | A,B=map(int,input().split())
S=input()
if S[A]=="-":
if all(S[i]!="-" for i in range(A)) and all(S[i]!="-" for i in range(A+1,A+B+1)):
print("Yes")
exit()
print("No") |
abc084_b | 20,439,654 | a, b = map(int, input().split())
S = input()
if S[:a].isdigit() and S[a] == "-" and S[a + 1:].isdigit():print("Yes")
else:print("No") |
abc084_b | 20,447,608 | a, b = map(int,input().split())
s = input()
if s[a] == '-' and s.count('-') == 1:
print("Yes")
else:
print("No") |
abc084_b | 20,448,573 | a,b = map(int,input().split())
s = str(input())
for i in range(a+b):
if i == a:
if s[i] != '-':
print('No')
exit(0)
else:
if not s[i].isdigit():
print('No')
exit(0)
print('Yes') |
abc084_b | 20,446,441 | A,B=map(int,input().split())
S=input()
if S[A]!='-':
print('No')
else:
if (S[:A]+S[A+1:]).isdigit():
print('Yes')
else:
print('No') |
abc084_b | 16,585,504 | import sys
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LS2(): return list(sys.stdin.readline().rstrip()) #空白なし
A,B = MI()
S = LS2()
for i in range(A+B+1):
if i != A and S[i] == '-':
print('No')
break
elif i == A and S[i] != '-':
print('No')
break
else:
print('Yes')
|
abc084_b | 16,633,654 | import sys
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LS2(): return list(sys.stdin.readline().rstrip()) #空白なし
A,B = MI()
S = LS2()
for i in range(A+B+1):
if i == A:
if S[i] != '-':
print('No')
break
else:
if S[i] == '-':
print('No')
break
else:
print('Yes')
|
abc084_b | 17,911,415 | a, b = map(int, input().split())
S = input()
if S[a] != "-" or not S[:a].isnumeric() or not S[a+1:].isnumeric():
print("No")
else:
print("Yes") |
abc084_b | 15,341,783 | import re
A, B = map(int, input().split())
S = input()
print("Yes" if re.fullmatch(r"\d{"+str(A)+r"}-\d{"+str(B)+r"}", S) else "No") |
abc084_b | 20,513,044 | a,b=map(int,input().split())
s=input()
flg=1
for i in range(len(s)):
if i==a:
if s[i]!="-":
flg=0
else:
if s[i] not in "1234567890":
flg=0
if flg:
print("Yes")
else:
print("No") |
abc084_b | 21,885,994 | a, b = map(int, input().split())
s = input()
print("YNeos"[not(s[a] == '-' and all('0' <= c <= '9' for c in (s[:a] + s[a+1:])))::2]) |
abc084_b | 18,218,203 | a, b = map(int, input().split())
s = input()
flag = True
for i in range(a):
if s[i] == '-':
flag = False
break
if s[a] != '-':
flag = False
for i in range(a + 1, a + b + 1):
if s[i] == '-':
flag = False
break
if flag:
print('Yes')
else:
print('No') |
abc084_b | 1,991,278 | a,b=map(int,input().split())
s = input()
for i in range(len(s)):
if ((i==a and s[i]!="-") or (i!=a and not s[i].isdigit())):
print("No")
break
else:
print("Yes")
|
abc084_b | 21,889,936 | a,b = map(int,input().split())
s = list(input())
for i in range(a):
if s[i] == "-":
print("No")
exit()
if s[a] != "-":
print("No")
exit()
for i in range(b):
if s[a+i+1] == "-":
print("No")
exit()
print("Yes") |
abc084_b | 17,503,067 | A, B = map(int, input().split())
S = input()
if S.count('-') == 1:
x, y = S.split('-')
if len(x) == A and len(y) == B:
print("Yes")
else:
print("No")
else:
print("No")
|
abc084_b | 18,403,507 | A,B=map(int,input().split())
S=input()
if S[A]=='-' and not '-' in S[0:A] and not '-' in S[A+1:A+B+1]:
print('Yes')
else:
print('No') |
abc084_b | 16,649,621 | A,B=map(int,input().split())
S=input()
if S.count('-')==1 and S[A]=='-':
print("Yes")
else:
print("No")
|
abc084_b | 18,546,429 | from sys import stdin
from functools import reduce
import itertools
import math
# = int(stdin.readline().rstrip())
# = [int(x) for x in stdin.readline().rstrip().split()]
# = stdin.readline().rstrip()
# = [x for x in stdin.readline().rstrip().split()]
a, b = [int(x) for x in stdin.readline().rstrip().split()]
s = stdin.readline().rstrip()
flag = 1
if s[a] != "-":
flag = 0
for i in range(a):
if s[i].isdecimal() == False:
flag = 0
for i in range(a+2, len(s)):
if s[i].isdecimal() == False:
flag = 0
if flag:
print("Yes")
else:
print("No")
|
abc084_b | 18,776,078 | import sys
import os
from copy import copy
import operator
import time
import datetime
import math
from math import floor, ceil, sqrt, log
from decimal import Decimal as D
from fractions import Fraction
import functools
import random
from random import randint, shuffle
import bisect
import string
from collections import deque
import collections
import itertools
import heapq
sys.setrecursionlimit(4100000)
product = functools.partial(functools.reduce, operator.mul)
class UnionFind:
def __init__(self, n):
self.parents = [-1] * n
def __getitem__(self, item):
if type(item) == tuple:
if len(item) == 1:
return self.size(item[0])
else:
self.union(item[0], item[1])
elif type(item) == slice:
return self.same(item.start, item.stop)
else:
return self.find(item)
def __len__(self):
return self.group_count()
def __pos__(self):
return self.max_size()
def __neg__(self):
return self.min_size()
def __invert__(self):
return self.roots()
def union(self, x, y):
x, y = self.find(x), self.find(y)
if x != y:
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def find(self, x):
if self.parents[x] < 0:
return x
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def size(self, x):
return -self.parents[self.find(x)]
def same(self, x, y):
return self.find(x) == self.find(y)
def members(self, x):
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
return list(filter(lambda x: x < 0, self.parents))
def group_count(self):
return len(self.roots())
def max_size(self):
return -min(self.parents)
def min_size(self):
return -max(self.roots())
def append(self, n):
self.parents += [-1] * n
class Imos:
def __init__(self, n):
self.val = [0] * n
def add(self, x, y, n=None):
if n is None:
n = 1
self.val[x] += n
if len(self.val) > y + 1:
self.val[y+1] -= n
def imos(self):
for i in range(1, len(self.val)):
self.val[i] += self.val[i-1]
def max(self):
return max(self.val)
def min(self):
return min(self.val)
class CS:
def __init__(self, grid):
self.cs = grid
for i0 in range(len(grid)):
for i1 in range(len(grid[0])):
if i0 == 0:
if i1 == 0:
continue
self.cs[i0][i1] += self.cs[i0][i1-1]
else:
if i1 == 0:
self.cs[i0][i1] += self.cs[i0-1][i1]
else:
self.cs[i0][i1] += self.cs[i0-1][i1] + self.cs[i0][i1-1] - self.cs[i0-1][i1-1]
def sum(self, start_0, start_1, end_0, end_1):
if start_0 == 0:
if start_1 == 0:
return self.cs[end_0][end_1]
return self.cs[end_0][end_1] - self.cs[end_0][start_1-1]
if start_1 == 0:
return self.cs[end_0][end_1] - self.cs[start_0-1][end_1]
start_0 -= 1
start_1 -= 1
return self.cs[end_0][end_1] - self.cs[start_0][end_1] - self.cs[end_0][start_1] + self.cs[start_0][start_1]
def mod(n):
return n % (10 ** 9 + 7)
def sinput():
return sys.stdin.readline()[:-1]
def input():
inputs = list(map(int, sys.stdin.readline().split()))
if len(inputs) == 1:
return inputs[0]
return inputs
def listban(l):
return list(map(list, set(map(tuple, l))))
def div(n):
lower_divisors, upper_divisors = [], []
i = 1
while i * i <= n:
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n // i)
i += 1
return lower_divisors + upper_divisors[::-1]
def prime(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
n //= f
else:
f += 2
if n != 1:
a.append(n)
return a
def div_counter(l, n):
return prime(l).count(n)
def lcm(x, y):
return (x * y) // math.gcd(x, y)
def C(n, r):
if n < r:
return 0
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
def P(n, r):
if n < r:
return 0
return math.factorial(n) // math.factorial(n - r)
def H(n, r):
return C(n + r - 1, r)
def cos(x, y, a):
return (x ** 2 + y ** 2 - 2 * x * y * math.cos(math.radians(a))) ** 0.5
def DFS(g, s, pos=None):
if pos is None:
pos = set()
pos.add(s)
for i in g[s]:
if not (i in pos):
DFS(g, i, pos)
return pos
def DFS_one(g, s, pos=None):
if pos is None:
pos = set()
pos = copy(pos)
pos.add(s)
b = copy(pos)
m = copy(pos)
for i in g[s]:
if not (i in pos):
b = DFS(g, i, pos)
if len(m) < len(b):
m = b
return m
def SSP(a, li=None):
if li is None:
li = []
if len(a) == 1:
return [a[0]]
return list(set(li + SSP(a[1:], li) + list(map(lambda x: x + a[0], SSP(a[1:], li))) + [a[0]]))
def dijkstra(g, s):
n = len(g)
dist = [10**100] * n
hq = [(0, s)]
dist[s] = 0
seen = [False] * n
while hq:
v = heapq.heappop(hq)[1]
seen[v] = True
for to, cost in g[v]:
if seen[to] == False and dist[v] + cost < dist[to]:
dist[to] = dist[v] + cost
heapq.heappush(hq, (dist[to], to))
return dist
def LIS(b):
l = [b[0]]
for i in b:
if i > l[-1]:
l += [i]
else:
l[bisect.bisect_left(l, i)] = i
return len(l)
def yn(b):
if b:
print("Yes")
else:
print("No")
a, b = input()
s = sinput()
if s[a] == "-":
for i in s[:a]:
if not i in string.digits:
break
else:
for i in s[a+2:]:
if not i in string.digits:
break
else:
print("Yes")
exit()
print("No")
|
abc084_b | 1,922,740 | A,B = map(int,input().split())
S = input()
def it():
try:
for c in S[:A]:
yield int(c) in range(10)
yield S[A] == '-'
for c in S[A+1:]:
yield int(c) in range(10)
except ValueError:
yield False
print('Yes' if all(it()) else 'No') |
abc084_b | 7,963,954 | A,B=map(int,input().split())
S=list(input())
count=0
for n in range(A):
if S[n]!='-':
count+=1
else:
break
if S[A]=='-':
count+=1
for n in range(A+1,A+B+1):
if S[n]!='-':
count+=1
else:
break
if count==A+B+1:
print('Yes')
else:
print('No')
|
abc084_b | 23,285,345 | a,b = map(int,input().split())
s = str(input())
ans = True
for i in range(0,len(s)):
if i == a:
if s[i] != '-':
ans = False
else:
if s[i] == '-':
ans = False
if (ans):
print('Yes')
else:
print('No') |
abc084_b | 23,387,141 | A, B = (int(x) for x in input().split())
address = list(input())
Answer = "Yes"
for i in range(A):
if address[i] == "-":
Answer = "No"
break
if address[A] != "-":
Answer = "No"
for i in range(A + 1, A + B + 1):
if address[i] == "-":
Answer = "No"
break
print(Answer) |
abc084_b | 1,922,381 | A, B = list(map(int, input().split()))
S = input()
def judge(A, B, S):
if S[A] != '-':
return False
S = S[:A] + S[A+1:]
num = '0123456789'
for x in S:
if x not in num:
return False
return True
if judge(A, B, S):
print("Yes")
else:
print("No")
|
abc084_b | 22,565,204 | a, b = map(int, input().split())
s = input()
flg = True
for i in range(a):
if s[i] == '-':
flg = False
if s[a] != '-':
flg = False
for i in range(b):
if s[a + 1 + i] == '-':
flg = False
print("Yes" if flg else "No")
|
abc084_b | 26,529,847 | a,b = map(int,input().split())
S = input()
for i in range(a+b+1):
if (i == a and S[i] != "-") or (i != a and S[i] == "-"):
print("No")
exit()
print("Yes") |
abc084_b | 1,923,940 | a,b=[int(i) for i in input().split()]
s=input()
s2=s.split("-")
if s[a]=='-' and s2[0].isdigit() and s2[1].isdigit():
print("Yes")
else:
print("No")
|
abc084_b | 27,048,227 | a, b = map(int, input().split())
S = input()
flag = S[a]=="-"
num = {str(i) for i in range(0, 10)}
for x in S[:a]+S[a+1:]:
if x not in num:
flag = False
if flag:
print("Yes")
else:
print("No") |
abc084_b | 29,029,757 | A, B = map(int, input().split())
s = list(input().split("-"))
if len(s) != 2:
print("No")
else:
print("Yes") if len(s[0]) == A and len(s[1]) == B else print("No") |
abc084_b | 27,436,511 | a,b=map(int,input().split())
s=input()
for i in range(a):
if s[i] == '-':
print('No')
exit()
if s[a] != '-':
print('No')
exit()
for i in range(a+1,a+b+1):
if s[i] == '-':
print('No')
exit()
print('Yes') |
abc084_b | 31,446,086 | a,b = map(int,input().split())
S = input()
D = {}
for i in range(10):
D[str(i)] = 1
for i in range(a):
if not S[i] in D:
print("No")
exit()
if S[a] != "-":
print("No")
exit()
for i in range(b):
if not S[a+1+i] in D:
print("No")
exit()
print("Yes") |
abc084_b | 33,771,987 | import sys
input = sys.stdin.readline
def iinput(): return int(input())
def sinput(): return input().rstrip()
def i0input(): return int(input()) - 1
def linput(): return list(input().split())
def liinput(): return list(map(int, input().split()))
def miinput(): return map(int, input().split())
def li0input(): return list(map(lambda x: int(x) - 1, input().split()))
def mi0input(): return map(lambda x: int(x) - 1, input().split())
INF = 10**20
MOD = 1000000007
A, B = miinput()
S = sinput()
for i, c in enumerate(S):
if i == A:
if c != '-':
print('No')
exit()
else:
if c not in '0123456789':
print('No')
exit()
print('Yes') |
abc084_b | 29,589,604 | a, b = map(int, input().split())
ans = "Yes"
for i, s in enumerate(input()):
if i == a and s != "-": ans = "No"
if i != a and s == "-": ans = "No"
print(ans) |
abc084_b | 29,716,185 | A,B = map(int,input().split())
S = input()
l = [str(i) for i in range(10)]
if S[A] != "-":
exit(print("No"))
for i in range(A):
if S[i] in l:
continue
else:
exit(print("No"))
for i in range(B):
if S[A+1+i] in l:
continue
else:
exit(print("No"))
print("Yes") |
abc084_b | 1,927,929 | print['No','Yes'][map(int,raw_input().split())==map(len,raw_input().split('-'))] |
abc084_b | 19,682,672 | import sys
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def LS2(): return list(sys.stdin.readline().rstrip())
A,B = MI()
S = S()
T = S[:A]
U = S[A+1:]
if S[A] == '-' and T.isdigit() and U.isdigit():
print('Yes')
else:
print('No')
|
abc084_b | 6,781,272 | a,b = map(int,input().split())
s = input()
for i in range(a+b+1):
if i == a:
if s[i] != '-':
print('No')
break
else:
if s[i] == '-':
print('No')
break
else:
print('Yes') |
abc084_b | 36,570,366 | import re
a, b =map(int,input().split())
s = input()
if s[a] == '-' and s[0:a].isdigit() and s[a+1:].isdigit():
print("Yes")
else:
print("No") |
abc084_b | 32,855,633 | A, B = map(int, input().split())
S = input()
if S.count("-") == 1 and S[A] == "-":
print("Yes")
else:
print("No") |
abc084_b | 30,176,599 | a, b = map(int, input().split())
s = input()
if len(s) != a + b + 1:
exit(print("No"))
for i in range(a+b+1):
if i == a:
if(s[i] != '-'):
exit(print("No"))
else:
if(not(ord('0') <= ord(s[i]) <= ord('9'))):
exit(print("No"))
print("Yes") |
abc084_b | 37,299,582 | A,B=map(int,input().split())
S=input()
ans = True
if len(S) !=A+B+1:
ans = False
if S[A] != '-':
ans = False
for i in range(A):
if S[i]=='-':
ans = False
for i in range(1,B+1):
if S[-i] == '-':
ans = False
print('Yes' if ans == True else 'No') |
abc084_b | 35,578,898 | import re
a,b = map(int,input().split())
pat = re.compile('[0-9]{%d}-[0-9]{%d}'%(a,b))
print('Yes' if re.fullmatch(pat,input()) else 'No') |
abc084_b | 16,632,138 | a,b=map(int,input().split())
s=list(input())
f=0
for i in range(a):
if not s[i] in "0123456789":
f=1
if s[a]!="-":
f=1
for i in range(b):
if not s[i+a+1] in "0123456789":
f=1
print("Yes" if f==0 else "No")
|
abc084_b | 49,413,463 | a,b=map(int,input().split())
s=input()
x=s[:a]
y=s[a+1:]
#print(x,y)
for i in x+y:
if not i in "0123456789":
print("No")
exit()
if s[a]!="-":
print("No")
else:
print("Yes") |
abc084_b | 6,854,734 | A, B = map(int, input().split())
S = list(input())
N = [str(a) for a in range(10)]
ans = 'Yes'
for i, s in enumerate(S):
if i != A:
if not s in N:
ans = 'No'
else:
if s != '-':
ans = 'No'
print(ans) |
abc084_b | 10,488,405 | a,b = map(int,input().split())
c = list(input())
ans = True
for i in range(a+b+1):
if not((i==a and c[i]=="-") or (i!=a and c[i]!="-")):
ans = False
break
print("Yes" if ans else "No") |
abc084_b | 2,916,074 | a,b=map(int,input().split())
s=input()
print('Yes' if s[:a].isdigit() and s[-b:].isdigit() and s[a]=='-' else 'No')
|
abc084_b | 1,923,567 | # coding: utf-8
# Your code here!
A,B=[int(i) for i in input().split()]
S=input()
flag = 1
L = A+B+1
if len(S)== L:
for i in range(L):
if (i != A and S[i] == '-'):
flag = 0
if (i == A and S[i] != '-'):
flag = 0
else:
flag = 0
if flag == 1:
print('Yes')
else:
print('No') |
abc084_b | 6,938,092 | A, B = map(int, input().split())
S = input()
nums = ("0", "1", "2", "3", "4", "5", "6", "7", "8", "9")
isvalid = all(c in nums for c in S[:A] + S[-B:]) and S[A] == "-"
print("Yes" if isvalid else "No")
|
abc084_b | 22,569,209 | mod = 1000000007
eps = 10**-9
def main():
import sys
input = sys.stdin.readline
a, b = map(int, input().split())
S = input().rstrip('\n')
if S[a] != "-" or S.count("-") != 1:
print("No")
else:
print("Yes")
if __name__ == '__main__':
main()
|
abc084_b | 1,927,594 | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**15
mod = 10**9+7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def main():
a,b = LI()
s = S()
if len(s) != a+b+1:
return 'No'
for i in range(a):
if not ('0' <= s[i] <= '9'):
return 'No'
if s[a] != '-':
return 'No'
for i in range(b):
if not ('0' <= s[i+a+1] <= '9'):
return 'No'
return 'Yes'
print(main())
|
abc084_b | 31,453,592 | a, b = map(int, input().split())
s = input()
cond = all(s[i].isdigit() for i in range(a + b + 1) if i != a) and s[a] == "-"
print("Yes" if cond else "No")
|
abc084_b | 39,947,039 | A,B=map(int,input().split())
S=input()
print("Yes" if S.count('-')==1 and S[A]=='-' else "No") |
abc084_b | 18,446,971 | A,B=map(int, input().split())
S=input()
if S[A]=="-":
st=S.split("-")
n=st[0];m=st[1]
if n.isdigit() and m.isdigit():
print("Yes")
else:
print("No")
else:
print("No")
|
abc084_b | 16,632,062 | import sys
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split()) #空白あり
def LS2(): return list(sys.stdin.readline().rstrip()) #空白なし
A,B = MI()
S = LS2()
for i in range(A+B+1):
if i == A:
if S[i] != '-':
print('No')
break
else:
if S[i] == '-':
print('No')
break
else:
print('Yes')
|
abc084_b | 11,244,842 | import math
a,b=map(int,input().split())
s=input()
t=s.partition("-")
if s[a]=='-' and t[0].isnumeric() and t[2].isnumeric():
print("Yes")
else:
print("No")
|
abc084_b | 1,922,671 | # coding: utf-8
# Your code here!
a,b=map(int,input().split())
s=input().split('-')
if len(s)!=2:
print("No")
elif len(s[0])!=a or len(s[1])!=b:
print("No")
else:
print("Yes")
|
abc084_b | 42,890,209 | A,B=map(int,input().split())
s=input()
try:
int(s[:A])
except:
print('No')
exit()
if s[A]!='-':
print('No')
exit()
try:
int(s[A+1:])
except:
print('No')
exit()
print('Yes') |
abc084_b | 47,540,761 | A,B=map(int,input().split())
S=input()
if S[A]=="-":
S=S[:A]+S[A+1:]
if "-" not in S:
print("Yes")
else:
print("No")
else:
print("No") |
abc084_b | 53,493,979 | import re
import bisect
from math import *
from itertools import *
# n = int(input())
a, b = map(int, input().split())
s = input()
# a = list(map(int, input().split()))
if re.match(f"\d{{{a}}}-\d{{{b}}}", s):
print("Yes")
else:
print("No")
|
abc084_b | 45,454,718 | import sys
import sys
# sys.setrecursionlimit(10**8)设置最大递归次数
class FastIO:
def __init__(self):
return
@staticmethod
def read_int():
return int(sys.stdin.readline().strip())
@staticmethod
def read_float():
return float(sys.stdin.readline().strip())
@staticmethod
def read_ints():
return map(int, sys.stdin.readline().strip().split())
@staticmethod
def read_floats():
return map(float, sys.stdin.readline().strip().split())
@staticmethod
def read_ints_minus_one():
return map(lambda x: int(x) - 1, sys.stdin.readline().strip().split())
@staticmethod
def read_list_ints():
return list(map(int, sys.stdin.readline().strip().split()))
@staticmethod
def read_list_floats():
return list(map(float, sys.stdin.readline().strip().split()))
@staticmethod
def read_list_ints_minus_one():
return list(map(lambda x: int(x) - 1, sys.stdin.readline().strip().split()))
@staticmethod
def read_str():
return sys.stdin.readline().strip()
@staticmethod
def read_list_strs():
return sys.stdin.readline().strip().split()
@staticmethod
def read_list_str():
return list(sys.stdin.readline().strip())
@staticmethod
def st(x):
return sys.stdout.write(str(x) + '\n')
@staticmethod
def lst(x):
return sys.stdout.write(" ".join(str(w) for w in x) + '\n')
@staticmethod
def round_5(f):
res = int(f)
if f - res >= 0.5:
res += 1
return res
@staticmethod
def max(a, b):
return a if a > b else b
@staticmethod
def min(a, b):
return a if a < b else b
@staticmethod
def ceil(a, b):
return a // b + int(a % b != 0)
def ask(self, lst):
# CF交互题输出询问并读取结果
self.lst(lst)
sys.stdout.flush()
res = self.read_int()
# 记得任何一个输出之后都要 sys.stdout.flush() 刷新
return res
def out_put(self, lst):
# CF交互题输出最终答案
self.lst(lst)
sys.stdout.flush()
return
@staticmethod
def accumulate(nums):
n = len(nums)
pre = [0] * (n + 1)
for i in range(n):
pre[i + 1] = pre[i] + nums[i]
return pre
@staticmethod
def get_random_seed():
# 随机种子避免哈希冲突
return random.randint(0, 10 ** 9 + 7)
class Solution:
def __init__(self):
return
@staticmethod
def main(ac=FastIO()):
a, b = ac.read_ints()
s = ac.read_str()
if len(s) == a+b+1 and s[a] == "-" and all(w.isnumeric() for w in s[:a]+s[a+1:]):
ac.st("Yes")
else:
ac.st("No")
return
Solution().main()
|
abc084_b | 6,131,012 |
A,B = map(int,input().split())
S = input()
num = "0123456789"
ans = "Yes"
if len(S) != A+B+1:
ans = "No"
for i in range(len(S)):
if i != A and S[i] not in num:
ans = "No"
if i == A and S[i] != "-":
ans = "No"
print (ans)
|
abc084_b | 1,925,439 | a,b = map(int,input().split())
s=input()
if s[a] != '-' :
print('No')
else :
ans = 'Yes'
for i in range(len(s)) :
if i==a :
continue
if s[i] == '-' :
ans = 'No'
print(ans) |
abc057_a | 1,181,010 | a, b = map(int, input().split())
print((a + b) % 24) |
abc057_a | 7,551,896 | print(sum(list(map(int,input().split())))%24) |
abc057_a | 6,864,822 | #ABC058
a = list(map(int,input().split()))
print( sum(a) % 24 ) |
abc057_a | 2,170,847 | A,B=map(int,input().split())
print((A+B)%24) |
abc057_a | 4,421,336 | a,b = map(int,input().split())
print((a+b)%24) |
abc057_a | 4,742,983 | print(eval(input().replace(' ','+'))%24) |
abc057_a | 2,832,377 | print sum([int(x) for x in raw_input().split()]) % 24 |
abc057_a | 3,874,639 | A,B=map(int,input().split())
print((A+B)%24) |
abc057_a | 2,657,241 | A,B=map(int,input().split());print((A+B)%24) |
abc057_a | 38,248,106 | A,B=map(int,input().split())
print((A+B)%24) |
abc057_a | 1,239,039 | print(sum(map(int,input().split()))%24) |
abc057_a | 1,187,353 | a,b = map(int,input().split())
print((a+b)%24)
|
abc057_a | 1,180,956 | a,b = map(int,input().split(' '))
print((a+b)%24) |
abc057_a | 3,790,578 | print(sum(map(int,input().split()))%24) |
abc057_a | 4,307,889 | print sum(map(int,raw_input().split()))%24 |
abc057_a | 1,181,029 | [a, b] = map(int, input().split())
print((a + b) % 24) |
abc057_a | 1,273,214 | A,B=map(int,input().split())
print((A+B)%24) |
abc057_a | 2,470,183 | A,B=map(int,input().split())
print((A+B)%24)
|
abc057_a | 3,445,669 | a,b=map(int,input().split())
print((a+b)%24) |
abc057_a | 1,181,045 | print sum(map(int, raw_input().split()))%24 |
abc057_a | 1,183,959 | a, b = [int(x) for x in input().split()]
print((a + b) % 24)
|
abc057_a | 2,707,542 | a,b=map(int,raw_input().split())
print (a+b)%24
|
abc057_a | 3,955,508 | a,b=map(int,input().split())
print((a+b)%24)
|
abc057_a | 1,182,979 | a,b=map(int,input().split())
print((a+b)%24)
|
abc057_a | 1,207,010 | A, B = list(map(int, input().split()))
print((A+B) % 24) |
abc057_a | 2,900,512 | from collections import defaultdict
import sys,heapq,bisect,math,itertools,string
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
a,b = map(int,input().split())
print((a+b)%24) |
abc057_a | 1,181,031 | a,b = map(int,input().split())
c = (a+b)%24
print(c) |
abc057_a | 2,906,552 | a,b=map(int,input().split())
print((a+b)%24) |
abc057_a | 4,742,952 | print(sum(map(int,input().split()))%24) |
abc057_a | 1,180,833 | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def main():
a,b = LI()
return (a+b)%24
print(main())
|