problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p03486 | s517491334 | Accepted | s = input()
t = input()
s2 = sorted(s)
t2 = sorted(t, reverse=True)
print("Yes" if s2 < t2 else "No") |
p03427 | s042543271 | Accepted | N = int(input())
N_ = str(N)
n = len(N_)
if n == 1:
print(N)
exit()
for i in range(1, n):
if N_[i] != '9':
break
else:
ans = int(N_[0]) + 9*(n-1)
print(ans)
exit()
ans = int(N_[0])-1 + 9*(n-1)
print(ans) |
p03479 | s659212504 | Accepted | x, y = map(int, input().split())
ans = 0
while x <= y:
x *= 2
ans += 1
print(ans) |
p02570 | s073722198 | Wrong Answer | x,y,z = map(int,input().split())
if x/z>=y:
print('Yes')
else:
print('No')
|
p03723 | s870700435 | Accepted | ## A - Cookie Exchanges
A, B, C = map(int, input().split())
if not (A%2 == B%2 == C%2 == 0):
ans = 0
elif A == B == C:
ans = -1
else:
ans = 0
while A%2 == B%2 == C%2 == 0:
a = (B+C) // 2
b = (C+A) // 2
c = (A+B) // 2
A = a
B = b
C = c
ans += 1
print(ans)
|
p02629 | s541202102 | Accepted | n=int(input())
def num2(num):
if num<=26:
return chr(num+96)
elif num%26==0:
return num2(num//26-1)+chr(122)
else:
return num2(num//26)+chr(96+num%26)
print(num2(n)) |
p03759 | s982215205 | Wrong Answer | a, b, c = map(int, input().split())
ans = 'Yes' if b-a == c-b else 'No'
print(ans) |
p03438 | s389722453 | Accepted | N = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
total1 = 0
total2 = 0
for i in range(N):
if a[i]>b[i]:
total1 += a[i]-b[i]
else:
total2 += (b[i]-a[i])//2
if total1 <=total2:
print('Yes')
else:
print('No') |
p03210 | s066060408 | Accepted | print('YES' if input() in '357' else 'NO') |
p02756 | s546991937 | Accepted | s = input()
q = int(input())
r, st1, st2 = 0, "", ""
for _ in range(q):
query = input()
if query[0] == "1":
r += 1
else:
t, f, c = query.split()
if (r + int(f)) % 2:
st1 += c
else:
st2 += c
string = "".join(reversed(list(st1))) + s + st2
if r % 2 == 0:
print(string)
else:
print("".join(reversed(list(string)))) |
p02600 | s325162634 | Accepted | x = int(input())
def level(x):
if x >= 1800:
return 1
elif x>= 1600:
return 2
elif x>=1400:
return 3
elif x>=1200:
return 4
elif x >= 1000:
return 5
elif x >= 800:
return 6
elif x >= 600:
return 7
else:
return 8
print(level(x)) |
p02555 | s931689034 | Accepted | s = int(input())
mod = 1000000007
dp = [0]*(s+1)
dp[0] = 1
for i in range(3,s+1):
for j in range(i-2):
dp[i] += dp[j]
dp[i] %= mod
print(dp[s]) |
p02880 | s102774148 | 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") |
p03162 | s108056231 | Accepted | N = int(input())
A = [list(map(int, input().split())) for _ in range(N)]
dp = [[0] * 3 for _ in range(N + 1)]
for i in range(N):
for j in range(3):
for k in range(3):
if j != k:
dp[i+1][k] = max(dp[i+1][k], dp[i][j] + A[i][k])
print(max(dp[N])) |
p03136 | s989481698 | Wrong Answer | N = int(input())
li = list(map(int, input().split()))
li.sort()
sum = 0
for i in li[:-2]:
sum = i + sum
Nmax = li[-1]
if N <= 2 or li[0] < 1:
print("No")
elif Nmax < sum:
print("Yes")
else:
print("No")
|
p03951 | s934185919 | Accepted | N = int(input())
s = input()
t = input()
if t in s:
print(N)
quit()
for i in range(1, N+1):
if t in (s + t[-i:]):
print(N+i)
quit() |
p04034 | s680216864 | Accepted | N, M = map(int, input().split())
c = [1] * N
r = [True] + [False] * (N-1)
for i in range(M):
x, y = map(int, input().split())
if r[x-1] == True:
r[y-1] = True
if c[x-1] == 1:
r[x-1] = False
c[x-1] -= 1
c[y-1] += 1
print(sum(r))
|
p03252 | s253991826 | Accepted | def assert_(s, t):
if s != t:
print("No")
exit()
def main():
S = input()
T = input()
mapping = {}
mapping_ = {}
for i in range(len(S)):
if S[i] in mapping:
assert_(mapping[S[i]], T[i])
if T[i] in mapping_:
assert_(mapping_[T[i]], S[i])
mapping[S[i]] = T[i]
mapping_[T[i]] = S[i]
print("Yes")
main() |
p02772 | s063811141 | Accepted | n = int(input())
A = list(map(int,input().split()))
for a in A:
if a%2:
continue
if a%3==0 or a%5==0:
continue
else:
print('DENIED')
break
else:
print('APPROVED') |
p02791 | s012327131 | Wrong Answer | #入力:N(int:整数)
def input1():
return int(input())
#入力:N,M(int:整数)
def input2():
return map(int,input().split())
#入力:[n1,n2,...nk](int:整数配列)
def input_array():
return list(map(int,input().split()))
N=input1()
p=input_array()
count=0
for i in p:
flag=True
for j in p[:i+1]:
if i<=j:
flag=True
else:
flag=False
break
if flag:
count+=1
print(count)
|
p02645 | s522236207 | Accepted | S = input()
print(S[0:3]) |
p02786 | s670357879 | Wrong Answer | from math import floor # 切り下げ
h = int(input())
cnt = 0
def attack(hp):
if hp == 1:
global cnt
cnt += 1
return
else:
hp = floor(hp/2)
attack(hp)
attack(hp)
attack(h)
print(cnt) |
p03438 | s480644543 | Accepted | n = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
ope = 0
for i in range(n):
if b[i] > a[i]:
ope+=(b[i]-a[i]+1)//2
if sum(b) - sum(a) < 0:
print('No')
elif ope <= sum(b) - sum(a):
print('Yes')
else:
print('No') |
p02629 | s638242658 | Accepted | n = int(input())
num = 26
arr = []
ans = ""
moji = "abcdefghijklmnopqrstuvwxyz"
flg = False
ar = []
n = n - 1
for i in range(10000):
arr.append(n % num)
n = n // num - 1
if n < 0:
break
arr.reverse()
ans = ""
for i in arr:
ans +=moji[i]
print(ans) |
p04020 | s579279210 | Wrong Answer | import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n = int(input())
A = list(int(input()) for _ in range(n))
res, A[0] = divmod(A[0], 2)
for i in range(1, n):
cnt, A[i] = divmod(A[i], 2)
res += cnt
if A[i - 1] and A[i]:
res += 1
print(res)
if __name__ == '__main__':
resolve()
|
p03161 | s000109026 | Accepted | n, k = map(int, input().split())
h = list(map(int, input().split()))
inf = 10 ** 10
dp = [inf for _ in range(n)]
dp[0] = 0
for i in range(1, n):
for j in range(1, k+1):
if i - j >= 0:
dp[i] = min(dp[i], dp[i-j] + abs(h[i] - h[i-j]))
#print(dp)
print(dp[n-1]) |
p02823 | s522973834 | Wrong Answer | N, A, B = map(int, input().split())
x = A - 1
y = B - A - 1
z = N -B
if y % 2 == 1:
ans = (y + 1) / 2
else:
if x >= z:
ans = y + z + 1
else:
ans = y + x + 1
print(int(ans)) |
p03042 | s979217353 | Wrong Answer | s = input()
upper = int(s[:2])
lower = int(s[2:4])
if upper <= 0 or lower <= 0:
print('NA')
exit()
if upper > 12:
if lower > 31: print('NA')
else: print('YYMM')
else:
if lower > 31: print('MMYY')
else: print('AMBIGUOUS')
|
p02629 | s357885927 | Accepted | n = int(input())
def numalpha(num):
if num <= 26:
return chr(64+ num)
elif num % 26 == 0:
return numalpha(num // 26-1) + chr(90)
else:
return numalpha(num//26) + chr(64 + num % 26)
print(numalpha(n).lower())
|
p02724 | s555074001 | Accepted | ##B
X = int(input())
X500 = X//500
X5 = (X % 500)//5
print(X500*1000+X5*5) |
p03069 | s564678346 | Wrong Answer | input();print(input().count('#.')) |
p02916 | s973536538 | Accepted | N = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
ans = 0
for i in range(len(a)):
if i == 0:
ans += b[a[i]-1]
elif a[i] - a[i-1] == 1:
ans += b[a[i]-1] + c[a[i-1]-1]
else:
ans += b[a[i]-1]
print(ans) |
p02993 | s056497037 | Accepted | #!/usr/bin/env python3
s = input()
for i in range(3):
if s[i] == s[i+1]:
print("Bad")
s = 0
break
if s != 0:
print("Good") |
p02598 | s970958990 | Accepted | import math
n,k=map(int,input().split())
a=list(map(int,input().split()))
x0=0
x1=10**9
while(1):
sum=0
mid=(x0+x1)//2
for i in range(n):
sum+=math.ceil(a[i]/mid)-1
if(sum<=k):
x1=mid
if(sum>k):
x0=mid
if(x0+1==x1):
print(x1)
break |
p03745 | s053851872 | Accepted | N=int(input())
A=list(map(int,input().split()))
sw="1"
ans=1
for i in range(N-1):
if sw=="1":
if A[i]>A[i+1]:
sw="2"
if A[i]<A[i+1]:
sw="3"
elif sw=="2":
if A[i]<A[i+1]:
ans+=1
sw="1"
elif sw=="3":
if A[i]>A[i+1]:
ans+=1
sw="1"
print(ans)
|
p02606 | s681970558 | Wrong Answer | L,R,d=map(int,input().split())
def divLR():
return (R-L+1)//d
print(divLR()) |
p02831 | s362072294 | Wrong Answer | import math
A, B = map(int, input().split())
gcd = 1
for i in range(2,min(A,B)):
if A%i==0 and B%i==0:
gcd = i
print(int(A*B/gcd)) |
p03997 | s445020991 | Accepted | a = int(input())
b = int(input())
c = int(input())
print((a+b)*c//2) |
p03693 | s502721826 | Accepted | r, g, b = map(int, input().split())
num = 100 * r + 10 * g + b
ans = 'NO'
if num % 4 == 0:
ans = 'YES'
print(ans) |
p03437 | s635431452 | Accepted | X, Y = map(int, input().split())
if (X % Y == 0):
print(-1)
else:
print(X) |
p02699 | s176751142 | Wrong Answer | s,w=input().split()
if s>w:print("safe")
else:print("unsafe")
|
p03699 | s703611234 | Accepted | n=int(input())
s=[int(input()) for _ in range(n)]
s1=[si for si in s if si%10]
s.sort()
s1.sort()
ans=sum(s)
if ans%10==0:
if s1:
ans-=s1[0]
else:
ans=0
print(ans)
|
p02747 | s487946232 | Accepted | S = input()
if set(S[0::2]) == set('h') and set(S[1::2]) == set('i') and len(S) % 2 == 0:
ans = True
else:
ans = False
if ans:
print('Yes')
else:
print('No') |
p02701 | s790222186 | Wrong Answer | a=map(int,input().split())
b=input().split()
def func(a,b):
ab=set(b)
return len(ab)
print(func(a,b)) |
p03239 | s273247669 | Accepted | N, T = map(int, input().split())
ans = 1001
for _ in range(N):
c, t = map(int, input().split())
if t <= T:
ans = min(c, ans)
if ans == 1001:
print('TLE')
else:
print(ans)
|
p03136 | s392251647 | Wrong Answer | n = input()
l = list(map(int, input().split()))
print(max(l) < sum(l) - max(l)) |
p03162 | s647072395 | Accepted | n=int(input())
l=[list(map(int,input().split())) for _ in range(n)]
dp=[[0]*3 for _ in range(n)]
dp[0]=l[0]
for i in range(n-1):
for j in range(3):
dp[i+1][j]=max(dp[i][(j+1)%3]+l[i+1][j],dp[i][(j+2)%3]+l[i+1][j])
print(max(dp[n-1])) |
p02768 | s461927477 | Accepted | n, a, b = map(int, input().split())
mod = 10 ** 9 + 7
def mod_cmb(n, r, mod):
p, q = 1, 1
for i in range(r):
p = p * (n - i) % mod
q = q * (i + 1) % mod
return p * pow(q, mod - 2, mod) % mod
answer = pow(2, n, mod) - 1
answer -= mod_cmb(n, a, mod) + mod_cmb(n, b, mod)
answer %= mod
print(answer)
|
p02742 | s677655376 | Accepted | import sys
import math
import bisect
def main():
n, m = map(int, input().split())
if n == 1 or m == 1:
print(1)
else:
ans = ((m + 1) // 2) * ((n + 1) // 2)
ans += (m // 2) * (n // 2)
print(ans)
if __name__ == "__main__":
main()
|
p02613 | s241930275 | Accepted | n = int(input())
c = [0]*4
for _ in range(n):
s = str(input())
if s == 'AC':
c[0] += 1
elif s == 'WA':
c[1] += 1
elif s == 'TLE':
c[2] += 1
else:
c[3] += 1
print('AC x '+str(c[0]))
print('WA x '+str(c[1]))
print('TLE x '+str(c[2]))
print('RE x '+str(c[3]))
|
p03037 | s110673051 | Accepted | n, m = map(int, input().split())
low = 0
high = 100001
for i in range(m):
l,m = map(int, input().split())
low = max(low, l)
high = min(high, m)
if high-low+1<0:
print(0)
else:
print(min(high-low+1, n)) |
p02572 | s874139441 | Wrong Answer | import numpy as np
n=int(input())
t=np.array(input().split(' '))
num=np.zeros(n)
for a in range(n):
num[a]=int(t[a])
a=np.sum(num)**2
b=np.sum(num**2)
x=int((a-b)/2)
x=(x-1)%(10**9+7)
print(x) |
p03998 | s526047483 | Accepted | def judge(c):
if len(c) == 0:
return 1, c, "-1"
else:
return 0, c[0], c[1:]
def main():
sa = input()
sb = input()
sc = input()
card = {"a": sa, "b": sb, "c": sc}
next_player = "a"
while True:
now = next_player
is_finish, next_player, card[now] = judge(card[now])
if is_finish:
print(now.upper())
break
if __name__ == '__main__':
main()
|
p03136 | s460386677 | Accepted | N = int(input())
L = [int(i) for i in input().split()]
print('Yes' if sum(L) > 2 * max(L) else 'No') |
p02689 | s322432307 | Wrong Answer | n,m = map(int,input().split())
h = list(map(int,input().split()))
ans = [1]*n
for i in range(m):
print(ans)
a,b = map(int,input().split())
if h[a-1]>h[b-1]:
ans[b-1] = 0
elif h[b-1]>h[a-1]:
ans[a-1] = 0
else:
print("a")
ans[a-1] = 0
ans[b-1] = 0
print(ans.count(1)) |
p03699 | s744168283 | Wrong Answer | N = int(input())
s_min = 100
score = 0
for _ in range(N):
tmp = int(input())
score += tmp
s_min = min(s_min, tmp)
print(score - s_min if score % 10 == 0 else score) |
p02982 | s059623830 | Accepted | import math
n,d=map(int,input().split())
x=[list(map(int,input().split())) for _ in range(n)]
count=0
for i in range(n):
for j in range(i+1,n):
ans=0
for k in range(d):
ans+=(x[i][k]-x[j][k])**2
if math.sqrt(ans).is_integer()==True:
count+=1
print(count)
|
p02597 | s241484213 | Wrong Answer | def checkFunction(c):
count = 0
while True:
# print(count, c)
if not ('WR' in c):
return count
while c[-1] == 'W':
c = c[:-1]
while c[0] == 'R':
c = c[1:]
if (c.index('R') == len(c) - 1):
return count + 1
else:
c = c.replace('WR', 'RR',1)[:-1]
count += 1
N = int(input())
c= input()
print(checkFunction(c))
|
p02909 | s858677377 | Accepted | S = input()
ls = ['Sunny','Cloudy','Rainy']
if S == 'Sunny':
print(ls[1])
elif S == 'Cloudy':
print(ls[2])
else:
print(ls[0]) |
p02675 | s532637569 | Accepted | n=input()[-1:]
hon=['2','4','5','7','9']
pon=['0','1','6','8']
bon=['3']
if n in hon:
print('hon')
elif n in pon:
print('pon')
else:
print('bon') |
p02848 | s231614945 | Accepted | N = int(input())
S = input()
ans = str()
for i in S:
m = (ord(i) - ord('A') + N) % 26
ans += chr(m + ord('A'))
print(ans) |
p02766 | s415884555 | Wrong Answer | N, K = map(int, input().split())
i = 0
while K**i < N: i += 1
print(i) |
p02683 | s529945870 | Wrong Answer | n,m,co=map(int,input().split())
l=[]
for i in range(n):
l.append(list(map(int,input().split())))
c=2**n
ans=10**10
for i in range(c):
li=[]
a=0
for j in range(n):
if ((i >> j) & 1):
li.append(l[j])
a+=l[j][0]
z=[0]*m
for k in range(len(li)):
for kk in range(m):
z[kk]+=li[k][kk]
if min(z)>co-1:
ans=min(ans,a)
if ans==10**10:
print(-1)
else:
print(ans)
|
p03327 | s267765189 | Accepted | N=int(input())
if(N<1000):
print("ABC")
else:
print("ABD") |
p03803 | s457308337 | Wrong Answer | a,b = map(int,input().split())
if a==1 and b!=1 or a>b:
print('Alice')
elif b==1 and a!=1 or b>a:
print('Bob')
else:
print('Draw') |
p03827 | s634841195 | Wrong Answer | import os
import sys
import math
if os.environ.get("DEBUG") is not None:
sys.stdin = open("in.txt", "r")
rl = sys.stdin.readline
n, s = [rl().rstrip("\n") for _ in range(2)]
print(n, s)
x = 0
ans = 0
for it in s:
if it == "I":
x += 1
else:
x -= 1
ans = max(ans, x)
print(ans) |
p02726 | s992484342 | Wrong Answer | n,x,y = map(int,input().split())
u = []
for i in range(1,n):
for j in range(i+1,n+1):
u.append(min(j-i,abs(x-i)+abs(y-j)+1))
import collections
u2 = collections.Counter(u)
u2 = list(u2.items())
for k in range(n):
u2.append((0,0))
for i in range(n):
if u2[i][0] == i+1:
print(u2[i][1])
else:
print(0) |
p02754 | s042934886 | Wrong Answer | n,a,b = map(int,input().split())
if a ==0:
print(0)
elif b == 0:
print(a)
else:
print(n-b)
|
p03994 | s990288465 | Wrong Answer | s = list(input())
k = int(input())
for i in range(len(s)):
a = 26-(ord(s[i])-97)
# print(ord(s[i]))
# print(a)
if k >= a and a != 26:
k -= a
s[i] = "a"
# print(k)
s[-1] = chr(97+((ord(s[-1])+k) % 97) % 27)
# print(ord(s[-1]))
print("".join(s))
|
p03633 | s861146951 | Accepted | N = int(input())
a = [int(input()) for i in range(N)]
import fractions
ans = a[0]
for i in range(1, N):
ans = ans * a[i] // fractions.gcd(ans, a[i])
print(ans) |
p02659 | s975107687 | Accepted | import math
from decimal import Decimal
a, b = map(str, input().split())
a=Decimal(a)
b=Decimal(b)
#print(b)
#print(a*b)
print(math.floor(a*b)) |
p03838 | s189320177 | Accepted | x, y = list(map(int, input().split()))
ans = abs(abs(x) - abs(y))
if (x < 0) == (y > 0):
ans += 1
elif (x > y):
ans += 2
print(ans) |
p02607 | s778151338 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(n//2):
if a[2*i] % 2 == 1:
ans += 1
print(ans)
|
p03041 | s389420737 | Wrong Answer | p,q = input().split()
q_ = int(q) -1
n = input()
x = n.replace(n[q_], n[q_].lower(), 1)
print(x) |
p02577 | s837915338 | Accepted | wa = 0
for i in input():
wa += int(i)
wa %= 9
if wa == 0:
print('Yes')
else:
print('No') |
p03679 | s880137044 | Accepted | x,a,b=map(int,input().split())
if a>=b:
print("delicious")
elif b<=(a+x):
print("safe")
else:
print("dangerous") |
p02753 | s338982420 | Accepted | S=input()
print('No' if S=='AAA' or S=='BBB' else 'Yes')
|
p03994 | s356307922 | Accepted | # coding: utf-8
S=list(input())
K=int(input())
N=len(S)
L=[]
for i in range(N):
L.append((26-(ord(S[i])-ord("a")))%26)
for i in range(N):
if K>=L[i]:
S[i]="a"
K-=L[i]
if K>0:
S[-1]=chr(ord("a")+((ord(S[-1])+K-ord("a"))%26))
print("".join(S)) |
p03795 | s151611789 | Accepted | N = int(input())
x = N * 800
y = N // 15 * 200
print(x-y) |
p03282 | s807136636 | Wrong Answer | s= input()
fn1 = None
for i in range(len(s)):
if s[i] != "1":
fn1 = s[i]
break
print("1" if fn1 is None else fn1) |
p02823 | s157706962 | Accepted | from collections import defaultdict
def readInt():
return int(input())
def readInts():
return list(map(int, input().split()))
def readChar():
return input()
def readChars():
return input().split()
n,a,b = readInts()
if (b-a)%2==0:
print((b-a)//2)
else:
print(min(b-1,n-a,a+(b-a-1)//2,n-(a+b-1)//2)) |
p04030 | s587351177 | Accepted | s=input()
l=[]
for i in s:
if i=="0":
l.append("0")
elif i=="1":
l.append("1")
elif i=="B":
if l!=[]:
l.pop()
if l==[]:
print("")
else:
print("".join(l))
|
p02729 | s077353154 | Accepted | N,M=list(map(int,input().split()))
if N>0 and M>0:
print(int(M*(M-1)/2+N*(N-1)/2))
elif N==0:
print(int(M*(M-1)/2))
else:
print(int(N*(N-1)/2)) |
p03479 | s718064009 | Accepted | x,y=map(int,input().split())
ans=1
while 2*x<=y:
x*=2
ans+=1
print(ans) |
p03107 | s283893015 | Accepted | S = input()
print(min(S.count('0'), S.count('1')) * 2) |
p03127 | s275476452 | Accepted | import sys
from bisect import *
from heapq import *
from collections import *
from itertools import *
from functools import *
from math import *
from fractions import *
sys.setrecursionlimit(100000000)
input = lambda: sys.stdin.readline().rstrip()
def main():
N = int(input())
A = list(map(int, input().split()))
print(reduce(gcd, A))
main()
|
p02759 | s516197978 | Wrong Answer | N = int(input())
print(N/2+N%2) |
p03796 | s677292126 | Accepted | def resolve():
n = int(input())
q = 1
for i in range(1, n+1):
q *= i
q %= (10**9+7)
print(q)
resolve() |
p03632 | s786039518 | Accepted | a, b, c, d = map(int, input().split())
if b <= c or d <= a:
print(0)
elif (d >= b and c <= a) or (b >= d and a <= c):
print(min(d - c, b - a))
elif b >= d:
print(d - a)
else:
print(b - c)
|
p03759 | s593469334 | Accepted | a,b,c=map(int,input().split())
if b-a==c-b:
print('YES')
else:
print('NO') |
p03699 | s521824727 | Accepted | n = int(input())
s = [int(input()) for _ in range(n)]
s.sort()
ans = p_ans = sum(s)
if ans % 10 != 0: print(ans)
else:
s = [s_i if s_i % 10 != 0 else 0 for s_i in s]
for s_i in s:
if s_i != 0:
ans -= s_i
break
if ans == p_ans: print(0)
else: print(ans) |
p03696 | s029272446 | Accepted | #!/usr/bin/env python3
input()
s = input()
c = 0
for i in s:
if i == "(":
c += 1
else:
if c > 0:
c -= 1
d = 0
for i in s[::-1]:
if i ==")":
d += 1
else:
if d > 0:
d -= 1
print("("*d+s+")"*c)
|
p02596 | s250376232 | Wrong Answer | k = int(input())
#a,b = map(int,input().split())
#a_L = list(map(int,input().split()))
sevn = "7"
i = 1
for i in range(1,10**4+1):
tmp = int(sevn)
if tmp%k==0:
print(i)
exit()
sevn += "7"
#i += 1
print(-1) |
p03592 | s808431775 | Wrong Answer | n,m,k = map(int,input().split())
for i in range(n):
if (n-2*i) != 0 and (k-m*i) % (n-2*i) == 0:
print('Yes')
exit()
print('No')
|
p03281 | s737569158 | Accepted | n = int(input())
ans = 0
for i in range(1,n+1):
if i%2==0:
continue
else:
divcnt = 0
for j in range(1,i+1):
if i%j==0:
divcnt += 1
if divcnt == 8:
ans += 1
print(ans)
|
p03317 | s843901074 | Wrong Answer | #import numpy as np
import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial#, gcd
from bisect import bisect_left, bisect_right #bisect_left(list, value)
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 10**9+7
def input(): return sys.stdin.readline()[:-1]
pl = lambda x: print(*x, sep='\n')
N, K = map(int, input().split())
A = list(map(int, input().split()))
mi = A.index(1)
lc = math.ceil(mi//2)
rc = math.ceil((N-mi-1)//2)
print(lc+rc)
|
p03437 | s392700846 | Wrong Answer | X, Y = map(int, input().split())
if X == Y or X % Y == 0:
print(-1)
else:
for i in range(10**18):
X1 = int(X*i)
if X1 % Y != 0:
print(str(X1))
break
|
p03360 | s688755162 | Wrong Answer | x = list(map(int, input().split()))
for i in range(int(input())):
x.sort
x[-1]=x[-1]*2
print(sum(x)) |
p03796 | s369162699 | Accepted | n = int(input())
ans = 1
mod = 10**9+7
for i in range(1,n+1):
ans = ans * i % mod
print(ans) |
p02623 | s073327836 | Wrong Answer | N, M, K = map(int, input().split())
A_N = list(map(int, input().split()))
B_M = list(map(int, input().split()))
A_ind = 0
B_ind = 0
count = K
ans = 0
for i in range(N+M):
if A_N[0] < B_M[0]:
if count >= A_N[0]:
count -= A_N.pop(0)
ans += 1
if len(A_N) == 0:
A_N.append(1000000001)
else:
if count >= B_M[0]:
count -= B_M.pop(0)
ans += 1
if len(B_M) == 0:
B_M.append(1000000001)
print(ans) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.