problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02665 | s431662834 | Accepted | n=int(input())
a=list(map(int,input().split()))
s=sum(a)
res=0
m=1
for i in a:
b=m-i
if b<0:
print(-1)
exit(0)
res+=i
res+=b
s-=i
m=min(b*2,s)
print(res)
|
p03657 | s034591987 | Wrong Answer | a,b=(int(x) for x in input().split())
c = ( a + b ) % 3
if (str(c) == '0'):
print ( 'Possible' )
else:
print ( 'Impossible' ) |
p03456 | s935189297 | Accepted | a,b = input().split()
s = int(a+b)
ans = "No"
for i in range(1,1000):
if s/i == i:
ans = "Yes"
print(ans) |
p03623 | s740034932 | Wrong Answer | s = str(input())
alphabet = ["a","b","c","d","e","f"
,"g","h","i","j","k","l","m","n",
"o","p","q","r","s","t","u","v","w","x","y","z"]
for i in s:
if i in alphabet:
alphabet.remove(i)
if len(alphabet)!=0:
print(alphabet[0])
else:
print("None") |
p03457 | s712040247 | Wrong Answer | N = int(input())
locx = 0
locy =0
time = 0
for i in range(N):
t,x,y = map(int,input().split())
time = t-time
dis = abs(locx-x)+abs(locy-y)
if (time-dis)<0 :
print("No")
exit()
if (time-dis)%2 == 1:
print("No")
exit()
locx = x
locy = y
else :
print("Yes") |
p03612 | s556361560 | Wrong Answer | N = int(input())
p = list(map(int,input().rstrip().split(" ")))
ans = 0
swap = 0
for i in range(N - 1):
if p[i] == i + 1:
swap = p[i]
p[i] = p[i + 1]
p[i + 1] = swap
ans += 1
print(ans) |
p02594 | s295353874 | Accepted | t = int(input())
if t >= 30:
print('Yes')
else:
print('No') |
p03437 | s495411048 | Wrong Answer | # APC 001: A β Two Integers
x, y = map(int, input().split())
print('-1' if x % y == 0 else x * y) |
p03455 | s892047728 | Accepted | a,b=map(int,input().split())
print("Even" if a*b % 2 == 0 else "Odd") |
p03910 | s280027551 | Wrong Answer | import math
n=int(input())
def ts(x):
return x*(x+1)
m=n
for i in range(math.ceil(math.sqrt(2*n)-2),math.floor(math.sqrt(2*n))+1,1):
if ts(i)<=2*n<=ts(i+1):
m=i+1
break
a=n%(m+1)
b=n//(m+1)
if a!=0:
print(a)
i=1
c=0
while c!=b:
if i!=a and n+1-i!=a:
print(i)
print(m+1-... |
p03723 | s138087787 | Wrong Answer | a, b, c = map(int, input().split())
if a == b == c:
print(-1)
exit()
if a % 2 != 0 or b % 2 != 0 or c % 2 != 0:
print(0)
exit()
N = (a + b + c) // 3
cnt = 1
while N:
if N % 2 != 0: break
N //= 2
cnt += 1
print(cnt)
|
p02724 | s671912526 | Wrong Answer | x = int(input())
Y = [500, 100, 50, 10, 5, 1]
ans = 0
for i in Y:
if i == 500:
ans += (x // i)*1000
elif i == 5:
ans += (x // i)*5
x -= (x//i)*i
if x == 0:
break
print(ans) |
p02578 | s214774646 | Accepted | n=int(input())
a=list(map(int,input().split()))
s=0
for i in range(n-1):
if a[i+1]<a[i]:
t=a[i]-a[i+1]
s+=t
a[i+1]+=t
print(s)
|
p02727 | s250932122 | Wrong Answer | X, Y, A, B, C = map(int, input().split())
ps = sorted(map(int, input().split()), reverse = True)
qs = sorted(map(int, input().split()), reverse = True)
rs = sorted(map(int, input().split()), reverse = True)
red_apples = X
green_apples = Y
while red_apples > 0 and X - red_apples < C and rs[X-red_apples] > ps[red_apple... |
p02693 | s055879318 | Accepted | import sys
import math
K = int(input())
A, B = map(int, sys.stdin.readline().strip().split())
if B >= math.ceil(A / K) * K:
print('OK')
else:
print('NG')
|
p02918 | s165320967 | Wrong Answer | from itertools import groupby
n, k = map(int, input().split())
D = {
'L': 0,
'R': 0
}
for val, it in groupby(input()):
D[val] += 1
if D['L'] == D['R']:
u = 2 * max([0, D['L'] - k]) + (D['L'] - k == 0)
else:
u = 1 + 2 * max([0, min(D.values()) - k])
print(n - u)
|
p02756 | s143437764 | Accepted | s=list(input())
top=bool()
t=[]
u=[]
n=int(input())
for i in range(n):
q=list(map(str,input().split()))
if q[0]=='1':
top=not top
else:
if (q[1]=="1") ^ top:
t.append(q[2])
else:
u.append(q[2])
s=list(reversed(t))+s+u
if top:
print(*list(reversed(s)),sep='')
else:
print(*s,sep='') |
p03672 | s720586533 | Wrong Answer | s = input()
ans = 0
for i in range(1, len(s) // 2 - 1):
if s[:i] == s[i:2*i]:
ans = 2 * i
print(ans)
|
p03556 | s717022452 | Accepted | import math
n=int(input())
for i in range(n,0,-1):
if math.sqrt(i).is_integer():
print(i)
break
|
p02952 | s816819324 | Wrong Answer | N = int(input())
count = 0
for i in range(1,N+1):
if i % 2 == 1:
count+=1
print(count) |
p03264 | s316119889 | Accepted | a=int(input())
if a%2==0:
print(int(a*a/4))
else:
print(int(((a+1)*(a-1))/4)) |
p02909 | s955250869 | Accepted | import sys
def solve():
input = sys.stdin.readline
S = input().strip("\n")
if S[0] == "S": print("Cloudy")
elif S[0] == "C":print("Rainy")
else: print("Sunny")
return 0
if __name__ == "__main__":
solve() |
p03852 | s072253098 | Wrong Answer | c = str(input())
for c in "aiueo":
print("vowel")
else:
print("consonant") |
p02817 | s849667607 | Wrong Answer | S,T = input().split()
ans = S + T
print(ans) |
p02663 | s022800873 | Accepted | # coding: utf-8
def solve(*args: str) -> str:
h1, m1, h2, m2, k = map(int, args[0].split())
return str((h2-h1)*60 + (m2-m1) - k)
if __name__ == "__main__":
print(solve(*(open(0).read().splitlines())))
|
p02881 | s124914766 | Accepted | N = int(input())
ans = 10 ** 18
for i in range(1, int(N ** 0.5 + 0.5) + 1):
if N % i == 0:
walk = i + N // i - 2
ans = min(ans, walk)
print(ans)
|
p02879 | s580642832 | Accepted | a, b = map(int ,input().split())
if (a < 10 and b < 10):
print(a*b)
else:
print(-1) |
p02627 | s914459782 | Accepted | n = input()
if n.islower():
print('a')
else:
print('A')
|
p02819 | s359775640 | Wrong Answer | n=int(input())
for p in range(2, n):
if n % p != 0:
print(n)
break
else:
n=n+1 |
p02910 | s532503162 | Accepted | s=list(input())
o=['R','U','D']
e=['L','U','D']
for i in range(len(s)):
if (i+1)%2==0:
if s[i] not in e:
print("No")
exit()
else:
if s[i] not in o:
print("No")
exit()
print("Yes") |
p02775 | s922609347 | Wrong Answer | N=list(reversed(input()))
ans=0
old=0
k=[]
for n in N:
if int(n)+old<=5:
ans+=int(n)+old
k.append([int(n)+old,int(n)])
old=0
else:
ans+=10-(int(n)+old)
k.append([10-(int(n)+old),int(n)])
old=1
if old==1:
ans+=1
print(ans) |
p02548 | s272537679 | Accepted | N = int(input())
cnt = 0
for a in range(1, 10 ** 6 + 1):
for b in range(1, 10 ** 6 + 1):
if N - a * b <= 0:
break
if N - a * b > 0:
cnt += 1
print(cnt)
|
p03633 | s270927593 | Accepted | from fractions import gcd
def lcm(a,b): return a*b//gcd(a,b)
# def lcm(a,b): return a*b//gcd(a,b)
n = int(input())
ans = 1
for i in range(n):
t = int(input())
ans = lcm(t, ans)
print(ans) |
p02881 | s164493917 | Wrong Answer | import math
def main():
N = int(input())
for a in range(1, int(math.sqrt(N)))[::-1]:
if N % a == 0:
b = N // a
print(a + b - 2)
return
if __name__ == "__main__":
main() |
p03695 | s253930791 | Accepted | n = int(input())
A = list(map(int, input().split()))
ratelist = [1, 400, 800, 1200, 1600, 2000, 2400, 2800, 3200]
rate = [0] * n
count = 0
for i in range(n):
rate[i] = sum([A[i] >= j for j in ratelist])
if rate[i] == 9:
count += 1
ans = len(set(rate))
if count > 0:
ans -= 1
print('{} {}'. format(max... |
p03219 | s790247076 | Accepted | x, y = map(int, input().split())
print(x + y // 2) |
p03163 | s401888590 | Accepted | import sys
input=sys.stdin.readline
n,W=map(int,input().split())
items=[list(map(int,input().split())) for i in range(n)]
import numpy as np
dp=np.zeros([n+1,W+1],dtype=np.int64)
for i in range(n):
w=items[i][0]
v=items[i][1]
dp[i+1][:w]=dp[i][:w]
dp[i+1][w:]=np.maximum(dp[i][w:],dp[i][:-w]+v)
print(dp[-1][-1... |
p02682 | s212201735 | Accepted | z = input().split()
a=int(z[0])
b=int(z[1])
c=int(z[2])
k=int(z[3])
res=0
if k>=a:
res=res+a
if k-1>=b:
res=res+b-b
if k-(a+b)>=c:
res=res+c-2*c
else:
res=res+(k-a-b)-2*(k-a-b)
else:
res=res+(k-a)-(k-a)
else:
res=res+k
print(res) |
p03087 | s541797580 | Accepted | N, Q = map(int, input().split())
S = input()
query = [input().split() for i in range(Q)]
AC = [0 for i in range(N+1)]
for i in range(N):
AC[i+1] = AC[i] + (1 if S[i:i+2] == 'AC' else 0)
for i in range(Q):
L, R = int(query[i][0]), int(query[i][1])
print(AC[R-1] - AC[L-1]) |
p02836 | s403110762 | Accepted | import math
s=input()
count=0
a=-1
for i in range(math.floor(len(s)/2)):
if s[i]!=s[a]:
count+=1
a+=-1
print(count) |
p02835 | s139029689 | Accepted |
A = list(map(int, input().split()))
if sum(A) > 21:
print("bust")
else:
print("win")
|
p03261 | s795751739 | Accepted | n=int(input())
x=[input() for _ in range(n)]
ans='Yes'
if len(x)==len(set(x)):
for i in range(n-1):
if x[i][-1]!=x[i+1][0]:
ans='No'
break
else:
ans='No'
print(ans)
|
p02952 | s450301697 | Accepted | N = int(input())
if N < 10:
print(N)
elif N < 100:
print(9)
elif N < 1000:
print(N - 90)
elif N < 10000:
print(909)
elif N < 100000:
print(N - 9090)
elif N == 100000:
print(90909) |
p02917 | s821752477 | Wrong Answer | import copy
N = int(input())
Bs = list(map(int, input().split()))
As = [copy.copy(Bs[0])]
As.extend(copy.copy(Bs))
#print(Bs)
#print(As)
for index, B in enumerate(Bs):
print(Bs)
print(As)
if B < As[index]:
As[index] = B
#print(As)
print(sum(As))
|
p03836 | s395957778 | Accepted | sx,sy,tx,ty = map(int,input().split())
ans = 'R'*(tx-sx)+'U'*(ty-sy) + 'L'*(tx-sx) +'D'*(ty-sy) + 'D' + 'R'*(tx-sx+1) + 'U'*(ty-sy+1)+ 'L' + 'U' + 'L'*(tx-sx+1) + 'D'*(ty-sy+1) + 'R'
print(ans) |
p02811 | s109187286 | Accepted | k, y = [int(i) for i in input().split()]
print('Yes' if 500 * k >= y else 'No') |
p02631 | s135823620 | Wrong Answer | n = int(input())
A = list(map(int, input().split()))
xor = 0
for a in A:
xor ^= a
result = []
for a in A:
result.append(xor ^ a)
print(result) |
p03208 | s836154589 | Accepted | N, K = map(int, input().split())
H = [int(input()) for i in range(N)]
H.sort()
ans = float("inf")
for i in range(N-K+1):
ans = min(ans, H[i+K-1]-H[i])
print(ans) |
p03035 | s192111309 | Wrong Answer | A,B= map(int,input().split())
if A>=13:
print(B)
elif A<=12 & A>=6:
print(B/2)
elif A<=5:
print(0) |
p02707 | s866040180 | Accepted | N, = map(int, input().split())
X = list(map(int, input().split()))
R = [0]*N
for x in X:
R[x-1] += 1
for r in R:
print(r)
|
p04043 | s410419297 | Wrong Answer | INT_MAX=10**18+7
MOD=10**9+7
def INPUT():return list(int(i) for i in input().split())
def LIST_1D_ARRAY(n):return [0 for _ in range(n)]
def LIST_2D_ARRAY(m,n):return [[0 for _ in range(n)]for _ in range(m)]
#################################################################################
a,b,c=INPUT()
if a==5 and b==7 ... |
p03282 | s276731143 | Accepted | s=input()
k=int(input())
for i in range(k):
if s[i]!="1":
print(s[i])
break
else:
print("1") |
p03331 | s388109354 | Accepted | n = str(input())
ans = 0
for x in n:
ans+=int(x)
if ans==1:
ans=10
print(ans) |
p03043 | s385022468 | Accepted | import math
n,k = map(int,input().split())
c = 0
for i in range(1,n+1):
if i >= k:
c += 1
else:
s = math.ceil(math.log2(k/i))
c += (1/2)**s
print(c/n) |
p02633 | s484691296 | Wrong Answer | X = input()
X_int = int(X)
if 360%X_int==0:
print( int( 360 / X_int) )
else:
print( 360 ) |
p02697 | s398204151 | Wrong Answer | n, m = map(int, input().split())
result = []
x = [i for i in range(1, 2*m+2)]
for i in range(m):
result.append([x[i], x[-i-1]])
for j in result:
print(*j) |
p02971 | s635427288 | Accepted | import sys
from collections import deque, Counter, defaultdict
from fractions import gcd
input = sys.stdin.readline
def main():
n = int(input())
As = [int(input()) for i in range(n)]
sAs = sorted(As)
mn1 = sAs[-1]
mn2 = sAs[-2]
for i in range(n):
if As[i] == mn1:
print(mn2)
... |
p02948 | s317115437 | Accepted | import heapq as q
import sys
input = sys.stdin.readline
n, m = map(int, input().split())
ab = [list(map(int, input().split())) for i in range(n)]
ans = 0
v = []
q.heapify(v)
ab.sort()
i = 0
for j in range(m):
while True:
if i >= n:
break
a, b = ab[i]
if a > j + 1:
break
q.heappush(v, -b... |
p02583 | s983231513 | Accepted | n=int(input())
a=list(map(int,input().split()))
ct=0
b=0
for i in range(0,n-2):
p=a[i]
for j in range(i+1,n-1):
q=a[j]
for k in range(j+1,n):
r=a[k]
if p!=q and q!=r and r!=p and 2*max(p,q,r)<p+q+r:
ct+=1
print(ct)
|
p03145 | s802946140 | Wrong Answer | AB,BC,CA = sorted(map(int,input().split()))
print(AB*BC/2)
|
p03478 | s464112949 | Accepted | inp = list(map(int,input().split()))
N = inp[0]
A = inp[1]
B = inp[2]
l=list()
for i in range(N+1):
n0 = i % 10
n1 = (i % 100 - n0) // 10
n2 = (i % 1000 - n0 - n1*10) // 100
n3 = (i % 10000 - n0 - n1*10 - n2*100) // 1000
n4 = (i % 100000 - n0 - n1*10 - n2*100 - n3*1000) // 10000
if A <= n0+n1+n2... |
p03854 | s938137305 | Wrong Answer | s=input().replace("eraser","").replace("dreamer","").replace("erase","").replace("dream","")
if s=="":print('YES')
else:print('NO') |
p03408 | s082167164 | Wrong Answer | n=int(input())
s=[]
for i in range(n):
s.append(input())
m=int(input())
t=[]
for i in range(m):
t.append(input())
from collections import Counter
s=Counter(s)
t=Counter(t)
ans=-1000000
for i in s:
ans=max(ans,s[i]-t.get(i,0))
for i in t:
ans=max(ans,-t[i]+s.get(i,0))
print(ans)
|
p03239 | s059783996 | Accepted | import sys
def input(): return sys.stdin.readline().rstrip()
def main():
N, T = map(int, input().split())
MAX_ANS = 10000
ans = MAX_ANS
for _ in range(N):
c, t = map(int, input().split())
if c < ans and t <= T:
ans = c
if ans == MAX_ANS:
print('TLE')
else:
... |
p03719 | s550133540 | Accepted | A,B,C = map(int, input().split())
print('Yes' if A<=C<=B else 'No') |
p02873 | s272688636 | Accepted | s = input()
de_num = 0
le_num = 0
ans = [0]*(len(s)+1)
for i in range(len(s)):
if s[i] == "<":
de_num += 1
else:
de_num = 0
ans[i+1] = de_num
s = s[::-1]
ans.reverse()
for i in range(len(s)):
if s[i] == ">":
le_num += 1
else:
le_num = 0
ans[i+1] = max(le_num,an... |
p02705 | s461393888 | Accepted | n = int(input())
print(2*n*3.14159264) |
p02687 | s947917114 | Accepted | S=input()
if S=="ABC":
print("ARC")
else:
print("ABC") |
p02554 | s912698837 | Wrong Answer | import random
N = int(input())
A = []
B = 0
while 0 not in A and 9 not in A:
for i in range(0,N):
A.append(random.randint(0,9))
for j in range(0,N):
B += A[j]*10**j
x = B % 10**9 + 7
print(x) |
p04044 | s341081510 | Accepted | n,l=map(int, input().split())
s=[]
for i in range(n):
s.append(input())
s.sort()
sen=""
for i in range(n):
sen=sen+s[i]
print(sen) |
p03767 | s609395365 | Wrong Answer | def getInput():
return [int(i) for i in input().rstrip().split(' ')]
N = getInput()[0]
a_i = getInput()
a_i.sort(reverse=True)
team = [[0 for i in range(3)] for i in range(N)]
sums = 0
for i in range(3):
for j in range(N):
team[j][i] = a_i.pop(0)
if i==1:
sums += team[j][1]
print(... |
p03284 | s990800521 | Wrong Answer | n,k=map(int,input().split())
print(n%k)
|
p02951 | s960343724 | Accepted | A,B,C = list(map(int,input().strip().split()))
if C - ( A - B ) < 0:
print(0)
else:
print(C - (A-B))
|
p03360 | s615941762 | Accepted | A, B, C = map(int, input().split())
K = int(input())
M = max(A, B, C)
G = A+B+C-M
print(G+M*(2**K)) |
p02555 | s541888956 | Accepted | S=int(input())
cnt=0
import math
def combinations_count(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
if S<3:
print(0)
else:
syou=S//3
amari=S%3
while syou>0:
cnt=cnt+combinations_count(syou+amari-1, amari)
syou=syou-1
amari=amari+3
print(cnt%((10**9)+7)) |
p03220 | s241843184 | Accepted | n = int(input())
t,a = map(float,input().split())
h = list(map(float,input().split()))
best = 10 ** 5
ans = -1
for i in range(n):
tt = t - h[i] * 0.006
best = min(best,abs(tt - a))
if abs(a - tt) == best:
ans = i
print(ans+1) |
p03086 | s797955425 | Wrong Answer | s=input()
tmp = 0
ans = -1
flg= 1
for i in range(len(s)):
if s[i] in ["A","G","C","T"]:
tmp += 1
else:
if ans <= tmp:
ans = tmp
flg = 0
tmp = 0
print(ans if flg==0 else tmp) |
p02777 | s334806604 | Wrong Answer | from sys import stdin
lines = stdin.readlines()
S, T = map(str, lines[0].split())
A, B = map(int, lines[1].split())
U = lines[2]
if S == U :
a = A - 1
b = B
else :
a = A
b = B - 1
print(a, b) |
p04045 | s344639005 | Wrong Answer | n, k = map(int, input().split())
d = list(map(int, input().split()))
lis = []
for i in range(10):
if not i in d:
lis.append(i)
inf = 1001001001
ans = inf
def dfs(s, n):
if len(s) == 4:
if int(s) >= n:
global ans
ans = min(ans, int(s))
return
else:
for ... |
p02717 | s984934895 | Accepted | #!/usr/bin/env python3
x, y, z = map(int, input().split())
print(z, x, y) |
p03852 | s605593003 | Accepted | c = input()
if c in 'aiueo':
print('vowel')
else:
print('consonant') |
p02958 | s489310289 | Accepted | N = int(input())
ps = [int(i) for i in input().split()]
ans = 0
for a, b in zip(ps, sorted(ps)):
if a != b:
ans += 1
if ans > 2:
print('NO')
else:
print('YES')
|
p04044 | s576398456 | Wrong Answer | N, L =list(map(int, input().split()))
array = []
word = ""
for i in range(N):
s = input()
array.append(s)
print(array)
new_array = sorted(array)
print(new_array)
for j in range(N):
word += new_array[j]
print(word) |
p03796 | s602907488 | Wrong Answer | inN = int(input())
D=1000000000 + 7
p=0
for i in range(inN):
p*=i
if (D < p): p=p%D
print(str(p)) |
p03380 | s419011382 | Accepted | n = int(input())
a = list(map(int, input().split()))
a.sort()
import bisect
import numpy as np
amax = a[-1]
cent = amax // 2
idx = bisect.bisect_left(a, cent)
if idx == len(a)-1:
print(amax, a[-2])
else:
max_idx = np.argmin([abs(a[idx]-cent), abs(a[idx-1]-cent)])
if max_idx:
print(amax, a[idx-1])
... |
p03711 | s294873875 | Accepted | f_1 = {1,3,5,7,8,10,12}
f_2 = {4,6,9,11}
x, y = map(int, input().split())
if (x in f_1) and (y in f_1):
print("Yes")
elif (x in f_2) and (y in f_2):
print("Yes")
else:
print("No") |
p03962 | s073327186 | Accepted | print(len(set(input().split()))) |
p03838 | s444108043 | Accepted | # A - Simple Calculator
x,y = map(int,input().split())
# εγγ¨η΅γγγ« B γζΌγγ¨γ
ans1 = -y - (-x) + 2
# εγγ γ B γζΌγγ¨γ
ans2 = y - (-x) + 1
# η΅γγγ γ B γζΌγγ¨γ
ans3 = -y - x + 1
# B γζΌγγͺγγ¨γ
ans4 = y - x
ans = [ans1,ans2,ans3,ans4]
ans = [a for a in ans if a > 0]
ans = min(ans)
print(ans) |
p02711 | s104072865 | Accepted | S = input()
if '7' in S:
print('Yes')
else:
print('No') |
p02994 | s581044021 | Wrong Answer | n,l=map(int, input().split())
t=0
for i in range(n):
if i==0:
t=abs(l+(i+1)-1)
else:
t=min(t, abs(l+(i+1)-1))
print(t) |
p03339 | s987297644 | Wrong Answer | N=int(input())
S=list(str(input()))
wesr=S[1:].count('W')
east=S[1:].count('E')
ans_min = east
ans = east
for i in range(N-1):
if S[i]=='W':
ans+=1
else:
ans-=1
if ans < ans_min:
ans_min = ans
print(ans_min)
|
p02706 | s275607899 | Accepted | n, m = map(int, input().split())
a = sum(list(map(int, input().split())))
if n >= a:
print(n-a)
else:
print(-1)
|
p03076 | s117844698 | Wrong Answer | a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
ans = a//10*10 + b//10*10 + c//10*10 + d//10*10 + e//10*10 + 50
for i in range(1, 10):
for j in [a, b, c, d, e]:
if str(j)[-1] == str(i):
ans += i - 10
print(ans)
exit()
print(ans) |
p02963 | s531894101 | Accepted | import numpy as np
def solve(s):
h = int(np.sqrt(s))
if h**2 < s:
h += 1
d = h**2 - s
if d == 0:
x, y = 0, 0
else:
x, y = 1, d
return " ".join(map(str, [0,0,x,h,h,y]))
s = int(input())
print(solve(s)) |
p02603 | s281841477 | Accepted | import math
import collections
import bisect
from collections import deque
from copy import copy, deepcopy
def main():
N = int(input())
A = list(map(int, input().split()))
ans = 1000
for i in range(N - 1):
if A[i] < A[i + 1]:
ans += (A[i + 1] - A[i]) * (ans // A[i])
print(ans)... |
p02957 | s478733859 | Wrong Answer | a,b=map(int,input().split())
if a%2==b%2:
print((a+b)/2)
else:
print("IMPOSSIBLE") |
p03243 | s738401423 | Accepted | n = input()
while True:
if len(set(list(n))) == 1:
print(n)
break
n = str(int(n)+1) |
p03319 | s168131614 | Accepted | def main():
import sys
input = sys.stdin.buffer.readline
N, K = (int(i)-1 for i in input().split())
_ = [int(i) for i in input().split()]
print((N + K - 1)//K)
if __name__ == '__main__':
main()
|
p02972 | s208724359 | Wrong Answer | # coding: utf-8
N = int(input())
A = list(map(int, input().split()))
A.reverse()
B = [0 for i in range(N)]
for i in range(N):
tmp = 0
for j in range(0, i+1, i+1):
tmp += B[j]
if A[i] % 2 != tmp % 2:
B[i] = 1
B.reverse()
ans = []
M = sum(B)
for i in range(N):
if B[i] == 1:
ans.app... |
p03261 | s017609287 | Accepted | n = int(input())
w = [input() for i in range(n)]
lists = []
tmp = ''
for i in range(n):
if i != 0:
if tmp != w[i][0]:
print('No')
exit()
if w[i] in lists:
print('No')
exit()
lists.append(w[i])
tmp = w[i][-1]
print('Yes')
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.