problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03637 | s615304226 | Accepted | a=int(input())
an=[int(i) for i in input().split()]
count=0
for i in an:
if i%2==0:
count+=1
if i%4==0:
count+=1
if a%2==1:
a-=1
if count>=a:
print("Yes")
else:
print("No") |
p04044 | s958354527 | Accepted | n , l = map(int , input().split())
s = [input() for i in range(n)]
s.sort()
print(''.join(s)) |
p03211 | s229264049 | Wrong Answer | s = str(input())
L = [753]
for i in range(len(s) - 2):
a = int(s[i:i + 3])
L.append(a)
L.sort()
for j in range(len(L)):
if L[j] == 753:
if j == len(L) - 1:
print(L[j] - L[j - i])
break
if j == 0:
print(L[j + 1] - L[j])
break
else:
if L[j + 1] - L[j] <= L[j] - L[j - 1]:
... |
p03761 | s678136573 | Accepted | from collections import Counter
N = int(input())
strings = [input() for _ in range(N)]
ctypes = set(''.join(strings))
counters = [Counter(s) for s in strings]
s = ''
for c in ctypes:
s += c * min([counter[c] for counter in counters])
print(''.join(sorted(s)))
|
p03617 | s764224028 | Accepted | Q,H,S,D = map(int, input().split())
N = int(input())
Q *= 4
H *= 2
min_cost = min(Q,H,S)
res = 0
if N%2:
N -= 1
res += min_cost
if N != 0:
res += N//2*min(2*min_cost,D)
print(res) |
p04012 | s287330522 | Wrong Answer | w = input()
beau = {}
for i in range(len(w)):
if not w[i] in beau:
beau[w[i]] = 1
else:
beau[w[i]] += 1
num = sum(list(beau.values()))%2
if num == 0:
print('YES')
else:
print('NO') |
p03639 | s993471372 | Accepted | n = int(input())
a = list(map(int,input().split()))
a4 = 0
a2 = 0
a0 = 0
for i in a:
if i % 4 == 0:
a4 += 1
elif i % 2 == 0:
a2 = 1
elif i % 2 != 0:
a0 += 1
if a4 + 1 - a2 < a0:
print('No')
else:
print('Yes') |
p03795 | s385681062 | Accepted | n = int(input())
x = 800 * n
y = int(n // 15) * 200
print(x-y) |
p02631 | s168170296 | Accepted | def solve():
N = int(input())
A = list(map(int, input().split()))
total = 0
for a in A:
total ^= a
ans = []
for a in A:
ans.append(total^a)
return ans
print(*solve())
|
p03557 | s476799167 | Accepted | from bisect import bisect, bisect_left
N = int(input())
A = sorted(list(map(int, input().split())))
B = sorted(list(map(int, input().split())))
C = sorted(list(map(int, input().split())))
ans = 0
for i in B:
max_A = bisect(A, i-1)
min_C = bisect_left(C, i+1)
# print("m_A", max_A, "m_C", min_C)
ans += (... |
p03285 | s348900453 | Accepted | n = int(input())
ans = 0
for i in range(30):
for j in range(15):
if i*4 + j*7 == n:
ans += 1
print("Yes" if ans >= 1 else "No") |
p04031 | s005040274 | Accepted | n=int(input())
t = list(map(int,input().split()))
ans = 10000000000
for i in range(-100, 101):
memo = 0
for j in t:
memo += (i-j)**2
ans = min(ans, memo)
print(ans) |
p03062 | s070451213 | Wrong Answer | import bisect
n=int(input())
a=sorted(list(map(int,input().split())))
ind=bisect.bisect_left(a,0)
if ind==0 :
print(sum(a))
elif ind==n:
print(-sum(a)+2*a[-1])
elif ind%2==0:
print(-sum(a[:ind])+sum(a[ind:]))
else:
print(-sum(a[:ind])+sum(a[ind:])-2*min(abs(a[ind]),abs(a[ind-1]))) |
p02982 | s186413884 | Accepted | import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)
INF = float('inf')
N, D = map(int, input().split())
points = []
for _ in range(N):
point = list(map(int, input().split()))
points.append(point)
ans = 0
for i in ra... |
p02595 | s555923353 | Wrong Answer | import sys
import math
line = input()
N = line.split(' ')[0]
D = line.split(' ')[1]
count = 0
for i in range(1,int(N)):
inputs = input()
X = int(inputs.split(' ')[0])
Y = int(inputs.split(' ')[1])
if(math.sqrt(pow(X,2) + pow(Y,2)) <= int(D) ):
count = count + 1
print(count)
|
p03785 | s646199419 | Accepted | n, c, k = map(int, input().split())
begin = 0
t = 0
cap = 0
L = []
for i in range(n):
L.append(int(input()))
L = sorted(L)
for i in range(n):
a = L[i]
if begin == 0:
begin = a
if a <= begin + k and cap < c:
cap += 1
else:
t += 1
begin = a
cap = 1
print(t +1... |
p02772 | s949469300 | Wrong Answer | import sys
n = int(input())
a = list(map(int,input().split()))
for i in range(0,n-1):
if a[i]%2 == 0:
if a[i]%3 != 0 and a[i]%5 != 0:
print("DENIED")
sys.exit()
print("APPROVED") |
p02583 | s644322463 | Wrong Answer | N = int(input())
L = map(int, input().split())
L = list(set(L))
L.sort()
ret = 0
N_ = len(L)
if N_ >= 3:
for i in range(N_ - 2):
for j in range(i + 1, N_ - 1):
for k in range(j + 1, N_):
if L[i] + L[j] > L[k]:
ret += 1
print(ret) |
p04005 | s442658913 | Accepted | A = sorted(list(map(int, input().split())))
if any(a % 2 == 0 for a in A):
print(0)
else:
print(A[0] * A[1]) |
p03543 | s691695131 | Wrong Answer | N = input()
N = sorted(N)
if (N[0] == N[1] == N[2]) or (N[1] == N[2] == N[3]):
print("Yes")
else:
print("No") |
p03693 | s677049979 | Accepted | r,g,b=map(int,input().split())
rgb=r*100+g*10+b
print('YES' if rgb%4==0 else 'NO') |
p02608 | s226157022 | Wrong Answer | N = int(input())
record = [0] * 1000000
for i in range(1,N+1):
for j in range(1,N+1):
sum = i**2 + i**2 + j**2 + i*i + i*j +j*i
if sum >= N: break
# print(i,j)
record[sum] += 3
for num in record[1:N+1]:
print(num)
|
p02900 | s078090606 | Wrong Answer | a,b = map(int, input().split())
def getPrime(a):
prime=[]
for i in range(2,int(min(a,b)**0.5)+1):
if a%i == 0:
for j in prime:
if i%j == 0:
break
else:
prime+=[i]
return prime
a_prime=getPrime(a)
b_prime=getPrime(b)
print(len(set(a_prime) & set(b_prime))+1) |
p02829 | s145153277 | Accepted | A = int(input())
B = int(input())
print(6 - A - B)
|
p03221 | s941167555 | Accepted | import sys
input = sys.stdin.readline
import heapq
N,M = (int(x) for x in input().split())
pref = [[] for _ in range(N)]
ans = [0] * M
prefnumber = 0
for i in range(M):
P,Y = (int(x) for x in input().split())
pref[P-1].append((Y,i))
for p in pref:
prefnumber += 1
count = 1
if p:
heapq.heapi... |
p02552 | s258749013 | Wrong Answer | x = int(input())
if x==1:
print(0)
else:
print(0) |
p03087 | s376184717 | Accepted | N, Q = map(int,input().split())
S = input()
acc = [0]*N
for i in range(N-1):
if S[i:i+2] == "AC":
acc[i+1] += acc[i]+1
else:
acc[i+1] = acc[i]
ans = 0
for i in range(Q):
l,r = map(int,input().split())
print(acc[r-1]-acc[l-1]) |
p03069 | s042036499 | Wrong Answer | n = int(input())
s = input()
cou = 0
if "#" not in s:
print(0)
else:
a = s.index("#")
s1 = s[a:]
b = s1.count(".")
c = s1.count("#")
print(min(b,c)) |
p02678 | s021599920 | Accepted | n,m=map(int,input().split())
r=[[] for x in range(n)]
for c in range(m):
a,b=map(int,input().split())
r[a-1].append(b-1)
r[b-1].append(a-1)
s=[-1]*n
u=[0]
v=[]
k=1
while k<n:
for d in u:
for e in r[d]:
if s[e]==-1:
s[e]=d
k+=1
v.append(... |
p02790 | s419908854 | Wrong Answer | a,b=map(int,input().split())#整数を複数の変数に格納
if a^b > b^a:
print(a^b)
else:
print(b^a) |
p03208 | s392228517 | Wrong Answer | N, K = map(int, input().split())
h = [int(input()) for _ in range(N)]
h = sorted(h, reverse=True)
h = h[:K]
print(h)
print(max(h) - min(h))
|
p03127 | s502265588 | Accepted | n=int(input())
lis=list(map(int,input().split()))
m=min(lis)
new=lis
num=0
while True:
for i in range(n+num):
new[i]%=m
if all(nn==0 for nn in new):
print(m)
exit()
new.append(m)
sl={m}
for i in range(n+num):
if new[i]!=0:
sl.add(new[i])
m=min(sl)
num+=1 |
p03360 | s210982328 | Wrong Answer | data = list(map(int, input().split()))
k = int(input())
if k == 1:
print( sum(data) + max(data) )
else:
print( sum(data) + max(data) ** k - max(data) )
|
p03038 | s557621989 | Accepted | n,m=map(int,input().split())
a=list(map(int,input().split()))
bc=[list(map(int,input().split())) for i in range(m)]
bc.sort(key=lambda x:x[1])
for b,c in bc[::-1]:
a.extend([c]*b)
if len(a) > 2*n:
break
a.sort(reverse=True)
print(sum(a[:n]))
|
p03017 | s780541956 | Wrong Answer | n,a,b,c,d=map(int,input().split())
s="0"+input()
x=s[a:c+1]
y=s[b:d+1]
if "##" in s[a:c+1]:
print("No")
exit()
if "##" in s[b:d+1]:
print("No")
exit()
if c>d:
if not "..." in s[b:d+1]:
print("No")
exit()
print("Yes") |
p03721 | s480701165 | Accepted | def main():
n,k=map(int,input().split())
ab=sorted([list(map(int,input().split())) for _ in [0]*n],key=lambda x:x[0])
count=0
for i in range(n):
count+=ab[i][1]
if count>=k:
print(ab[i][0])
exit()
if __name__=='__main__':
main() |
p03438 | s126460973 | Accepted | n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
cnt=0
for i in range(n):
x=a[i]
y=b[i]
if x>y:
cnt-=x-y
elif x<y:
cnt+=(y-x)//2
print('Yes' if cnt>=0 else 'No') |
p03146 | s754748516 | Wrong Answer |
import numpy as np
import sys
input = sys.stdin.readline
s = int(input())
ans = 1
while s != 4:
if s%2 == 0 :
s = s/2
else:
s = 3*s + 1
ans+=1
print(s)
if ans == 10:
break
print(ans+3)
|
p02711 | s986373451 | Accepted | a,b,c=input()
if a=='7' or b=='7' or c=='7':
print('Yes')
else:
print('No') |
p02641 | s832824052 | Accepted | x, n = map(int, input().split())
plist = list(map(int, input().split()))
if n == 0:
print(x)
exit()
for i in range(100):
if (x - i) not in plist:
print(x - i)
exit()
if (x + i) not in plist:
print(x + i)
exit() |
p02572 | s144697232 | Accepted | N = int(input())
list_a = [int(x) for x in input().split(' ')]
# sum_a = sum(list_a) % (10**9+7)
# sum_a2 = sum([(x**2) % (10**9+7) for x in list_a])
sum_a = sum(list_a)
sum_a2 = sum([x**2 for x in list_a])
print(((sum_a ** 2 - sum_a2) // 2) % (10**9+7))
|
p02899 | s984306144 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
Answer = []
for i in range(N):
Answer.append(0)
for i in range(N):
Answer[A[i]-1] = i + 1
print(Answer)
|
p03136 | s957981875 | Wrong Answer | a=input()
b=list(map(int,input().split()))
b.sort()
if sum(b)-max(b)-max(b)<0:
print("Yes")
else:
print("No") |
p02861 | s987643213 | Wrong Answer | import math
n = int(input())
coord_list = [list(map(int, input().split())) for _ in range(n)]
all_distances = 0
# 順列計算
for i in range(n-1):
for j in range(i+1, n):
distance = math.sqrt((coord_list[i][0] - coord_list[j][0]) ** 2 + (coord_list[i][1] - coord_list[j][1]) ** 2)
all_distances += d... |
p03137 | s231467850 | Accepted | n,m = map(int,input().split())
X = list(map(int,input().split()))
X.sort()
diff = [X[i+1]-X[i] for i in range(m-1)]
diff.sort()
if n >= m:
print(0)
else:
print(sum(diff[:m-n])) |
p03043 | s026212420 | Accepted | n, k = map(int, input().split())
import math
ans = 0
for i in range(1,n+1):
if i < k:
t = math.log10(k/i)/math.log10(2)
if t == int(t):
ans += 1/(2**t)
else:
ans += 1/(2**(int(t+1)))
else:
ans += 1
print(ans/n) |
p02832 | s280117074 | Accepted | N=int(input())
a=list(map(int,input().split()))
ok=1
for i in range(N):
if a[i]==ok:
ok += 1
if ok==1:
print(-1)
else:
print(N-ok+1)
|
p03071 | s405823368 | Wrong Answer | x,y=map(int,input().split())
ans=0
ans=max(ans,x+x+1)
ans=max(ans,x+y)
ans=max(ans,x+y+1)
print(ans) |
p04043 | s639973287 | Accepted | if sorted(list(map(int,input().split())))==[5,5,7]:
print('YES')
else:
print('NO') |
p02771 | s420220510 | Wrong Answer | l = map(int, input().split())
if len(set(l)):
print("Yes")
else:
print("No") |
p03221 | s096882088 | Accepted | n,m=map(int,input().split())
import bisect
l=[[] for _ in range(n)]
l2=[]
for i in range(m):
p,y=map(int,input().split())
l[p-1].append(y)
l2.append([p,y])
for m in l:
m.sort()
for m in l2:
print("{:06d}".format(m[0]) +"{:06d}".format(bisect.bisect_left(l[m[0]-1],m[1])+1))
|
p03657 | s477907472 | 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") |
p03803 | s588210558 | Accepted | A, B = map(int, input().split())
if A == B:
print('Draw')
elif A > B != 1 or (A < B and A == 1):
print('Alice')
else:
print('Bob') |
p03495 | s626542195 | Wrong Answer | import collections
n, k = map(int, input().split())
a = list(map(int, input().split()))
cnt = len(set(a))
ans = 0
l = collections.Counter(a)
for i, v in l.most_common()[::-1]:
if k < cnt:
cnt -= v
ans += v
print(ans) |
p02631 | s252289581 | Wrong Answer | N = int(input())
a = list(map(int,input().split()))
if N == 2:
print(a[1],a[0])
exit()
for i in range(N):
if i+3 < N:
print(a[i+1]^a[i+2]^a[i+3],end = " ")
else:
print(a[i-1]^a[i-2]^a[i-3],end = " ")
|
p02910 | s606076147 | Accepted | a = ["R","U","D"]
b = ["L","U","D"]
s = input()
cnt = 0
for i in range(len(s)):
if i%2==0:
if s[i] in a:
pass
else:
cnt = 1
break
else:
if s[i] in b:
pass
else:
cnt = 1
break
if cnt == 0:
print("Yes")
els... |
p02695 | s429486372 | Wrong Answer | n, m, q = map(int, input().split())
abcd = [list(map(int, input().split())) for i in range(q)]
import itertools
A = []
M = []
for i in range(1, m+1):
M.append(i)
for team in itertools.combinations(M, n):
A.append(team)
B = [0]*len(A)
for i in range(q):
a = abcd[i][0]
b = abcd[i][1]
c = abcd[i]... |
p03711 | s789049561 | Wrong Answer | x, y = [int(i) for i in input().split()]
gr = [4,6,9,11]
if (x ==2) | (y ==2):
print("No")
elif (x in gr) & (y in gr):
print("Yes")
else:
print("Yes")
|
p02640 | s936446878 | Accepted | X,Y = map(int,input().split())
if Y - 2 * X >= 0 and 2 * X - Y / 2 >= 0 and (Y - 2 * X) % 2 == 0:
print('Yes')
else:
print('No') |
p02923 | s705401471 | Wrong Answer | N = int(input())
H = list(map(int, input().split()))
ans = 0
for i in range(N-1):
if H[i] >= H[i+1]: ans += 1
else: ans = 0
print(ans) |
p03076 | s895457051 | Wrong Answer | dishes = [int(input()) for i in range(5)]
min_dish = dishes.pop(dishes.index(min(dishes)))
sum = 0
for d in dishes:
sum += -int(-d)
print(sum + min_dish) |
p04005 | s315812633 | Accepted | a = list(map(int, input().split()))
if a[0]%2 == 0 or a[1]%2 == 0 or a[2]%2 == 0:
print(0)
else:
a.sort()
print(a[0]*a[1]) |
p02786 | s476845155 | Wrong Answer | #!python3.4.3
import math
h = int(input())
x = math.floor(h/2)
n = 2
count = n
while x > 1:
x = math.floor(x/2)
n = n*2
count += n
print(count+1)
|
p02622 | s646971133 | Accepted | def operation(s,t):
cnt = 0
if s == t:
return cnt
for i in range(len(s)):
if s[i]!=t[i]:
cnt+=1
return cnt
def main():
s = str(input())
t = str(input())
print(operation(s,t))
if __name__ == '__main__':
main() |
p02615 | s314400414 | Wrong Answer |
def solve():
N = int(input())
A = list(map(int,input().split()))
Taku = []
A.sort()
A.reverse()
flg = 0
ans = 0
for an in A:
if flg == 0:
Taku.append(an)
flg = 1
else:
Takudiff = [min(Taku[i], Taku[i-1]) for i in range(len(Taku... |
p02687 | s104950410 | Accepted | from collections import defaultdict
from math import gcd
import time
import sys
from collections import Counter
import itertools
import math
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
start = time.time()
# N = list(map(int, input()))[::-1]
N = input()
if N[... |
p03106 | s900590267 | Accepted | a, b, k = map(int, input().split())
cnt = 0
for i in reversed(range(1, 101)):
if a%i==0 and b%i==0:
cnt += 1
if cnt == k:
print(i)
break |
p02973 | s969861331 | Accepted | from bisect import bisect_right
N = int(input())
A = [int(input()) for _ in range(N)]
t = [-A[0]]
for a in A[1:]:
if a <= -t[-1]:
t.append(-a)
else:
t[bisect_right(t, -a)] = -a
print(len(t))
|
p03555 | s786661018 | Wrong Answer | a=list(input())
b=list(input()).reverse()
print('NYOE S'[a==b::2]) |
p03644 | s883133401 | Wrong Answer | n = int(input())
results = 0
number = 0
for i in range(n+1):
if i == 0:
continue
count = 0
while True:
if i % 2 == 0:
count += 1
i = i / 2
else:
if results < count:
results = count
number = n
break
print(... |
p02823 | s635309169 | Accepted | def main():
N,A,B = map(int,input().split())
if abs(A-B)%2==1:
print(min(A-1,N-B)+1+(B-A-1)//2)
else:
print(abs(A-B)//2)
if __name__ == '__main__':
main() |
p03639 | s438429015 | Accepted | N = int(input())
A = list(map(int, input().split(' ')))
n, m = 0,0
for a in A:
if not a % 4:
n += 1
if not a % 2:
m += 1
m -= n
if 2 * n >= N-1:
print('Yes')
elif 2*n + m >= N:
print('Yes')
else:
print('No')
|
p02820 | s783826349 | Accepted | n,k=map(int,input().split())
a,b,c=map(int,input().split())
t=input()
d={"r":c,"s":a,"p":b}
ans=0
for i in range(n):
if i<k:
ans+=d[t[i]]
elif t[i]!=t[i-k]:
ans+=d[t[i]]
else:
t=t[:i]+"z"+t[i+1:]
print(ans) |
p02756 | s249171829 | Accepted | s,_,*q=open(0)
a='S'
p=1
for q in q:
try:
q,f,c=q.split()
if(f<'2')^p:a+=c
else:a=c+a
except:p^=1
print(a.replace('S',s[:-1])[::p or-1]) |
p03243 | s637016744 | Accepted | n=int(input())
for i in range(1,10):
x = 111*i
if x >= n:
print(x)
break |
p03774 | s762549499 | Accepted | n, m = map(int, input().split())
s = [tuple(map(int, input().split())) for _ in range(n)]
c = [tuple(map(int, input().split())) for _ in range(m)]
for a, b in s:
d = float('inf')
for i in range(m):
x, y = c[i]
if abs(a - x) + abs(b - y) < d:
d = abs(a - x) + abs(b - y)
... |
p03345 | s678508870 | Accepted | a, b, c, k = map(int, input().split())
if k%2 == 0:
print(a-b)
else:
print(b-a) |
p03282 | s266137696 | Accepted | def mi():
return map(int, input().split())
def ii():
return int(input())
def main():
S = input()
K = ii()
for i in range(min(len(S), K)):
if S[i] != '1':
print(S[i])
return
print(1)
if __name__ == '__main__':
main() |
p03038 | s406291117 | Accepted | N, M = map(int, input().split())
A = sorted([int(i) for i in input().split()])
BC = [tuple(map(int, input().split())) for _ in range(M)]
BC.sort(key=lambda x: x[1], reverse=True)
ans = 0
j = 0
b = 0
for i in range(N):
if j < M and A[i] < BC[j][1]:
ans += BC[j][1]
b += 1
if b == BC[j][0]:
... |
p03475 | s428968237 | Wrong Answer | N = int(input())
csf = [tuple(map(int,input().split())) for i in range(N-1)]
for i in range(N-1):
t = 0
for c,s,f in csf[i:]:
t = max(t, s)
if t%f:
t += 0--t//f
t += c
print(t)
print(0) |
p03719 | s233738194 | Accepted | a, b, c = map(int, input().split())
print('Yes' if a <= c <= b else 'No') |
p03319 | s621789221 | Accepted | N,K = map(int, input().split())
_ = input()
print(-(-(N-1)//(K-1))) |
p03407 | s821308824 | Accepted |
a,b,c = map(int,input().split())
print("Yes" if a+b >= c else "No") |
p02730 | s911786058 | Accepted | S = input()
N = len(S)
M = int((N-1)/2)
a = 0
for i in range(M):
if S[i] == S[M-1-i] and S[i] == S[N - 1 - i]:
a += 1
else:
break
if a == M:
print("Yes")
else:
print("No")
|
p02790 | s790265480 | Accepted | a, b = map(int, input().split())
ans = sorted([str(a) * b, str(b) * a])[0]
print(ans) |
p02724 | s760464780 | Wrong Answer | n = int(input())
print(n%500%5*5+n//500*1000) |
p03293 | s197412533 | Accepted | s = list(input())
t = input()
prev = s
for i in range(len(s)):
prev = list(prev[-1]) + prev[:-1]
if ''.join(prev) == t:
print('Yes')
exit()
print('No') |
p04031 | s975413612 | Accepted | n,*a=map(int,open(0).read().split())
ans=10**9
for i in range(-100,101):
c=0
for a_i in a:
c+=(a_i-i)**2
ans=min(ans,c)
print(ans) |
p03861 | s831479596 | Wrong Answer | a,b,c=map(int,input().split())
M = b % c
m = a % c
res = (b-M)/c+(m-a)/c
K=int(res)+1
print(K) |
p03323 | s958861595 | Accepted | a,b=map(int,input().split())
print("Yay!" if a<9 and b<9 else ":(") |
p02773 | s143820789 | Accepted | n = int(input())
s = [input() for i in range(n)]
s.sort()
poll = []
count = []
pre_poll = ''
for i in range(n):
if pre_poll == s[i]:
count[-1] += 1
else:
poll.append(s[i])
count.append(1)
pre_poll = s[i]
poll_dict = dict(zip(poll, count))
poll_dict = dict(sorted(poll_di... |
p03779 | s163206396 | Accepted | X=int(input())
for i in range(1,X+1):
if (i*(i+1))//2>=X:
print(i)
break |
p02789 | s303524483 | Accepted | n, m = map(int, input().split())
if n == m:
print("Yes")
else:
print("No")
|
p02719 | s393599027 | Wrong Answer | n, k = map(int, input().split())
if k == 1:
print(0)
exit()
def gcd(a,b):
while b!=0:
a,b=b,a%b
return a
tmp = gcd(n, k)
low = 10**19
while True:
tmp = abs(tmp-k)
if tmp < low:
low = tmp
n = tmp
else: break
print(low) |
p02627 | s666085159 | Accepted | word = input()
if str.isupper(word):
print('A')
elif str.islower(word):
print('a') |
p03478 | s691657022 | Accepted | target,min_t,max_t=(int(x) for x in input().split())
al=[]
for i in range(target+1):
ii = sum(list(map(int,str(i))))
if min_t <= ii <= max_t:
al.append(i)
print(sum(al))
|
p02756 | s680580969 | Accepted | s = input()
n = int(input())
t = ''
for i in range(n):
q = input().split()
if len(q) == 1:
t, s = s, t
elif len(q) == 3:
if q[1] == '1':
t += q[2]
elif q[1] == '2':
s += q[2]
t = t[::-1]
print(t + s) |
p02553 | s912405797 | Wrong Answer | a,b,c,d = map(int,input().split())
ans = 0
if ans < a*c:
ans = a*c
if ans < a*d:
ans = a*d
if ans < b*c:
ans = b*c
if ans < b*d:
ans = b*d
print(ans) |
p02771 | s406804627 | Wrong Answer | d = raw_input()
a, b, c = d.split()
a = int(a)
b = int(b)
c = int(c)
if (a==b):
if c == a:
print("Yes")
else:
print("No")
else:
if a==c or b == c:
print("Yes")
else:
print("No") |
p03162 | s866414457 | Accepted | N = int(input())
value = [[0]*3 for _ in range(N+1)]
for i in range(N):
a = list(map(int, input().split()))
for k in range(3):
value[i+1][k] = a[k]
dp = [[0]*3 for _ in range(N+1)]
for i in range(1,N+1):
for j in range(3):
for k in range(3):
if j == k:
continue
dp[i][k] = max(dp[i][k]... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.