problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03779 | s483791325 | Accepted | X = int(input())
pos = 0
for i in range(1, 100001):
pos += i
if pos >= X:
print(i)
break
|
p03665 | s573163193 | Wrong Answer | import sys
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
N,P = MI()
A = LI()
x = sum(A[i] & 1 for i in range(N)) # Aiの中で、偶数であるものの個数
y = N-x # Aiの中で、奇数であるものの個数
if y == 0:
print(0 if P == 1 else 2**x)
else:
print(2**(x+y-1))
|
p02982 | s349260066 | Accepted | N, D = [int(i) for i in input().split()]
X = []
for i in range(N):
X += [[int(i) for i in input().split()]]
a = 0
for i in range(N):
for j in range(i):
y = 0
for k in range(D):
y += (X[i][k] - X[j][k]) ** 2
if y == int(y ** 0.5) ** 2:
a += 1
print(a) |
p03994 | s923498960 | Accepted | def main():
S = list(input())
k = int(input())
ans = []
for s in S:
if s != 'a' and ord(s) >= 123 - k:
ans.append('a')
k -= 123 - ord(s)
else:
ans.append(s)
if k > 0:
ans[-1] = chr((ord(ans[-1]) + k - 97) % 26 + 97)
print(''.join(ans))
if __name__ == '__main__':
main()
|
p03605 | s286423048 | Accepted | n=input()
print("Yes" if "9" in n else "No")
|
p02548 | s780079058 | Accepted | from math import floor
n = int(input())
m = floor(n**0.5)
ans = 0
for i in range(1, m+1):
ans += 2*((n-1)//i)
ans -= 2*i-1
if m*m == n:
ans += 1
print(ans) |
p02911 | s196616633 | Accepted | N, K, Q = map(int, input().split())
Ans = [K - Q] * N
A = []
for i in range(Q):
Ans[int(input()) - 1] += 1
for i in Ans:
if i > 0:
print('Yes')
else:
print('No') |
p03796 | s236143363 | Wrong Answer | import math
n = int(input())
power = math.factorial(n)
print(power)
print(power%(10**9)) |
p03803 | s853876036 | Accepted | trump=[2,3,4,5,6,7,8,9,10,11,12,13,1]
a,b=map(int,input().split(" "))
if a==b:print("Draw")
else:print(["Alice","Bob"][trump.index(b)>trump.index(a)]) |
p02983 | s648695229 | Wrong Answer | l,r=map(int,input().split())
l=l%2019
r=r%2019
if (l<=1009 and r<=1009) or (l>1009 and r>1009):
print((l*(l+1))%2019)
else:
print(0) |
p03338 | s079638729 | Wrong Answer | import math
x = int(input())
seen = [0] * 1001
ans = 1
for i in range(x):
if(seen[i]): pass
cur = i
if(i > 1):
while (cur <= x):
cur *= i
if(cur <= x): ans = max(ans, cur)
print(ans)
|
p02882 | s859378391 | Accepted | import math
a, b, x = map(int, input().split())
if a * a * b / 2.0 <= x:
ans = math.degrees(math.atan(2 * (a * a * b - x) / (a * a * a)))
else:
ans = math.degrees(math.pi / 2.0 - math.atan(2 * x / (a * b * b)))
print('{:.010f}'.format(ans)) |
p03162 | s745736489 | Accepted | N = int(input())
P = [list(map(int,input().split())) for i in range(N)]
a=[P[0][0]]*N
b=[P[0][1]]*N
c=[P[0][2]]*N
for i in range (1, N):
a[i] = max(b[i-1], c[i-1])+P[i][0]
b[i] = max(a[i-1], c[i-1])+P[i][1]
c[i] = max(a[i-1], b[i-1])+P[i][2]
print(max(a[N-1], b[N-1], c[N-1])) |
p03000 | s537973835 | Accepted | N, X = map(int, input().split())
Ls = [int(i) for i in input().split()]
Ds = [0]
for i, l in enumerate(Ls):
Ds.append(Ds[i] + l)
print(sum([d <= X for d in Ds]))
|
p02796 | s937917529 | Accepted | n = int(input())
rng = []
for _ in range(n):
x, l = map(int, input().split())
rng.append((x-l, x+l))
rng.sort(key=lambda x: x[1])
ans = 1
tmp = rng[0][1]
for i in range(1, n):
l, r = rng[i]
if tmp <= l:
ans += 1
tmp = r
print(ans) |
p03416 | s143463622 | Wrong Answer | a, b = map(int, input().split())
count = 0
for i in range(a, b):
A = str(i)
if A[0] == A[-1] and A[1] == A[-2]:
count += 1
print(count) |
p03455 | s488224628 | Accepted | a, b = map(int, input().split())
if (a * b) % 2 == 0:
print("Even")
else:
print("Odd") |
p02713 | s932503174 | Accepted | import math
K = int(input())
check = {}
ans = 0
for i in range(201):
check[i] = 0
for a in range(1, K+1):
for b in range(1, K+1):
check[math.gcd(a, b)] += 1
for c in range(1, K+1):
for k in check.keys():
num = math.gcd(c, k) * check[k]
ans += num
print(ans) |
p03854 | s032316735 | Accepted | words = ("dream","dreamer","erase","eraser")
import sys
readline = sys.stdin.readline
S = readline().rstrip()
stack = [0]
while stack:
ind = stack.pop()
if ind == len(S):
print("YES")
break
for w in words:
if S[ind:ind + len(w)] == w:
stack.append(ind + len(w))
else:
print("NO") |
p03127 | s934006261 | Accepted | import fractions
N = int(input())
A = list(map(int, input().split()))
ans = A[0]
for i in range(1, N):
ans = fractions.gcd(ans, A[i])
print(ans)
|
p02795 | s163373246 | Accepted | h=int(input())
w=int(input())
n=int(input())
m=max(h,w)
import math
print(math.ceil(n/m)) |
p03821 | s477319411 | Accepted | import sys
n = int(sys.stdin.readline())
m = map(int, sys.stdin.read().split())
ab = list(zip(m, m))
res = 0
for i, j in ab[::-1]:
if j != 1:
res += - (i + res) % j
print(res)
|
p02720 | s203190277 | Accepted | def dfs(s,l):
if s!="":
if len(s)>10 or s[0]=="0":
return
if s!="":
l.append(int(s))
for c in "0123456789":
if s!="":
if abs(int(s[-1])-int(c))<=1:
dfs(s+c,l)
else:
if c!="0":
dfs(s+c,l)
k=int(input())
l=[]
dfs("",l)
l.sort()
print(l[k-1])
|
p02641 | s319558305 | Accepted | # C - Forbidden List
X, N = map(int, input().split())
num_list = list(map(int, input().split()))
for i in range(len(num_list)):
num_list[i] = num_list[i]-X
for i in range(101):
if (-i in num_list) is False:
print(X-i)
break
if (i in num_list) is False:
print(X+i)
break |
p02994 | s933448014 | Accepted | N, L = map(int, input().split())
A = sorted([L + i for i in range(N)], key=lambda x: abs(x))
print(sum(A[1:]))
|
p03838 | s824493313 | Accepted | x, y = [int(x) for x in input().split()]
if x == 0:
ans = abs(y) + (y < 0)
else:
ans = 1 if (x < 0 and abs(x) < abs(y)) or (x > 0 and abs(x) > abs(y)) else 0
ans += abs(abs(y) - abs(x))
ans += 1 if (-1 if (x < 0 and abs(x) < abs(y)) or (x > 0 and abs(x) > abs(y)) else 1) * x * y < 0 else 0
print(ans)
|
p02777 | s263572240 | Accepted | s,t=input().split(" ")
a,b=map(int,input().split(" "))
u=input()
if s==u:
print(a-1, b)
else:
print(a, b-1) |
p02598 | s868885731 | Accepted | N, K = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
hi = 10**18
lo = 0
while hi - lo > 1:
mid = (hi + lo) // 2
cut = 0
for i in range(N):
cut += (A[i] + mid - 1) // mid - 1
if cut <= K:
hi = mid
else:
lo = mid
print(hi) |
p03105 | s918876969 | Accepted | import math
import collections
import sys
#input = sys.stdin.readline
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
a,b,c=MI()
print(min(int(b/a),c)) |
p03817 | s365792475 | Accepted | n=int(input())
p,q=divmod(n,11)
if q==0:
print(2*p)
elif q<=6:
print(2*p+1)
else:
print(2*p+2) |
p03804 | s846937362 | Wrong Answer | N, M = map(int, input().split())
A = [input() for _ in range(N)]
B = [input() for _ in range(M)]
flg = False
for y in range(N-M+1):
for x in range(N-M+1):
res = True
for i in range(M):
if A[y+i][y+i:y+i+M] != B[i][i:i+M]: res = False
if res: flg = True
if flg: break
if flg: break
print("Yes" if flg else "No")
|
p04012 | s930612764 | Accepted | import collections
w = input()
cw = collections.Counter(w)
for val in cw.values():
if val%2 == 1:
print('No')
exit()
print('Yes')
|
p03254 | s734212463 | Accepted | import itertools
N, x = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
a = list(itertools.accumulate(a))
cnt = 0
for i in range(len(a)):
if x > a[i]:
if i == len(a)-1:
break
cnt += 1
elif x == a[i]:
cnt += 1
break
else:
break
print(cnt) |
p03323 | s393645518 | Wrong Answer | print(1)
|
p02817 | s874844446 | Accepted | s, t = input().split()
print(t + s) |
p02910 | s085211048 | Accepted | a = list(input())
# print(a[1])
b = 0
c = 0
for i in range(len(a)):
if i % 2 == 1:
b = b + int(a[i] != "R")
if i % 2 == 0:
c = c + int(a[i] != "L")
if b +c == len(a):
print("Yes")
else:
print("No") |
p02767 | s745079116 | Accepted | n = int(input())
x = list(map(int, input().split()))
max_x = max(x)
min_x = min(x)
ans = []
for i in range(1, 101):
a = 0
for xi in x:
a += (xi - i)*(xi - i)
ans.append(a)
print(min(ans)) |
p03061 | s099983180 | Accepted | from fractions import gcd
N = int(input())
arr = list(map(int, input().split()))
left = [0 for _ in range(N+1)]
right = [0 for _ in range(N+1)]
for i in range(N):
left[i+1] = gcd(left[i],arr[i])
right[-i-2] = gcd(right[-i-1], arr[-i-1])
ans = 1
for i in range(N):
result = gcd(left[i], right[i+1])
ans = max(ans, result)
print(ans) |
p02779 | s779075106 | Wrong Answer | count = int(input())
n_sequence = sorted([int(x) for x in input().split()])
for n in range(count):
if (n_sequence[n-2] == n_sequence[n-1]) or (n_sequence[n-1] == n_sequence[n]) \
or (n_sequence[n-2] == n_sequence[n]):
print("NO")
break
else:
print("YES") |
p02862 | s667456458 | Wrong Answer | import itertools
x, y = map(int, input().split())
if (x+y) % 3 != 0:
print(0)
else:
roots = 0
for seq in itertools.permutations(['u', 'l'], int((x+y)/3)):
_x = 0
_y = 0
for v in seq:
if v == 'u':
_x += 1
_y += 2
else:
_x += 2
_y += 1
if (_x == x) & (_y == y):
roots += 1
print(roots % (pow(10, 9)+7))
|
p03680 | s161692831 | Wrong Answer | N = int(input())
A = [int(input()) for i in range(N)]
cnt = 1
if 2 not in A:
print(-1)
a = A[0]
while a != 2:
a = A[a-1]
cnt += 1
if a == 1:
print(-1)
exit()
print(cnt) |
p03109 | s036192739 | Accepted | y,m,d = map(int,input().split(sep="/"))
if 4 > m:
print("Heisei")
elif m == 4 and d <= 30:
print("Heisei")
else:
print("TBD")
|
p02748 | s415847976 | Accepted | A, B, M = map(int, input().split())
a = [int(x) for x in input().split()]
b = [int(x) for x in input().split()]
x = []
y = []
c = []
setmin = 1001001001001
for _ in range(M):
xi, yi, ci = map(int, input().split())
x.append(xi)
y.append(yi)
c.append(ci)
discountprice = a[xi-1] + b[yi-1] - ci
if discountprice < setmin:
setmin = discountprice
print(min(min(a)+min(b), setmin)) |
p02838 | s320377506 | Accepted | def main():
N=int(input())
A=list(map(int,input().split()))
mod=10**9+7
ans=0
for i in range(60):
a=0
for x in A:
if x>>i&1:
a+=1
ans+=a*(N-a)*pow(2,i,mod)
ans%=mod
print(ans)
if __name__ == '__main__':
main()
|
p03208 | s267466532 | Accepted | N, K = map(int, input().split())
H = sorted([int(input()) for _ in range(N)])
print(min([H[i + K - 1] - H[i] for i in range(N - K + 1)]))
|
p02897 | s508920793 | Accepted | n = int(input())
print("0.5" if n %2 == 0 else ((n//2+1)/n))
|
p02612 | s552809792 | Accepted | # n, m, l = map(int, input().split())
# list_n = list(map(int, input().split()))
# n = input()
# list = [input() for i in range(N)
# list = [[i for i in range(N)] for _ in range(M)]
import sys
input = sys.stdin.readline
N = int(input())
if N % 1000 != 0:
print(1000 - N % 1000)
else:
print(0)
|
p02725 | s620194805 | Accepted | k, n = map(int, input().split())
A = input().split()
a = [int(i) for i in A]
kyori = k + a[0] - a[n-1]
for i in range(n):
if kyori < a[i] - a[i-1]:
kyori = a[i] - a[i-1]
print(k-kyori) |
p02571 | s400942928 | Accepted | s = input()
t = input()
n = len(s)
nt = len(t)
ans = 1000
for i in range(n - nt + 1):
string = s[i:i + nt]
count = 0
for c1, c2 in zip(string, t):
if c1!=c2: count += 1
ans = min(ans, count)
print(ans) |
p03067 | s147481659 | Accepted | A,B,C=map(int,input().split())
print("Yes" if A<=C<=B or B<=C<=A else "No") |
p02953 | s687158000 | Wrong Answer | # C - Build Stairs
n = int(input())
h = list(int(x) for x in input().split())
ans = 'Yes'
for i in range(1, n):
if h[i-1]-h[i]>1:
ans = 'No'
break
if i>1 and h[i-2]>h[i-1] and h[i-1]>h[i]:
ans = 'No'
break
print(ans) |
p03163 | s767649215 | Wrong Answer | n, w = map(int, input().split())
wts = []
for i in range(n):
wts.append(list(map(int, input().split())))
dp = [[0]*(w+1) for i in range(n)]
dp[0][wts[0][0]] = wts[0][1]
for i in range(1, n):
for j in range(1+w):
if j >= wts[i][0]:
dp[i][j] = max(dp[i-1][j], wts[i][1]+dp[i-1][j-wts[i][0]])
else:
dp[i][j] += dp[i-1][j]
print(dp[-1][-1]) |
p03323 | s171223017 | Accepted | a,b=map(int,input().split())
if abs(a-b) > 1:
print(':(')
else:print('Yay!') |
p03385 | s551816491 | Accepted | if sorted(input()) == list('abc'):
print('Yes')
else:
print('No') |
p03852 | s863680691 | Wrong Answer | a=["a","e","i","o","u"]
print("vowel" if input() in a else "constant") |
p03817 | s893039351 | Wrong Answer | x = int(input())
if x <= 6:
print(1)
else:
q, m = divmod(x, 11)
ans = q*2
while m >= 0:
m -= ([5, 6])[ans%2]
ans += 1
print(ans)
|
p02723 | s481691993 | Wrong Answer | input = input()
if input[2] == input[3] and input[4] == input[5]:
print('Yes')
else:
print('NO') |
p02678 | s285579510 | Accepted | n,m=list(map(int,input().split()))
r=[[]for i in range(n)]
for i in range(m):
inp=list(map(lambda x:int(x)-1,input().split()))
r[inp[0]].append(inp[1])
r[inp[1]].append(inp[0])
w=[0 for i in range(n)]
w[0]=1
a=[0]
b=[]
while True:
for i in a:
for j in r[i]:
if w[j]==0:
w[j]=i+1
b.append(j)
if len(b)==0:
break
a=b
b=[]
print("Yes")
for i in range(1,n):
print(w[i]) |
p02603 | s407381160 | Accepted | N = int(input())
m = 1000
k = 0
A = list(map(int,input().split()))
M = A[0]
for a in A:
if M > a:
if k > 0:
m += k * M
k = 0
elif M < a:
if k == 0:
k,m = divmod(m,M)
M = a
m += k * M
print(m) |
p02732 | s902973924 | Accepted | n=int(input())
a=[int(i) for i in input().split()]
nC2=[0 for i in range(n+1)]
for i in range(2,n+1):
nC2[i]=i*(i-1)//2
cnt=[0 for i in range(n)]
for i in a:
cnt[i-1]+=1
res=0
for i in cnt:
res+=nC2[i]
for i in a:
print(res-nC2[cnt[i-1]]+nC2[cnt[i-1]-1]) |
p03456 | s219826539 | Accepted | import math
def main():
a, b = map(int, input().split())
n = str(a) + str(b)
N = int(n)
if math.sqrt(N) % 1 == 0:
print('Yes')
else:
print('No')
main() |
p03289 | s546563012 | Wrong Answer | S=input()
if S[0]=="A" and S[2:-1].count("C")==1:
for s in S[1:]:
if s!="C":
if s.islower():
print("AC")
exit()
print("WA")
|
p03069 | s079142206 | Wrong Answer | N=int(input())
S=input()
ans=0
black=0
white=0
for n in range(N):
if S[n]=='.':
white+=1
else:
black+=1
stones={'b':0,'w':white}
for n in range(N-1):
if S[n]=='#':
stones['b']+=1
else:
stones['w']-=1
if S[n]!=S[n+1]:
ans+=min(stones['b'],stones['w'])
print(min(ans,black,white))
|
p02641 | s797221846 | Wrong Answer | x,n = map(int,input().split())
if n == 0:
print(x)
exit()
l = set(list(map(int,input().split())))
for i in range(1,max(x,100-x)+1):
if x-i not in l:
print(x-i)
exit()
if x+i not in l:
print(x+i)
exit() |
p02629 | s335768561 | Wrong Answer | n = int(input())
l = [0]
ans = []
a = 0
cur = 1
while a < 1000000000000001:
a += 26**cur
cur += 1
l.append(a)
l = list(reversed(l))
for i in range(len(l)-1):
if l[i] >= n:
ans.append(0)
else:
div = (n-1)//(l[i]-l[i+1])
n = n-div*(l[i]-l[i+1])
ans.append(div)
ans.append(n)
ans =list(map(lambda x:x+96, ans))
for i in range(len(ans)):
if ans[i] > 96:
ans2 = ans[i:]
break
ans2 = "".join([chr(i) for i in ans2])
print(ans2) |
p02775 | s625642146 | Wrong Answer | import numpy as np
N = raw_input()
ans = 0
shiharai = np.zeros(len(N)+1)
uketori = np.zeros(len(N)+1)
for i in range(len(N)):
item = int(N[-1-i])
if item < 6:
shiharai[i] = shiharai[i] + item
ans = ans + item
else:
ans = ans + (11-item)
shiharai[i+1] = shiharai[i+1] + 1
uketori[i] = uketori[i] + (10-item)
sol = shiharai - uketori
ans = 0.0
for item in sol:
ans = ans + np.abs(item)
print int(ans)
|
p02987 | s312704664 | Wrong Answer | s = list(input())
if len(set(s))==2 and (s[0]==s[1] and s[2]==s[3]) or (s[0]==s[2] and s[1]==s[3]) or (s[0]==s[3] and s[1]==s[2]):
print('Yes')
else:
print('No')
|
p02756 | s539328789 | Wrong Answer | import sys
input = sys.stdin.readline
S = input()
Q = int(input())
A = [(input().split()) for _ in range(Q)]
for i in range(Q):
if A[i] == ["1"]:
S = ''.join(list(reversed(S)))
else:
if A[i][1] == "1":
S = S + A[i][2]
else:
S = A[i][2] + S
print(S)
|
p03836 | s727398460 | Wrong Answer | sx, sy, tx, ty = map(int, input().split())
right_shift = tx - sx
for i in range(right_shift):
print('R', end='')
up_shift = ty - sx
for i in range(up_shift):
print('U', end='')
for i in range(right_shift):
print('L', end='')
for i in range(up_shift + 1):
print('D', end='')
for i in range(right_shift + 1):
print('R', end='')
for i in range(up_shift + 1):
print('U', end='')
for i in range(right_shift + 1):
print('L', end='')
for i in range(up_shift + 1):
print('D', end='')
print('R') |
p02784 | s830254158 | Wrong Answer | h, n = map(int, input().split())
A = list(map(int, input().split()))
flag = False
for a in A:
h -= a
if h<0:
flag = True
break
print("Yes" if flag else "No") |
p03359 | s418365341 | Wrong Answer | a,b = map(int,input().split())
a_list = [i for i in range(1,a+1)]
b_list = [i for i in range(1,b+1)]
a_len = len(a_list)
b_len = len(b_list)
if a_len <= b_len:
print(a_len)
elif a_len == b_len:
print(a_len)
else:
print(b_len) |
p03131 | s831990942 | Accepted | k, a, b = map(int, input().split())
if b - a <= 2:
print(k + 1)
else:
tmp = (k - a + 1) // 2
ans = a + (b - a) * tmp
if (k - a + 1) % 2 == 1:
ans += 1
print(ans)
|
p02854 | s995289135 | Accepted | n = int(input())
a = list(map(int,input().split()))
m = 10**10
x = sum(a)
y = 0
for i in range(n):
x -= a[i]
y += a[i]
m = min(abs(x-y),m)
print(m) |
p03285 | s991093389 | Wrong Answer | n = int(input())
print('Yes' if n%4==0 or n%7==0 or n%11==0 else 'No') |
p03387 | s893028598 | Accepted | A=sorted(map(int,input().split()))
a=2*A[2]-A[1]-A[0]
print((a+3)//2 if a%2 else a//2) |
p03328 | s832787711 | Accepted | a, b = map(int, input().split())
print(((b-a-1)*(b-a))//2-a) |
p02676 | s346178337 | Accepted | n = int(input())
s = input()
if len(s) <= n:
print(s)
else:
print(s[0:n]+"...")
|
p02554 | s851251749 | Wrong Answer |
n = int(input())
if n == 1:
print(0)
elif n == 2:
print(2)
else :
x = n - 2
combi = (n*(n-1))
ans = ((10 ** x)%(10**9+7) * combi - combi)%(10**9+7)
print(ans)
|
p03494 | s372877999 | Accepted | input()
A = list(map(int, input().split()))
count = 0
while all(a % 2 == 0 for a in A):
A = [a/2 for a in A]
count += 1
print(count) |
p02720 | s245805521 | Accepted | import sys
sys.setrecursionlimit(10**9)
S = []
def add(a):
if a > 3234566667:
return
x = a % 10
if x != 0:
S.append(a * 10 + x - 1)
add(a * 10 + x - 1)
S.append(a * 10 + x)
add(a * 10 + x)
if x != 9:
S.append(a * 10 + x + 1)
add(a * 10 + x + 1)
for i in range(9):
S.append(i+1)
add(i+1)
S.sort()
print(S[int(input())-1])
|
p02726 | s122830043 | Accepted | n,x,y=map(int, input().split(" "))
dp=[0]*(n-1)
for i in range(1,n):
for j in range(i+1,n+1):
dp[min(j-i,abs(x-i)+abs(y-j)+1)-1] += 1
for i in range(n-1):
print(dp[i]) |
p03479 | s752816278 | Accepted | a,b = map(int, input().split())
r = 1
while True :
if a*2 > b :
break
r+=1
a = 2*a
print(r) |
p03012 | s019013271 | Accepted | N = int(input())
A = list(map(int , input().split()))
m = 100**9
for i in range(N):
m = min(m , abs(sum(A[:i]) - sum(A[i:])))
print(m) |
p02754 | s976734438 | Wrong Answer | n, a, b = map(int,input().split())
kumi = n // (a + b)
nokori = n % (a + b)
if nokori == 0:
print(a * kumi)
elif nokori >= 1 and nokori< a:
print(a * kumi + n - a - b)
elif nokori >= a:
print(a * kumi + a)
|
p02594 | s494712247 | Accepted |
x = int(input())
if x>=30:
print("Yes")
else:
print("No")
|
p03075 | s796240037 | Wrong Answer | n = []
ans = 'Yay!'
for i in range(6):
n.append(int(input()))
for i in range(4):
for j in range(4):
if abs(n[i] - n[j]) > n[5]:
ans = ':('
print(ans)
|
p03417 | s504782403 | Accepted | N,M=map(int,input().split())
if N==1 and M==1:
print(1)
exit()
if N==1 or M==1:
print(N*M-2)
exit()
print((N-2)*(M-2))
|
p03067 | s540310278 | Accepted | a,b,c=map(int,input().split())
print("Yes" if a>c>b or b>c>a else "No") |
p02664 | s880089693 | Wrong Answer | t = input()
ans = [0]*(len(t))
for i,c in enumerate(t):
if i !=0 and c =="?":
ans[i] = "D"
elif len(t)!=1:
ans[i] = t[i]
else:
ans = "D"
print(*ans,sep="") |
p02615 | s768842359 | Accepted | import math
n = int(input())
A = list(map(int, input().split()))
A.sort(reverse=True)
ans = A[0] + 2*sum(A[1:math.floor(n/2)]) + (n%2)*A[math.floor(n/2)]
print(ans)
|
p03745 | s432965698 | Accepted | n = int(input())
A = list(map(int, input().split()))
check = ''
ans = 0
for i in range(n-1):
diff = A[i] - A[i+1]
if check == '':
if diff < 0:
check = '+'
elif diff > 0:
check = '-'
elif check != '':
if check == '+' and diff > 0:
ans += 1
check = ''
elif check == '-' and diff < 0:
ans += 1
check = ''
print(ans+1)
|
p02628 | s646458358 | Accepted | n, k = map(int, input().split())
p = [int(x) for x in input().split()]
p = sorted(p)
total = 0
for i in range(k):
total += p[i]
print(total)
|
p03557 | s453368260 | Accepted | #!/usr/bin/env python3
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 7)
import bisect
N = int(readline())
A = sorted(list(map(int,readline().rstrip().split())))
B = sorted(list(map(int,readline().rstrip().split())))
C = sorted(list(map(int,readline().rstrip().split())))
cnt = 0
for i in range(N):
j = bisect.bisect_left(A,B[i])
k = bisect.bisect_right(C,B[i])
cnt += j*(N-k)
print(cnt) |
p03657 | s423983665 | 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') |
p03471 | s373097771 | Accepted | import sys
N, Y = map(int, input().split())
for i in range(N + 1):
if 10000 * i > Y:
break
for j in range(N + 1 - i):
if 10000 * i + 5000 * j > Y:
break
k = N - i - j
if 10000 * i + 5000 * j + 1000 * k > Y:
break
if 10000 * i + 5000 * j + 1000 * k == Y:
print('{0} {1} {2}'.format(i, j, k))
sys.exit()
print('-1 -1 -1') |
p03910 | s388646926 | Accepted | n = int(input())
r = 10**7+1
l = 1
def f(n):
return (n**2+n)//2
while r-l> 1:
if f((l+r)//2)>n:
r = (l+r)//2
else:
l = (l+r)//2
l = l+1
rm = (l+1)*l//2-n
ans = list(range(1, l+1))
ans.remove(rm)
for a in ans:
print(a)
|
p02917 | s068478998 | Wrong Answer | def resolve():
N = int(input())
B_list = list(map(int, input().split()))
sum_point = 0
sum_point += B_list[0]
for i in B_list:
sum_point += i
print(sum_point)
if __name__ == "__main__":
resolve() |
p03827 | s735146727 | Wrong Answer | a=[-2]
for i in open(0).read():a+=a[-1]+1-2*(i=='D'),
print(max(a)) |
p02552 | s777103848 | Accepted | def inp():
return input()
def iinp():
return int(input())
def inps():
return input().split()
def miinps():
return map(int,input().split())
def linps():
return list(input().split())
def lmiinps():
return list(map(int,input().split()))
def lmiinpsf(n):
return [list(map(int,input().split()))for _ in range(n)]
x = iinp()
if x == 0:
print(1)
else:
print(0) |
p02658 | s461125290 | Accepted | n = int(input())
arr = list(map(int,input().split()))
ans = 1
if 0 in arr:
print(0)
exit()
for i in arr:
ans *= i
if ans > 10**18:
print(-1)
exit()
print(ans if ans <= 10**18 else -1)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.