problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p03331 | s878592615 | Accepted | def digits_sum(x):
result = 0
while x > 0:
result += x % 10
x //= 10
return result
N = int(input())
result = 10**5
for A in range(1, N):
B = N - A
result = min(result, digits_sum(A) + digits_sum(B))
print(result)
|
p03773 | s387739174 | Accepted | a,b=map(int,input().split())
ans=a+b
if ans<24:
print(ans)
else:
ans-=24
print(ans)
|
p02767 | s951386359 | Accepted | N=int(input())
X=list(map(int,input().split()))
ANS=[0]*100
for i in range(100):
for x in X:
ANS[i] += ((x - (i+1)) ** 2)
print(min(ANS))
|
p03861 | s349136874 | Accepted | a,b,x = map(int,input().split())
print(b//x-(a-1)//x)
|
p02767 | s529349946 | Accepted | N = int(input())
lst_X = list(map(int, input().split()))
def main(N, lst_X):
min_P1 = sum(lst_X) // N
sum_sutamina1 = 0
for X in lst_X:
sum_sutamina1 += (X - min_P1) ** 2
min_P2 = min_P1 + 1
sum_sutamina2 = 0
for X in lst_X:
sum_sutamina2 += (X - min_P2) ** 2
return min(sum_sutamina1, sum_sutamina2)
if __name__ == "__main__":
answer = main(N, lst_X)
print(answer)
|
p03160 | s545847000 | Accepted | def solve(h):
best_p = abs(h[0] - h[1])
best_pp = 0
n = 2
while n < len(h):
cost1 = best_p + abs(h[n] - h[n-1])
cost2 = best_pp + abs(h[n] - h[n-2])
best = min(cost1, cost2)
best_pp, best_p = best_p, best
n = n + 1
return best_p
def main():
N = int(input())
heights = list(map(int, input().split()))
assert len(heights) == N
assert N >= 2
res = solve(heights)
print(res)
if __name__ == '__main__':
main() |
p03910 | s182210483 | Accepted | N = int(input())
tmp = 0
for i in range(1,N+1):
tmp += i
if tmp >= N:
p = i
break
fuyou = tmp - N
for i in range(1,p+1):
if i == fuyou:
continue
print(i) |
p02756 | s153128376 | Accepted | s=input()
q=int(input())
cnt=0
front=[]
rear=[]
for qq in range(q):
l=list(input().split())
if l[0]=='1':
cnt+=1
else:
if (cnt+int(l[1]))%2==1:
front.append(l[2])
else:
rear.append(l[2])
front=''.join(front[::-1])
rear=''.join(rear)
s=front+s+rear
print(s if cnt%2==0 else s[::-1]) |
p02613 | s770299496 | Accepted | N = int(input())
S = [input() for _ in range(N)]
D = {}
D['AC'] = 0
D['WA'] = 0
D['TLE'] = 0
D['RE'] = 0
for k in range(N):
D[S[k]] += 1
print('AC x',D['AC'])
print('WA x',D['WA'])
print('TLE x',D['TLE'])
print('RE x',D['RE']) |
p03407 | s481497364 | Wrong Answer | import sys
input = sys.stdin.readline
def main():
A, B, C = map(int, input().split())
if A + B >= C:
print("YES")
else:
print("NO")
if __name__ == '__main__':
main() |
p02576 | s548058528 | Wrong Answer | N, X, T = map(int,input().split())
if N <= X:
print(T)
else:
if N % X == 0:
A = N / X * T
print(A)
else:
B = (N / X + 1) * T
print(B) |
p04031 | s834598644 | Accepted | N = int(input())
##N, M = map(int, input().split())
D = list(map(int, input().split()))
if sum(D) > 0:
target = int(sum(D) / N + 0.5)
else:
target = int(sum(D) / N - 0.5)
ans = 0
for i in D:
ans += (target - i)*(target - i)
print(ans) |
p03971 | s392466208 | Accepted | n,a,b = map(int,input().split())
s = input()
maxa = a+b
maxb = b
counta = 0
countb = 0
for i in range(n):
if s[i] == 'c':
print("No")
elif s[i] == 'b':
if countb < maxb and counta < maxa:
print("Yes")
counta += 1
countb += 1
elif counta < maxa:
print("No")
else:
print("No")
else:
if counta < maxa:
print("Yes")
else:
print("No")
counta+=1
|
p02554 | s048530068 | Accepted | N = int(input())
mod = 10 ** 9 + 7
if N == 1:
print(0)
exit()
def factorial(p, n):
result = 1
for i in range(1, n + 1):
result = result * p % mod
return result
ans = factorial(10, N) - 2 * factorial(9, N) + factorial(8, N)
ans = ans % mod
while True:
if ans > 0:
break
ans += mod
print(ans)
|
p02627 | s991585809 | Wrong Answer | a=input()
if a==a or a==b or a==c or a==d or a==e or a==f or a==g or a==h or a==i or a==j or a==k or a==l or a==m or a==n or a==o or a==p or a==q or a==r or a==s or a==t or a==u or a==v or a==w or a==x or a==y or a==z:
print("a")
else:
print("A")
|
p02642 | s761706232 | Wrong Answer | import sys
input = sys.stdin.readline
n = int(input())
a = [int(x) for x in input().split()]
maxval = 10 ** 6 + 5
factor_cnt = [0] * (maxval+1)
factor_cnt[0] = 2
factor_cnt[1] = 2
for i in range(n):
if factor_cnt[a[i]] > 1:
continue
if a[i] == 1:
continue
for k in range(a[i], maxval+1, a[i]):
factor_cnt[k] += 1
result = sum(factor_cnt[v] == 1 for v in a)
print(result) |
p02995 | s894216413 | Accepted | import fractions
a,b,c,d = map(int,input().split())
AdivC = (a-1)//c
BdivC = b//c
AdivD = (a-1)//d
BdivD = b//d
gc = fractions.gcd(c,d)
div = (c*d)//gc
AdivCandD = (a-1)//div
BdivCandD = b//div
divC = BdivC - AdivC
divD = BdivD - AdivD
divCandD = BdivCandD - AdivCandD
ans = b-a+1
ans = ans -(divC+divD-divCandD)
print(ans) |
p03264 | s603835447 | Accepted | k=int(input())
if k%2==0:
ans=(k//2)**2
else:
ans=(k//2)*(k//2+1)
print(ans) |
p03624 | s781938904 | Accepted | icase=0
if icase==0:
s=set(input())
abc=list("abcdefghijklmnopqrstuvwxyz")
# abc.sort(reverse=True)
yn=""
for i in range(len(abc)):
if not abc[i] in s:
print(abc[i])
yn="OK"
break
if yn=="":
print("None")
|
p02795 | s069359450 | Wrong Answer | H = int(input())
W = int(input())
N = int(input())
x = H if H>W else W
print(N//x+ 0 if N%x==0 else 1) |
p02720 | s406223256 | Accepted | K = int(input())
runrun = [[1]*10]
s = sum(runrun[0][1:])
i = 1
while K > s:
K -= s
r = [sum(runrun[-1][max(0,i-1):min(10, i+2)]) for i in range(10)]
runrun.append(r)
s = sum(r[1:])
i += 1
j = 1
while runrun[-1][j] < K:
K -= runrun[-1][j]
j += 1
ans = [j]
k = -2
while K and len(runrun) >= -k:
j = max(0, j-1)
while runrun[k][j] < K:
K -= runrun[k][j]
j += 1
k -= 1
ans.append(j)
print("".join(map(str, ans)))
|
p02819 | s244930983 | Wrong Answer | import math
array=[2]
for i in range(3,100003,2):
prime=True
for n in range(len(array)):
if array[n] > math.sqrt(i):
break
if i % array[n] == 0:
prime = False
break
if prime:
array.append(i)
l=int(input())
for m in range(len(array)):
if l>array[m]:
pass
else:
print(array[m])
break |
p02860 | s296654504 | Wrong Answer | n = int(input())
s = input()
if n % 2 == 1:
print('No')
exit(0)
n = n // 2
a = s[:n]
if a.count(s) == 2:
print('Yes')
else:
print('No') |
p02832 | s247359414 | Wrong Answer | N=int(input())
A=[int(x) for x in input().split()]
start=1
for i in A:
if start==i:
start+=1
print(len(A)-start+1)
|
p02607 | s265091043 | Accepted | N = int(input())
L = list(map(int, input().split()))
ans = 0
for i, l in enumerate(L):
if i % 2 != 1 and l % 2 == 1:
ans += 1
print(ans)
|
p03408 | s632678138 | Accepted | red_str_list=[]
blue_str_list=[]
blue_cnt=int(input())
for _ in range(blue_cnt):
red_str_list.append(input())
red_cnt=int(input())
for _ in range(red_cnt):
blue_str_list.append(input())
ans=0
dic = dict()
for i in red_str_list:
if (i in dic.keys()):
dic[i]+=1
else:
dic[i]=1
for i in blue_str_list:
if (i in dic.keys()):
if dic[i]>0:
dic[i]-=1
print(max(dic.values()))
|
p03486 | s206454798 | Wrong Answer | a = list(input().split())
b = list(input().split())
a.sort()
b.sort(reverse=True)
if ''.join(a) < ''.join(b):
print('Yes')
else:
print('No') |
p03486 | s851526501 | Wrong Answer | try:
s = input()
t = input()
s_ = sorted(s)
t_ = sorted(t, reverse=True)
print(s_)
print(t_)
print('No' if s_>t_ else 'Yes')
except EOFError:
pass |
p03239 | s140181754 | Accepted | n,t = map(int,input().split())
li = []
for i in range(n):
a,b = map(int,input().split())
if b <= t:
li.append(a)
if len(li) >= 1:
print(min(li))
else:
print("TLE") |
p03359 | s157079753 | Accepted | a, b = map(int, input().split())
if b<a:
print(a-1)
else:
print(a) |
p02633 | s640263929 | Accepted | import math
x = int(input())
d = math.gcd(360, x)
print(360//d) |
p02572 | s667591168 | Wrong Answer | import itertools
import sys
sys.setrecursionlimit(10**7)
def input(): return sys.stdin.readline().rstrip()
def main():
n = int(input())
hoge = tuple(map(int, input().split()))
sumn = 0
for pair in list(itertools.combinations(hoge, 2)):
sumn += (pair[0] * pair[1])
print(sumn)
if __name__ == '__main__':
main() |
p03339 | s544181297 | Wrong Answer | # coding: utf-8
N = int(input())
S = input()
# ruisekiwa ba-jon
ruiseki_w = [0] * (N + 1)
ruiseki_e = [0] * (N + 1)
for i in range(0, len(S)):
ruiseki_w[i+1] = ruiseki_w[i] + S[i].count("W")
ruiseki_e[i+1] = ruiseki_e[i] + S[i].count("E")
res = 10**10
for i in range(1, len(S)):
res = min(ruiseki_w[i-1] - ruiseki_w[0] + ruiseki_e[-1] - ruiseki_e[i+1], res)
print(res)
|
p03243 | s759421333 | Accepted | N=int(input())
S=N//100
if N<=S*100+S*10+S:
print(S*100+S*10+S)
else:
print((S+1)*100+(S+1)*10+S+1) |
p02880 | s465652679 | Accepted | n = int(input())
for i in range(1, 10):
for j in range(1, 10):
if i * j == n:
print("Yes")
exit()
print("No") |
p02627 | s725998165 | Accepted | # 幅優先探索（行きがけ）
import collections
import sys
import copy
import re
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def main():
s = S()
if s.isupper():
print("A")
else:
print("a")
if __name__ == '__main__':
main()
|
p02621 | s455446489 | Wrong Answer | a = int(input())
ans = a+a*2+a*3
print(ans)
|
p03711 | s534977487 | Accepted | key = list(map(int, input().split()))
if 2 in key:
print("No")
elif (key[0] in [4, 6, 9, 11] and key[1] in [4, 6, 9, 11]) or (key[0] in [1, 3, 5, 7, 8, 10, 12] and key[1] in [1, 3, 5, 7, 8, 10, 12]):
print("Yes")
else:
print("No") |
p03380 | s613426752 | Accepted | N = int(input())
A = sorted(list(map(int, input().split())))
n = A[-1]
r_val = -float('inf')
r_row = None
for idx in range(N - 1):
if r_val < min(n - A[idx], A[idx]):
r_val = min(n - A[idx], A[idx])
r_row = A[idx]
print(n, r_row)
|
p03785 | s118939614 | Wrong Answer | import math
n,c,k = map(int,input().split())
t = [int(input()) for i in range(n)]
t.sort(reverse=True)
key = t[0]-k
len_t = 0
ans = 0
for i in range(n):
if t[i] >= key:
len_t += 1
else:
ans += math.ceil(len_t/c)
key = t[i]-k
len_t = 1
ans += math.ceil(len_t/c)
print(ans)
|
p03555 | s281509352 | Wrong Answer | s_a = input()
s_b = input()
if s_a[0] == s_b[2] and s_a[2] == s_a[0] and s_a[1] == s_b[1]:
print("YES")
else:
print("NO") |
p03251 | s347517719 | Accepted | N, M, X, Y = map(int, input().split())
x = list(map(int, input().split()))
y = list(map(int, input().split()))
def check(x,y,X,Y):
# print(x,y)
x.append(X)
y.append(Y)
# print(x,y)
if min(y)>max(x):
return True
return False
if check(x,y,X,Y):
print('No War')
else:
print('War') |
p02957 | s319625248 | Wrong Answer | a,b = map(int,input().split())
s=a+b
if s%2 != 0:
print("IMPOSSIBLE")
else:
print(s/2)
|
p02718 | s971358025 | Accepted | n, m = map(int, input().split())
A = list(map(int, input().split()))
count = 0
total = 0
for j in range(n):
total += A[j]
for i in range(n):
if A[i] >= total *(1/(4*m)):
count += 1
if count >= m:
print("Yes")
else:
print("No") |
p02696 | s346289728 | Accepted | a, b, n = map(int, input().split())
if n < b:
print((a * n) // b)
else:
print((a * (b - 1) )//b) |
p02659 | s847074492 | Accepted | from decimal import Decimal
a,b=input().split()
print(int(Decimal(a)*Decimal(b))) |
p02695 | s831987394 | Accepted | ## C Many Requirements
import itertools
N, M, Q = map(int, input().split() )
X = [list( map( int,input().split() ) ) for x in range(Q)]
listd = []
A = list( itertools.combinations_with_replacement( [i for i in range(1, M+1) ], N ) )
for a in A:
sumd = 0
for q in range(Q):
if a[X[q][1]-1] - a[X[q][0]-1] == X[q][2]:
sumd += X[q][3]
listd.append(sumd)
print( max(listd) ) |
p03160 | s193327878 | Accepted | n=int(input())
h=[int(i) for i in input().split(' ')]
dp=[0]*(n)
dp[1]=abs(h[1]-h[0])
for i in range(2,n):
t1=dp[i-2]+abs(h[i]-h[i-2])
t2=dp[i-1]+abs(h[i]-h[i-1])
dp[i]=min(t1,t2)
print(dp[n-1])
|
p03309 | s442409902 | Accepted | n, *a = map(int, open(0).read().split())
s = [a - i - 1 for i, a in enumerate(a)]
b = sorted(s)[n // 2]
print(sum(abs(s - b) for s in s)) |
p03644 | s234110633 | Accepted | n=int(input())
for i in range(8):
if 2**i > n:
print(2**(i-1))
break
|
p02813 | s738022288 | Accepted | import itertools
n = int(input())
N = [int(i) for i in range(1, n+1)]
P = tuple(map(int, input().split()))
Q = tuple(map(int, input().split()))
c = 0
a = 0; b = 0
for i in itertools.permutations(N):
c += 1
if i == P: a = c
if i == Q: b = c
print(abs(a-b)) |
p03779 | s267169996 | Wrong Answer | from itertools import accumulate
n=int(input())
x=[]
for i in range(1,33000):
x+=[i]
y=list(accumulate(x))
for i in range(32999):
if y[i]>=n:
print(i+1)
break |
p03251 | s988100726 | Accepted | def resolve():
N, M, X, Y = map(int, input().split())
x = list(map(int, input().split()))
y = list(map(int, input().split()))
ans = 0
for z in range(X+1, Y+1):
if max(x)<z and z<=min(y):
ans += 1
print("No War" if ans != 0 else "War")
resolve() |
p04029 | s453188896 | Wrong Answer | N = int(input())
print(N*(N-1)//2) |
p02755 | s625223932 | Accepted | import math
a,b = [float(i) for i in input().split()]
ans = 1000000000
flag = False
for i in range(1,10000):
ans8 = int(math.floor(i*0.08))
ans10 = int(math.floor(i*0.1))
# print(ans8,ans10)
if ans8 == a and ans10 == b:
ans = min(ans, i)
flag = True
if flag is True:
print(ans)
else:
print(-1) |
p02547 | s174961295 | Accepted | import time
from math import ceil
from collections import defaultdict, deque
def A(s):
if s[-1] == 's':
return s + 'es'
return s + 's'
def B(n, d):
for i in range(n - 2):
if (d[i][0] == d[i][1] and d[i + 1][0] == d[i + 1][1] and
d[i + 2][0] == d[i + 2][1]):
return 'Yes'
return 'No'
def main():
n = int(input())
d = [list(map(int, input().split())) for i in range(n)]
print(B(n, d))
if __name__ == '__main__':
main()
|
p02675 | s157629194 | Accepted | N = int(input())
kurai_1 = N % 10
hon_yomi = {
0:'pon',
1:'pon',
2:'hon',
3:'bon',
4:'hon',
5:'hon',
6:'pon',
7:'hon',
8:'pon',
9:'hon'
}
print(hon_yomi[kurai_1]) |
p02958 | s433325163 | Accepted | n = int(input())
p = list(map(int, input().split()))
c = 0
for i in range(n):
if p[i]!=i+1:
c+=1
if c>2:
print("NO")
else:
print("YES") |
p02663 | s218227044 | Accepted | import sys,queue,math,copy,itertools,bisect,collections,heapq
def main():
sys.setrecursionlimit(10**7)
INF = 10**18
MOD = 10**9 + 7
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
SI = lambda : sys.stdin.readline().rstrip()
h1,m1,h2,m2,k = LI()
t = (h2 * 60 + m2) - (h1*60 + m1)
print(t-k)
if __name__ == '__main__':
main() |
p03427 | s823062245 | Accepted | n = input()
m = int(n)
c = n[0]
k = len(n)
tmp = int(c + "9"*(k-1))
ans = int(c) + (k-1)*9
if tmp > m:
ans = (int(c)-1) + (k-1)*9
print(ans) |
p03126 | s910431439 | Accepted | n,m = map(int,input().split())
K = []
A = []
for i in range(n):
k,*a = input().split()
K.append(k)
A.append(a)
ans = 0
for i in range(m):
sum = 0
for j in range(n):
sum += str(i+1) in A[j]
if sum == n:
ans+=1
print(ans) |
p03219 | s331744817 | Wrong Answer | x,y=map(int,input().split())
print(x+y/2)
|
p02820 | s423117392 | Accepted | n, k = map(int, input().split())
r, s, p = map(int, input().split())
t = input()
ans = 0
cmds = ['']*n
for i, c in enumerate(t):
if c == 'r':
cmd = 'p'
pt = p
elif c == 's':
cmd = 'r'
pt = r
elif c == 'p':
cmd = 's'
pt = s
if i-k >= 0 and cmds[i-k] == cmd:
cmd = ''
pt = 0
ans += pt
cmds[i] = cmd
print(ans) |
p03126 | s181124391 | Wrong Answer | n,m=map(int,input().split())
check = [0 for i in range(m)]
for _ in range(n):
A = list(map(int, input().split()))
for a in A[1:]:
check[a-1] += 1
print(check)
ans = sum([c == n for c in check])
print(ans) |
p04043 | s009563721 | Wrong Answer | a,b,c=input().split()
d=[a,b,c]
print(d.count("5"))
if d.count("5")==2 and d.count("7")==1:
print("YES")
else:
print("NO")
|
p03145 | s417702748 | Accepted | a, b, c = map(int, input().split())
print(a * b // 2) |
p02771 | s872446394 | Accepted | a, b, c = map(int, input().split())
if a == b :
if b == c :
print('No')
else :
print('Yes')
elif b == c :
if b == a :
print('No')
else :
print('Yes')
elif c == a :
if c == b :
print('No')
else :
print('Yes')
else :
print('No')
|
p03657 | s737892801 | Accepted | a, b = map(int, input().split())
print('Possible' if a % 3 == 0 or b % 3 == 0 or (a + b) % 3 == 0 else 'Impossible') |
p03252 | s172329400 | Wrong Answer | S = sorted(input())
T = sorted(input())
reg = [None]*26
reg_flag = [0]*26
for i in range(len(S)):
index = ord(S[i])-97
if reg_flag[index] == 0:
reg[index] = T[i]
reg_flag[index] = 1
index_T = ord(T[i])-97
if reg_flag[index_T] == 0:
reg[index_T] = S[i]
reg_flag[index_T] = 1
if reg[index] == T[i]:
pass
else:
print('No')
exit()
print('Yes') |
p03252 | s583031014 | Accepted | s=input()
t=input()
n=len(s)
d={}
for i in range(n):
ss=s[i]
tt=t[i]
if ss in d and (ss,tt) not in d.items():
print("No")
exit()
if tt in d.values() and (ss,tt) not in d.items():
print("No")
exit()
if ss not in d:
d[ss]=tt
print("Yes") |
p02766 | s292284873 | Wrong Answer | import math as m
N,K=map(int,input().split())
r=m.log(N,K)
if r>int(r):
print(int(r+1))
else:
print(int(r))
|
p02847 | s056714251 | Wrong Answer | S=str(input())
if S=="SUN":
print(7)
elif S=="MON":
print(6)
elif S=="TUE":
print(5)
elif S=="WED":
print(4)
elif S=="TUE":
print(3)
elif S=="FRI":
print(2)
else:
print(1)
|
p03293 | s918663920 | Accepted | 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())
a = s()
b = s()
sample = ""
for i in range(len(a)):
a = a[-1] + a[0:-1]
if a == b:
print("Yes")
exit()
print("No") |
p02814 | s309175957 | Accepted | N, M = map(int, input().split())
A = list(set(map(int, input().split(" "))))
G = A.copy()
while not any(x % 2 for x in G):
G = [i // 2 for i in G]
if not all(x % 2 for x in G):
print(0)
exit(0)
def gcd(a, b):
while b:
a, b = b, a % b
return a
def lcm(a, b):
return a * b // gcd(a, b)
total = 1
for x in A:
total = lcm(total, x // 2)
print((M // total + 1) // 2)
|
p02553 | s453891204 | Accepted | a, b, c, d = map(int, input().split())
print(max(a*c,a*d,b*c,b*d)) |
p03657 | s354819975 | Accepted | from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations
def main():
A, B = map(int, input().split())
print('Possible') if not A%3 or not B%3 or not (A+B)%3 else print('Impossible')
if __name__ == '__main__':
main() |
p03285 | s300663227 | Accepted | N = int(input())
for i in range(14):
for j in range(25):
if 7*i + 4*j == N:
print("Yes")
exit()
print("No") |
p02935 | s783844425 | Accepted | N = int(input())
v = list(map(int, input().split()))
v = sorted(v)
ans = v[0]
for i in range(1, N):
ans = (ans + v[i]) / 2
print(ans) |
p03137 | s590159956 | Accepted | def mapt(fn, *args):
return tuple(map(fn, *args))
def Input():
return mapt(int, input().split(" "))
def main():
n, m = Input()
x = sorted(Input())
data = sorted((abs(x[i]-x[i+1]) for i in range(m-1)), reverse=True)
print(sum(data[n-1:]))
main() |
p03127 | s248289451 | Accepted | import fractions
N = int(input())
A = list(map(int,input().split()))
ans = A[0]
for i in range(N-1):
ans = fractions.gcd(ans,A[i+1])
print(ans) |
p02582 | s397159248 | Accepted | s = input()
if 'RRR' in s:
print(3)
elif 'RR' in s:
print(2)
elif 'R' in s:
print(1)
else:
print(0)
|
p02633 | s169423301 | Wrong Answer | x=int(input())
if(360%x==0):
print(360//x)
|
p03637 | s802995557 | Accepted | N = int(input())
A = [int(i) for i in input().split()]
d = {
"4":0,
"2":0,
"1":0
}
for i in A:
if i%4==0:
d["4"] += 1
elif i%2==0:
d["2"] += 1
else:
d["1"] += 1
if d["1"] == 0:
print("Yes")
elif d["1"] <= d["4"]:
print("Yes")
elif d["1"] + -(-d["2"]//2) - 1 <= d["4"]:
print("Yes")
else:
print("No") |
p02552 | s010744373 | Accepted | x = int(input())
if x == 0:
print(1)
else:
print(0) |
p03478 | s317206492 | Wrong Answer | n,a,b=map(int,input().split())
ans=0
for i in range(1,n+1):
for j in str(i):
count=0
count+=int(j)
if a<=count<=b:
ans+=i
print(ans) |
p03041 | s269613182 | Accepted | n,k = map(int,input().split())
s = input()
if s[k-1] =='A':
s2 = 'a'
elif s[k-1] =='B':
s2 = 'b'
else:
s2 = 'c'
if k == 1:
print(s2+s[1:n])
elif k == n:
print(s[:k-1]+s2)
else:
print(s[:k-1]+s2+s[k:n]) |
p02718 | s579290483 | Wrong Answer | N, M = map(int, input().split())
A = list(map(int, input().split()))
A.sort(reverse=True)
x = sum(A)
min_ = x / (4*M)
flag = 0
for i, a in enumerate(A):
if i == M:
flag = 1
break
if a < min_:
break
if flag == 1:
print("Yes")
else:
print("No") |
p03486 | s028940784 | Wrong Answer | import sys
s = sorted(list(input()))
t = sorted(list(input()))
str_long = min([len(s), len(t)])
i = 0
while i < str_long:
if ord(s[i]) == ord(t[-1-i]):
i += 1
continue
elif ord(s[i]) < ord(t[-i-1]):
print("Yes")
sys.exit()
else:
break
print("No") |
p03971 | s025896823 | Wrong Answer | N, A, B = map(int, input().split())
S = input()
y = 0
k = 0
for i in S:
if i=='c':
print('No')
elif (i=='a'):
if (y<(A+B)):
print('Yes')
y += 1
else:
print('No')
else:
if (y<(A+B))and(k<=B):
print('Yes')
y += 1
k += 1
else:
print('No') |
p03408 | s900869799 | Wrong Answer | n=int(input())
s=[input() for _ in range(n)]
m=int(input())
t=[input() for _ in range(m)]
ans=0
buf=0
s.sort()
t.sort()
for i in range(n):
buf=0
for j in range(i,n):
if s[i]==s[j]:
buf+=1
elif s[i]>s[j]:
break
for j in range(m):
if s[i]==t[j]:
buf-=1
elif s[i]>t[j]:
break
if buf>ans:
ans=buf
print(ans) |
p03262 | s460348431 | Accepted | import math
N, X = [int(x) for x in input().split()]
Coordinates = [int(x) for x in input().split()]
diff = [abs(x - X) for x in Coordinates]
if len(diff) == 1:
print(min(diff))
else:
ans = diff[0]
for i in range(1, len(diff)):
ans = math.gcd(ans, diff[i])
print(ans) |
p02615 | s473521604 | Wrong Answer | n = int(input())
a = list(map(int,input().split()))
a.sort(reverse=True)
score = a[0]
for i in range(2,n):
score += min(a[i-1],a[i-2])
print(score) |
p03352 | s244700860 | Wrong Answer | X = int(input())
ans = 0
for b in range(1,X):
for p in range(2, X):
if X >= b**p:
if ans < b**p:
ans = b**p
break
print(ans) |
p03632 | s661364434 | Accepted | a,b,c,d=map(int,input().split())
if min(b,d)-max(a,c)>0:
print(min(b,d)-max(a,c))
else:
print(0) |
p04020 | s425437550 | Wrong Answer | N = int(input())
a = []
for i in range(N):
a.append(int(input()))
#
count = 0
for i in range(N):
count += a[i]//2
a[i] = a[i]%2
for i in range(N-1):
if a[i]==1:
if a[i+1]==1:
a[i] = 0
a[i+1] = 0
count += 1
print(count)
|
p03861 | s235908055 | Wrong Answer | a,b,x = map(int,input().split())
ans = ((b-a)+1)//x
if a%x == 0:
ans += 1
if a != b and b%x == 0:
ans += 1
if (b-a)%x == 0:
ans -= 1
print(ans) |
p02661 | s571444851 | Accepted | N = int(input())
A = []
B = []
for i in range(N):
a, b = list(map(int, input().split()))
A.append(a)
B.append(b)
A = sorted(A)
B = sorted(B)
if N % 2:
ans = B[N//2] - A[N//2] + 1
else:
l = A[N//2-1] + A[N//2]
r = B[N//2-1] + B[N//2]
ans = r-l+1
print(ans) |
p02842 | s034333864 | Wrong Answer | from math import floor
n = int(input())
for x in range(n):
cost = floor(x * 1.08)
if cost == n:
print(x)
exit()
print(":(") |
p02576 | s879824217 | Wrong Answer | N,X,T=map(int,input().split())
for i in range(0,1000):
if X*i>=N:
print(T*i)
break
|
p03037 | s264922113 | Accepted | n,m=map(int,input().split())
s,t=map(int,input().split())
for i in range(m-1):
x,y=map(int,input().split())
if s<x:
s=x
if t>y:
t=y
print(max(0,t-s+1)) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.