problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03281 | s828165215 | Wrong Answer | n = int(input())
if n >= 195:
print(3)
elif n >= 165:
print(2)
elif n >= 105:
print(1)
else:
print(0)
|
p03042 | s860837981 | Accepted | s = int(input())
L, R = divmod(s, 100)
if 0 < L < 13:
if 0 < R < 13:
print('AMBIGUOUS')
else:
print('MMYY')
elif 0 < R < 13:
print('YYMM')
else:
print('NA') |
p02818 | s141672925 | Accepted | n = list(map(int,input().split()))
ans1 = n[0] - n[2]
ans2 = (n[0] + n[1]) - n[2]
if ans1 <= 0:
ans1 = 0
if ans1 > 0:
ans2 = n[1]
elif ans2 <= 0:
ans2 = 0
print(ans1,ans2)
|
p02775 | s410533637 | Accepted | N = ("00"+input())[::-1]
ans = 0
carry = 0
for i in range(len(N)-1):
n = int(N[i])
nextn = int(N[i+1])
if carry == 1:
carry = 0
n += 1
if n <=4:
ans += n
elif n >= 6:
ans += 10-n
carry = 1
else: # n==5
if nextn <= 4:
ans += n
else:
ans += 10-n
carry = 1
print(ans)
|
p03210 | s039526017 | Accepted | X = int(input())
if X == 7:
print('YES')
elif X == 5:
print('YES')
elif X == 3:
print('YES')
else:
print('NO') |
p04019 | s637721701 | Accepted | S = input().strip()
C = {"N":0,"S":0,"E":0,"W":0}
for i in range(len(S)):
C[S[i]] += 1
if C["N"]>0 and C["S"]>0 and C["E"]>0 and C["W"]>0 or C["N"]==0 and C["S"]==0 and C["E"]>0 and C["W"]>0\
or C["N"]>0 and C["S"]>0 and C["E"]==0 and C["W"]==0 or C["N"]==0 and C["S"]==0 and C["E"]==0 and C["W"]==0:
print("Yes")
else:
print("No") |
p03286 | s564888357 | Accepted | import sys
N = int(sys.stdin.readline())
if N == 0:
print(0)
sys.exit()
binN = ""
pN = abs(N)
while N != 0:
if abs(N % -2) == 1:
binN += "1"
else:
binN += "0"
N += N%(-2)
N //= -2
print(binN[::-1]) |
p03106 | s163727307 | Accepted | a,b,k =map(int ,input().split())
n =[]
for i in range(100):
if a %(i+1) ==0 and b %(i+1) ==0:
n.append(i+1)
n.sort(reverse =True)
print(n[k-1]) |
p03012 | s874355648 | Accepted | import sys
input = sys.stdin.readline
n=int(input())
w = list(map(int,input().split()))
ans = sum(w)
for i in range(n):
ans = min(ans,abs(sum(w[:i])-sum(w[i:])))
print(ans) |
p03162 | s773910507 | Accepted | n = int(input())
dp = [[0]*n for i in range(3)]
for i in range(n):
if i==0:
dp[0][0], dp[1][0], dp[2][0] = map(int, input().split())
continue
a, b, c = map(int, input().split())
dp[0][i] = max(dp[1][i-1]+a, dp[2][i-1]+a)
dp[1][i] = max(dp[0][i-1]+b, dp[2][i-1]+b)
dp[2][i] = max(dp[0][i-1]+c, dp[1][i-1]+c)
print(max(dp[0][n-1], dp[1][n-1], dp[2][n-1])) |
p02677 | s633129890 | Accepted | import math
A, B, H, M = map(int, input().split())
thetaA = math.radians(0.5*(60*H+M))
thetaB = math.radians(6*M)
Ax = A*math.cos(thetaA)
Ay = A*math.sin(thetaA)
Bx = B*math.cos(thetaB)
By = B*math.sin(thetaB)
dis = math.sqrt(pow(Ax-Bx,2) + pow(Ay-By,2))
print(dis) |
p03815 | s458752383 | Wrong Answer | x = int(input())
if x<11:
if x<=6:
print(1)
else:
print(2)
else:
if x-11*(x//11)<=6:
print(2*x//11+1)
else:
print(2*x//11+2) |
p02958 | s383310768 | Accepted | n=int(input())
p=list(map(int,input().split()))
t=list(range(1,n+1))
cnt=0
for i in range(n):
if p[i]!=t[i]:
cnt+=1
print('YES' if 0<=cnt<=2 else 'NO') |
p02697 | s789852964 | Accepted | n, m = map(int, input().split())
if n % 2 == 1:
for i in range(m):
print(n - i, i + 1)
else:
used = [False] * (n + 1)
offset = 0
for i in range(m):
a = n - (i + offset)
b = i + offset + 1
d = min(a - b, n - (a - b))
if used[d] or a - b == n - (a - b):
offset = 1
used[d] = True
print(n - i, i + offset + 1)
|
p02988 | s624853192 | Accepted | n = int(input())
arr = list(map(int, input().split()))
ans =0
for i in range(1,n-1, 1):
if arr[i-1] < arr[i] and arr[i] <arr[i+1]:
ans +=1
if arr[i-1] > arr[i] and arr[i] >arr[i+1]:
ans +=1
print(ans) |
p02861 | s235830221 | Wrong Answer | import itertools
N=int(input())
X=[list(map(int,input().split())) for i in range(N)]
total=0
route=list(itertools.combinations(X,2))
print(route)
for i in route:
total+=((i[0][0]-i[1][0])**2+(i[0][1]-i[1][1])**2)**(1/2)
print(total*2/N) |
p02696 | s115517229 | Accepted | A, B, N = map(int, input().split())
from math import floor
if B - 1 <= N:
x = B - 1
else:
x = N
print(floor(A*x/B) - A*floor(x/B)) |
p02778 | s100262310 | Accepted | U = input()
print("x" * len(U))
|
p03352 | s356673416 | Wrong Answer | from math import sqrt, log
x = int(input())
ans = 1
for i in range(2, int(sqrt(x)) + 1):
n = int(pow(i, int(log(x, i))))
if n <= x:
ans = max(ans, n)
print(ans)
|
p02790 | s846280031 | Accepted | import math
a,b= list(map(int,input().split(" ")))
aa = str(a) * b
bb = str(b) * a
if aa < bb:
print(aa)
else:
print(bb) |
p03774 | s609070565 | Accepted | n, m = map(int, input().split())
hito = [list(map(int, input().split())) for i in range(n)]
point = [list(map(int, input().split())) for j in range(m)]
for k in range(n):
min_ten = abs(point[0][0]-hito[k][0])+abs(point[0][1]-hito[k][1])
min_num = 1
for p in range(1, m):
kyori = abs(point[p][0]-hito[k][0])+abs(point[p][1]-hito[k][1])
if kyori < min_ten:
min_ten = kyori
min_num = p+1
print(min_num) |
p03672 | s262353968 | Accepted | S = input()
for i in range(len(S)-1,0,-1):
s = S[:i]
if len(s)%2: continue
m = len(s)//2
if s[:m] == s[m:]:
print(len(s))
exit() |
p03759 | s336913062 | Accepted | a, b, c = map(int, input().split())
if b-a == c-b:
print("YES")
else:
print("NO") |
p03495 | s426577780 | Wrong Answer | N, K = map(int, input().split())
*A, = map(int, input().split())
d = [0]*(N+1)
for a in A:
d[a] += 1
d.sort()
d.reverse()
print(sum(d[K:]))
|
p02935 | s759542418 | Accepted | import heapq
n = int(input())
v = list(map(float,input().split()))
heapq.heapify(v)
for i in range(n-1):
v1 = heapq.heappop(v)
v2 = heapq.heappop(v)
heapq.heappush(v,(v1+v2)/2)
ans = heapq.heappop(v)
print(ans)
|
p03680 | s947293224 | Accepted | n=int(input())
count=0
A=[]
for i in range(n):
A.append(input())
temp=1
ans = -1
for i in A:
temp=A[int(temp)-1]
count+=1
if temp=='2':
ans=count
break
print(ans) |
p02861 | s443665718 | Wrong Answer | n=int(input())
l=[]
for i in range(n):
x,y=map(int,input().split())
l.append([x,y])
import itertools
seq=[i for i in range(n)]
p=list(itertools.permutations(seq))
import math
ans=0
for pp in p:
for i in range(n-1):
xy=math.sqrt((l[pp[i]][0]+l[pp[i+1]][0])**2 + (l[pp[i]][1]+l[pp[i+1]][1])**2)
ans+=xy
print(ans/len(p)) |
p03309 | s109884876 | Accepted | n=int(input())
a=list(map(int,input().split()))
for i in range(n):
a[i]-=i+1
a=sorted(a)
def f(x):
ans=0
for i in range(n):
ans+=abs(x-a[i])
return ans
if n%2==0:
m=n//2
else:
m=(n+1)//2
print(f(a[m-1]))
|
p02935 | s281501095 | Accepted | n = int(input())
v = list(map(float, input().split()))
v.sort()
for _ in range(n-1):
v[1] = (v[0]+v[1])/2
v.pop(0)
print(v[0]) |
p02842 | s983447090 | Accepted | import math
import sys
readline = sys.stdin.readline
def main():
n = int(readline().rstrip())
for i in range(50001):
k = math.floor(i * 1.08)
if n == k:
print(i)
return
print(':(')
if __name__ == '__main__':
main()
|
p03457 | s661891334 | Wrong Answer | # -*- coding:utf-8 -*-
n = int(input())
t, x, y = [0], [0], [0]
for i in range(n):
t_i, x_i, y_i = map(int, input().strip().split())
t.append(t_i)
x.append(x_i)
y.append(y_i)
can = "YES"
for i in range(n):
dt = t[i+1] - t[i]
dist = abs(x[i+1] - x[i]) + abs(y[i+1] - y[i])
if (dt < dist):
can = "NO"
if(dist % 2) != (dt % 2):
can = "NO"
print(can) |
p03163 | s755042380 | Wrong Answer | N,W = map(int,input().split())
A = [list(map(int, input().split())) for i in range(N)]
dp = [[0 for _ in range(W+1) ] for _ in range(N + 1)]
for i in range(1,N + 1):
for j in range(W + 1):
if j - A[i-1][0] >= 0:
dp[i][j] = dp[i - 1][j - A[i-1][0]] + A[i - 1][1]
else:
dp[i][j] = dp[i-1][j]
#print(dp)
print(max(dp[N])) |
p02820 | s226829930 | Accepted | N,K=map(int,input().split())
R,S,P=map(int,input().split())
L=input()
T=[]
for i in range(N):
T.append(L[i])
for i in range(K,N):
if T[i]==T[i-K]:
T[i]="0"
p=0
for i in T:
if i=="r":
p+=P
elif i=="s":
p+=R
elif i=="p":
p+=S
print(p) |
p03485 | s686764576 | Wrong Answer | import numpy as np
a, b = map(int, input().split())
print(np.ceil(a+b/2)) |
p02922 | s872927531 | Accepted | A, B = map(int, input().split())
count, outlet = 0, 1
while outlet < B:
outlet = outlet-1
outlet = outlet+A
count = count+1
print(count) |
p03607 | s941835012 | Accepted | def main():
import collections
import sys
input = sys.stdin.readline
n = int(input())
b = []
for i in range(n):
a = int(input())
b_append = b.append
b_append(a)
s = set(b)
s = tuple(s)
c = collections.Counter(b)
ans = 0
for i in range(len(s)):
if c[s[i]] % 2 == 0:
continue
else:
ans += 1
print(ans)
if __name__ == '__main__':
main() |
p03657 | s631902710 | Accepted | A, B = map(int, input().split())
if A % 3 == 0 or B % 3 == 0 or (A + B) % 3 == 0:
print('Possible')
else:
print('Impossible') |
p02707 | s849393309 | Accepted | n=int(input())
a=list(map(int,input().split()))
l=[0 for i in range(n)]
for i in a:
l[i-1]+=1
for i in l:
print(i) |
p03261 | s293341420 | Accepted | N = int(input())
W = ['0'] * N
for i in range(N):
W[i] = input()
if len(set(W)) != N:
print("No")
exit()
k = W[0][-1]
for i in range(1,N):
if W[i][0] != k:
print("No")
exit()
k = W[i][-1]
print("Yes") |
p03779 | s914920600 | Wrong Answer | x = int(input())
num = 1
while num**2+num < 2*x:
print(num,num**2-num)
num += 1
print(num) |
p03385 | s105807967 | Accepted | s = input()
if 'a' in s and 'b' in s and 'c' in s:
print("Yes")
else:
print("No")
|
p02820 | s892122729 | Accepted | n,k=map(int,input().split())
get_score=list(map(int,input().split()))
t=list(input())
dic={'r':0,'s':1,'p':2}
ans=0
for i in range(n):
if t[i]=='D':continue
if i+k<n and t[i]==t[i+k]:
t[i+k]='D'
ans+=get_score[(dic[t[i]]+2)%3]
print(ans) |
p03804 | s928993418 | Accepted | n,m=map(int,input().split())
a=[]
b=[]
ans=False
for _ in range(n):
a.append(input())
for _ in range(m):
b.append(input())
for i in range(n-m+1):
for j in range(n-m+1):
for k in range(m):
if a[i+k][j:j+m]!=b[k]:
break
if k==m-1:
ans=1
if ans==1:
break
print('Yes') if ans==1 else print('No') |
p03720 | s740034306 | Wrong Answer | from collections import defaultdict
N, M = map(int, input().split())
d = defaultdict(int)
for _ in range(M):
a, b = map(int, input().split())
d[a] += 1
d[b] += 1
for i in d.values():
print(i) |
p03665 | s869159318 | Accepted | from math import factorial
N,P=map(int,input().split())
A=list(map(int,input().split()))
num_k=0
num_g=0
for i in range(N):
if A[i]%2==0:
num_g+=1
else:
num_k+=1
n=num_k//2
ans_k=0
for i in range(0,n*2+1,2):
ans_k+=factorial(num_k)/factorial(i)/factorial(num_k-i)
ans_g=2**(num_g)
ans=int(ans_k*ans_g)
if P==0:
print(ans)
else:
ans=2**N-ans
print(ans) |
p02958 | s986363618 | Accepted | n = int(input())
p = tuple(map(int, input().split()))
cnt = 0
for i in range(1, n+1):
if i != p[i-1]:
cnt += 1
if cnt > 2:
print("NO")
else:
print("YES") |
p02817 | s394331420 | Wrong Answer | S,T=map(str,input().split())
print(S+T) |
p03910 | s036116148 | Accepted | n = int(input())
ans = 0
lst = []
for i in range(1,n+1):
ans += i
lst.append(i)
if ans>=n:
break
num = ans-n
if num != 0:
lst.remove(num)
L =len(lst)
for i in range(L):
print(lst[i]) |
p02953 | s033684236 | Accepted | N = int(input())
H = list(map(int,input().split()))
can = True
for i in reversed(range(1,N)):
if H[i - 1] - 1 == H[i]:
H[i - 1] -= 1
elif H[i - 1] - 1 > H[i]:
can = False
break
print(['No', 'Yes'][can]) |
p04005 | s456748757 | Wrong Answer | import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()
def resolve():
L=list(map(int,input().split()))
prod=L[0]*L[1]*L[2]
ans=10**9
for i in L:
if i%2==0:
ans= 0
break
else:
ans=min(ans,prod//i)
print(ans)
resolve() |
p04045 | s695772692 | Accepted | N,K=map(int,input().split())
D=[int(x) for x in input().split()]
D=set(D)
kouho=N
while(1):
lenkouho=len(str(kouho))
flag=1
for i in range(lenkouho):
if int(str(kouho)[i]) in D:
flag=0
if flag==1:
print(kouho)
break
kouho+=1
|
p03145 | s670467546 | Accepted | a,b,c = map(int,input().split())
print(int((a * b) / 2)) |
p03434 | s053393621 | Accepted | N=int(input())
A=list(map(int,input().split()))
A.sort(reverse=True)
Alice=A[::2]
Bob=A[1::2]
print(sum(Alice)-sum(Bob)) |
p02792 | s023260997 | Accepted | n=int(input())
l=[]
for i in range(1,n+1):
t=list(str(i))
l.append((t[0],t[-1]))
ans=0
for i in range(1,10):
for j in range(1,10):
ans+=l.count((str(i),str(j)))*l.count((str(j),str(i)))
print(ans) |
p02989 | s186698383 | Wrong Answer | N = int(input().rstrip())
line = input().rstrip()
l = [int(v) for v in line.split()]
l.sort()
uniq_list = sorted(list(set(l)))
result = 0
cur_i = 0
for i in range(len(uniq_list)):
for j in range(cur_i, len(l)):
if uniq_list[i] == l[j]:
if (N / 2) == j:
result = uniq_list[i] - uniq_list[i - 1]
break
else:
cur_i = j + 1
print(result) |
p02582 | s830369607 | Wrong Answer | S = list(input())
count = 0
ans = 0
for w in S:
if w == 'R':
count += 1
else:
if count > ans:
ans = count
count = 0
print(ans)
|
p02744 | s929209478 | Accepted | N=int(input())
l=["a","b","c","d","e","f","g","h","i","j"]
def hu(t,c,n):
if n<N:
for i in range(0,c):
hu(t+[i],c,n+1)
hu(t+[c],c+1,n+1)
else:
pr(t)
def pr(t):
for i in t:
print(l[i],end="")
print()
hu([0],1,1) |
p02922 | s309406337 | Accepted | A=list(map(int,input().split()))
a=A[0]
b=A[1]
count=0
i=1
while i<b:
count=count+1
i=i+a-1
print(count) |
p02705 | s193946926 | Wrong Answer | r = int(input())
ma = r * 2 * 3.1415 |
p03038 | s648455795 | Accepted | from sys import stdin
nii=lambda:map(int,stdin.readline().split())
n,m=map(int,input().split())
a=sorted(list(nii()))
l=[list(nii()) for i in range(m)]
l=sorted(l,key=lambda x:x[1],reverse=True)
man=[]
num=0
for b,c in l:
man+=[c]*b
num+=b
if num>n:
break
ans=0
for i in range(n):
if i<num:
ans+=max(a[i],man[i])
else:
ans+=a[i]
print(ans) |
p02570 | s546639160 | Accepted | d,t,s=map(int,input().split())
if d/s<=t:print("Yes")
else:print("No") |
p02676 | s202736456 | Accepted | import sys
def input():
return sys.stdin.readline().strip()
MOD = 10 ** 9 + 7
sys.setrecursionlimit(20000000)
INF = float("inf")
def main():
K = int(input())
S = list(input())
if len(S) <= K:
print(*S, sep="")
else:
answer = S[:K] + ["..."]
print(*answer, sep="")
if __name__ == "__main__":
main()
|
p03637 | s577439152 | Accepted | n = int(input())
a = list(map(int, input().split()))
x,y,z = 0,0,0
for i in a:
if i%4 == 0: x += 1
elif i%2 == 0: y += 1
else: z += 1
if x >= z-1+y%2: print("Yes")
else: print("No") |
p02860 | s294141347 | Accepted | def main():
N = int(input())
S = list(input())
flag = False
for i in range(N):
T1 = S[:i]
T2 = S[i:N]
if(T1 == T2):
flag = True
#print('Yes')
break
# print(T1)
# print(T2)
if(flag):
print('Yes')
else:
print('No')
if __name__ == "__main__":
main() |
p02684 | s013765017 | Wrong Answer | n,k=map(int,input().split())
A=list(map(int,input().split()))
A=[0]+A
B=[]
C=[0]+[-1]*n
now_city=1
seen=set()
#【ループ回数】200000
for i in range(1,len(A)):
print("Baah")
|
p03251 | s875434598 | Accepted | n, m, X, Y = map(int, input().split())
x = list(map(int, input().split()))
y = list(map(int, input().split()))
x.sort()
y.sort()
for z in range(X+1, Y):
if x[n-1] < z <= y[0]:
print("No War")
exit()
print("War") |
p03545 | s422287871 | Accepted | import sys
s = input()
for i in range(8):
siki = s[0]
tmp = int(s[0])
for j in range(3):
if i&(1<<j):
siki = siki+'+'+s[j+1]
tmp+=int(s[j+1])
else:
siki = siki + '-' + s[j+1]
tmp-=int(s[j+1])
if tmp==7:
print(siki,"=7",sep="")
exit() |
p02682 | s916390364 | Accepted | a, b, c, k = map(int, input().split())
ans = 0
ans += min(a, k) - min(c, max(0, k-a-b))
print(ans)
|
p03544 | s198883029 | Accepted | def lucas(n):
global nlist
if n==0:
return 2
if n==1:
return 1
if nlist[n]!=0:
return nlist[n]
else:
nlist[n]=lucas(n-1)+lucas(n-2)
return lucas(n-1)+lucas(n-2)
nlist=[0 for a in range(100)]
print(lucas(int(input())))
|
p02600 | s161188677 | Accepted | a = int(input())
if 400<=a and a<=599:
print(8)
elif 600<=a and a<=799:
print(7)
elif 800<=a and a<=999:
print(6)
elif 1000<=a and a<=1199:
print(5)
elif 1200<=a and a<=1399:
print(4)
elif 1400<=a and a<=1599:
print(3)
elif 1600<=a and a<=1799:
print(2)
elif 1800<=a and a<=1999:
print(1) |
p02621 | s000250263 | Accepted | a = int(input())
print(a + a ** 2 + a ** 3)
|
p03163 | s754052965 | Accepted | def solve(N, W, weight_values):
dp = [0 for _ in range(W + 1)]
for i in range(N):
i_weight, i_value = weight_values[i]
for w in range(W, i_weight - 1, -1):
# dp[w] = max(dp[w - i_weight] + i_value, dp[w])
temp = dp[w - i_weight] + i_value
if temp > dp[w]:
dp[w] = temp
print(dp[W])
def iln(): return list(map(int, input().split()))
N, W = iln()
w_v = []
for i in range(N):
w_v.append(iln())
solve(N, W, w_v)
|
p02994 | s192661584 | Wrong Answer | N, L = map(int, input().split())
s = ((L+1-1) + (L+N-1))*N // 2
if L > 0:
print(s - 2)
else:
if L+N-1 >= 0:
print(s)
else:
print(s - (L+N-1))
|
p02888 | s602531986 | Accepted | import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N = ir()
L = lr()
L.sort()
answer = 0
for i in range(N-1, -1, -1):
# iが一番大きい辺
x = L[i]
left = 0
right = i - 1
while left < right:
if L[left] + L[right] <= x:
left += 1
continue
answer += (right - left)
right -= 1
print(answer)
|
p03150 | s227457308 | Wrong Answer | S=list(input())
A=list("keyence")
import sys
while True:
s = S.pop(0)
if s == A[0]:
A.pop(0)
else:
pass
if len(A) == 0:
print("YES")
sys.exit()
if len(S) == 0:
print("NO")
sys.exit() |
p02748 | s741579086 | Accepted | #!/usr/bin/env python3
def main():
A, B, M = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
min_cost = min(a) + min(b)
for i in range(M):
x, y, c = map(int, input().split())
cost = a[x - 1] + b[y - 1] - c
if min_cost > cost:
min_cost = cost
print(min_cost)
if __name__ == "__main__":
main()
|
p02727 | s581027048 | Wrong Answer | x, y, na, nb, nc = map(int, input().split())
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
c = [int(i) for i in input().split()]
a.sort(reverse=True)
b.sort(reverse=True)
c.sort(reverse=True)
a = a[:x]
b = b[:y]
ai = len(a) - 1
bi = len(b) - 1
for i in c:
if i > a[ai]:
a[ai] = i
bi -= 1
elif i > b[bi]:
b[bi] = i
bi -= 1
else:
break
print(sum(a)+sum(b)) |
p02645 | s790766139 | Wrong Answer | s = "This is a pen."
n = 1
m = 4
print(s[n-1:n-1+m]) # 'This'
print(s[0:4]) # 'This'
print(s[-4:-1]) # 'pen' |
p02676 | s496048047 | Accepted | # coding: utf-8
def solve(*args: str) -> str:
k = int(args[0])
S = args[1]
return S if len(S) <= k else S[:k]+'...'
if __name__ == "__main__":
print(solve(*(open(0).read().splitlines())))
|
p02627 | s815421647 | Accepted | a = input()
if a.isupper():
print('A')
else:
print('a') |
p02687 | s576885905 | Wrong Answer | s = input()
print('ABC' if s == 'ARC' else 'ABC') |
p03543 | s162434423 | Accepted | N = list((input()))
if N[0] == N[1] and N[1] == N[2] or N[-1] == N[-2] == N[-3]:
print('Yes')
else:
print('No')
|
p02747 | s050751027 | Wrong Answer | input_line = input()
input_num = len(input_line)
ans = 'Yes'
num = 0
for i in range(input_num):
if num == 0:
if input_line[i] == 'h':
if i + 1 < input_num:
if input_line[i + 1] == 'i':
num = 1
ans = 'Yes'
else:
ans = 'No'
else:
ans = 'No'
else:
num = 0
print(ans) |
p02602 | s082113847 | Accepted | n,k=map(int,input().split())
a=list(map(int,input().split()))
for i in range(n-k):
if a[i]<a[i+k]:
print('Yes')
else:
print('No') |
p03095 | s719198915 | Accepted | #import sys
#import numpy as np
import math
#from fractions import Fraction
import itertools
from collections import deque
from collections import Counter
#import heapq
from fractions import gcd
#input=sys.stdin.readline
import bisect
n=int(input())
s=list(input())
c=Counter(s)
c=c.values()
ans=1
mod=10**9+7
for i in c:
ans*=(i+1)
ans%=mod
print(ans-1) |
p02820 | s752793897 | Accepted | N, K = map(int, input().split())
R, S, P = map(int, input().split())
T = list(input())
score = {'r': P, 'p': S, 's': R}
ans = 0
for i in range(K):
flag = True
while i < N:
if i >= K and T[i] == T[i-K]:
flag = not flag
else:
flag = True
if flag:
ans += score[T[i]]
i += K
print(ans) |
p03557 | s803570412 | Accepted | n = int(input())
a = sorted(map(int, input().split()))
b = sorted(map(int, input().split()))
c = sorted(map(int, input().split()))
import bisect
ans = 0
for i in b:
A = bisect.bisect_left(a, i)
C = n - bisect.bisect_right(c, i)
ans += A * C
print(ans) |
p02835 | s005667524 | Wrong Answer | a1, a2, a3 = map(int,input().split())
if a1 + a2 + a3 <= 22:
print('bust')
else:
print('win') |
p02755 | s543076593 | Accepted | A, B = map(int, input().split())
A_min = 12.5 * A
A_max = 12.5 * (A + 1)
B_min = 10 * B
B_max = 10 * (B + 1)
if A % 2 == 0:
myList1 = list(range(int(A_min), int(A_max + 1)))
else:
myList1 = list(range(int(A_min + 1), int(A_max)))
myList2 = list(range(int(B_min), int(B_max)))
mySet = list(set(myList1) & set(myList2))
mySet = [item for item in mySet if item >= 1]
if len(mySet) == 0:
print(-1)
else:
print(sorted(mySet)[0]) |
p02820 | s742531892 | Accepted | n, k = map(int, input().split())
r, s, p = map(int, input().split())
t = input()
def point(str):
if str == "r":
return p
if str == "s":
return r
if str == "p":
return s
total_point = 0
memory = [""] * k
for i in range(n):
if t[i] != memory[i % k]:
memory[i % k] = t[i]
total_point += point(t[i])
else:
memory[i % k] = ""
print(total_point) |
p03721 | s693252015 | Accepted | from collections import defaultdict
N, K = map(int, input().split())
a = defaultdict(int)
for i in range(N):
num, length = map(int, input().split())
a[num] += length
num = list(a.keys())
num.sort()
cnt = 0
for i in range(len(num)):
cnt += a[num[i]]
if cnt >= K:
break
print(num[i]) |
p02823 | s283964214 | Accepted | n, a, b = (int(x) for x in input().split())
if (b - a) % 2 == 0:
ans = (b-a) // 2
else:
ans = min(a-1, n-b) + 1 + (b-a-1)//2
print(ans)
|
p03012 | s629005225 | Accepted | n=int(input())
w=list(map(int,input().split()))
s=sum(w)
x=0
fin=1000
for i in range(n-1):
x+=w[i]
z=s-x
con=abs(z-x)
if con<fin:
fin=con
print(fin) |
p03773 | s684253094 | Wrong Answer | a,b = map(int, input().split())
if a+b<=24: print(a+b)
else: print((a+b)//24) |
p02900 | s127624165 | Accepted | def f(a,b):
if b:return f(b,a%b)
p=set()
for i in range(2,int(a**0.5)+1):
while True:
if a%i==0:
a//=i
p.add(i)
else:
break
if a!=1:
return len(p)+2
return len(p)+1
print(f(*map(int,input().split()))) |
p02771 | s459895574 | Accepted | a = input().split()
if a[0] == a[1] and a[1] == a[2]:
print('No')
elif a[0] != a[1] and a[1] != a[2] and a[2] != a[0]:
print('No')
else:
print('Yes') |
p03437 | s409696114 | Accepted | x,y=map(int,input().split())
if x%y==0:
print(-1)
else:
print(x) |
p02957 | s834250253 | Wrong Answer | a,b = map(int, input().split())
if (a+b)%2==0:
print((a+b)%2)
else:
print("IMPOSSIBLE") |
p03679 | s743043927 | Accepted | x,a,b=map(int,input().split())
if (b-a)<=0:
print("delicious")
else:
if (b-a)<=x:
print("safe")
else:
print("dangerous") |
p02761 | s249440795 | Accepted | n, m = map(int, input().split())
s = []
c = []
number = 100000
for i in range(m):
x, y = map(int, input().split())
s = s + [x]
c = c + [str(y)]
for i in range(1000):
count = 0
i_list = list(str(i))
if len(i_list) == n:
for j in range(m):
if i_list[s[j] - 1] != c[j]:
count += 1
if count == 0:
number = i
break
if number < 10000:
print(number)
else:
print('-1')
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.