problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02780 | s046480653 | Wrong Answer | def calc(n):
return (n+1)/2.0
N,K=map(int,input().split())
P=list(map(int,input().split()))
Q=list(map(calc,P))
print(Q)
cnt=0.0
for i in range(N-K+1):
S=sum(Q[i:i+K])
cnt=max(cnt,S)
print(cnt) |
p03286 | s895090827 | Wrong Answer | N = int(input())
s = ''
s2 = ''
while N != 0:
if N % 2 == 0:
s += '0'
N //= (-2)
if N % 2 == -1 or N % 2 == 1:
s += '1'
N //= (-2)
N += 1
s2 = s[::-1]
print(s2) |
p03605 | s074582222 | Accepted |
n=list(input())
print('Yes' if '9' in n else 'No')
|
p03380 | s182195860 | Accepted | import numpy as np
N = int(input())
A = np.array(tuple(map(int, input().split())))
if N == 2:
print(*A)
else:
max_A = A.max()
print(max_A, A[np.abs(A - max_A / 2).argmin()])
|
p02612 | s447270533 | Accepted | n = int(input())
count = (n // 1000)
money = count * 1000
if money < n:
print((count+1) * 1000 -n)
else:
print((count) * 1000 -n) |
p03282 | s157786043 | Accepted | s = str(input())
k = int(input())
for i in range(k):
if s[i] != "1":
print(s[i])
exit()
print("1") |
p03592 | s480905714 | Accepted | import sys
if __name__ == "__main__":
N, M, K = [int(x) for x in input().split(" ")]
if M < N:
N, M = M, N
for x in range(0, N + 1):
for y in range(0, M + 1):
if x * (M - y) + (y * (N - x)) == K:
print("Yes")
sys.exit(0)
print("No")
|
p02916 | s554297857 | Accepted | n = int(input())
a = list(map(lambda x: int(x)-1, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
res = b[a[0]]
for i in range(1, n):
res += b[a[i]]
if a[i-1]+1 == a[i]:
res += c[a[i-1]]
print(res)
|
p03262 | s782854461 | Accepted | def gcd(a, b):
while b:
a, b = b, a % b
return a
N,X = map(int,input().split())
A = list(map(int,input().split()))
B = [abs(X-i) for i in A]
ans = B[0]
for j in B:
ans = gcd(ans, j)
print(ans) |
p03329 | s151299400 | Wrong Answer | N = int(input())
tannis = [1]
i = 1
while 6**i < N:
tannis.append(6**i)
i += 1
i = 1
while 9**i < N:
tannis.append(9**i)
i += 1
dp = [float('inf') for _ in range(N+1)]
dp[0] = 0
for i in range(1, N+1):
for t in tannis:
if i-t >= 0:
dp[i] = min(dp[i], dp[i-t]+1)
#print(dp)
pr... |
p03062 | s636795992 | Wrong Answer | n = int(input())
a = [int(i) for i in input().split()]
m = len(list(filter(lambda x: x < 0, a)))
s = sum(map(abs, a))
if m % 2 == 0 or 0 in a:
print(s)
else:
print(s - 2 * min(a))
|
p03860 | s588498676 | Accepted | S=str(input())
print('A'+S[8]+'C')
|
p03699 | s508483515 | Accepted | #18:31
#Bugged
n=int(input())
s=[]
t=[0]*n
for i in range(n):
a=int(input())
s.append(a)
if a%10!=0:
t[i]=a
pt=sum(s)
s=sorted(s)
t=sorted(t)
for i in range(n):
if pt%10==0:
pt-=t[0]
t.pop(0)
if pt%10!=0:
print(pt)
else:
print(0) |
p03293 | s197393916 | Accepted | s = str(input())
t = str(input())
for i in range(len(s)):
if(t == s[i:]+s[:i]):
print('Yes')
exit()
print('No')
|
p02696 | s280602481 | Accepted | a, b, x = map(int, input().split())
if b > x:
print(a*x//b)
else:
print(a*(b-1)//b) |
p03407 | s957183577 | Accepted | a, b, c = map(int, input().split())
if a + b >= c:
print('Yes')
else:
print('No') |
p03544 | s018270949 | Wrong Answer | n=int(input())
l_b=2
l=1
if n=="1":
print("2")
elif n=="2":
print("1")
else:
for i in range(3,n+1):
l_bb=l_b
l_b=l
l=l_b+l_bb
print(l) |
p03469 | s947953333 | Accepted | s = input()
if s[3] == '7':
ans = s[:3] + '8' + s[4:]
else:
ans = s
print(ans) |
p02702 | s932724399 | Wrong Answer | S = input()
mods = []
for i in range(len(S)):
mod = int(S[i:]) % 2019
mods.append(mod)
cnt = len(mods) - len(set(mods))
print(cnt) |
p02832 | s821878626 | Wrong Answer | import numpy as np
n = int(input())
a = np.array(list(map(int, input().split())))
check = [i for i in range(1, n+1)]
ans = 1
for i in range(1, n+1):
if not i in a:
print(-1)
break
idx = np.where(a==i)[0][-1]
ans += len(a[:idx]) - 1
a = a[idx:]
if len(a) == 1:
print(ans)
break |
p03281 | s233341383 | Accepted | n = int(input())
def divisor(n: int) -> list:
list_of_divisor = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
list_of_divisor.append(i)
if i != n//i:
list_of_divisor.append(n//i)
# list_of_divisor.sort()
return list_of_divisor
ans = 0
for i in rang... |
p02996 | s585195859 | Accepted | from sys import stdin
def main():
#入力
readline=stdin.readline
N=int(readline())
li=[]
for i in range(N):
ab=list(map(int,readline().split()))
li.append(ab)
li.sort(key=lambda x:x[1])
t=0
for i in range(N):
task=li[i]
t+=task[0]
if t>task[1]:
... |
p03161 | s460623138 | Wrong Answer | def main():
N, K = list(map(int, input().split()))
field = list(map(int, input().split()))
dpList = [0] * N
dpList[1] = abs(field[0] - field[1])
for i in range(2, N):
minCost = 1000000
for j in range(1, min(K, i) + 1):
minCost = min([minCost, dpList[i - j] + abs(field[... |
p03011 | s353466872 | Accepted | import itertools
pqr = list(map(int, input().split()))
print(min([a+b for a, b in itertools.combinations(pqr, 2)])) |
p02993 | s362817777 | Accepted | S = input()
flg = 1
for i in range(len(S)-1):
if S[i] == S[i+1]:
print("Bad")
flg = 0
break
if flg:
print("Good") |
p03862 | s730716726 | Accepted | n,x=map(int,input().split())
a=list(map(int,input().split()))
dp=[0]*(n-1)
ans=0
for i in range(n-1):
dp[i]=a[i]+a[i+1]
for j in range(n-2):
if dp[j]>x:
ans+=min(dp[j]-x,a[j+1])
dp[j+1]-=min(dp[j]-x,a[j+1])
dp[j]-=min(dp[j]-x,a[j+1])
if dp[n-2]>x:
ans+=dp[n-2]-x
dp[n-2]-=dp[n-2]-x
if dp[0]>x:
ans+... |
p02995 | s310436853 | Accepted | import math
a,b,c,d=map(int,input().split())
def gcd(a,b):
if b>a:
b,a=a,b
if b==0:
return a
else:
return gcd(b,a%b)
def warikiri(n,c,d):
koubai=(c*d)//gcd(c,d)
return n-n//d-n//c+n//koubai
print(warikiri(b,c,d)-warikiri(a-1,c,d)) |
p02916 | s985522434 | Accepted | n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
s = 0
for i in range(n):
s += b[i]
for i in range(n - 1):
if a[i + 1] == a[i] + 1:
s += c[a[i] - 1]
print(s) |
p02970 | s053217852 | Accepted | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, D = map(int, readline().split())
F = 2 * D + 1
print((N + F - 1) // F)
return
if __name__ == '__main__':
main()
|
p03799 | s829821877 | Accepted | N, M=map(int, input().split())
if N>M//2:
print(M//2)
else:
ans=N
M-=N*2
ans+=M//4
print(ans) |
p03150 | s494336780 | Accepted | S = input();
str = 'keyence';
ans = 'NO'
if S[:7] == str :
ans = 'YES';
elif S[-7:] == str :
ans = 'YES';
else :
for i in range(1,8) :
if S[0:i] == str[0:i] and S[-7+i:] == str[-7+i:] :
ans = 'YES';
break;
print(ans);
|
p03136 | s324970629 | Accepted | n = int(input())
L = list(map(int,input().split()))
l = sorted(L)
c = sum(l)-l[len(L)-1]
if l[len(L)-1] < c:
print('Yes')
else:
print('No') |
p02707 | s499714647 | Accepted | n=int(input())
a=list(map(int,input().split()))
ans=[0]*(n+1)
for i in range(len(a)):
ans[a[i]]+=1
ans=ans[1:]
ansstr=''
for i in range(len(ans)):
print(ans[i])
|
p02717 | s310490145 | Wrong Answer | X,Y,Z=list(map(int, input().split()))
print(str(Z)+str(X)+str(Y)) |
p03681 | s896529165 | Accepted | n, m = map(int , input().split())
ans = 1
mod = 10**9+7
for i in range(1, n+1):
ans = (ans%mod)*(i%mod)
ans = ans%mod
for i in range(1, m+1):
ans = (ans%mod)*(i%mod)
ans = ans%mod
# if the difference between them is greater than 1 they can't be arranged
if abs(n-m)>1:
print(0)
# if they have same number they can ... |
p03803 | s342402488 | Wrong Answer | A, B = map(int, input().split())
if A == B:
print('Draw')
elif A == 1:
print('Alice')
elif A == 1:
print('Bob')
elif A < B:
print('Alice')
elif A > B:
print('Bob') |
p03804 | s418163204 | Accepted | n, m = map(int, input().split())
a = [input() for _ in range(n)]
b = [input() for _ in range(m)]
for i in a:
for j in b:
if j not in i:
print("No")
quit()
print("Yes") |
p02843 | s646056258 | Wrong Answer | X = int(input())
x = X//100
if X > x*105 :
print('1')
elif X <= x*105 :
print('0')
|
p02624 | s336418661 | Accepted | N = int(input())
ans = 0
for i in range(1,N+1):
val = N // i
ans += val*(val+1)*i//2
print(ans) |
p03127 | s016807087 | Accepted | import sys
def gcd(a, b):
a, b = max(a, b), min(a, b)
while a % b > 0:
a, b = b, a % b
return b
def solve():
input = sys.stdin.readline
N = int(input())
A = [int(i) for i in input().split()]
gcdA = A[0]
for a in A: gcdA = gcd(gcdA, a)
print(gcdA)
return 0
if __name__ ... |
p02693 | s104744751 | Accepted | # coding: utf-8
k = int(input())
a, b = map(int,input().split())
flg = False
for i in range(1001):
if a<=k*i<=b:
flg = True
if flg:
print('OK')
else:
print('NG') |
p03680 | s395041101 | Accepted | n = int(input())
a = [0]
for i in range(n):
a.append(int(input()))
cnt = 0
a_before = 1
while cnt <= n:
cnt += 1
if a[a_before] == 2:
print(cnt)
break
a_before = a[a_before]
else:
print(-1) |
p03146 | s048102863 | Accepted | s=int(input())
k=1
a=[]
while True:
if k==1:
a.append(s)
k+=1
elif a[-1]%2==0:
p=a[-1]/2
a.append(p)
k+=1
else:
p=3*a[-1]+1
a.append(p)
k+=1
if len(set(a))!=len(a):
print(k-1)
exit() |
p03011 | s128973886 | Accepted | ls = list( map(int,input().split()))
print(sum(ls) -max(ls))
|
p02702 | s136789216 | Wrong Answer | import numpy as np
# input the data
s = input()
m = len(s)
detecter = []
count = 0
for i in range(1, 100):
detecter.append(str(i * 2019))
for i in range(len(detecter)):
if (detecter[i] in s) == True:
detected = len(detecter[i])
tmp = s.count(detecter[i])
count += tmp
print(count)
|
p04005 | s695305797 | Wrong Answer | L=list(map(int,input().split()))
L=sorted(L)
print(L[0]*L[1]*(L[2]//2)) |
p02989 | s226653255 | 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()))
for k in range(1, max(D)):
left = 0
right = 0
for i in range... |
p02618 | s566933118 | Accepted | # coding: utf-8
import copy
D = int(input())
C = list(map(int,input().split()))
S = []
for i in range(D):
s = list(map(int,input().split()))
S.append(s)
day_of_problems = [0] * 27
tmp = 0
for i in range(D):#i+1日目
A = []
for t in range(26):
A.append(S[i][t] + day_of_problems[t])
tmp = ... |
p03281 | s392498854 | Wrong Answer | def gp():
yield 2
yield 3
n=6
while 1:
yield n-1
yield n+1
n+=6
def resolve():
nn=int(input())
l=[]
ans=0
for n in range(1,nn+1)[::2]:
s=1
pl=gp()
for i in pl:
k=0
while n%i==0:
k+=1
n//=i
s*=k+1
if n==1:
break
if s==8:
ans+=1
print(ans) |
p03042 | s595050833 | Wrong Answer | n=input()
n1,n2=int(n[:2]),int(n[2:])
if n1>12 and n2>12 or n1==0 or n2==0:
print("Na")
elif (n1!=0 and n1<=12) and (n2!=0 and n2<=12):
print("AMBIGUOUS")
elif n1!=0 or n1<=12:
print("MMYY")
elif n2!=0 or n2<=12:
print("YYMM")
else:
print("errer")
|
p02861 | s186126434 | Wrong Answer | N = int(input())
A = [tuple(map(int, input().split())) for _ in range(N)]
ans = []
for i in range(len(A)-1):
for k in range(i+1,len(A)):
print(i, k)
ans.append((((A[i][0]-A[k][0])**2)+(A[i][1]-A[k][1])**2)**0.5)
print(sum(ans)*2/N) |
p03038 | s461405026 | Accepted | n,m=map(int,input().split())
a=list(map(int,input().split()))
a.sort()
x=[]
for i in range(m):
b,c=map(int,input().split())
x.append([b,c])
y=sorted(x,key=lambda x:(x[1],x[0]),reverse=True)
p=0
q=0
for i in range(n):
if a[i]<y[p][1]:
a[i]=y[p][1]
q+=1
else:
break
if q==y[p][... |
p02659 | s573624614 | Accepted | a,b = input().split()
a = int(a)
b = int(b.replace('.',''))
print(int(a*b//100)) |
p02732 | s517954667 | Accepted | from collections import Counter
n = int(input())
a = list(map(int, input().split()))
c = Counter(a)
ans = 0
for i in range(1, n + 1):
ans += c[i] * (c[i] - 1) // 2
for i in range(n):
print(ans - c[a[i]] + 1) |
p03379 | s644918058 | Wrong Answer | n = int(input())
x = list(map(int, input().split()))
for i in range(n):
xsort = sorted(x)
if x[i] < xsort[n//2]:
print(xsort[2//n])
else:
print(xsort[n//2-1]) |
p03730 | s448941112 | Wrong Answer | a, b, c=map(int, input().split())
a%=2
b%=2
c%=2
if a==1:
print("YES")
else:
if a==b==c:
print("YES")
elif a==b==0 and c==1:
print("NO")
elif a==1 and b==c==0:
print("NO")
else:
print("YES") |
p03030 | s713410505 | Accepted | n = int(input())
lst = []
for i in range(n):
s, p = input().split()
lst.append([s, int(p), i+1])
beta = sorted(lst, key=lambda x: x[1], reverse=True)
alpha = sorted(beta, key=lambda x: x[0])
for i in range(n):
print(alpha[i][2]) |
p02627 | s396886528 | Accepted | A = input()
if A.islower():
print('a')
else:
print('A')
|
p02720 | s705385857 | Accepted | from collections import deque
k = int(input())
q = deque()
for i in range(1, 10):
q.append(i)
for _ in range(k):
p = q.popleft()
r = p % 10
if r != 0:
q.append(10 * p + r - 1)
q.append(10 * p + r)
if r != 9:
q.append(10 * p + r + 1)
print(p) |
p04034 | s897721716 | Accepted | n, m = map(int, input().split())
flag = [False] * n
quan = [1] * n
flag[0] = True
for i in range(m):
x, y = map(int, input().split())
x, y = x - 1, y - 1
if flag[x]:
flag[y] = True
quan[x] -= 1
quan[y] += 1
if quan[x] == 0:
flag[x] = False
print(len(list(filter(lambda x: x == Tr... |
p02790 | s343740821 | Accepted | a,b=map(int,input().split())
print(str(a)*b if a<=b else str(b)*a) |
p02755 | s116527597 | Accepted |
import collections
import math
class Solution:
def solve(self, A, B):
for i in range(10**4):
aTax, bTax = math.floor(i*0.08), math.floor(i * 0.1)
if aTax == A and bTax == B:
return i
return -1
sol = Solution()
[A, B] = list(map(int, input().strip().spl... |
p02953 | s434939270 | Accepted | n = int(input())
H = list(map(int,input().split()))
for i in range(n-1):
if H[i] == 1+ H[i+1]:
H[i+1] += 1
elif H[i] >1+ H[i+1]:
print('No')
break
else:
print('Yes')
|
p02789 | s548321535 | Accepted | N,M=list(map(int,input().split()))
print(["No","Yes"][N==M]) |
p03220 | s481206848 | Wrong Answer |
N = int(input()) # 地点の候補数
T, A = map(int, input().split()) # T:平均気温 A:温度
H = list(map(int, input().split())) #標高(x)
list = [A-(T - i * 0.006) for i in H]
print(list.index(min(list)))
|
p03745 | s665209620 | Wrong Answer | n = int(input()); a = list(map(int, input().split())); b = -1; x = 1
for i in range(n-1):
if b == 0:
if a[i] > a[i+1]: b = -1; x += 1
elif b == 1:
if a[i] < a[i+1]: b = -1; x += 1
else:
if a[i] < a[i+1]: b = 0
else: b = 1
print(x) |
p02642 | s692874674 | Accepted | n = int(input())
data = list(map(int, input().split()))
mx = max(data)
marked = [0]*(mx + 1)
for a in data:
for x in range(a, mx+1, a):
marked[x] += 1
ans = 0
for a in data:
if marked[a] == 1:
ans += 1
print(ans)
|
p02753 | s825089506 | Accepted | S = input()
if S == 'AAA' or S == 'BBB':
print('No')
else:
print('Yes')
|
p02682 | s914808228 | Accepted | a, b, c, k = map(int, input().strip().split())
d = 0
if a > k:
d += k
else:
d += a
k -= a
if b > k:
d += 0
else:
d += 0
k -= b
d -= k
print(d) |
p03607 | s681728968 | Wrong Answer | L = [int(input()) for _ in range(int(input()))]
r = 0
for s in set(L):
if L.count(s) % 2 == 0:
r+=1
print(r) |
p02900 | s956109643 | Accepted | a,b = map(int,input().split())
def prime_d(n):
i = 2
t = []
while i * i <= n:
while n % i == 0:
n /= i
t.append(i)
i += 1
if n > 1:
t.append(n)
return t
l = set(prime_d(a))
m = set(prime_d(b))
print(len(l&m)+1)
|
p03797 | s325530177 | Accepted | s, c = map(int, input().split())
if c/2 > s:
c -= s*2
scc = s + c//4
else:
scc = c//2
print(scc) |
p03427 | s191181716 | Wrong Answer | n = list(input())
l = len(n)
for i in range(l):
n[i] = int(n[i])
score = 0
if l == 1:
print(n[0])
else:
if n.count(9) == l-1:
score += 8 + 9*(l-1)
else:
score += n[0] - 1
score += 9*(l-1)
print(score) |
p03435 | s066795154 | Accepted | c=[list(map(int,input().split())) for j in range(3)]
if c[0][0]+c[1][1]+c[2][2]==c[0][1]+c[1][2]+c[2][0] and c[0][0]+c[1][1]+c[2][2]==c[0][2]+c[1][0]+c[2][1] and c[0][0]+c[1][1]+c[2][2]==c[0][2]+c[1][1]+c[2][0]:
print("Yes")
else:
print("No")
|
p02725 | s781417170 | Wrong Answer | k, n = map(int, input().split())
A = list(map(int, input().split()))
ans = 0
B = [0]*n
for i in range(n):
B[i] = A[i] - A[0]
if B[i] > k/2:
B[i] = B[i] - k
B.sort()
print(B[n-1] - B[0]) |
p03457 | s293592814 | Accepted | n = int(input())
def enable_move(old_pos, new_pos):
old_t, old_x, old_y = old_pos
new_t, new_x, new_y = new_pos
t = new_t - old_t
d = abs(new_x - old_x) + abs(new_y - old_y)
if t < d:
return False
return ((t - d) % 2 == 0)
ans = "Yes"
old_pos = [0, 0, 0]
for _ in range(n):
new_pos ... |
p03241 | s971271538 | Wrong Answer | N, M = map(int, input().split())
ans = 1
import math
for i in range(int(math.sqrt(M)), 0, -1):
if M % i == 0 and i * N <= M:
ans = i
break
print(ans)
|
p02640 | s829256148 | Accepted | X, Y = map(int, input().split())
# 全ての組を探索すればよい
ans = 'No'
for i in range(X+1):
if 2*i + 4*(X-i) == Y:
ans = 'Yes'
break
print(ans) |
p03612 | s704280616 | Accepted | N=int(input())
alist=[0]+list(map(int,input().split()))
answer=0
if alist[N]==N:
alist[N-1],alist[N]=alist[N],alist[N-1]
answer+=1
for i in range(1,N+1):
if alist[i]==i:
alist[i],alist[i+1]=alist[i+1],alist[i]
answer+=1
print(answer) |
p03565 | s831308290 | Wrong Answer | import re
s=str(input())
s = s.replace('?', '.')
t=str(input())
#if len(s)<len(t):
# print("UNRESTORABLE")
for i in range(0,len(s)-len(t)+1):
if re.match(s[i:i+len(t)],t):
s=s.replace(".","a")
print(s[:i]+t[0:len(t)]+s[i+len(t):])
exit()
else:
print("UNRESTORABLE") |
p04019 | s641026881 | Accepted | if __name__ == "__main__":
s = input()
p = set(s)
if len(p) % 2 == 1:
print('No')
exit()
if 'S' in p and 'N' in p:
print('Yes')
elif 'W' in p and 'E' in p:
print('Yes')
else:
print('No')
|
p04031 | s959839213 | Accepted | n=int(input())
a=list(map(int,input().split()))
ans=10**10
for i in range(-100,101):
tmp=0
for j in range(n):
tmp+=(a[j]-i)**2
ans=min(ans,tmp)
print(ans) |
p02724 | s066006232 | Wrong Answer | x = int(input())
if x%500 == 0:
print(x*2)
else:
ans = x//500 + (x//5)*5
print(ans) |
p02743 | s179666400 | Wrong Answer | import math
a,b,c = map(int, input().split())
sa = str(math.sqrt(a))
sb = str(math.sqrt(b))
sc = str(math.sqrt(c))
sa = int(sa.replace('.', ''))
sb = int(sb.replace('.', ''))
sc = int(sc.replace('.', ''))
if sa + sb < sc:
print('Yes')
else:
print('No') |
p03804 | s060271695 | Accepted | n,m=map(int,input().split())
a=[list(input()) for i in range(n)]
b=[list(input()) for i in range(m)]
exist=False
for i in range(n-m+1):
for j in range(n-m+1):
match=True
for k in range(m):
for l in range(m):
if a[i+k][j+l]!=b[k][l]:
match=False
if match:
exist=True
print("Yes... |
p02765 | s328732305 | Accepted | import bisect,collections,copy,heapq,itertools,math,numpy,string
import sys
sys.setrecursionlimit(10**7)
def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstr... |
p03693 | s730395465 | Accepted | r,g,b = map(int, input().split())
print('YES' if (r*100+g*10+b)%4==0 else 'NO') |
p02676 | s328339475 | Accepted | K=int(input())
S=input()
if len(S) <= K:
print(S)
else:
print(S[:K]+'...')
|
p03486 | s157167684 | Wrong Answer | s = list(input())
t = list(input())
s.sort()
s = "".join(s)
t.sort()
t = "".join(t)
print("Yes" if s<t else "No") |
p03767 | s129453920 | Accepted | n = int(input())
a = list(map(int,input().split()))
a.sort(reverse=True)
c = 0
t = 1
while t < 2*n:
c += a[t]
t += 2
print(c)
|
p02933 | s828472407 | Wrong Answer | a = int(input())
s = input()
if a >= 3200:
print("red")
else:
print(s) |
p02994 | s209693900 | Wrong Answer | #ABC131 B
N,L = map(int,input().split())
aji = []
delta = []
for i in range(N):
aji.append(L + i)
for j in range(N):
delta.append(abs(aji[i]))
print(min(delta)) |
p03672 | s381965541 | Accepted | S = input()
length = len(S)
for i in range(length):
if i > 0 and len(S) % 2 == 0:
if S[:len(S) // 2] == S[-len(S) // 2:]:
print(len(S))
break
S = S[:-1]
|
p02707 | s735278614 | Accepted | n=int(input())
l=list(map(int,input().split()))
ans=[0]*n
for i in l:
ans[i-1]+=1
for j in ans:
print(j) |
p02696 | s065088550 | Wrong Answer | a, b, n = map(int, input().split())
ans = 0
if b == 1:
ans = 0
else:
for x in range(0, a * n, b):
new = x // b - a * ((x / a) // b)
if new > ans:
ans = new
print(int(ans))
|
p02970 | s498847093 | Wrong Answer | n,d = list(map(int,input().split()))
ans = 0
cnt = 0
while ans <= n:
ans += d*2+1
cnt += 1
print(cnt) |
p03817 | s941003239 | Wrong Answer | x=int(input())
c=x//11
d=x%11
if c==0 and d<=5:
print(1)
elif c==0 and d<=10:
print(2)
elif d==0:
print(2*c)
elif d<=5:
print(2*c+1)
else:
print(2*c+2)
#c=0を書く |
p03427 | s983632967 | Accepted | dd = list(map(int, open(0).read().rstrip()))
n = len(dd)
ans = sum(dd)
tmp = 0
for i in range(n):
if dd[i] > 0:
tmp += dd[i]
ans = max(ans, tmp - 1 + (n-i-1)*9)
print(ans) |
p02554 | s347230525 | Accepted | mod = 10**9 + 7
N = int(input())
print((pow(10, N, mod) - 2 * pow(9, N, mod) + pow(8, N, mod)) % mod)
|
p02773 | s473813148 | Accepted | import collections
n = int(input())
s = [input() for _ in range(n)]
s = collections.Counter(s).most_common()
ans = []
for i in range(1, len(s) + 1):
ans.append(s[i - 1][0])
if i == len(s):
break
if s[i - 1][1] != s[i][1]:
break
ans.sort()
print(*ans, sep='\n') |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.