problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02743 | s860470510 | Wrong Answer |
import math
def main():
a, b, c = map(int, input().split())
if (c-a-b) > pow(10, 5):
if c-a-b > 2 * math.sqrt(a*b): return "Yes"
return "No"
if (c-a-b) * (c-a-b) > 4 * a * b: return "Yes"
return "No"
if __name__ == '__main__':
print(main()) |
p03721 | s583472031 | Wrong Answer | n, k = map(int, input().split())
a = [0] * n
b = [0] * n
sum = 0
arr = []
for i in range(n):
a[i], b[i] = map(int, input().split())
# print(a, b)
arr_list = list(zip(a, b))
# print(arr_list)
arr_list.sort()
# print(arr_list)
for i in range(n):
# print(arr_list[i][1])
sum += arr_list[i][1]
if sum >= k:
answer = a[i]
break
print(answer)
|
p02835 | s796745933 | Accepted | a = list(map(int, input().split()))
if sum(a) >= 22:
print('bust')
else:
print('win')
|
p02723 | s888675528 | Wrong Answer | s=str(input())
if s[2]==s[3] and s[4]==s[5]:
print("YES")
else:
print("NO") |
p03745 | s895835082 | Accepted | N = int(input())
pre = None
is_inc = None
ans = 1
for num in list(map(int, input().split())):
if pre is None:
pre = num
continue
if is_inc is None and num > pre:
is_inc = True
elif is_inc is None and num < pre:
is_inc = False
elif (is_inc and num < pre) or (not is_inc and num > pre):
ans += 1
is_inc = None
pre = num
print(ans)
|
p04044 | s199528318 | Accepted | N,L = map(int,input().split())
S = sorted([input() for n in range(N)])
print("".join(S)) |
p03485 | s245280138 | Accepted | import math
a, b = map(int, input().split())
print(math.ceil((a + b) / 2)) |
p03971 | s424788185 | Accepted | N, A, B = [int(x) for x in input().split()]
S = input()
total = 0
Btotal = 0
for n in range(N):
if S[n]=="a" and total<A+B:
print("Yes")
total += 1
elif S[n]=="b" and total<A+B and Btotal<B:
print("Yes")
total += 1
Btotal += 1
else:
print("No") |
p03673 | s737564934 | Accepted | from collections import deque
n=int(input())
a=list(map(int,input().split()))
ans=deque()
rev=False
if n&1:
rev=True
for i in a:
if rev:
ans.appendleft(i)
else:
ans.append(i)
rev=not rev
print(*ans) |
p02665 | s970241278 | Accepted | N = int(input())
A = list(map(int, input().split()))
cap = [[0, 0] for _ in range(N+1)]
cap[-1] = [A[-1], A[-1]]
for i in range(N-1,-1,-1):
cap[i][0] = (cap[i+1][0] + 2 - 1)//2
cap[i][1] = cap[i+1][1] + A[i]
ans = 1
nodes = 1
failed = nodes < cap[0][0]
for i in range(N):
nodes = min((nodes - A[i])*2, cap[i+1][1])
if nodes < cap[i+1][0]:
failed = True
break
ans += nodes
print(-1 if failed else ans)
|
p02577 | s023056354 | Wrong Answer | def is_sum_nine(str_N):
sum = 0
for i in range(len(str_N)):
sum += int(str_N[i])
if len(str(sum)) < 5:
if sum % 9 == 0:
return True
else:
return False
else:
is_sum_nine(str(sum))
def main():
N = str(abs(int(input())))
if is_sum_nine(N):
print("Yes")
else:
print("No")
if __name__ == "__main__":
main()
|
p03815 | s559634438 | Wrong Answer | import math
x = int(input())
if x % 11 == 0:
print(math.ceil(x/11)*2)
elif x % 11 <= 5:
print(math.ceil(x/11)*2-1)
elif 5 < x % 11 < 11:
print(math.ceil(x/11)*2)
|
p03324 | s346654912 | Accepted | def calc(n):
if n % 100 != 0:
return 0
return calc(n/100) + 1
def resolve():
d, n = map(int, input().split())
n = n + calc(n)
print(100**d*n)
resolve() |
p02881 | s942245351 | Accepted | N = int(input())
ans = 10000000000000000000
for i in range(1,1000001):
if N%i == 0:
ans = min(ans,i+N//i-2)
print(ans)
|
p04044 | s752206474 | Wrong Answer | N, L = map(int, input().split())
S = [input() for i in range(N)]
S.sort(reverse = True)
print(''.join(S)) |
p02727 | s423991407 | Wrong Answer |
X, Y, A, B, C = map(int, input().split())
P = sorted(map(int, input().split()))
Q = sorted(map(int, input().split()))
R = sorted(map(int, input().split()))
ans = 0
for _ in range(X):
if not R or P[-1] > R[-1]:
ans += P.pop()
else:
ans += R.pop()
for _ in range(Y):
if not R or Q[-1] > R[-1]:
ans += Q.pop()
else:
ans += R.pop()
print(ans)
|
p02792 | s250651978 | Accepted |
N = int(input())
memo = [0]*100
for n in range(1,N+1):
s = str(n)
memo[int(s[0])*10+int(s[-1])] += 1
cnt = 0
for i in range(10):
for j in range(i,10):
cnt += memo[i*10+j]*memo[j*10+i]*(1+int(i!=j))
print(cnt) |
p02677 | s875257866 | Accepted | import sys, math
max_int = 1000000001 # 10^9+1
min_int = -max_int
a, b, h, m = map(int, sys.stdin.readline().split())
alpha = abs(math.pi * (h / 6 + m / 360 - m / 30))
if alpha > math.pi:
alpha = 2 * math.pi - alpha
print((a ** 2 + b ** 2 - 2 * a * b * math.cos(alpha)) ** 0.5)
|
p02756 | s505909460 | Accepted | s = input()
top = ''
n = int(input())
isReverse = False
for i in range(n):
Q = input().split()
if(Q[0] == '1'):
isReverse = not isReverse
else:
if Q[1] == '1':
if isReverse: s += Q[2]
else: top += Q[2]
else:
if isReverse: top += Q[2]
else: s += Q[2]
if isReverse: s = s[::-1] + top
else: s = top[::-1] + s
print(s) |
p03821 | s099213235 | Wrong Answer | N = int(input())
A, B = [0]*N, [0]*N
for i in range(N):
A[i], B[i] = map(int, input().split())
ans = 0
for i in range(N-1, -1, -1):
j = 1
while j*B[i] - (A[i] + ans) < 0:
j += 1
ans += j*B[i] - (A[i] + ans)
print(ans) |
p03035 | s150710201 | Wrong Answer | x,y = map(int,input().split())
if (x<=5):
print(y)
elif (x>=13):
print(0)
else :
print(y/2) |
p02548 | s834898792 | Accepted | N=int(input())
count = 0
for a in range(1,1000001):
count+=(N-1)//a
print(count) |
p02818 | s344711014 | Accepted | a,b,k = map(int, input().split())
if a-k >= 0:
print(a-k, b)
elif a+b-k>=0:
print(0, a+b-k)
else:
print(0, 0) |
p02675 | s074415245 | Accepted | L = list(input())
if L[len(L)-1]=='3':
print('bon')
elif L[len(L)-1]=='0' or L[len(L)-1]=='1' or L[len(L)-1]=='6' or L[len(L)-1]=='8':
print('pon')
else:
print('hon') |
p03625 | s726668902 | Accepted | from collections import defaultdict
n = int(input())
A = list(map(int, input().split()))
A.sort()
dict = defaultdict(int)
count = 0
select = []
for _ in range(n):
length = A.pop()
if dict[length] > 0:
dict[length] -= 1
select.append(length)
count += 1
else:
dict[length] += 1
if count == 2:
break
if len(select) < 2:
print(0)
else:
a = select.pop()
b = select.pop()
print(a*b)
|
p03698 | s862455107 | Accepted | S = input()
len_S = len(S)
if len_S == len(set(S)):
print("yes")
else:
print("no")
|
p02693 | s532699430 | Accepted | k=int(input())
a,b=map(int,input().split())
print("OK" if (b//k)*k>=a else "NG") |
p02646 | s112628702 | Accepted | A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
print("YES" if abs(A-B)<=(V-W)*T else "NO") |
p02786 | s304620192 | Accepted | import sys
import math
read = sys.stdin.buffer.read #全てまとめて文字列として格納
readline = sys.stdin.buffer.readline # 一行読む
readlines = sys.stdin.buffer.readlines # 全行リストに格納
H = int(read())
if H == 1:
print(1)
exit()
EXP = math.floor(math.log(H,2))
print(str(int(2**(EXP+1)-1))) |
p03680 | s747171690 | Accepted | n=int(input())
a=[int(input()) for i in range(n)]
c=0
for i in range(1,n+1):
c=a[c]-1
if c==1:
print(i)
break
else:
print(-1) |
p03264 | s593154848 | Accepted | k = int(input())
print(k // 2 * ((k + 1) // 2)) |
p02548 | s092037492 | Accepted | N = int(input())
ans = 0
for a in range(1, N+1):
x = N // a
if N % a == 0:
ans += x - 1
else:
ans += x
print(ans) |
p02684 | s662754894 | Accepted | n, k = map(int, input().split())
a = list(map(int, input().split()))
s = 1
c = 0
d = {}
t = []
# 順番をdictで持つ
while not s in d.keys():
d[s] = c
t.append(s)
c += 1
s = a[s-1]
l = c - d[s]
m = len(d.keys()) - l
if m >= k:
print(t[k])
else:
print(t[(k - m) % l + m])
|
p03434 | s048811078 | Accepted | N = int(input())
a = list(map(int,input().split()))
a.sort(reverse=True)
Alice = 0
Bob = 0
for i in range(N):
if i%2 == 0:
Alice += a[i]
else:
Bob += a[i]
print(Alice-Bob) |
p02641 | s313390326 | Accepted | X,N=map(int,input().split())
P=set(map(int,input().split()))
l=[0]+[(1+i//2)*(-1 if i%2==0 else 1) for i in range(101)]
for i in l:
if X+i not in P:
print(X+i)
break |
p02730 | s076938710 | Wrong Answer | import sys
s = str(input())
a = int((len(s)-1)/2)
b = int(((len(s)+3)/2)-1)
s1 = s[:a]
s2 = s[b:]
for i in range(len(s1)//2):
if s1[i] != s1[-1-i] or s2[i] != s2[-1-i]:
print("No")
sys.exit()
print("Yes") |
p04044 | s369222265 | Wrong Answer | N,L = map(int,input().split())
wordlist = []
for i in range(N):
x = input()
wordlist.append(x)
print(sorted(wordlist))
|
p02702 | s186062933 | Accepted | S = input()
N = len(S)
mod = 2019
num = [0 for i in range(2019)]
num[0] = 1
t = 1
rem = 0
for i in reversed(S):
rem += int(i) * t
rem %= mod
t *= 10
t %= mod
num[rem] += 1
print(int(sum([i * (i-1) / 2 for i in num]))) |
p03759 | s627494453 | Accepted | a, b, c = map(int, input().split())
if b - a == c - b:
print("YES")
else:
print("NO") |
p03659 | s713986537 | Accepted | n = int(input())
a = list(map(int, input().split()))
sumA = sum(a)
x_y = []
x = 0
for i in range(n-1):
x += a[i]
y = sumA - x
x_y.append(abs(x-y))
print(min(x_y))
|
p03997 | s237103171 | Wrong Answer | a = int(input())
b = int(input())
h = int(input())
print((a+b)*h/2) |
p03693 | s522189246 | Accepted | import sys
r, g, b = sys.stdin.readline().split()
def main():
ans = 'YES' if not int(g + b) % 4 else 'NO'
print(ans)
if __name__ == '__main__':
main() |
p03385 | s554231039 | Accepted | s =input()
if ("a" in s and "b" in s and "c" in s):
print("Yes")
else:
print("No") |
p03455 | s930895472 | Accepted | a,b =map(int,input().split())
print("Even" if (a*b)%2==0 else "Odd") |
p02640 | s484342622 | 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())
x,y = i2()
for i in range(x+1):
if 2*i + 4*(x-i) == y:
print("Yes")
exit()
print("No") |
p03524 | s852952725 | Accepted | S = input()
a = S.count("a")
b = S.count("b")
c = S.count("c")
if abs(a-b) <= 1 and abs(a-c) <= 1 and abs(b-c) <= 1:
print("YES")
else:
print("NO")
|
p02813 | s241782177 | Accepted | from itertools import permutations
n = int(input())
p = tuple(map(int, input().split()))
q = tuple(map(int, input().split()))
a = list(permutations(range(1, n + 1)))
print(abs(a.index(p) - a.index(q))) |
p02946 | s874694188 | Accepted | K,X=map(int,input().split())
print(" ".join(map(str,range(X-K+1,X+K)))) |
p02923 | s129704311 | Accepted | N = int(input())
H = [int(h) for h in input().split()]
cnt = 0
ans = 0
i = 0
while i < N-1:
if H[i] < H[i+1]:
ans = max(ans, cnt)
cnt = 0
else:
cnt += 1
i += 1
ans = max(ans, cnt)
print(ans)
|
p02627 | s285300521 | Accepted | # print('a' if 'a' <= input() <= 'z' else 'A')
print(['A','a']['a' <= input() <= 'z'])
|
p02607 | s339921364 | Wrong Answer | in_str = input()
N = int(in_str)
in_list = input().split(' ')
count = 0
for i in range(N):
if i%2==0:
print(i)
if int(in_list[i])%2==1:
count += 1
print(i)
print(count)
print(count) |
p03804 | s287741866 | Accepted | #!/usr/bin/env python3
n, m = map(int, input().split())
a = [input() for _ in range(n)]
b = [input() for _ in range(m)]
for i in range(n - m + 1):
for j in range(n - m + 1):
if all(b[k] == a[i + k][j:j + m] for k in range(m)):
print("Yes")
exit()
print("No")
|
p03639 | s101136661 | Accepted | import collections
n = int(input())
a = list(map(int, input().split()))
ax = []
for i in a:
if (i % 4 == 0):
t = 4
elif (i % 2 == 0):
t = 2
else:
t = 1
ax.append(t)
ay = collections.Counter(ax)
if((ay[2] == 0 and ay[1] <= ay[4]+1) or(ay[2] != 0 and ay[1] <= ay[4])):
print("Yes")
else:
print("No") |
p03838 | s122483995 | Wrong Answer | a, b = map(int, input().split())
if a > 0 and b > 0 or a < 0 and b < 0:
if a > b:
print(a-b+2)
else:
print(b-a)
elif abs(a) == abs(b):
print(1)
else:
if a == 0 or b == 0:
print(abs(abs(a)-abs(b)))
else:
print(abs(abs(a)-abs(b))+1)
|
p02801 | s168147408 | Accepted | c=input()
print(chr(ord(c)+1)) |
p02647 | s644641565 | Wrong Answer | N, K = map(int, input().split())
list = list(map(int, input().split()))
rlist=[]
i=0
l=len(list)
while(i<K):
j=0
while(j<l):
k=0
max=1
while(k<l):
if(k < j):
if(j<=k+list[k]):
max+=1
elif(j < k):
if(k-list[k]<=j):
max+=1
k+=1
rlist.append(max)
j+=1
list=rlist
rlist=[]
i+=1
print(list) |
p02772 | s558929847 | Accepted | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
def main():
N = int(input())
A = list(map(int, input().split()))
for a in A:
if a % 2 == 0:
if a % 3 == 0 or a % 5 == 0:
continue
else:
print('DENIED')
exit(0)
print('APPROVED')
if __name__ == "__main__":
main()
|
p03487 | s357460801 | Accepted | from collections import Counter
n = int(input())
a = map(int, input().split())
counter = Counter(a)
ans = 0
for i, j in counter.items():
if j - i < 0:
ans += j
else:
ans += min(j - i, j)
print(ans)
|
p03705 | s696713954 | Accepted | N,A,B=map(int,input().split())
ans=0
if A>B or (N==1 and A!=B):
ans=0
elif N==1 and A==B:
ans=1
else:
ans=(N-2)*(B-A)+1
print(ans)
|
p03162 | s065612819 | Wrong Answer | N = int(input())
a = []*N
for _ in range(N):
a.append(list(map(int,input().split())))
dp = [[0,0]]*(N+1)
m = max(a[0])
j = a[0].index(m)
dp[0][0] = m
dp[0][1] = j
for i in range(1,N):
prev = dp[i-1][1]
m = 0
for j in range(3):
if j!=prev:
m = max(a[i][j],m)
j = a[i].index(m)
dp[i][0] = dp[i-1][0] + m
dp[i][1] = j
print(dp[N-1][0]) |
p02725 | s580286830 | Wrong Answer | k, n = (int(i) for i in input().split())
a = list(map(int, input().split()))
i=0
while i < n-1:
if (a[i+1]-a[i]) >= k/2:
print(str(k-a[i+1]+a[i]))
break
i += 1
else:
print(str(a[n-1]-a[0])) |
p02823 | s971759093 | Wrong Answer | N, A, B = map(int, input().split())
if abs(A-B) % 2 == 0:
print(abs(A-B)//2)
else:
top = (B-(A+1))//2 + A
low = (N-A - (N-B+1))//2+N-B
print(top)
|
p02912 | s878792733 | Accepted | def main():
n,m=map(int,input().split())
a=list(map(lambda x:int(x)*-1,input().split()))
import heapq
heapq.heapify(a)
for i in range(m):
x=heapq.heappop(a)
heapq.heappush(a,(x+1)//2)
print(sum(a)*-1)
if __name__=="__main__":
main() |
p02612 | s822011055 | Accepted | n = int(input())
a = n%1000
if a == 0:
print(0)
else:
print(1000-a) |
p02583 | s470004537 | Wrong Answer | n=int(input())
li=list(map(int,input().split()))
ans=0
li.sort()
for i in range(0,n-2):
for j in range(i+1,n-1):
for k in range(j+1,n):
if(li[i]+li[j]>li[k]):
ans+=1
print(ans) |
p03339 | s042809064 | Wrong Answer | def resolve():
n = int(input())
s = input()
sum_e = [0]*(n+1)
sum_w = [0]*(n+1)
for i in range(n):
ev = 1 if s[i] == 'E' else 0
wv = 1 if s[i] == 'W' else 0
sum_e[i+1] = sum_e[i] + ev
sum_w[i+1] = sum_w[i] + wv
ans = float('inf')
if n == 2:
print(1 if len(Counter(list(s)).keys()) == 2 else 0)
return
for i in range(1, n):
v = sum_w[i-1] + (sum_e[-1] - sum_e[i+1])
ans = min(ans, v)
print(ans)
resolve() |
p02576 | s896635200 | Accepted | from math import ceil
def mlt(): return map(int, input().split())
x, y, z = mlt()
print(ceil(x/y)*z)
|
p03455 | s129991465 | Accepted | a,b=map(int,input().split())
if (a*b)%2==1:
print("Odd")
else:
print("Even") |
p02900 | s595397330 | Accepted | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
a, b = map(int, input().split())
_min, _max = min(a, b), max(a, b)
prime_factors = []
i = 2
while i ** 2 <= _min:
ext = 0
while _min % i == 0:
ext += 1
_min //= i
if ext:
prime_factors.append((i, ext))
i += 1
if _min != 1:
prime_factors.append((_min, 1))
ans = 1
for pf, _ in prime_factors:
if _max % pf == 0:
ans += 1
print(ans)
|
p02584 | s479519120 | Accepted | # cook your dish here
x,k,d=map(int,input().split())
x=abs(x)
f = x//d;
ans = 0
if(k<=f):
ans = abs(x) - abs(k*d)
else:
e = (k - f)%2
if(e==0):
ans = x - f*d;
else:
ans = x - (f+1)*d;
print(abs(ans)) |
p03075 | s369744446 | Wrong Answer | a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
d = [a,b,c,d,e]
for i in range(4):
if d[i+1]-d[i] > k:
print(":(")
exit()
print("Yey!") |
p03815 | s510372281 | Accepted | x = int(input())
if x%11 == 0 :
print((x//11)*2)
elif x%11 <= 6 :
print((x//11)*2+1)
else :
print((x//11)*2+2)
|
p02697 | s342834946 | Wrong Answer | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
def main():
N,M = map(int, readline().split())
if N % 2 == 1:
for i in range(M):
print(i + 1, N - i)
else:
for i in range(M):
if i < M // 2:
print(i + 1, N - i)
else:
print(i + 2, N - i - 1)
if __name__ == "__main__":
main()
|
p02831 | s816511429 | Wrong Answer | import math
a, b = map(int, input().split())
gcd = 1
prime = []
roota = math.floor(a**(1/2))
for i in range(1, roota + 1):
if a % i == 0 and b % i == 0:
prime.append(i)
for i in prime:
gcd *= i
if b % a == 0:
gcd = a
print(int(a * b / gcd)) |
p02548 | s793693077 | Accepted | N = int(input())
c = 0
for A in range(1, N + 1):
for B in range(1, N + 1):
if A * B >= N:
break
else:
c += 1
print(c) |
p02596 | s032575614 | Accepted | k=int(input())
count=1
num=7
for _ in range(k):
if num%k == 0:
print(count)
break
else:
count += 1
num = (num % k)*10 + 7
else:
print(-1) |
p02693 | s240524622 | Wrong Answer | K = int(input())
A, B = map(int, input().split())
ans = 'NO'
for i in range(A, B+1):
print(i)
if i % K == 0:
ans = 'OK'
break
print(ans) |
p02628 | s513083163 | Accepted | # coding: utf-8
n, k = map(int, input().split())
p = list(map(int, input().split()))
ans = 0
p.sort()
for i in range(k):
ans = ans + p[i]
print(ans)
|
p03699 | s562715653 | Wrong Answer | n = int(input())
s = [int(input()) for _ in range(n)]
s.sort(reverse=True)
tots = sum(s)
i = n - 1
while tots % 10 == 0:
tots -= s[i]
i -= 1
if i < 0:
break
print(tots)
|
p02724 | s414226784 | Accepted | X = int(input())
print(1000 * (X // 500) + 5 * ((X - 500 * (X // 500)) // 5))
|
p02633 | s615860639 | Accepted | i=int(input())
a=0
for j in range(361):
a=(i+a)%360
if a==0:
print(j+1)
break |
p03073 | s536680166 | Accepted | s=input()
leng=len(s)
cnt1=cnt2=0
m=["0","1"]
for i in range(leng):
if s[i]!=m[0]:
cnt1+=1
else:
cnt2+=1
t=m[0]
m[0]=m[1]
m[1]=t
print(min(cnt1,cnt2))
|
p03681 | s853527948 | Accepted | import math
N, M = map(int, input().split())
if N == M:
ans = (math.factorial(N) ** 2) * 2
elif abs(N - M) == 1:
x = max(N, M)
ans = (math.factorial(x) ** 2) // x
else:
ans = 0
print(ans % (10 ** 9 + 7))
|
p02621 | s493163424 | Wrong Answer | a=3
print(a+a*+a*3) |
p02627 | s073155008 | Accepted | print('A' if ord(input()) < 96 else 'a')
|
p03624 | s632238456 | Accepted | s = list(input())
s = set(s)
s = sorted(s)
m = 'abcdefghijklmnopqrstuvwxyz'
for i in range(len(m)):
if s[i] != m[i]:
print(m[i])
exit(0)
if i + 1 != len(m) and i + 1 == len(s):
print(m[i + 1])
exit(0)
print('None') |
p03319 | s686106245 | Accepted | n, k = map(int, input().split())
A = list(map(int, input().split()))
if (n-k)//(k-1) == (n-k)/(k-1):
print((n-k)//(k-1)+1)
else :
print((n-k)//(k-1)+2) |
p02952 | s843465966 | Accepted | cnt = 0
for i in range(1, int(input())+1):
if len(str(i)) % 2:
cnt += 1
print(cnt)
|
p02897 | s639062531 | Wrong Answer | n = int(input())
if n == 1:
print(1)
elif n%2 == 0:
print((n//2)/n)
else:
print(0.6) |
p03011 | s450102579 | Accepted | time = list(map(int, input().split()))
time.sort()
print(sum(time[:2]))
|
p03471 | s761302411 | Accepted | N, Y = map(int, input().split())
ans = [-1, -1, -1]
findit = False
sen = 0
for man in range(N + 1):
if findit == True:
break
for gosen in range(N + 1):
if findit == True:
break
sen = N - man - gosen
if (man * 10000) + (gosen * 5000) + (sen * 1000) == Y and 0 <= sen:
ans = [man, gosen, sen]
findit = True
str_ans = map(str, ans)
print(" ".join(str_ans)) |
p02933 | s007151469 | Wrong Answer | a = int(input())
s = input()
if a >= 3200:
print('red')
else:
print(s) |
p03126 | s649694038 | Wrong Answer | n,m=list(map(int,input().split()))
a=set(input()[1:])
for i in range(n-1):
b=set(input()[1:])
a=set(a&b)
print(len(a)-1)
|
p03695 | s346907145 | Accepted | n=int(input())
ci=[0]*8
ov=0
a=list(map(int,input().split()))
for pt in a:
if pt>=3200:
ov+=1
else:
ci[pt//400]=1
ans = sum(ci)
print(max(1,ans),ans+ov) |
p02713 | s438567111 | Wrong Answer | #!/usr/bin/env python3
def main():
N = int(input())
ans = 0
for i in range(N + 1):
if i % 3 != 0 and i % 5 != 0:
ans += i
print(ans)
if __name__ == '__main__':
main()
|
p03331 | s272377036 | Accepted | N = int(input())
ans = float("inf")
for i in range(1, N):
ans = min(ans, sum([int(n) for n in list(str(i))]
)+sum([int(n) for n in list(str(N-i))]))
print(ans)
|
p02724 | s050589487 | Accepted | n = int(input())
ans = n // 500 * 1000
n %= 500
ans += n // 5 * 5
print(ans) |
p02994 | s831577368 | Wrong Answer | lst = input()
lst = lst.split()
for i in range(len(lst)):
lst[i]= int(lst[i])
N = lst[0]
L = lst[1]
q = L
l = 0
lste = [abs(L)]
tlst = []
for i in range(2,N+1):
t = L+i-1
q += t
tlst.append(t)
t = abs(t)
lste.append(t)
slst = sorted(lste)
l = slst[0]
if tlst.count(-l) > 0:
print(q+l)
else:
print(q-1) |
p02553 | s728191221 | Wrong Answer | import sys
a,b,c,d=map(int,input().split())
if max(a,b)>=0 and max(c,d)>=0:
print(max(a,b)*max(c,d))
sys.exit()
elif max(a,b)<=0 and max(c,d)<=0:
print(min(a,b)*min(c,d))
sys.exit()
elif max(a,b)>=0 and max(c,d)<=0:
print(min(a,b)*max(c,d))
sys.exit()
elif max(a,b)<=0 and max(c,d)>=0:
print(max(a,b)*min(c,d))
sys.exit()
else:
pass |
p03481 | s837764143 | Accepted | x, y = [int(w) for w in input().split()]
ans = 0
t = x
while t <= y:
t *= 2
ans += 1
print(ans)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.