problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03672 | s674586040 | Accepted | #!/usr/bin/env python3
s = input()
for i in range(1,len(s)-1):
if (len(s) - i) % 2 == 1: pass
elif s[:(len(s) - i)//2] == s[(len(s) - i)//2:-i]:
print(len(s) - i)
#print(s[:-i])
break |
p03773 | s410802338 | Accepted | a,b = map(int,input().split())
if a+ b >=24:
print(a+b-24)
else:
print(a+b) |
p02862 | s900439867 | Wrong Answer | x,y = map(int,input().split())
mod = 10**9 + 7
if (x+y)%3 != 0:
print(0)
else:
n=(x+y)//3
r = min(x-n,y-n)
p=1
q=1
for i in range(r):
p *= n-i
q *= (i+1)
ans = p * pow(q,mod-2,mod)
ans %= mod
print(ans)
|
p02555 | s886317090 | Accepted | def solve():
S = int(input())
MOD = 10**9+7
dp = [0] * (S+1)
dp[0] = 1
for i in range(1,S+1):
cnt = 0
for j in range(i-2):
cnt += dp[j]
dp[i] = cnt % MOD
print(dp[S])
if __name__ == '__main__':
solve() |
p03612 | s665056296 | Accepted | n = int(input())
P = list(map(int, input().split()))
Cnt = []
cnt = 0
ans = 0
for idx, p in enumerate(P, 1):
if idx == p:
Cnt.append(idx)
cnt += 1
else:
cnt = 0
if cnt == 2:
ans -= 1
cnt = 0
ans += len(Cnt)
print(ans) |
p02717 | s691383633 | Wrong Answer | def main(cell):
n=cell[0]
k=cell[1]
risk=int(abs(n/k))
n=n-k*(risk-2)
pren=n
while 2>0:
n=abs(n-k)
if n >pren:
break
else:
pren=n
return pren
cell=list(map(int,input().split()))
pren=main(cell)
print(pren) |
p02677 | s519292027 | Wrong Answer | import math
A, B, H, M = map(int, input().split())
long = M * 6
short = (H*60 + M) * 0.5
k = short - long
if k > 180:
k -= 180
a = (A**2) + (B**2) - (2*A*B*math.cos(math.radians(k)))
print(a**(1/2)) |
p03221 | s199267274 | Accepted | n,m=map(int,input().split())
ans=[]
re=[[] for _ in range(n)]
for _ in range(m):
a=list(map(int,input().split()))
re[a[0]-1].append(a[1])
ans.append(a)
d={}
for f in re:
new=sorted(f)
for i in range(len(new)):
d[new[i]]=i+1
for x in ans:
p=x[0]
q=d[x[1]]
print(str('{:0=6}'.format(p))+str('{:0=6}'.format(q)))
|
p03071 | s507442142 | Accepted | A,B=map(int,input().split())
ans=0
if A>B:
ans+=A
A-=1
else:
ans+=B
B-=1
ans+=max(A,B)
print(ans) |
p02755 | s283103978 | Accepted | Str = input().split()
A = int(Str[0])
B = int(Str[1])
import math
amin = math.ceil(A/0.08)
amax = (A+1)/0.08
if amax == math.floor(amax):
amax= amax-1
else:
amax = math.floor(amax)
i = amin
ans = -1
while i <= amax:
if int(i*0.1) == B:
ans = i
break
i+=1
print(ans) |
p02613 | s765557753 | Accepted | N=int(input())
ca=0
cw=0
ct=0
cr=0
for _ in range(N):
a=input()
if a=='AC':
ca+=1
elif a=='WA':
cw+=1
elif a=='TLE':
ct+=1
elif a=='RE':
cr+=1
print('AC x',ca)
print('WA x',cw)
print('TLE x',ct)
print('RE x',cr) |
p03150 | s775817037 | Wrong Answer | from sys import stdin
s = stdin.readline().rstrip()
key = "keyence"
for i in range(len(s)):
for j in range(len(s)-i):
if s[:i]+s[j:] == key:
print("YES")
exit()
print("NO") |
p03109 | s209332279 | Accepted | S=input()
print("Heisei" if S<="2019/04/30" else "TBD") |
p02819 | s851055569 | Wrong Answer | def factorization(n):
res = []
for i in range(2, int(n ** 0.5) + 1):
if n % i == 0:
cnt = 0
while n % i == 0:
cnt += 1
n //= i
res.append([i, cnt])
if n != 1:
res.append([n, 1])
return res
x = int(input())
res = x
while True:
if len(factorization(res)) == 1:
print(res)
break
res += 1 |
p02693 | s008375286 | Accepted | k = int(input())
a, b = map(int, input().split())
if a%k == 0 or b%k == 0 or (b//k) - (a//k) >= 1:
print('OK')
else:
print('NG') |
p03323 | s991511966 | Accepted | A, B = map(int, input().split())
if A <= 8 and B <= 8:
print("Yay!")
else:
print(":(") |
p02819 | s678874181 | Wrong Answer | X = int(input())
while True:
flag = 0
for i in range(2, X+1): #2からXまでのループ
if (X+1) % i == 0: #対象はX+1という数
flag = 1
break
if flag == 1:
X += 1
continue
break
print(X + 1) |
p03323 | s759919073 | Wrong Answer | def LI():
return [ int(s) for s in input().split() ]
a,b = LI()
print('Yay') if a <= 8 and b <= 8 else print(':(') |
p03137 | s226236269 | Accepted | n,m=map(int,input().split())
l=list(map(int,input().split()))
l.sort()
if n>=m:
print(0)
else:
dif_l=[]
for i in range(m-1):
dif_l.append(l[i+1]-l[i])
dif_l.sort()
sum=0
for j in range(m-n):
sum+=dif_l[j]
print(sum) |
p02727 | s253482878 | Accepted | X, Y, A, B, C = map(int, input().split())
p = sorted(list(map(int, input().split())))
q = sorted(list(map(int, input().split())))
r = sorted(list(map(int, input().split())))[::-1]
pq = sorted(p[-X:] + q[-Y:])
ans = sum(pq)
if pq[0] < max(r):
left = 0
right = len(r)
while left < right - 1:
mid = (left + right) // 2
if pq[mid] >= r[mid]:
right = mid
else:
left = mid
ans = ans + sum(r[:right]) - sum(pq[:right])
print(ans)
|
p02730 | s755835627 | Accepted | S = input()
N = len(S)
S1 = S[:N//2]
S2 = S[N//2 + 1:]
N1 = len(S1)
if S1 != S2:
print('No')
exit()
for i in range(N//4):
if S1[i] != S1[-i - 1]:
print('No')
exit()
print('Yes') |
p02767 | s614443186 | Accepted | import math
N = int(input())
X = list(map(int,input().split()))
mean = round(sum(X)/N)
var = sum([(x - mean) ** 2 for x in X])
print(var) |
p03073 | s470277781 | Wrong Answer | S = input()
n = len(S)
cnt = 0
for i in range(n):
if int(S[i])%2 == i%2:
cnt += 1
print(cnt) |
p03565 | s122236497 | Wrong Answer | import re
s=input().replace("?",".")
t=input()
for i in range(len(s)-len(t)+1):
if re.match(s[i:i+len(t)],t):
s=s.replace(".","a")
print(s[:i]+t+s[i+len(t):])
exit()
print("UNRESTORABLE") |
p02793 | s882145791 | Wrong Answer | import fractions
mod=10**9+7
def lcm(a,b):
return a*b//fractions.gcd(a,b)
n=int(input())
A=list(map(int,input().split()))
x=1
for i in range(n):
x=lcm(x,A[i])
ans=0
for i in range(n):
ans+=(x*pow(A[i],mod-2,mod))%mod
print(ans) |
p02765 | s066627966 | Accepted | n,r = map(int,input().split())
if n >= 10 :
print(r)
else:
print(r + 100 * (10 - n)) |
p02847 | s590624396 | Wrong Answer | S = input()
if S == "SUN": print(7)
if S == "MUN": print(6)
if S == "TUE": print(5)
if S == "WED": print(4)
if S == "THU": print(3)
if S == "FRI": print(2)
if S == "SAT": print(1) |
p04045 | s743614606 | Accepted | N,K = map(int,input().split())
D = list(input().split())
for x in range(N,10**6):
x = str(x)
judge = 1
for xi in x:
if(xi in D):
judge = 0
if(judge == 1):
ans = x
break
print(ans) |
p03785 | s453397696 | Wrong Answer | n, c , k = map(int, input().split())
t = []
for i in range(n):
t.append(int(input()))
t.sort()
bus = 1
limit = t[0] + k
passenger = 0
"""
最初の人のリミットが来るor定員を超える→バス追加
"""
for i in range(n):
if limit < t[i]:
bus += 1
if i+1 < n:
limit = t[i] + k
passenger += 1
if passenger == c:
bus += 1
if i+1 < n:
limit = t[i+1] + k
print(bus) |
p02697 | s183274263 | Accepted | def resolve():
N,M = map(int,input().split())
if N % 2 == 1:
for i in range(M):
print(str(i+1) + " " + str(N-i))
else:
for i in range((M-1) // 2 + 1):
print(str(i+1) + " " + str(N-i))
for i in range((M-1) // 2 + 1 , M):
print(str(i+1) + " " + str(N-i-1))
resolve() |
p02731 | s670606783 | Accepted | a=float(input())
print(a/3*a/3*a/3) |
p03076 | s429257090 | Accepted | N = 5
D = [int(input()) for _ in range(N)]
srv_t = 0
last_srv = 0
for d in D:
if d%10!=0:
t = 10 - d%10
else:
t = 0
srv_t += (d+t)
last_srv = max(last_srv,t)
print(srv_t-last_srv) |
p02582 | s428869328 | Accepted | a = input('')
S = []
num = 0
for i in a:
S.append(i)
for j in range(3):
if S[j] == 'R':
num += 1
if num == 2 and S[1] == 'S':
print(1)
else:
print(num) |
p03106 | s575744434 | Accepted | import sys
def input(): return sys.stdin.readline().strip()
def I(): return int(input())
def LI(): return list(map(int, input().split()))
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def S(): return input()
def LS(): return input().split()
INF = float('inf')
a, b, k = LI()
cds = []
ans = 1
for i in range(1, min(a, b)+1):
if a % i == 0 and b % i == 0:
cds.append(i)
print(cds[-k])
|
p02639 | s731804338 | Wrong Answer | a = list(map(int, input().split()))
for i in range(len(a)):
if a[i]==0:
print(i)
exit() |
p02748 | s835457342 | Accepted | A, B, M = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
Z = [list(map(int, input().split())) for i in range(M)]
li = []
for z in Z:
li.append(a[z[0]-1]+b[z[1]-1]-z[2])
li.append(min(a)+min(b))
print(min(li)) |
p02861 | s793099662 | Wrong Answer | from math import hypot, factorial
def dfs(p):
res = 0
for i in range(n):
if used[i]:
continue
used[i] = True
c = hypot(x[i] - x[p], y[i] - y[p]) if ~p else 0
res += dfs(i) + c
used[i] = False
return res
n = int(input())
x = [0] * n
y = [0] * n
for i in range(n):
x[i], y[i] = map(int, input().split())
used = [False] * n
ans = dfs(-1) / factorial(n)
print(ans)
|
p02988 | s765017133 | Accepted | n = int(input())
p = list(map(int, input().split()))
ans = 0
for i in range(1, n-1):
if p[i-1] > p[i] >p[i+1] or p[i-1] < p[i] < p[i+1]: ans += 1
print(ans) |
p03433 | s104837787 | Accepted | n=int(input())
a=int(input())
print("Yes" if n%500<=a else "No") |
p02760 | s490496290 | Accepted | a = []
for i in range(3):
a += list(map(int, input().split()))
bg = [False]*9
n = int(input())
for i in range(n):
b = int(input())
if b in a:
bg[a.index(b)] = True
num = [[0,1,2],[3,4,5],[6,7,8],[0,3,6],[1,4,7],[2,5,8],[0,4,8],[2,4,6]]
for x, y, z in num:
if bg[x] and bg[y] and bg[z]:
print('Yes')
exit()
print('No') |
p03815 | s551115595 | Wrong Answer | x=int(input())
print((x//11)*2 + 0 if x%11==0 else (1 if x*(x//11)+6>x else 2)) |
p02621 | s478270456 | Wrong Answer | a = int(input("整数を入力してください"))
answer = a+a*a+a*a*a
print(answer) |
p03254 | s387465173 | Wrong Answer | n, x = map(int, input().split())
A = sorted([int(i) for i in input().split()])
# print(A)
cnt = 0
for e in A:
if e <= x:
x = x - e
cnt += 1
if x == 0 or cnt == 0:
print(cnt)
else:
print(cnt-1)
|
p02702 | s751642564 | Accepted | S=input()[::-1]
l=len(S)
t=0
p=0
ss=[0]*2019
ss[0]=1
d=1
for i in S:
p=(p+int(i)*d)%2019
d*=10
d%=2019
ss[p]+=1
for c in ss:
t+=c*(c-1)//2
print(t) |
p02946 | s863793820 | Accepted | k, x = map(int, input().split())
ans_list = []
for i in range(x-k+1, x+k):
if -1000000 <= i <= 1000000:
ans_list.append(str(i))
print(" ".join(ans_list))
|
p03136 | s318372174 | Accepted | # solution
data = int(input())
array = list(map(int, input().split()))
one=max(array)
two=sum(array)-one
print("Yes" if two>one else "No") |
p02918 | s732336599 | Accepted | n,k = map(int,input().split())
S = input()
dif = 1
for i in range(0,n-1):
if S[i] != S[i+1]:
dif += 1
print(n-max(1,dif-2*k)) |
p02553 | s604355250 | Accepted | import sys
def input(): return sys.stdin.readline().rstrip()
def main():
a, b, c, d = map(int,input().split())
print(max(a*c,a*d,b*c,b*d))
if __name__=='__main__':
main() |
p02723 | s870660478 | Accepted | S = str(input())
if S[2]==S[3] and S[4]==S[5]:
print('Yes')
else:
print('No') |
p02982 | s533570985 | Accepted | n,d=map(int,input().split())
x=[list(map(int,input().split())) for i in range(n)]
lis=[False for i in range(16001)]
i=0
while(i*i<16000):
lis[i*i]=True
i+=1
ans=0
for i in range(n):
for j in range(i):
dis=sum([(x[i][k]-x[j][k])*(x[i][k]-x[j][k]) for k in range(d)])
# print(dis)
if lis[dis]:
ans += 1
print(ans) |
p02832 | s335382041 | Wrong Answer | N = int(input())
a = []
a = list(map(int,input().split()))
index = 0
count = 0
searchNum = 1
for j in range(N):
if searchNum ==1:
if not searchNum in a:
searchNum = N +1
break
if not j + 1 in a:
searchNum -= 1
break
if j <= N:
if a[index + j] == searchNum:
index = index + j
searchNum += 1
continue
else:
continue
print(int(N -searchNum))
|
p03632 | s710840012 | Wrong Answer | a,b,c,d=map(int,input().split())
ans=min(c,d)-max(a,b)
if ans<=0:
print(0)
else:
print(ans) |
p03637 | s923636018 | Accepted | import sys
input = sys.stdin.readline
n = int(input())
a = [int(x) for x in input().split()]
key_1, key_4 = 0, 0
for value in a:
if value%4 == 0:
key_4 += 1
elif value%2 == 1:
key_1 += 1
if key_4+key_1 == n and key_1 <= key_4+1:
print("Yes")
elif key_1 <= key_4:
print("Yes")
else:
print("No") |
p02621 | s974321009 | Wrong Answer | n = int(input())
print(n ** 6) |
p02583 | s235500136 | Accepted | N = int(input())
L = list(map(int,input().split()))
L.sort()
ans = 0
for i in range(N):
for j in range(i+1,N):
for k in range(j+1,N):
if L[i] == L[j] or L[j] == L[k]: continue
if L[k] < L[i] + L[j]:
ans += 1
print(ans) |
p03695 | s121712491 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
l = [i//400 for i in a]
l = set(l)
cnt = 0
for j in a:
if j >= 3200:
cnt += 1
if cnt >= 1:
cnt -= 1
print(len(l)-cnt, len(l)+cnt) |
p03632 | s176521598 | Accepted | A, B, C, D = map(int, input().split())
alice = [0]*100
bob = [0]*100
alice[A:B] = [1]*(B-A)
bob[C:D] = [1]*(D-C)
print(sum([alice[i]*bob[i] for i in range(100)])) |
p02946 | s859714656 | Accepted | k,x=map(int,input().split())
ans=""
for i in range(x-k+1,x+k):
ans+=str(i)+" "
print(ans) |
p02718 | s891282477 | Accepted | N, M = map(int,input().split())
A = list(map(int,input().split()))
counter = 0
border = sum(A)/(M*4)
for i in range(N):
if A[i] >= border:
counter += 1
if counter >= M:
print('Yes')
else:
print('No')
|
p02659 | s856121927 | Wrong Answer | import math
print(math.floor(eval(input().replace(" ", "*")))) |
p02631 | s180161262 | Accepted | N = int(input())
A = list(map(int, input().split()))
x = 0
for a in A:
x ^= a
print(" ".join(map(str, [x^a for a in A]))) |
p03251 | s122267705 | Accepted | N, M, X, Y = map(int, input().split())
x = list(map(int, input().split()))
y = list(map(int, input().split()))
ans = False
for i in range(X+1, Y+1):
if i > max(x) and i <= min(y):
ans = True
break
print("War" if ans == False else "No War") |
p03126 | s362408480 | Accepted | n, m = map(int,input().split())
a = [list(map(int,input().split())) for _ in range(n)]
ans = 0
for i in range(1, m+1):
cnt = 0
for j in range(n):
if i in a[j][1:]:
cnt += 1
if cnt == n:
ans += 1
print(ans)
|
p03696 | s108821235 | Accepted | _ = input()
S = input()
needs_right = 0
needs_left = 0
for c in S:
if c == '(':
needs_right += 1
else:
if needs_right == 0:
needs_left += 1
else:
needs_right -= 1
print('(' * needs_left + S + ')' * needs_right)
|
p02730 | s599502218 | Accepted | s = input()
l = len(s)//2
s_ = s[::-1]
s1 = s[:l]
s1_ = s1[::-1]
s2 = s[l+1:]
s2_ = s2[::-1]
if s == s_ and s1 == s1_ and s2 == s2_:
print("Yes")
else:
print("No") |
p02642 | s623236412 | Accepted | n = int(input())
a = list(map(int,input().split()))
a.sort()
ma = a[-1]
dp = [0]*(ma+1)
for i in range(1,n):
if a[i]==a[i-1]:
dp[a[i]]=1
for i in a:
for j in range(i*2,ma+1,i):
#if dp[j]==1:
#break
dp[j]=1
ans = 0
for i in a:
if dp[i]==0:
ans+=1
print(ans) |
p03221 | s051855829 | Accepted | from bisect import bisect_right
n,m=map(int,input().split())
k=[[] for i in range(n+1)]
p,y=[0]*m,[0]*m
for i in range(m):
p[i],y[i]=map(int,input().split())
k[p[i]].append(y[i])
for i in range(n+1):
k[i].sort()
for i in range(m):
x=bisect_right(k[p[i]],y[i])
ans1=str(p[i])
while len(ans1)<6:
ans1="0"+ans1
ans2=str(x)
while len(ans2)<6:
ans2="0"+ans2
print(ans1+ans2)
|
p03331 | s202885143 | Accepted | def ds(x):
ret = 0
while x > 0:
ret += x % 10
x //= 10
return ret
n = int(input())
ans = n
for i in range(1, n):
ans = min(ans, ds(i) + ds(n-i))
print(ans) |
p03284 | s384211436 | Accepted | n,k = map(int,input().split())
print(1*(n%k>0)) |
p02779 | s042261871 | Accepted | n = int(input())
As = list(map(int, input().split()))
if len(As) == len(set(As)):
print('YES')
else:
print('NO') |
p03252 | s314799267 | Accepted | s = list(str(input()))
t = list(str(input()))
s.sort()
t.sort()
al = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']
arr1 = [0] * 26
arr2 = [0] * 26
for i in range(len(s)):
arr1[ord(s[i]) - 97] += 1
for i in range(len(t)):
arr2[ord(t[i]) - 97] += 1
arr1.sort()
arr2.sort()
if arr1 == arr2:
print('Yes')
else:
print('No')
|
p02814 | s400722762 | Accepted | import fractions
n, m = map(int, input().split())
*a, = map(int, input().split())
lcm = a[0]//2
for x in a:
x //= 2
g = fractions.gcd(lcm, x)
if (lcm//g)%2 != (x//g)%2:
print(0)
quit()
lcm = lcm*x//g
print((m//lcm + 1)//2)
|
p03438 | s622941675 | Wrong Answer | from sys import stdin
from math import ceil
def main():
readline=stdin.readline
N=int(readline())
a=list(map(int,readline().split()))
b=list(map(int,readline().split()))
a.sort()
b.sort()
a_count=0
for i in range(N):
if a[i]<b[i]:
c=ceil((b[i]-a[i])/2)
a_count+=c
if sum(b)-sum(a)<0 or 3<sum(b)-sum(a):
print("No")
elif a_count<=sum(b)-sum(a):
print("Yes")
else:
print("No")
if __name__=="__main__":
main() |
p02765 | s031334048 | Wrong Answer | n, r = map(int, input().split())
print(r - 100 * max(10 - n, 0)) |
p02724 | s908483535 | Accepted | x=int(input())
ans=(x//500)*1000
x-=(x//500)*500
ans+=(x//5)*5
print(ans) |
p03281 | s953109432 | Wrong Answer | n=int(input())
j=1
a=0
while j<=n:
d=0
for i in range(1,j):
if j%i==0:
d+=1
if d==8:
a+=1
j+=2
print(a)
|
p03645 | s756180526 | Wrong Answer | n,m = map(int,input().split())
lis1 = []
lis2 = []
ans = "IMPOSSIBLE"
for i in range(m):
a,b = map(int,input().split())
if a == 1:
lis1.append(b)
else:
lis2.append((a,b))
lis2 = set(lis2)
for j in lis1:
if (j,n) in lis2:
ans = "POSSIBLE"
else:
pass
print(lis1,lis2)
print(ans) |
p03012 | s747442612 | Wrong Answer | n = int(input())
w = list(map(int, input().split()))
w_sum = sum(w)
num = 0
ans = 0
for i in range(n):
num += w[i]
if num*2>=w_sum:
ans = num-(w_sum-num)
break
if n == 2:
ans = w[1]-w[0]
print(ans) |
p03711 | s267152993 | Wrong Answer | A={1, 3, 5, 7, 8, 10, 12}
B={4, 6, 9, 11}
C={2}
D= {map(int, input().split())}
print("Yes" if D <= A or D <= B or D <= C else "No") |
p02578 | s003867472 | Accepted | N = int(input())
A = list(map(int, input().split()))
sum_value = 0
for i in range(len(A)-1):
if A[i] >= A[i+1]:
x = A[i] - A[i+1]
A[i+1] = x + A[i+1]
sum_value += x
print(sum_value) |
p03815 | s246740709 | Accepted | print((2*int(input())+9)//11) |
p03371 | s713825460 | Accepted | a,b,c,x,y=map(int,input().split())
ans1=a*x+b*y
ans2=2*c*max(x,y)
ans3=2*c*min(x,y)+a*(x-min(x,y))+b*(y-min(x,y))
print(min(ans1,ans2,ans3)) |
p03067 | s098971260 | Wrong Answer | a,b,c,=map(int, input().split())
if a<=c<=b:
print("Yes")
else:
print("No")
|
p02924 | s002625134 | Accepted | n = int(input())
print(n*(n-1)//2) |
p02548 | s457724014 | Accepted | import numpy as np
n = int(input())
count = np.zeros(n, dtype=np.int)
for d in range(1, n):
count[d::d] += 1
print(count.sum()) |
p04044 | s566763382 | Wrong Answer | n,l = map(int, input().split())
data = []
for i in range(n):
data.append(input())
data.sort()
for i in data:
print(i) |
p03711 | s138009743 | Wrong Answer | a,b = map(int, input().split())
listb = [4,6,9,11]
tmp = a in listb
print(tmp)
if (a == 2 and b ==2):
print("Yes")
elif (a in listb and b in listb):
print("Yes")
else:
print("No") |
p03293 | s131793596 | Accepted | s = list(input())
t = list(input())
for x in range(0,len(s)):
if s == t:
print("Yes")
exit()
s.insert(0, s[-1])
s.pop()
if s ==t:
print("Yes")
else:
print("No") |
p02702 | s607837783 | Accepted | s = input()
from collections import Counter
x = 1
mod = 2019
total = 0
ans = 0
cnt = Counter()
for i in range(len(s)-1,-1,-1):
cnt[total] += 1
total = total + int(s[i])*x
total %= mod
ans += cnt[total]
x = x*10%2019
print(ans) |
p02665 | s724534623 | Accepted | n = int(input())
values = list(map(int, input().split()))
from itertools import accumulate
copy = values[:]
copy.reverse()
acc = list(accumulate(copy))
acc.reverse()
b = 1
total = 1
for i in range(n+1):
a = values[i]
bCandidate = b - a
if bCandidate < 0:
print(-1)
exit()
b = min(2*bCandidate, acc[i] - a)
total += b
print(total) |
p02952 | s136648305 | Wrong Answer | import sys
n=int(input())
ans=0
for i in range(1,n):
s=str(i)
if len(s)%2==1:
ans+=1
print(ans) |
p02720 | s248182072 | Accepted | def solve():
K = int(input())
all = []
for i in range(1,10):
dfs(1,i,all)
all.sort()
print(all[K-1])
def dfs(d, val, all):
all.append(val)
if d == 10:
return
for j in [-1,0,1]:
add = val % 10 + j
if 0 <= add <= 9:
dfs(d+1, val*10+add, all)
if __name__ == '__main__':
solve() |
p03797 | s314895931 | Accepted | def slove(n, m):
tmp = n if n < m // 2 else m // 2
tmp2 = (m - tmp * 2) // 4
return tmp + tmp2
if __name__ == "__main__":
n, m = [int(i) for i in input().split()]
print(slove(n, m))
|
p03471 | s007001671 | Wrong Answer | N, Y = map(int, input().split())
for ykt in range(0, N+1):
for icy in range(0, N+1):
hdy = N - ykt - icy
if 10000 * ykt + 5000 * icy + 1000 * hdy:
print(str(ykt) + ' ' + str(icy) + ' ' + str(hdy))
exit()
print('-1 -1 -1')
|
p03767 | s975742918 | Accepted | from sys import stdin
import math
N = int(stdin.readline().rstrip())
a = list(map(int, stdin.readline().rstrip().split()))
a_sorted = sorted(a)
total = 0
for i in range(N*1, N*3, 2):
total += a_sorted[i]
print(total)
|
p02778 | s898347315 | Wrong Answer | S=input().split(" ")
for i in range(len(S)):
print("x",end="")
|
p03219 | s040634691 | Accepted | x, y = map(int, input().split())
print(x + y // 2)
|
p03804 | s608568184 | Wrong Answer | n,m = map(int,input().split())
list_A = list(input() for i in range(n))
list_B = list(input() for i in range(m))
print(list_A)
print(list_B)
k = "No"
for i in range(n-m+1):
for t in range(n-m+1):
if any( list_A[v+i][t:t+m]!=list_B[v] for v in range(m)):
break
k = "Yes"
print(k) |
p03126 | s868076697 | Wrong Answer | n, m = map(int, input().split())
c = list(map(int, input().split()))
A = set(c[1:])
for i in range(n-1):
t = list(map(int, input().split()))
A ^= set((t[1:]))
print(len(A)) |
p03623 | s023237207 | Accepted | def solve():
x, a, b = map(int, input().split())
if min(abs(a-x), abs(b-x)) == abs(a-x):
print("A")
else:
print("B")
return 0
if __name__ == "__main__":
solve()
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.