problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03001 | s186397204 | Wrong Answer | W, H, x, y = map(int,input().split())
if x == W//2 and y == H//2:
ans = 1
else:
ans = 0
print(W*H/2, ans) |
p02833 | s983238987 | Wrong Answer | n=int(input())
if n%2 ==0:
num=10
c=0;
while num <= n:
c += int(n/num)
num *= 5
print(int(c))
else:
print(0) |
p02570 | s457911234 | Accepted | import sys
input = sys.stdin.readline
D,T,S = map(int,input().split())
if(D/S <= T):
print('Yes')
else:
print('No') |
p04030 | s712882469 | Accepted | s = str(input())
disp = ""
for i in range(0, len(s)):
if s[i] == "1":
disp = disp + "1"
if s[i] == "0":
disp = disp + "0"
if s[i] == "B":
if len(disp) != 0:
disp = disp[:-1]
else:
disp == ""
print(disp) |
p03645 | s602934031 | Accepted | from collections import defaultdict
n,m=map(int,input().split())
ab=defaultdict(lambda: [])
for i in range(m):
a,b=map(int,input().split())
ab[a].append(b)
for aa in ab[1]:
for bb in ab[aa]:
if bb == n:
print("POSSIBLE")
exit()
print("IMPOSSIBLE") |
p02661 | s032668234 | Accepted | N = int(input())
AB = [list(map(int, input().split())) for i in range(N)]
def mid(AB, idx):
if N % 2 == 0:
return (AB[N//2-1][idx] + AB[N//2][idx]) / 2
else:
return AB[(N+1)//2-1][idx]
AB.sort()
amid = mid(AB, 0)
AB.sort(key=lambda x: x[1])
bmid = mid(AB, 1)
tmp = 1 if N % 2 == 1 else 2
print(int(tmp * (bmid - amid) + 1))
|
p03623 | s680569726 | Accepted | x,a,b = map(int,input().split())
a = abs(a-x)
b = abs(b-x)
if a < b:
print("A")
else:
print("B") |
p02699 | s068504498 | Accepted | S,W = map(int,input().split())
print('safe' if S > W else 'unsafe') |
p02835 | s232563548 | Accepted | a1,a2,a3 = map(int,input().split())
if a1 + a2 + a3 >= 22:
print("bust")
else:
print("win") |
p02603 | s790011943 | Accepted | n = int(input())
arr = list(map(int, input().split()))
money = 1000
for i in range(1, n):
p_now = arr[i]
p_before = arr[i-1]
if p_before < p_now:
stock = money // p_before
money += stock*(p_now - p_before)
print(money)
|
p03759 | s008397700 | Wrong Answer | a,b,c=map(int,input().split())
print('YES' if b-c == c-b else 'NO') |
p03146 | s552960046 | Accepted | s = int(input())
if s == 1 or s == 2:
print(4)
exit()
ans = 1
while s != 4:
ans += 1
if s % 2 == 0:
s //= 2
else:
s *= 3
s += 1
print(ans + 3) |
p02695 | s938648785 | Wrong Answer | from itertools import combinations_with_replacement
N, M, Q = [int(x) for x in input().split()]
lst = [list(map(int, input().split())) for _ in range(Q)]
ans = 0
for seq in combinations_with_replacement(range(1, M+1), N):
print(seq)
tmp = 0
for a, b, c, d in lst:
if (seq[b-1] - seq[a-1] == c):
tmp += d
ans = max(ans, tmp)
print(ans)
|
p03544 | s083797086 | Accepted | l=[2,1]
n=int(input())
for i in range(2,n+1):
l.append(l[i-1]+l[i-2])
print(l[n])
|
p02947 | s232764976 | Accepted | N = int(input())
s = [list(input()) for i in range(N)]
for i in range(N):
s[i].sort()
s = [''.join(s[i]) for i in range(N)]
import collections
cnt = collections.Counter(s)
ans = 0
for n in cnt.values():
if n != 1:
k = n * (n-1) // 2
ans += k
print(ans) |
p02772 | s703236644 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
for num in a:
if num % 2 == 0:
if num%3==0 or num%5==0:
pass
else:
print('DENIED')
print('APPROVED') |
p03449 | s117480500 | Accepted | N=int(input())
num_list=[]
while True:
try:
num_list.append(list(map(int,input().split())))
except:
break;
sum_list=[]
for k in range(N):
sum_list.append(sum(num_list[0][0:k+1])+sum(num_list[1][k:N+1]))
print(max(sum_list)) |
p03679 | s191131401 | Wrong Answer | X, A, B = [ int(v) for v in input().split(" ") ]
# A: 3 B: 4 X: 3
result = A - B
if result >= 0:
print("delicious")
elif abs(result) >= X:
print("dangerous")
else:
print("safe")
|
p03835 | s071568504 | Wrong Answer | k, s = map(int, input().split())
i = 0
x = 0
for x in range(0,k+1):
for y in range(0,k+1-x):
for z in range(0,k+1-x-y):
p = x+y+z
if x+y+z == s: i += 1
print(i) |
p02900 | s710705622 | Wrong Answer | from math import gcd
A, B = map(int, input().split())
m = gcd(A, B)
#print(m)
num = int(m**0.5) + 1 #mに対する素因数分解は、int(√m)+1の場合を調べればよい
ans = 1
for i in range(2,num+1):
if m%i:
continue
ans += 1
while not m%i:
m = m/i
print(ans)
|
p03767 | s894968919 | Accepted | n = int(input())
a = list(map(int, input().split(' ')))
sa = sorted(a,reverse=True)[0:2 * n]
cs = sa[1::2]
print(sum(cs))
|
p02724 | s306424847 | Accepted | x=int(input())
print(x//500*1000+(x%500)//5*5)
|
p02708 | s990876568 | Accepted | MOD = 10 ** 9 + 7
n, k = map(int, input().split())
def calc(a):
smallest = a * (a-1) // 2
largest = smallest + a * (n-a+1)
return largest - smallest + 1
ans = 0
for a in range(k, n+2):
ans += calc(a)
ans %= MOD
print(ans)
|
p02725 | s154747000 | Wrong Answer | k, n = [int(elem) for elem in input().split()]
a_lst = [int(elem) for elem in input().split()]
res = 0
if (a_lst[-1] - a_lst[-2]) <= (k - a_lst[-1]):
for i, a in enumerate(a_lst[:-1]):
res += a_lst[i+1] - a
else:
for i, a in enumerate(a_lst[1:]):
res += a - a_lst[i-1]
res += (a_lst[0] + k) - a_lst[-1]
print(res) |
p02583 | s502869539 | Accepted | n = int(input())
sticks = [int(x) for x in input().split()]
count = 0
for i in range(n - 2):
for j in range(i + 1, n - 1):
for k in range(j + 1, n):
a, b, c = sticks[i], sticks[j], sticks[k]
if a != b and a != c and b != c:
if a + b > c and b + c > a and c + a > b:
count += 1
print(count)
|
p02924 | s462453869 | Wrong Answer | n = int(input())
if n == 1:
print(0)
exit()
elif n == 2:
print(1)
exit()
# ans = 0
# for i in range(1, n):
# ans += i
# print(ans)
ans = int(n / (n-1) * (n-1) ** 2 / 2)
print(ans) |
p02613 | s910342482 | Wrong Answer | n = int(input())
ac = 0
wa = 0
tle = 0
re = 0
for i in range(n):
s = input()
if s == "AC":
ac += 1
elif s == "WA":
wa += 1
elif s == "TLE":
tle += 1
else:
re += 1
print(f"AC × {ac}\nWA × {wa}\nTLE × {tle}\nRE × {re}")
|
p03284 | s977439306 | Wrong Answer | n, k = map(int, input().split())
if n >= k:
print(n%k)
else:
print(k%n) |
p03309 | s237160697 | Accepted | n = int(input())
ai = [int(e) for e in input().split()]
bi = []
for i in range(len(ai)):
bi.append(ai[i]-i-1)
bi = sorted(bi)
b = bi[int(len(bi)/2)]
su = 0
for i in range(len(ai)):
su += abs(ai[i] - (b+i+1))
print(su) |
p03767 | s997669802 | Accepted | n = int(input())
a = sorted(list(map(int, input().split())))
ans = a[-2*n :: 2]
print(sum(ans)) |
p03479 | s195670570 | Wrong Answer | A, Y = map(int, input().split())
ans = 0
while A<=Y:
ans+=1
A*=2
print(A) |
p02924 | s244375244 | Wrong Answer | n = int(input())
if n % 2 == 0:
print(int((n+1)*(n/2)-n))
else:
print(int(n*(n//2))) |
p03799 | s979099531 | Accepted | import sys
import heapq
from decimal import Decimal
input = sys.stdin.readline
n, m = map(int, input().split())
if int(m/2) - n > 0:
print(n + int((m - 2*n)/4))
else:
print(int(m/2)) |
p03103 | s901950065 | Accepted | n,m=map(int,input().split())
ab = [list(map(int,input().split())) for _ in range(n)]
ab.sort(key=lambda x:x[0])
now=0
ans=0
for i in range(n):
if now+ab[i][1]<=m:
now += ab[i][1]
ans += ab[i][0]*ab[i][1]
else:
ans += ab[i][0]*(m-now)
break
print(ans) |
p03323 | s349055536 | Accepted | a, b = list(map(int, input().split()))
if a <= 8 and b <= 8:
print("Yay!")
else:
print(":(") |
p03407 | s383007282 | Accepted | import sys
def input(): return sys.stdin.readline().strip()
def resolve():
a,b,c=map(int, input().split())
if a+b>=c:
print('Yes')
else:
print('No')
resolve() |
p02608 | s190642723 | Accepted | import sys
def rs(): return sys.stdin.readline().rstrip()
def ri(): return int(rs())
def rs_(): return [_ for _ in rs().split()]
def ri_(): return [int(_) for _ in rs().split()]
N = ri()
f = [0] * N
for x in range(1,100+1):
for y in range(1, 100+1):
for z in range(1, 100+1):
h = x**2 + y**2 + z**2 + x*y + y*z + z*x
if h > N:
continue
f[h - 1] += 1
for i in range(N):
print(f[i])
|
p03345 | s609981745 | Wrong Answer | #-*-coding:utf-8-*-
import sys
input=sys.stdin.readline
def main():
a,b,c,k = map(int,input().split())
if a == b == c:
print(0)
elif (b+c)*k>10**18 or (a+c)*k > 10**18:
print("Unfair")
elif k % 2==0:
print(-1*((b+c)-(a+c)))
else:
print((b+c)-(a+c))
if __name__=="__main__":
main() |
p03419 | s017857275 | Accepted | n, m = map(int, input().split())
n -= 2
m -= 2
ans = 0
if n == 0 or m == 0:
ans = 0
elif n == -1 and m == -1:
ans = 1
elif n == -1 or m == -1:
ans = max(n, m)
else:
ans = n * m
print(ans)
|
p02608 | s045367211 | Wrong Answer | from collections import defaultdict
n = int(input())
d = defaultdict(int)
for i in range(1, 120):
for j in range(1, 120):
for k in range(1, 120):
num = i**2 + j ** 2 + k ** 2 + i * j + j * k + k * i
d[num] += 1
for i in range(n+1):
print(d[i])
|
p02939 | s351565507 | Wrong Answer | import sys
input = sys.stdin.readline
# A - Dividing a String
def count_substrings(first_substring):
arr = [first_substring]
i = len(first_substring)
while i < len(S):
s = S[i]
if s == arr[-1]:
if i + 1 < len(S):
i += 1
s += S[i]
else:
arr[-1] += s
break
arr.append(s)
i += 1
ans = len(arr)
if arr[-1] == arr[-2]:
ans -= 1
return ans
S = input()
ans1 = count_substrings(S[:1])
ans2 = count_substrings(S[:2])
print(max(ans1, ans2)) |
p02697 | s499356977 | Wrong Answer | n,m=map(int,input().split())
t=1
for i in range(1,m+1):
print(i,n-i+1) |
p03836 | s254534274 | Accepted | x1, y1, x2, y2 = map(int, input().split())
ans = ''
dx = x2 - x1
dy = y2 - y1
ans += 'R'*dx + 'U'*dy + 'R' + 'D'*(dy+1) + 'L'*(dx+1) + 'U'*(dy+1) + 'R'*dx + 'U' + 'L'*(dx+1) + 'D'*(dy+1) + 'R'
print(ans) |
p02576 | s682048724 | Accepted | n,x,t=map(int,input().split())
if n%x==0:
print((n//x)*t)
else:
print((1+n//x)*t) |
p02688 | s300763161 | Wrong Answer | a,b = map(int, input().split())
s=[]
for _ in range(b-1):
try:
p=input().split()
except:
p=""
try:
r=input().split()
for b in r:
for bb in b:
s.append(int(bb))
except:
r=""
result = list(filter(lambda x: x not in list(set(s)), list(range(1,a+1))))
print(len(result)) |
p03698 | s973713301 | Accepted | S=input();print(['no','yes'][len(set(S))==len(S)]) |
p02660 | s300252934 | Wrong Answer | import math , sys
def fac(x,T):
m = int(math.sqrt(x))+1
i=2
while x>1 and i <=m+1:
ind=0
while x%i == 0:
ind+=1
x=int(x/i)
if ind>0:
T.append( ind )
i+=1
return T
def sta ( x ):
return int( 0.5* (-1 + math.sqrt(1+8*x)))
N = int( input() )
Is = fac( N , [] )
ans = sum( [ sta(j) for j in Is])
print(ans) |
p03001 | s665701743 | Accepted | def q3():
W, H, x, y = (int(i) for i in input().split())
# 最大になるのは面積のちょうど半分
ans1 = W * H / 2
# (x,y)が長方形の中心の場合1
ans2 = 0
if x*2 == W and y*2 == H:
ans2 = 1
print('{0:.6f} {1}'.format(ans1, ans2))
if __name__ == '__main__':
q3()
|
p04043 | s421147646 | Accepted | a, b, c = map(int, input().split())
abc = sorted([a, b, c])
if abc[0] == 5 and abc[1] == 5 and abc[2] == 7:
print('YES')
else:
print('NO') |
p03705 | s194850063 | Wrong Answer | n,a,b = map(int,input().split())
k = b-a
if k<0:
print(0)
elif k==0:
print(1)
else:
print(b*k - a*k+1) |
p02583 | s555149249 | Accepted | n = int(input())
l = list(map(int,input().split()))
count = 0
for i in range(n):
for ii in range(n):
for iii in range(n):
if l[i] + l[ii] > l[iii] and l[ii] + l[iii] > l[i] and l[iii] + l[i] > l[ii] and i<ii and ii < iii and l[i] != l[ii] and l[i] != l[iii] and l[ii] != l[iii]:
count += 1
print(count) |
p02759 | s987659712 | Accepted | n = int(input())
print((n+1)//2) |
p03944 | s220983858 | Wrong Answer | W,H,N=map(int,input().split())
rec=[[0,0],[W,H]]
for i in range(N):
x,y,a=map(int,input().split())
if a==1:
rec[0][0]=max(rec[0][0],x)
elif a==2:
rec[1][0]=min(rec[1][0],x)
elif a==3:
rec[0][1]=max(rec[0][1],y)
elif a==4:
rec[1][1]=min(rec[1][1],y)
ans=(rec[1][0]-rec[0][0])*(rec[1][1]-rec[0][1])
print(ans if ans>=0 else 0) |
p02742 | s008614212 | Accepted | H, W = map(int, input().split())
if H == 1 or W == 1:
print(1)
exit()
if H*W % 2 != 0:
print(H*W//2+1)
else:
print(H*W//2) |
p03804 | s467230935 | Accepted | from sys import exit
n, m = map(int, input().split())
A = [input() for _ in range(n)]
B = [input() for _ in range(m)]
for x, a in enumerate(A):
if x > n - m + 1:
break
for i in range(n - m + 1):
if a[i: i + m] == B[0]:
for j in range(m):
if A[x + j][i: i + m] != B[j]:
break
else:
print("Yes")
exit()
print("No")
|
p03286 | s150621759 | Accepted | import sys
n = int(sys.stdin.readline().rstrip())
def base_convert(n, b):
res = ''
while n:
r = abs(n % b)
res = str(r) + res
n = (n - r) // b
return int(res) if res else 0
def main():
return base_convert(n, -2)
if __name__ == '__main__':
ans = main()
print(ans) |
p02639 | s459472468 | Wrong Answer | a = int(input().replace(' ', ''))
b = 12345
c = b-a
while c > 10:
c = c//10
print(c) |
p03385 | s445452681 | Accepted | s = input()
print('Yes' if ('a' in s) and ('b' in s) and ('c' in s) else 'No')
|
p02772 | s336194642 | Accepted | n = int(input())
a = list(map(int, input().split()))
for x in a:
if x%2 == 0:
if x%3 == 0 or x%5 == 0:
pass
else:
print("DENIED")
exit()
print("APPROVED") |
p03469 | s099603082 | Accepted | S = input()
ans = '2018/01/' + S[8:]
print(ans)
|
p03759 | s162089687 | Accepted | a_poll, b_poll, c_poll = map(int, input().split())
if b_poll - a_poll == c_poll - b_poll:
print('YES')
else:
print('NO') |
p02720 | s001467661 | Accepted | import queue
k = int(input())
q = queue.Queue()
for i in range(1, 10):
q.put(i)
for i in range(k):
x = q.get()
if x % 10 > 0:
q.put(x*10 + x % 10 - 1)
q.put(x*10 + x % 10)
if x % 10 < 9:
q.put(x*10 + x % 10 + 1)
print(x)
|
p03103 | s399636981 | Wrong Answer | n, m = map(int, input().split())
drinks = {}
for i in range(n):
a, b = map(int, input().split())
drinks[a] = b
sorted_drinks = sorted(drinks.items())
amount = 0
for d in sorted_drinks:
if m < d[1]:
amount += d[0]*m
break
m -= d[1]
amount += d[0]*d[1]
print(amount) |
p03639 | s098720452 | Accepted | n = int(input())
a = list(map(int, input().split()))
c4 = 0
c2 = 0
for i in a:
if i%4 == 0:
c4 += 1
elif i%2 == 0:
c2 += 1
c0 = n - c4 - c2
ans = False
if c2 < 2:
if c0 + c2 <= c4 + 1:
ans = True
else:
if c0 <= c4:
ans = True
if ans:
print("Yes")
else:
print("No") |
p03109 | s441921870 | Accepted | S=str(input())
if int(S[5:7])<=4:
print('Heisei')
else:
print('TBD') |
p03095 | s316449970 | Wrong Answer | from itertools import groupby as gb
n,s=open(0)
n=int(n)
s=sorted(s)
ans=1
mod=10**9+7
for i,x in gb(s):
ans=ans*(len(list(x))+1)%mod
print(ans-1)
|
p02548 | s677312744 | Accepted | n=int(input())
ans=0
for i in range(1,n):
ans+=(n-1)//i
print(ans) |
p02708 | s865887599 | Accepted | N, K = map(int, input().split())
ans = 0
for i in range(K, N+2):
ans += i * (N+1-i) + 1
print(ans % (10**9+7))
|
p02838 | s125978797 | Accepted | n = int(input())
a = [int(i) for i in input().split()]
ans = 0
mod = 10**9+7
for i in range(60):
x = 0
for j in range(n):
if a[j] >> i & 1: x += 1 # i桁目が1である数の個数
now = x*(n-x)%mod # 0と1の組み合わせの数(0 xor 1 = 1)
for _ in range(i): now = now*2%mod # i桁目が1なら*2^i
ans += now
ans %= mod
print(ans) |
p02548 | s482547257 | Accepted | n = int(input())
count = 0
for i in range(1,n):
count += (n-1)//i
print(count) |
p02602 | s961369745 | Accepted | n, k = map(int, input().split())
a = list(map(int, input().split()))
for i in range(k, n):
if a[i] > a[i-k]:
print('Yes')
else:
print('No')
|
p03778 | s105118199 | Accepted | w,a,b = (int(T) for T in input().split())
if a+w<b:
print(b-(a+w))
elif a<=b<=a+w:
print(0)
else:
print(a-(b+w)) |
p02817 | s697669838 | Accepted | s,t = input().split()
print(t+s) |
p03637 | s671592518 | Accepted | n = int(input())
A = list(map(int,input().split()))
B = [0]*3
for i in A:
if i%4==0: B[0]+=1
elif i%2==0: B[1]+=1
else: B[2]+=1
print('Yes' if B[0]==0 and B[2]==0 or B[0]>=B[2] or B[1]==0 and B[2]-B[0]==1 else 'No')
|
p03971 | s690395658 | Accepted | n,a,b=map(int,input().split())
c=a+b
s=input()
count1=0
count2=0
for i in s:
if count1>=c:
print("No")
continue
else:
if i=="a":
print("Yes")
count1+=1
continue
if i=="b" and count2<b:
print("Yes")
count1+=1;count2+=1
continue
print("No")
|
p03309 | s929543358 | Accepted | from collections import Counter
n=int(input())
a=list(map(int,input().split()))
for i in range(n):
a[i]=a[i]-(i+1)
ac=Counter(a)
if len(a)%2==0:
dist=len(a)//2
else:
dist=len(a)//2+1
temp=0
for i,j in sorted(ac.items()):
temp+=j
if temp>=dist:
ans=0
for k in range(n):
ans+=abs(a[k]-i)
print(ans)
exit() |
p02725 | s965387486 | Accepted | K, N = map(int, input().split())
A = list(map(int, input().split()))
A.append(K + A[0])
distance = 0
for x in range(len(A) - 1):
distance = max(distance, A[x + 1] - A[x])
print(K - distance) |
p03556 | s001816674 | Accepted | N=int(input())
import math
print((int(math.sqrt(N)))**2) |
p02658 | s381885047 | Accepted | N = int(input())
A = list(map(int,input().split()))
lim = 10**18
if 0 in A:
print(0)
exit()
ans = 1
A.sort(reverse = True)
for i in range(len(A)):
ans = ans * A[i]
if ans > lim:
print(-1)
exit()
if ans > lim:
print(-1)
else:
print(ans) |
p02811 | s334275835 | Accepted | k, x = map(int, input().split())
if x <= k * 500:
print("Yes")
else:
print("No")
|
p03548 | s005016527 | Wrong Answer | a,b,c = map(int,input().split())
#lis = list(map(int,input().split()))
if (a%(b+c)) == 0:
print((a//(b+c))-1)
else:
print((a//(b+c))) |
p03127 | s469192735 | Wrong Answer | import heapq
N=int(input())
A=list(map(int,input().split()))
heapq.heapify(A)
t1=heapq.heappop(A)
t2=heapq.heappop(A)
if t2%t1==0:
print(t1)
else:
a=t2
b=t1
while True:
a-=b
if a<1:
print(b)
break
elif a>=b:
pass
else:
t=a
a=b
b=t |
p03073 | s281149005 | Wrong Answer | s=input()
n=len(s)
ans=0
for i in range(n-1):
if s[i]=="0" and i%2==0:
ans+=1
elif s[i]=="1" and i%2==1:
ans+=1
ans1=0
for i in range(n-1):
if s[i]=="1" and i%2==0:
ans1+=1
elif s[i]=="0" and i%2==1:
ans1+=1
print(min(ans,ans1)) |
p03994 | s535900167 | Wrong Answer | import string
abc = string.ascii_lowercase
s = list(input())
K = int(input())
index = 0
while K > 0:
if index == len(s) - 1:
s[index] = abc[(abc.index(s[index]) + K) % 26]
break
tmp = 26 - abc.index(s[index])
if tmp == 0: continue
if K >= tmp:
s[index] = 'a'
index += 1
K -= tmp
else:
index += 1
for i in s:
print(i, end='') |
p02597 | s391258959 | Wrong Answer | k = int(input())
cs = input()
print(cs[:len(cs)//2].count("W"))
|
p02724 | s347501885 | Accepted | n = int(input())
print(n // 500 * 1000 + n % 500 // 5 * 5) |
p03252 | s168901519 | Wrong Answer | from collections import defaultdict
s=list(input())
t=list(input())
ds=defaultdict(list)
dt=defaultdict(list)
for i in range(len(s)):
ds[s[i]].append(i)
dt[t[i]].append(i)
dsk=list(ds.values())
dtk=list(dt.values())
if dsk==dtk:
print('Yes')
exit()
else:
print('No') |
p02996 | s462379828 | Accepted | N = int(input())
ABlist = [list(map(int, input().split())) for _ in range(N)]
ABlist.sort(key=lambda x: x[1])
time = 0
for a, b in ABlist:
time += a
if time > b:
print("No")
break
else:
print("Yes")
|
p02699 | s845811435 | Accepted | s,w = map(int,input().split())
if s>w:
print('safe')
else:
print('unsafe') |
p02993 | s765748758 | Wrong Answer | s=input()
if(s[0]==s[1]) or(s[1]==s[2])or(s[2]==s[3]):
print('Bad')
else:
print('Yes')
|
p03407 | s053839912 | Accepted | a,b,c=map(int,input().split())
if a+b>=c:
print("Yes")
else:
print("No") |
p03329 | s972048698 | Accepted | N=int(input())
ans=float("Inf")
for i in range(N+1):
k=N-i
k2=i
six=0
nine=0
while k2>0:
six+=k2%6
k2//=6
while k>0:
nine+=k%9
k//=9
ans=min(ans,six+nine)
print(ans) |
p02582 | s983830331 | Accepted | s=input()
t=s.find('R')
if t==2:
print(1)
elif t==-1:
print('0')
elif t==0:
if s[t]==s[t+1]:
if s[t+1]==s[t+2]:
print('3')
else:
print('2')
else:
print(1)
else:
if s[t]==s[t+1]:
print(2)
else:
print(1) |
p03796 | s084155396 | Wrong Answer | n=int(input())
ans=1
for i in range(n):
ans*=(i+1)
ans%=1000000007 |
p03910 | s637030518 | Wrong Answer | n = int(input())
if n == 1:
print(1)
exit()
elif n == 2:
print(2)
exit()
elif n == 3:
print(2)
print(1)
exit()
elif n == 4:
print(3)
print(1)
exit()
if n % 2 == 0:
print(n // 2)
print(1)
print(n // 2 - 1)
else:
print(n // 2 + 1)
print(n - (n // 2 + 1)) |
p03494 | s330769577 | Wrong Answer | n = int(input())
array = list(map(int, input().split()))
def cal(value):
return value / 2
def odd_even_cal(value):
return value % 2
for i in range(n):
if 0 not in list(map(odd_even_cal, array)):
print(i)
break
array = list(map(cal, array))
else:
print(i)
|
p03261 | s675920926 | Accepted | N=int(input())
B=list()
B.append(input())
ans='Yes'
for i in range(N-1):
tmp=input()
if tmp in B:
ans='No'
if tmp[0]!=B[i][-1]:
ans='No'
B.append(tmp)
print(ans) |
p02582 | s040800194 | Accepted | s = str(input())
n = len(s)
c = 0
for i in range(n):
if s[i] == "R":
j = i
a = 0
while s[j] == "R" and j < n-1:
a += 1
j += 1
if j == n-1 and s[j] == "R":
a += 1
c = max(a,c)
print(c)
|
p02953 | s248161972 | Wrong Answer | import sys
input = sys.stdin.readline
def main():
N=int(input())
H=list(map(int,input().split()))
s=0
if N==1:
print('Yes')
else:
for i in range(0,N-1):
if H[i]>H[i+1]:
s+=H[i]-H[i+1]
if s<2:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main()
|
p02801 | s338786416 | Wrong Answer | a = input()
ascii_a = ord(a)
# print(ascii_a)
next_ascii_a = ascii_a +1
chr(next_ascii_a) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.