problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p03673 | s474964302 | Accepted | N = int(input())
A = list(map(int,input().split()))
# 0
# 1, 0
# 2, 0, 1
# 3, 1, 0, 2
# 4, 2 ,0, 1, 3
front = []
back = []
for i in range(N):
if i % 2 == 0:
back.append(A[i])
else:
front.append(A[i])
ans = None
if N % 2 == 0:
ans = front[::-1] + back
else:
ans = back[::-1] + front
print(*ans) |
p03719 | s613319496 | Accepted | a,b,c=map(int,input().split())
print('YNeos'[c<a or c>b::2])
|
p03627 | s762258527 | Accepted | # https://atcoder.jp/contests/arc081/tasks/arc081_a
from collections import Counter
n = int(input())
nums = [int(i) for i in input().split()]
c = Counter(nums)
ans = 0
rec = []
for k, v in c.items():
if v >= 2:
rec.append(k)
if v >= 4:
ans = max(ans, k ** 2)
if len(rec) >= 2:
rec.sort(reverse=True)
ans = max(ans, rec[0] * rec[1])
print(ans) |
p03419 | s135035231 | Accepted | import sys
input = sys.stdin.readline
N, M = map(int, input().split())
if N > M: N, M = M, N
if N == 1 and (M == 1): print(1)
elif N == 2: print(0)
elif N == 1 and (M == 2): print(0)
elif N == 1: print(max(0, M - 2))
else: print(max(0, (N - 2) * (M - 2))) |
p02753 | s831638966 | Wrong Answer | s = input()
a = s.count("A")
b = s.count("B")
if a or b ==3:
print("No")
else:
print("Yes") |
p03495 | s507360331 | Accepted | from collections import Counter
n,k=map(int,input().split())
a=list(map(int,input().split()))
t=list(set(a))
c=sorted(Counter(a).most_common(),key=lambda x:x[1])
num=len(t)-k
if num<0:
print(0)
exit()
else:
ans=0
for i in range(num):
ans+=c[i][1]
print(ans) |
p02727 | s415341503 | Accepted | X, Y, A, B, C = map(int, input().split())
P = sorted(list(map(int, input().split())), reverse = True)
Q = sorted(list(map(int, input().split())), reverse = True)
R = list(map(int, input().split()))
a = sorted(P[:X] + Q[:Y] + R, reverse = True)
print(sum(a[:(X+Y)]))
|
p02630 | s821721730 | Accepted | import sys
def input():
return sys.stdin.readline()
N=int(input())
A=list(map(int,input().split()))
B=[0]*(10**5)
for a in A:
B[a-1]+=1
s=sum(A)
Q=int(input())
for i in range(Q):
b,c=map(int,input().split())
bb,bc=B[b-1],B[c-1]
B[c-1]+=bb
B[b-1]=0
s+=bb*c-bb*b
print(s) |
p02989 | s005193812 | Wrong Answer | import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
n = int(input())
D = list(map(int, input().split()))
D.sort()
for k in range(min(D),max(D)):
arc = 0
abc = 0
for i in range(n):
if D[i] >= k:
arc += 1
else:
abc += 1
if arc == abc:
count += 1
print(count) |
p02859 | s124991121 | Accepted | n = int(input())
print(n*n) |
p02859 | s313349602 | Accepted | print(int(input())**2) |
p03994 | s033365469 | Accepted | makeA = lambda c: (ord('z')-ord(c)+1) % 26
s = list(map(makeA,list(input())))
#print(s)
K = int(input())
len_s = len(s)
#print(len_s)
for i in range(len_s-1):
if s[i] <= K:
K -= s[i]
s[i] = 0
#print(s)
if K > 0:
s[-1] = (s[-1] + 26 - (K % 26)) % 26
#print(s)
makeS = lambda n: chr((26-n)%26+ord('a'))
print(''.join(list(map(makeS,s))))
|
p02683 | s738396192 | Accepted | N, M, X = map(int, input().split())
C = [0] * N
A = [[0] * M for _ in range(N)]
for i in range(N):
C[i], *A[i] = map(int, input().split())
ans = float('inf')
for bit in range(1 << N):
score = [0] * M
price = 0
for i in range(N):
if bit >> i & 1:
price += C[i]
for j in range(M):
score[j] += A[i][j]
if all(s >= X for s in score):
ans = min(ans, price)
print(ans if ans < float('inf') else -1) |
p03555 | s687605692 | Accepted | a = input()
b = input()
# 最初の文字と最後の文字を入れ替えても同じになればYES
if a[0] == b[2] and a[1] == b[1] and a[2] == b[0]:
print("YES")
else:
print("NO") |
p03797 | s060741758 | Wrong Answer | n, m = map(int, input().split())
print((n * 2 + m) // 4) |
p02546 | s053207142 | Accepted | s = input()
if s[-1] == "s":
print(s+"es")
else:
print(s+"s") |
p02660 | s619735451 | Accepted | n = int(input())
prime = list()
i = 2
while i * i <= n:
if n % i == 0:
cnt = 0
while n % i == 0:
cnt += 1
n //= i
prime.append(cnt)
i += 1
if n != 1:
prime.append(1)
ans = 0
for x in prime:
a = 1
while a * (a+1) // 2 <= x:
a += 1
ans += a-1
print(ans) |
p02783 | s341288911 | Wrong Answer | H, A = map(int, input().split(" "))
print(H//A+1) |
p02957 | s523863436 | Accepted | a,b=map(int, input().split())
delta=abs(a-b)
if delta%2==1:
print('IMPOSSIBLE')
else:
print(min(a,b)+ delta//2) |
p02596 | s019217346 | Accepted | K = int(input())
num = 7%K
ans = -1
for i in range(K):
if num%K == 0:
ans = i+1
break
num = (num*10 +7)%K
print(ans)
|
p02973 | s461830061 | Wrong Answer | N = int(input())
ans = 0
now = - float('inf')
for _ in range(N):
a = int(input())
if a < now:
ans += 1
now = a
print(ans) |
p02657 | s443766657 | Wrong Answer | # S = list(input().split())
# a = int(S[0])
# b = S[1].replace('.', '')
# B = int(b)
#
# ans = (a * B) // 100
# print(ans)
a, b = input().split()
A = int(a)
b = b.replace('.', '')
B = int(b)
ans = (A * B) // 100
print(ans) |
p03474 | s584060366 | Accepted | a, b = map(int, input().split())
s = input()
flag = True
if (s[a] != '-'): flag = False
for i in range(a + b - 1):
if (i == a): pass
elif s[i] == '-': flag = False
print('Yes') if flag else print('No')
|
p04034 | s466402631 | Wrong Answer | N,M = map(int,input().rstrip().split(" "))
ans = [False for _ in range(N + 1)]
balls = [1 for _ in range(N + 1)]
ans[1] = True
for i in range(M):
q = list(map(int,input().rstrip().split(" ")))
if ans[q[0]] == True:
ans[q[1]] = True
balls[q[0]] -= 1
balls[q[1]] += 1
ansi = 0
for i in range(N):
if ans[i] and balls[i] >= 0: ansi += 1
print(ansi) |
p02677 | s102226263 | Accepted | import math
a, b, h, m = map(int, input().split())
ang_a = (h+m/60)/12
ang_b = m/60
ang = ang_a - ang_b if ang_a - ang_b <= 0.5 else ang_b - ang_a
theta = ang * 2 * math.pi
print(math.sqrt(a**2 + b**2 - 2*a*b*math.cos(theta))) |
p03281 | s596885375 | Accepted | def main():
N = int(input())
ans = 0
for num in range(1, N + 1, 2):
cnt = 0
for i in range(1, num + 1, 2):
if num % i == 0:
cnt += 1
if cnt == 8:
ans += 1
print(ans)
if __name__ == "__main__":
main()
|
p02630 | s638523408 | Accepted | N = int(input())
A = list(map(int, input().split()))
Q = int(input())
B = [0]*Q
C = [0]*Q
num = [0]*100000
for i in range(N):
num[A[i]-1] += 1
sum = sum(A)
for i in range(Q):
B[i], C[i] = map(int, input().split())
sum += (C[i]-B[i])*num[B[i]-1]
num[C[i]-1] += num[B[i]-1]
num[B[i]-1] = 0
print(sum) |
p03220 | s702727585 | Accepted | N = int(input())
T, A = map(int, input().split())
lis = list(map(int, input().split()))
def calc_tem(H):
return abs(A - ((T*1000) - (H*6)) / 1000)
new_lis = list(map(calc_tem, lis))
ans = new_lis.index(min(new_lis)) + 1
print(ans) |
p02681 | s302730541 | Accepted | S=input()
T=input()
if S==T[:-1]:
print('Yes')
else:
print('No') |
p03345 | s503852676 | Wrong Answer | A,B,C,K = map(int,input().split())
a = A ** 2*(K + 1)
b = B ** 2*(K + 1)
c = C ** 2*(K + 1)
if (abs(a - b) > 10**18):
print("Unfair")
else:
print(str(a - b))
|
p03474 | s154457966 | Accepted | a,b=map(int,input().split())
s=input()
print("Yes" if s[a]=="-" and s.count("-")==1 else "No") |
p02554 | s288422254 | Wrong Answer | N=int(input())
M=10**9+7
ans=1
m=1
for i in range(N):ans=(ans*10)%M
for i in range(N):m=(m*9)%M
ans-=(m*2)%M
m=1
for i in range(N):m=(m*8)%M
print(ans+m) |
p02694 | s849719835 | Accepted | x=int(input())
m=100
cnt=0
while m<x:
cnt+=1
m=m+int(m*0.01)
print(cnt) |
p03625 | s053546462 | Accepted | from collections import Counter
n = int(input())
a = list(map(int, input().split()))
d = Counter(a)
ans = -1
for k in sorted(d.keys())[::-1]:
if ans == -1 and d[k] >= 4:
print(k*k)
exit()
elif ans == -1 and d[k] >= 2:
ans = k
elif ans != -1 and d[k] >= 2:
print(ans*k)
exit()
print(0) |
p03284 | s745183940 | Wrong Answer | a,b = map(int,input().split())
print(a%b) |
p02995 | s860910318 | Wrong Answer | from fractions import gcd
A, B, C, D = map(int, input().split())
sc = B//C - (A-1)//C
sd = B//D - (A-1)//D
scd = B//gcd(C, D) - (A-1)//gcd(C, D)
print(sc, sd, scd, B-A+1)
print(B-A+1 - sc - sd + scd)
|
p03146 | s358091677 | Accepted | import sys
def f(n):
if n & 1:
return n * 3 + 1
else:
return n // 2
s = int(sys.stdin.readline().rstrip())
def main():
a = s
res = set([a])
for i in range(2, 10**6+1):
a = f(a)
if a in res:
return i
res.add(a)
if __name__ == '__main__':
ans = main()
print(ans) |
p02947 | s419569314 | Accepted | N = int(input())
s = []
for _ in range(N):
s.append(''.join(sorted(input().lower())))
l = {}
for n in range(N):
if s[n] in l:
l[s[n]] += 1
else :
l[s[n]] = 1
print(sum(l[k] * (l[k]-1) // 2 for k in l)) |
p02598 | s647572467 | Wrong Answer | import math
N,K = map(int,input().split())
A = list(map(int,input().split()))
m = 0
M = max(A)
while(M-m>0.0001):
mm = 0
mid = (M+m)/2
for i in range(N):
mm += math.ceil(A[i]/mid)-1
if mm>K:
m = mid+1
else:
M = mid
print(math.ceil(mid))
|
p02554 | s064591024 | Wrong Answer | N=int(input())
if N<2:
print(0)
elif N==2:
print(2)
else:
without=10**(N-2)
each=N*(N-1)
final=without*each
considered=final%(1000000007)
print(int(considered)) |
p03037 | s770539167 | Accepted | n, m = map(int, input().split())
LR = [list(map(int, input().split())) for _ in range(m)]
L = []
R = []
L_append = L.append
R_append = R.append
for l, r in LR:
L.append(l)
R.append(r)
min_R = min(R)
max_L = max(L)
if min_R >= max_L:
ans = min_R +1 - max_L
else:
ans = 0
print(ans) |
p03434 | s817306819 | Accepted | def main():
from builtins import int, map, list, print
import sys
sys.setrecursionlimit(10 ** 6)
input = (lambda: (sys.stdin.readline()).rstrip())
input_list = (lambda: input().split())
input_number = (lambda: int(input()))
input_number_list = (lambda: list(map(int, input_list())))
N = input_number()
a = input_number_list()
a.sort(reverse=True)
alice = sum(a[::2])
bob = sum(a[1::2])
print(alice - bob)
if __name__ == '__main__':
main()
|
p02796 | s629826905 | Accepted | n = int(input())
ps = []
for _ in range(0, n):
x, l = [int(y) for y in input().split()]
ps.append((x + l, x - l))
ps.sort()
x = ps[0][0]
d = 0
for i in range(1, n):
p = ps[i]
if p[1] < x:
d += 1
else:
x = p[0]
print(n - d)
|
p03455 | s243566845 | Accepted | input_val1, input_val2 = map(int, input().split())
prod = input_val1 * input_val2
if (prod % 2) == 0:
print ('Even')
else:
print('Odd') |
p03162 | s037423753 | Wrong Answer | N = int(input())
T = [list(map(int,input().split())) for _ in range(N)]
dp = [[0]*3 for _ in range(N)]
for i in range(N):
if i == 0:
dp[i] = T[i]
for j in [0,1,2]:
dp[i][j] = max([dp[i-1][j1]+T[i][j] for j1 in [0,1,2] if j1 != j])
print(max(dp[-1])) |
p03625 | s787105482 | Accepted | from collections import Counter
n=int(input())
a=list(map(int,input().split()))
c=Counter(a)
can_make=[i[0] for i in c.items() if i[1]>=2]
can_make_square=[i[0] for i in c.items() if i[1]>=4]
can_make+=can_make_square
can_make.sort()
if len(can_make)<2:
print(0)
else:
print(can_make[-1]*can_make[-2]) |
p03645 | s800193777 | Accepted | n,m=map(int,input().split())
edg=[[] for i in range(n+1)]
for i in range(m):
a,b=map(int,input().split())
edg[a].append(b)
edg[b].append(a)
f=1
for i in range(2,n+1):
if 1 in edg[i] and n in edg[i]:
f=0
print("POSSIBLE" if f==0 else "IMPOSSIBLE")
|
p02646 | s622725103 | Accepted | A,V=map(int,input().split())
B,W=map(int,input().split())
T=int(input())
if abs(A-B)>(V-W)*T:
print("NO")
else:
print("YES") |
p02713 | s149932116 | Accepted | def gcd(a, b):
while b:
a, b = b, a % b
return a
K = int(input())
ans = 0
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
x = gcd(i,j)
ans += gcd(x,k)
print(ans) |
p02606 | s878339342 | Wrong Answer | l, r, d = map(int, input().split())
if d != 1:
print(int(r//d -l //d))
else:
print(r-l+1) |
p02693 | s573772003 | Accepted | k=int(input())
a,b=list(map(int,input().split()))
s=[]
for i in range(a,b+1):
s.append(i%k)
if 0 in s:
print("OK")
else:
print("NG")
|
p03284 | s830058588 | Accepted | a, b = list(map(int, input().split()))
if a%b == 0:
print("0")
else:
print("1") |
p02747 | s192440871 | Accepted | from sys import stdin
import math
import re
import queue
input = stdin.readline
MOD = 1000000007
INF = 122337203685477580
def solve():
str = (input().rstrip())
str = str.replace("hi","")
if(len(str) == 0):
print("Yes")
else:
print("No")
if __name__ == '__main__':
solve()
|
p03774 | s649659620 | Accepted | n,m = list(map(int,input().strip().split()))
# 2次元配列
student = []
for i in range(n):
array = list(map(int, input().strip().split()))
student.append(array)
cp = []
for i in range(m):
array = list(map(int, input().strip().split()))
cp.append(array)
result = [0] * n
for i in range(n):
dis_min = 10**9
for j in range(m):
dis = abs(student[i][0]-cp[j][0]) + abs(student[i][1] - cp[j][1])
if dis < dis_min:
dis_min = dis
result[i] = j+1
for i in result:
print(i) |
p02958 | s259097127 | Accepted | N=int(input())
p=list(map(int,input().split()))
K=0
for i in range(0,N):
if p[i]==i+1:
K=K
else:
K=K+1
if K==0 or K==2:
print("YES")
else:
print("NO") |
p03803 | s968050137 | Accepted | a, b = map(int, input().split())
if a == 1: a += 13
if b == 1: b += 13
if a > b: print('Alice')
elif a < b: print('Bob')
else: print('Draw') |
p03127 | s585248107 | Accepted | N = int(input())
A_list = list(map(int, input().split()))
def gcd(v1, v2):
if v2 == 0:
return v1
return gcd(v2, v1%v2)
tmp = A_list[0]
for a in A_list:
tmp = gcd(tmp, a)
print(tmp) |
p03281 | s040454324 | Accepted | def divi(x):
d = []
for i in range(1, int(x**0.5)+1):
if x%i == 0:
d.append(i)
if i!=(x//i):
d.append(x//i)
return d
n = int(input())
ans = 0
for j in range(1, n+1, 2):
if len(divi(j)) == 8:
ans += 1
print(ans) |
p03681 | s764667383 | Wrong Answer | # C - Reconciled?
N, M = map(int,input().split())
S = 1
for i in range(1,min(N,M)):
S *= i
ans = 0
if abs(N-M) > 1:
ans = 0
elif abs(N-M) == 1:
ans = S*S*max(N,M)
else:
ans = S*S*2
ans = ans % 1000000007
print(ans)
|
p03309 | s696384058 | Accepted | n = int(input())
a = list(map(int,input().split()))
l = [a[i]-i-1 for i in range(n)]
b = sorted(l)[n//2]
ans = 0
for i in range(n):
ans += abs(l[i]-b)
print(ans) |
p03061 | s499405148 | Accepted | import fractions
n = int(input())
a = list(map(int,input().split()))
ans = 0
l = [0]*(n+1)
r = [0]*(n+1)
for i in range(n):
l[i+1] = fractions.gcd(l[i],a[i])
for i in range(n-1,0,-1):
r[i] = fractions.gcd(r[i+1],a[i])
for i in range(n):
L = l[i]
R = r[i+1]
ans = max(ans,fractions.gcd(L,R))
print(ans) |
p02759 | s204377828 | Accepted | N = int(input())
print(N//2 + N%2) |
p02860 | s945242936 | Wrong Answer | n=int(input())
s=str(input())
if n%2==1:
print("No")
else:
a=int(n/2-1)
b=int(n/2)
c=n-1
d=s[0:a]
e=s[b:c]
if d==e:
print("Yes")
else:
print("No")
|
p03838 | s103768145 | Accepted | x,y = map(int,input().split())
if abs(y) > abs(x):
if x >= 0 and y >= 0:
print(y-x)
elif x < 0 and y <0:
print(abs(y)-abs(x)+2)
else:
print(abs(y)-abs(x)+1)
elif abs(y) < abs(x):
if x > 0 and y > 0:
print(x - y + 2)
elif x <= 0 and y <=0:
print(abs(abs(y)-abs(x)))
else:
print(abs(abs(y)-abs(x))+1)
else:
if x == y:
print("0")
else:
print("1") |
p02706 | s360397389 | Accepted | def q2():
days, _ = [int(i) for i in input().split(" ")]
hw = [int(i) for i in input().split(" ")]
play = days - sum(hw)
if play < 0:
play = -1
print(play)
q2() |
p02582 | s793381367 | Accepted | import sys
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
def main():
S = input().strip()
if S.count("RRR"):
print(3)
elif S.count("RR"):
print(2)
elif S.count("R"):
print(1)
else:
print(0)
if __name__ == '__main__':
main()
|
p02622 | s382265823 | Accepted | str1 = input()
str2 = input()
idx = 0
cnt = 0
for _ in range(len(str1)):
if str1[idx] != str2[idx]:
cnt += 1
idx += 1
print(cnt) |
p02842 | s730535272 | Wrong Answer | n = int(input())
for i in range(1, n):
if round(i * 1.08) == n:
print(i)
exit()
print(':(')
|
p02779 | s761680900 | Accepted | n=int(input())
a=[i for i in map(int, input().split())]
a.sort()
for i in range(n-1):
if a[i]==a[i+1]:
print('NO')
exit(0)
print('YES') |
p02725 | s618182797 | Accepted | K, N = map(int, input().split())
A = list(map(int, input().split()))
B = [abs(x - y) for x, y in zip(A[1:], A)]
B += [K - A[-1] + A[0]]
print(sum(B) - max(B))
|
p02699 | s254476577 | Wrong Answer | s, w = map(int, input().split())
if s < w:
print("unsafe")
else:
print("safe") |
p02923 | s266487380 | Wrong Answer | n = int(input())
H = list(map(int, input().split()))
ans = 0
c = 0
for i in range(n-1):
if H[i] >= H[i+1]:
c += 1
else:
ans = min(ans, c)
c = 0
print(ans) |
p02664 | s683737484 | Accepted | s = input().split()
s_replace = [x.replace('?', 'D') for x in s]
print(s_replace[0]) |
p04045 | s695925969 | Accepted | N,K,*dd = map(int, open(0).read().split())
valid = [1] * 10
for d in dd:
valid[d] = 0
digits = [i for i,v in enumerate(valid) if v]
num_digit = len(str(N))
from itertools import product
from sys import exit
for ans_digit in [num_digit, num_digit+1]:
for x in product(digits, repeat=ans_digit):
x = int(''.join(map(str, x)))
if x >= N:
print(x)
exit() |
p02701 | s567629220 | Accepted | import collections
N = int(input())
S = [input() for i in range(N)]
C = collections.Counter(S)
print(len(C))
|
p03659 | s648402132 | Accepted | n = int(input())
a = [int(x) for x in input().split()]
x = 0
ans = []
suma = sum(a)
for i in range(n - 1):
x += a[i]
ans.append(abs(suma - x * 2))
else:
print(min(ans)) |
p03774 | s521546928 | Accepted | n, m = map(int, input().split())
student = [tuple(map(int, input().split())) for _ in range(n)]
check_points = [tuple(map(int, input().split())) for _ in range(m)]
for a, b in student:
dst_min = float('inf')
ans = float('inf')
for i, (c, d) in enumerate(check_points):
now = abs(a - c) + abs(b - d)
if now < dst_min:
dst_min = now
ans = i + 1
print(ans)
|
p02917 | s429636470 | Accepted | n=int(input())
b=[int(i) for i in input().split()]
c=b[0]+b[-1]
for i in range(1,n-1):
c+=min(b[i],b[i-1])
print(c) |
p03760 | s036582813 | Accepted | o = list(input())
e = list(input()) + [""]
for x, y in zip(o, e):
print(x + y, end="")
|
p02621 | s145987037 | Accepted | a = int(input())
print (a+a*a+a*a*a) |
p03699 | s153544657 | Accepted | Row = int(input())
List = []
for i in range (Row):
List.append(int(input()))
List.sort(reverse = True)
mid = 0
for i in range(Row):
mid += List[i]
sumList = [mid]* (Row+1)
for i in range(Row):
sumList[i] = sumList[i]-List[i]
if sumList[i] % 10 == 0:
sumList[i]=0
if sumList[Row] % 10 == 0:
sumList[Row] = 0
res = max(sumList)
print(res) |
p03455 | s174991129 | Accepted | a,b = [int(x) for x in input().split()]
if a*b % 2 == 0:
print("Even")
else:
print("Odd") |
p03282 | s745978720 | Wrong Answer | S = input()
K = int(input())
L = 0
for s in range(len(S)):
if S[s]=="1":
L+=1
else:
L+=int(S[s])*5000000000000000
if L>K:
print(S[s])
exit()
|
p03545 | s399196858 | Accepted | def dfs(pos, Str, res):
#print(pos, Str, res)
if pos == 4:
if res == 7:
print(Str + "=7")
exit()
return
dfs(pos+1, Str + "+" + s[pos], res + int(s[pos]))
dfs(pos+1, Str + "-" + s[pos], res - int(s[pos]))
s = input()
dfs(1, s[0], int(s[0])) |
p02629 | s016187708 | Accepted | n = int(input())
s = ""
al = "abcdefghijklmnopqrstuvwxyz"
while n > 0:
o = (n-1) % 26
n = (n-1) // 26
s += al[int(o)]
print(s[::-1]) |
p03317 | s271425089 | Accepted | def resolve():
n, k = map(int, input().split())
a = list(map(int, input().split()))
print(-(-(n-1)//(k-1)))
resolve() |
p02971 | s935656606 | Accepted | n=int(input())
a=[int(input()) for i in range(n)]
sa=sorted(a)
for i in a:
if sa[-1]==i:
print(sa[-2])
else:
print(sa[-1]) |
p02697 | s707334275 | Accepted | n, m = map(int, input().split())
if n % 2 != 0:
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 + 1, n - i - 1)
|
p03219 | s595687825 | Accepted | x,y=map(int,input().split())
print(int(x+y/2)) |
p02700 | s204481756 | Wrong Answer | class monster:
stamina = 0
attack= 0
def __init__(self,stamina,attack):
self.stamina = stamina
self.attack = attack
abcd = input().split()
abcd=[int(x) for x in abcd]
a = abcd[0]
b = abcd[1]
c = abcd[2]
d = abcd[3]
taka = monster(a,b)
aoki = monster(c,d)
while(1):
aoki.stamina = aoki.stamina-taka.attack
if aoki.stamina<=0:
print('No')
break
taka.stamina = taka.stamina-aoki.attack
if taka.stamina<=0 :
print('Yes')
break |
p03160 | s868130477 | Accepted | n = int(input())
h = list(map(int,input().split()))
dp = [0] * n
dp[0] = 0
dp[1] = abs(h[1] - h[0])
for i in range(2,n):
dp[i] = min(abs(h[i]-h[i-1])+dp[i-1],abs(h[i]-h[i-2])+dp[i-2])
print(dp[n-1]) |
p03633 | s965613941 | Accepted | from functools import reduce
from fractions import gcd
def find_lcm(a, b):
return a * b // gcd(a, b)
def main():
n = int(input())
t = [int(input()) for _ in range(n)]
print(reduce(find_lcm, t))
if __name__ == '__main__':
main()
|
p02811 | s926812859 | Accepted | K,X=map(int, input().split())
if K*500>=X:
print('Yes')
else:
print('No') |
p03162 | s308676122 | Accepted |
N = int(input())
activity = [list(map(int, input().split())) for _ in range(N)]
dp = [[0] * 3 for _ in range(N)]
dp[0][0] = activity[0][0]
dp[0][1] = activity[0][1]
dp[0][2] = activity[0][2]
for i in range(1, N):
dp[i][0] = max(dp[i-1][1], dp[i-1][2]) + activity[i][0]
dp[i][1] = max(dp[i-1][2], dp[i-1][0]) + activity[i][1]
dp[i][2] = max(dp[i-1][0], dp[i-1][1]) + activity[i][2]
print(max(dp[N-1]))
|
p02606 | s273881897 | Accepted | l,r,d=map(int,input().split())
cnt=0
for i in range(l,r+1):
if(i%d==0):
cnt+= 1
print(cnt) |
p02909 | s856172294 | Wrong Answer | print('CRSlauoinunndyyy'[id(id)%3::3]) |
p03944 | s414641554 | Accepted | w, h, n = map(int, input().split())
xya = [list(map(int, input().split())) for _ in range(n)]
width = [0, w]
height = [0, h]
for x, y, a in xya:
if a == 1:
width = [max(width[0], x), width[1]]
elif a == 2:
width = [width[0], min(width[1], x)]
elif a == 3:
height = [max(height[0], y), height[1]]
elif a == 4:
height = [height[0], min(height[1], y)]
ans = max(0, width[1] - width[0]) * max(0, height[1] - height[0])
print(ans)
|
p02995 | s983100176 | Wrong Answer | def resolve():
from fractions import gcd
a, b, c, d = map(int, input().split())
e = c*d/gcd(c,d)
db = b - b//c - b//d + b//e
da = a-1 - (a-1)//c - (a-1)//d + (a-1)//e
print(int(db-da))
resolve() |
p03797 | s092805211 | Accepted | S, C = [int(n) for n in input().split(" ")]
if 2 * S >= C:
print(min([S, int(C/2)]))
else:
print(S + int((C - 2 * S) / 4)) |
p02833 | s861483646 | Wrong Answer | N = int(input())
i = 5
ans = 0
for j in range(10**8):
num = N//(i*2)
if num == 0:
break
else:
ans += num
i = i*5
print(ans)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.