problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p02790 | s865030817 | Accepted | a,b = raw_input().split()
a_ans = ""
b_ans = ""
for i in range(int(b)):
a_ans += a
for i in range(int(a)):
b_ans += b
if int(a) >= int(b):
print b_ans
else:
print a_ans |
p03001 | s224266375 | Wrong Answer | import sys
sys.setrecursionlimit(10**6)
w, h, x, y = map(int, input().split())
area = max(min(w*y, w*(h-y)), min(x*h, (w-x)*h))
is_multi = 0
if area in [w*y, w*(h-y)] and x == w//2:
is_multi = 1
elif area in [x*h, (w-x)*h] and y == h//2:
is_multi = 1
print(area, is_multi) |
p02594 | s307245715 | Accepted | x = int(input())
if x <= 40 and x >= 30:
print("Yes")
else:
print("No") |
p02753 | s696094091 | Accepted | import sys
input = sys.stdin.readline
S = input().rstrip()
from collections import Counter
c = Counter(S)
if len(c.keys()) == 2:
print("Yes")
else:
print("No") |
p02612 | s415767572 | Wrong Answer | N = int(input())
print(1000 - (N % 1000)) |
p03062 | s765981269 | Accepted | n=int(input())
a=list(map(int,input().split()))
if 0 in a:
print(sum(abs(i)for i in a))
else:
pc=mc=0
for i in range(n):
if a[i]>0:pc+=1
else:mc+=1
a[i]=abs(a[i])
if mc%2:print(sum(a)-min(a)*2)
else:print(sum(a)) |
p02767 | s527405761 | Accepted | n = int(input())
x = list(map(int,input().split()))
ans = []
for i in range(1,100):
sum = 0
for j in range(n):
sum = sum +((x[j]-i)**2)
ans.append(sum)
print(min(ans)) |
p02612 | s618089869 | Accepted | N = int(input())
res = N%1000
if res == 0:
print(res)
else:
print(1000-res)
|
p02843 | s909386147 | Accepted | import sys
import math
input = sys.stdin.readline
x = int(input())
if 105 * math.floor(x / 100) >= x:
ans = '1'
else:
ans = '0'
print(ans)
|
p02754 | s303912891 | Wrong Answer | X = list(map(int,input().split()))
N = X[0]
b = X[1]
r = X[2]
if b == 0:
print(0)
elif b + r == N:
print(b)
else:
print(b + (N - (b + r))) |
p03379 | s386622943 | Accepted | import copy
n = int(input())
x = list(map(int, input().split()))
y = copy.deepcopy(x)
y.sort()
mid_bigger = y[int(n/2)]
mid_smaller = y[int(n/2)-1]
ans = [0]*n
for i in range(0,n):
if (x[i]<mid_bigger):
ans[i]=mid_bigger
elif (x[i]>mid_smaller):
ans[i]=mid_smaller
elif (mid_smaller == x[i]):
ans[i] = mid_bigger
else:
ans[i] = mid_smaller
print(*ans, sep='\n') |
p03455 | s709845311 | Wrong Answer | input_str = input().split(" ")
a = int(input_str[0])
b = int(input_str[1])
product = a * b
if product % 2 == 1:
print("odd")
else:
print("even")
|
p02701 | s241600093 | Accepted | k = int(input())
a = []
for i in range(k):
a.append(input())
print(len(set(a)))
|
p02802 | s183063174 | Accepted | n, m = map(int, input().split())
answer = [[False, 0] for _ in range(n)]
for i in range(m):
number, result = input().split()
number = int(number)
if result == 'AC':
answer[number-1][0] = True
elif answer[number-1][0] != True:
answer[number-1][1] += 1
ret = [ans[1] for ans in answer if ans[0] == True]
print(len(ret), sum(ret))
|
p03860 | s193029320 | Accepted | a,b,c = input().split()
print("A"+b[0]+"C") |
p02742 | s141047318 | Wrong Answer | l = list(map(int, input().split()))
if l[0]%2==0 or l[1]%2==0:
print(l[0]*l[1]//2)
else:
print(l[0]*l[1]//2+1) |
p02847 | s985799901 | Accepted | S = input()
dic = {'SUN': 7, 'SAT': 1, 'FRI': 2, 'THU': 3, 'WED': 4, 'TUE': 5, 'MON': 6}
print(dic[S]) |
p03162 | s248625719 | 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])) |
p02732 | s660623093 | Accepted | n = int(input())
a_l = list(map(int,input().split()))
a_dict = {}
for num in a_l:
if num in a_dict:
a_dict[num] += 1
else:
a_dict[num] = 1
comb_dict = {}
comb_tot = 0
for num in a_dict:
comb_dict[num] = a_dict[num]*(a_dict[num]-1)//2
comb_tot += comb_dict[num]
for num in a_l:
ans = comb_tot - (a_dict[num]-1)
print(ans)
|
p03803 | s693026614 | Accepted | A, B =map(int, input().split())
if A==1:
A=14
if B==1:
B=14
print("Alice" if A>B else "Bob" if B>A else "Draw") |
p03281 | s611503627 | Accepted | def make_divisors(n):
ans=0
for i in range(1, int(n**0.5)+1):
if n % i == 0:
ans+=1
if i != n // i:
ans+=1
return ans
n=int(input())
a=0
for i in range(1,n+1,2):
if make_divisors(i)==8:
a+=1
print(a) |
p02771 | s779204993 | Wrong Answer | a,b,c=map(int,input().split())
d=a-b
e=a-c
f=b-c
if d*e*f==0 and (d+e+f!=0):
print("Yes")
else:
print("No")
|
p03657 | s898167401 | Accepted | a,b = map(int, input().split())
print("Possible" if a%3==0 or b%3==0 or (a+b)%3==0 else "Impossible") |
p03264 | s474081906 | Accepted | k = int(input())
p = k // 2
if k % 2 == 0:
print(p * p)
elif k % 2 > 0:
print(p*(p+1)) |
p03730 | s560445585 | Accepted | import sys
sys.setrecursionlimit(500000)
def input():
return sys.stdin.readline()[:-1]
def mi():
return map(int, input().split())
def ii():
return int(input())
def i2(n):
tmp = [list(mi()) for i in range(n)]
return [list(i) for i in zip(*tmp)]
def main():
A, B, C = mi()
for i in range(B):
if (A*i)%B == C:
print('YES')
return
print('NO')
if __name__ == '__main__':
main()
|
p02595 | s269310037 | Accepted | x,y = map(int,input().split())
y =y**2
count=0
for i in range(x):
a,b = map(int,input().split())
if a**2+b**2 <=y:
count+=1;
print(count) |
p03062 | s353856545 | Accepted | n = int(input())
a = list(map(int, input().split()))
c = 0
m = 10**10
flag = 0
ans = 0
for i in a:
if i == 0:
flag = 1
if i < 0:
c += 1
ans += abs(i)
m = min(m,abs(i))
if c%2 == 0:
flag = 1
if flag:
print(ans)
else:
print(ans-(2*m))
|
p02683 | s243308376 | Accepted | # C Skill Up
def list_add(li1, li2):
return [a+b for a, b in zip(li1, li2)]
N, M, X = map(int, input().split())
data = []
for n in range(N):
data.append(list(map(int, input().split())))
ans = 10000000
for c in range(1 << N):
x = [0] * M
yen = 0
for i, n in enumerate(format(c, f"{N}b")):
if n == "1":
yen += data[i][0]
x = list_add(x, data[i][1:])
for xm in x:
if xm < X:
break
else:
ans = min(ans, yen)
if ans == 10000000:
print(-1)
else:
print(ans) |
p02687 | s864362708 | Accepted | X = input()
if X == "ABC":
print("ARC")
else:
print("ABC") |
p03448 | s313723260 | Accepted | def resolve():
a = int(input())
b = int(input())
c = int(input())
x = int(input())
ans = 0
for i in range(a+1):
for j in range(b+1):
for k in range(c+1):
if 500 * i + 100 * j + 50 * k == x:
ans += 1
print(ans)
return
if __name__ == "__main__":
resolve()
|
p02832 | s355052513 | Accepted | N = int(input())
A = [int(x) for x in input().split()]
cnt=1
for i in A:
if i==cnt:
cnt+=1
if cnt==1:
print(-1)
else:
print(N-cnt+1) |
p02624 | s681946518 | Accepted | N = int(input()); print(sum((((N // i) * (2 * i + (N // i - 1) * i) // 2) for i in range(1, N + 1)))) |
p03644 | s065172857 | Accepted | N = int(input())
for i in range(8):
if 2 ** i > N:
print(2 ** (i-1))
break
|
p03434 | s278347937 | Accepted | n = int(input())
l = list(map(int,input().split()))
l = sorted(l,reverse=1)
A,B = 0,0
for i in range(n):
if (i+1)%2==1:
A += l[i]
else:
B += l[i]
print(A-B)
|
p03162 | s132905048 | Wrong Answer | # -*- coding: utf-8 -*-
def main():
n = int(input())
work_list = [tuple(map(int, input().split())) for i in range(n)]
total = 0
target = {0, 1, 2}
pre = {-1}
for work in work_list:
max_val = 0
now_target = target - pre
for i in now_target:
if max_val < work[i]:
max_val = work[i]
pre = {i}
total += max_val
print(total)
if __name__ == '__main__':
main()
|
p03524 | s528097334 | Accepted | s=input();print('YNEOS'[max(L:=[s.count(x)for x in 'abc'])-min(L)>1::2]) |
p02624 | s475669739 | Wrong Answer | n = int(input())
ans = 0
for _ in range(1, n+1):
y = n // _
ans += y * (y + 1) / 2 * _
print(ans) |
p03625 | s062699171 | Accepted | from collections import Counter
N = int(input())
d = Counter(map(int, input().split()))
sticks_len = []
for k, v in d.items():
if v >= 2:
sticks_len.append(k)
if v >= 4:
sticks_len.append(k)
sticks_len.sort()
if len(sticks_len) >= 2:
print(sticks_len[-1] * sticks_len[-2])
else:
print(0)
|
p02682 | s850460452 | Accepted | a, b, c, k = map(int, input().split())
if a >= k:
print(k)
elif a + b >= k:
print(a)
else:
print(a - (k -(a+b))) |
p03998 | s912782254 | Accepted | sa = input()
sb = input()
sc = input()
t = "a"
while True:
if t == "a":
if len(sa) == 0: break
t = sa[0]
sa = sa[1:]
elif t == "b":
if len(sb) == 0: break
t = sb[0]
sb = sb[1:]
elif t == "c":
if len(sc) == 0: break
t = sc[0]
sc = sc[1:]
print(t.upper()) |
p02916 | s815118394 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=list(map(int,input().split()))
count=0
ans=0
for i in range(n):
ans+=b[a[i]-1]
print(ans)
if count!=n-1:
if a[count]+1==a[count+1]:
ans+=c[a[count]-1]
print(ans)
count+=1
print(ans)
|
p03105 | s661576195 | Wrong Answer | A, B, C = map(int, input().split())
money_time = A * C
if money_time <= B:
print(A)
else:
print(B // A) |
p02802 | s513096441 | Accepted | a,b=map(int,input().split())
list = [0]*a
t_cnt = 0
f_cnt = [0]*a
for i in range(b):
c, d = map(str,input().split())
x = int(c) - 1
if list[x] == 0:
if d == 'AC':
list[x] = 1
t_cnt += 1
else:
f_cnt[x] += 1
for i in range(a):
if list[i] ==0:
f_cnt[i] = 0
print("{} {}".format(t_cnt, sum(f_cnt))) |
p03103 | s107614651 | Accepted | # C - Energy Drink cntlector
N, M = map(int, input().split())
AB = []
for i in range(N):
ab = list(map(int, input().split()))
AB.append(ab)
AB = sorted(AB, key=lambda x: x[0])
cnt = 0
ans = 0
for i in range(N):
cnt = min(M, AB[i][1])
M -= cnt
ans += AB[i][0] * cnt
if M==0:
break
print(ans) |
p03860 | s032454044 | Accepted | A = input().split()
print("A"+ str(A[1][0]) + "C")
|
p03000 | s720716677 | Wrong Answer | k, n = list(map(int, input().split(' ')))
l = list(map(int, input().split(' ')))
ct = 0
ans = 1
i = 0
while ct <= n:
ct += l[i]
ans += (ct <= n)
print(ans) |
p02613 | s949158090 | Wrong Answer | num=input()
if int(num)<=1000:
change=1000-int(num)
else:
array_1=list(num)
array_1=array_1[-4:]
a=''.join(array_1)
b=int(array_1[-4])+1
pay=b*1000
change=pay-int(a)
if array_1[-1]=="0" and array_1[-2]=="0" and array_1[-3]=="0":
change=0
print(change) |
p02797 | s499818547 | Wrong Answer | n, k, s = map(int, input().split())
s1 = str(s)
print((s1 + " ") * (k - 1) + '1 ' * (n - k) + str(s - n + k)) |
p03274 | s118754727 | Accepted | N,K = map(int, input().split())
X = [int(i) for i in input().split()]
ans = float("inf")
for left in range(N-K+1):
right = left + K - 1
if X[left] <=0 and X[right] <= 0:
cur = abs(X[left])
elif X[left] >= 0 and X[right] >= 0:
cur = abs(X[right])
else:
if abs(X[left]) >= abs(X[right]):
cur = abs(X[right]) * 2 + abs(X[left])
else:
cur = abs(X[left]) * 2 + abs(X[right])
ans = min(ans, cur)
print(ans) |
p03162 | s223166689 | Accepted | N=int(input())
abc=[list(map(int,input().split())) for i in range(N)]
x,y,z = 0,0,0
for a,b,c in abc:
x,y,z = max(y,z)+a,max(x,z)+b,max(x,y)+c
print(max(x,y,z)) |
p02645 | s689039599 | Accepted | s = input()
print(s[:3]) |
p03086 | s663876302 | Accepted | # -*- coding: utf-8 -*-
# 標準入力を取得
S = input()
# 求解処理
N = len(S)
ans = 0
ACGT = ["A", "C", "G", "T"]
for i in range(N):
if S[i] not in ACGT:
continue
length = 1
for j in range(i + 1, N):
if S[j] not in ACGT:
break
length += 1
ans = max(ans, length)
# 結果出力
print(ans) |
p03624 | s178209756 | Accepted | import string
s = set(input())
alp = sorted(string.ascii_lowercase,reverse=True)
ans = 'None'
for i in alp:
if not i in s:
ans = i
print(ans) |
p03448 | s922597557 | Accepted | # -*- coding: utf-8 -*-
A = int(input())
B = int(input())
C = int(input())
X = int(input())
count = 0
for a in range(A + 1):
for b in range(B + 1):
for c in range(C + 1):
if( 500*a + 100*b + 50*c == X): count += 1
print(count) |
p03693 | s817820638 | Accepted | r,g,b = map(int,input().split())
if((g*10+b) % 4 == 0):
print('YES')
else:
print('NO')
|
p02601 | s287587709 | Accepted | A,B,C=map(int,input().split())
K=int(input())
count=0
if B<=A:
while B<=A:
B*=2
count+=1
if count>K:
print('No')
else:
C*=2**(K-count)
if C>B:
print('Yes')
else:
print('No') |
p02939 | s597056990 | Wrong Answer | from collections import Counter
import math
import statistics
import itertools
# a,b=map(int,input().split())
b=list(input())
# c=[]
# for i in a:
# c.append(int(i))
# A,B,C= map(int,input().split())
# f = list(map(int,input().split()))
#g = [list(map(lambda x: '{}'.format(x), list(input()))) for _ in range(a)]
# h = []
# for i in range(a):
# h.append(list(map(int,input().split())))
# a = [[0] for _ in range(H)]#nizigen
# lis=[input() for i in range(a)]
lis=list(set(b))
print(len(b)-len(lis)) |
p02621 | s663785680 | Accepted | a = int(input())
print(a+a**2+a**3) |
p02712 | s774312072 | Wrong Answer | n = int(input())
s = 0
for i in range(n):
if (i%3==0) or (i%5==0):
s = s
else:
s = s + i
print (s)
|
p02789 | s505219664 | Accepted | n,m = map(int, input().split())
if n == m:
print('Yes')
else:
print('No') |
p03241 | s067417362 | Accepted | n,m=map(int,input().split())
i=1
x=[]
while(i*i<=m):
if(m%i==0):
x.append(i)
x.append(m//i)
i+=1
x.sort()
for xi in x:
if(xi>=n):
print(m//xi)
break |
p02899 | s754984954 | Accepted | n = int(input())
a = list(map(int,input().split()))
ans = [0]*n
for index,aa in enumerate(a):
ans[aa-1] = index+1
print(*ans) |
p03680 | s163224159 | Accepted | #python3
from collections import deque
def main():
n = int(input())
a = [int(input())-1 for _ in range(n)]
Q = deque()
Q.append(a[0])
cnt = 1
flag = False
for _ in range(n):
x = Q.popleft()
if x == 1:
flag = True
break
cnt += 1
Q.append(a[x])
if not flag:
print(-1)
else:
print(cnt)
main()
|
p02862 | s011124821 | Accepted |
[X,Y] = list(map(int,input().split()))
n = (-1*X+2*Y)//3
m = (2*X-Y)//3
if (X+Y)%3 !=0:
print(0)
elif n<0 or m<0:
print(0)
else:
MAXN = (10**6)+10
MOD = 10**9 + 7
f = [1]
for i in range(MAXN):
f.append(f[-1] * (i+1) % MOD)
def nCr(n, r, mod=MOD):
return f[n] * pow(f[r], mod-2, mod) * pow(f[n-r], mod-2, mod) % mod
print(nCr(n+m,n,10**9 + 7))
|
p03475 | s914507080 | Accepted | N = int(input())
csf = [list(map(int, input().split())) for i in range(N - 1)]
for i in range(N):
ans = 0
for c, s, f in csf[i::]:
if ans <= s:
ans = s
else:
if ans % f == 0:
pass
else:
ans = (ans // f + 1) * f
ans += c
print(ans)
|
p03592 | s564720245 | Wrong Answer | n,m, k = map(int, input().split())
bo = False
for i in range(1,n+1):
for j in range(1,m+1):
if i*(m-j) + j*(n-i) == k:
bo = True
if bo :
print("Yes")
else:
print("No")
|
p03377 | s741673810 | Accepted | a, b, x = map(int, input().split())
if x < a or x-a > b:
print('NO')
else:
print('YES')
|
p03282 | s182402733 | Accepted | s=list(input())
k=int(input())
for i in range(k):
if s[i]!="1":
print(s[i])
break
elif i==k-1:
print(s[i])
break |
p03106 | s292051733 | Accepted | a, b, k = list(map(int, input().split()))
l = []
for i in range(1,min(a,b)+1):
if a%(i) == 0 and b%(i) == 0:
l.append(i)
print(l[-(k)]) |
p02647 | s340676713 | Accepted | N, K = map(int, input().split())
A = list(map(int, input().split()))
for i in range(K):
s = [0] * N
e = [0] * N
for j in range(N):
s[max(j - A[j], 0)] += 1
e[min(j + A[j], N-1)] += 1
cur = 0
for j in range(N):
cur += s[j]
A[j] = cur
cur -= e[j]
if s[0] == N and e[N-1] == N:
break
print(' '.join(map(str, A)))
|
p03474 | s849907026 | Accepted | import sys
import copy
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
a, b = map(int, input().split())
s = input().split("-")
if len(s) == 2 and len(s[0]) == a and len(s[1]) == b:
print('Yes')
sys.exit()
else: print('No') |
p03475 | s352531043 | Wrong Answer | N = int(input())
CSFlist = [list(map(int, input().split())) for _ in range(N-1)]
def calc_time(start):
now = 0
for i in range(start, N-1):
C, S, F = CSFlist[i]
now = max(now, C)
if now % F != 0:
now += F - now % F
now += C
return now
for _ in range(N-1):
print(calc_time(_))
print(0) |
p02854 | s638844388 | Accepted | n=int(input())
a=list(map(int,input().split()))
import numpy as np
c=np.cumsum(a)
s=sum(a)
ans=float('inf')
index=0
for i in range(n):
if abs(2*c[i]-s)<ans:
ans=abs(2*c[i] - s)
index = i
print(ans) |
p03146 | s324400881 | Accepted | s = int(input())
a = [s]
def func(n):
if n % 2 == 0:
a.append(n//2)
elif n % 2 == 1:
a.append(3*n + 1)
i = 1
while True:
func(a[-1])
i += 1
if a.count(a[-1]) == 2:
break
else:
pass
print(i) |
p02730 | s090684099 | Accepted | s = input()
n = len(s)
sa = s[:(n-1)//2]
sb = s[(n+3)//2-1:n]
if s == s[::-1] and sa == sa[::-1] and sb == sb[::-1]:
print("Yes")
else:
print("No")
|
p02760 | s417451340 | Accepted | l = []
for i in range(3):
l.append(list(map(int, input().split())))
n = int(input())
for times in range(n):
b = int(input())
for cl in range(3):
for rw in range(3):
if b == l[cl][rw]:
l[cl][rw] = 0
for i in range(3):
if l[i][0] == l[i][1] == l[i][2] or l[0][i] == l[1][i] == l[2][i]:
print("Yes")
exit()
if l[0][0] == l[1][1] == l[2][2]:
print("Yes")
exit()
elif l[0][2] == l[1][1] == l[2][0]:
print("Yes")
exit()
print("No") |
p03827 | s030551396 | Accepted | N = int(input())
S = str(input())
def Main(N, S):
ans = 0
mx = ans
for c in S:
if c == "I":
ans += 1
else:
ans -= 1
mx = max(mx, ans)
return mx
res = Main(N, S)
print(res) |
p02831 | s681110107 | Wrong Answer | from math import sqrt
a, b = map(int, input().split())
gcd = 1
for i in range(1, int(sqrt(min(a, b))+1)):
if a % i == b % i == 0:
gcd *= i
print(int(a * b / gcd))
|
p02859 | s571979292 | Accepted | #k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
r = int(input())
print(r**2)
|
p03617 | s956072691 | Accepted | # coding: utf-8
# Your code here!
Q,H,S,D=map(int,input().split())
N=int(input())
cost=[Q,H,S,D]
ans=10**18
for index,item in enumerate(cost):
temp=item*(N*2**(2-index) if index!=3 else N//2)
for jndex,jtem in enumerate(cost[:3]):
ans=min(ans,temp+jtem*(0 if index!=3 else (N%2)*2**(2-jndex)))
print(ans)
|
p03592 | s794937230 | Wrong Answer | n, m, k = map(int, input().split())
for r in range(n+1):
for c in range(m+1):
if m*c + n*r - 2*c*r == k:
print('Yes')
break
else:
continue
break
else:
print('No') |
p02777 | s058938399 | Accepted | def resolve():
S, T = input().split()
A, B = list(map(int, input().split()))
U = input()
if S == U:
A -= 1
else:
B -= 1
print(A, B)
if '__main__' == __name__:
resolve() |
p02970 | s633902247 | Wrong Answer | n, d = map(int, input().split())
s = 2*d+1
ans = (n+s-1)/s
print(ans) |
p03632 | s142038035 | Accepted | a, b, c, d = map(int, input().split())
ans = 0
for i in range(0, 101):
if a <= i <= b and c <= i <= d:
ans = ans + 1
if ans != 0:
ans = ans - 1
print(ans) |
p03106 | s261285927 | Accepted | import sys
a,b,k=map(int,input().split())
for i in range(1,101):
if a%(101-i)==0 and b%(101-i)==0:
k-=1
if k==0:
print(101-i)
sys.exit() |
p02972 | s718855989 | Accepted | n = int(input())
a = list(map(int, input().split()))
b = [0 for _ in range(n)]
def check(i, n):
cnt = 0
t = i
while t <= n:
cnt += b[t-1]
t += i
return cnt
for i in range(n-1, -1, -1):
if (a[i] + check(i+1, n)) % 2 == 1:
b[i] = 1
ans = []
cnt = 0
for i in range(n):
if b[i] == 1:
cnt += 1
ans.append(i+1)
print(cnt)
l = [str(int(i)) for i in ans]
print(' '.join(l))
|
p03545 | s097329016 | Accepted | abcd=str(input())
for i in range(2**4):
list=[int(abcd[0])]
symbol=[]
for j in range(1,4):
if (i>>j)&1==True:
list.append(int(abcd[j]))
symbol.append('+')
else:
list.append(int(abcd[j])*(-1))
symbol.append('-')
if sum(list)==7:
print(str(abcd[0])+symbol[0]+str(abcd[1])+symbol[1]+str(abcd[2])+symbol[2]+abcd[3]+"=7")
break |
p03821 | s689670853 | Accepted | n=int(input())
a=[[int(i) for i in input().split()] for _ in range(n)]
u=0
for x in a[::-1]:
if (x[0]+u)%x[1]!=0:u+=((x[0]+u)//x[1]+1)*x[1]-x[0]-u
print(u) |
p03986 | s585726012 | Accepted | x = input()
ans = []
for i in x:
if i == 'S':
ans.append(i)
else:
if len(ans) == 0 or ans[-1] == 'T':
ans.append(i)
else:
ans.pop()
print(len(ans))
|
p02899 | s999575106 | Wrong Answer | n=int(input())
l=list(map(int,input().split()))
ans=[]
for i in range(1,len(l)+1):
ans.append(l.index(i)+1)
print (ans, end=" ") |
p03861 | s782949484 | Accepted | a,b,x=map(int,input().split());print(b//x-(a-1)//x) |
p03030 | s423566291 | Wrong Answer | N = int(input())
data = []
ans = []
for i in range(1, N+1):
city, score = input().split()
score = int(score)
data.append([city, score, i])
city_list = [x[0] for x in data]
score_list = [x[1] for x in data]
num_list = [x[2] for x in data]
city_unique = sorted(set(city_list))
for city_u in city_unique:
city_index = [i for i, x in enumerate(city_list) if x == city_u]
for score in sorted([score_list[x] for x in city_index], reverse=True):
ans.append(num_list[score_list.index(score)])
print(ans) |
p02917 | s442531877 | Accepted | n = int(input())
b = list(map(int,input().split()))
ans = 0
ans += b[0]
ans += b[n-2]
for i in range(0,n-2):
ans += min(b[i],b[i+1])
print(ans) |
p02814 | s724810583 | Accepted | N, M = map(int, input().split())
A = list(map(int, input().split()))
from fractions import gcd
def two(n):
ans = 0
while n%2==0:
n //= 2
ans += 1
return ans
def multi_lcm(A):
ans = A[0]
for a in A:
ans *= a//gcd(ans,a)
return ans
def solve(N,M,A):
ans = 0
num_two = len(set(map(two,A)))
if num_two != 1:
return 0
l = multi_lcm(A)
ans = (M+l//2)//l
return ans
print(solve(N,M,A)) |
p02784 | s807811771 | Accepted | h, n = map(int,input().split())
a = list(map(int,input().split()))
c = 0
for i in range(n):
c = c + a[i]
if (c >= h):
print("Yes")
else:
print("No") |
p03471 | s940653868 | Accepted | n, y = map(int, input().split())
a, b, c = -1, -1, -1
for i in range(n+1):
for j in range(n-i+1):
k = n - i - j
if 10000*i + 5000*j + 1000*k == y:
a, b, c = i, j, k
print(a, b, c) |
p03103 | s632238486 | Accepted | n,m=map(int,input().split())
num=[]
for i in range(n):
a,b=map(int,input().split())
num.append([a,b])
str1= lambda val: val[0]
num.sort(key=str1)
numa=0
numb=0
for i in range(n):
numa+=(num[i][1])*(num[i][0])
numb+=num[i][1]
if numb>=m:
numa-=(numb-m)*num[i][0]
break
print(numa)
|
p02725 | s911449115 | Wrong Answer | k=list(map(int, input().split(' ')))
a=list(map(int, input().split(' ')))
m=a[0]
for i in range(k[1]):
if i==k[1]-1:
if k[0]-a[i]+a[0]>m:
m=k[1]-a[i]+a[0]>m
else:
if a[i+1]-a[i]>m:
m=a[i+1]-a[i]>m
print(k[0]-m) |
p03486 | s970499640 | Accepted | S = list(input())
T = list(input())
S.sort()
T.sort(reverse=True)
if S < T:
print('Yes')
else:
print('No')
|
p03250 | s674384611 | Accepted | s=list(map(int,input().split()))
s=sorted(s)
print(10*s[2]+s[1]+s[0])
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.