problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02547 | s403275119 | Accepted | import sys
n = int(input())
n_concecutive = 0
for _ in range(n):
d1, d2 = map(lambda x: int(x), input().split())
if d1 == d2:
n_concecutive += 1
if n_concecutive >= 3:
print('Yes')
sys.exit()
else:
n_concecutive = 0
print('No') |
p02948 | s469308839 | Accepted | import sys
from heapq import heappop, heappush
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, M = lr()
works = [[] for _ in range(M+1)]
# M-1日後から選んでいく,
for _ in range(N):
a, b = lr()
if a <= M:
works[a].append(-b)
heap = []
answer = 0
fo... |
p03087 | s981264266 | Wrong Answer | N, Q = map(int, input().split())
S = input()
tmp = [0] * N
for i in range(1, N):
if S[i-1] + S[i] == 'AC':
tmp[i] += 1
for _ in range(Q):
l, r = map(int, input().split())
# print(tmp[l-1:r])
print(sum(tmp[l-1:r]))
|
p02861 | s678708963 | Accepted | import itertools
import math
def dis(X,Y):
return ((X[0]-Y[0])**2+(X[1]-Y[1])**2)**.5
def main():
n=int(input())
L=[list(map(int,input().split())) for _ in range(n)]
S=itertools.permutations([i for i in range(1,n+1)])
ans=0
for s in S:
for i in range(n-1):
a = s[i] - 1
... |
p03163 | s143532369 | Wrong Answer | import numpy as np
N,W = map(int,input().split())
"""
DP = np.zeros(W+1,dtype=int)
for _ in range(N):
w,v = map(int,input().split())
np.maximum(DP[:-w]+v,DP[w:],out=DP[w:])
print(DP.max())
"""
DP= np.full(N*10000+1,W+1)
DP[0] = 0
for _ in range(N):
w,v = map(int,input().split())
np.minimum(DP[:-v]+w,DP[v:],out... |
p02633 | s553315187 | Accepted | from math import gcd
X = int(input())
Y = (X*360)//gcd(X,360)
print(Y//X) |
p02820 | s879487765 | Wrong Answer | n,k=map(int,input().split())
s,p,r=map(int,input().split())
t=input()
a=0
for i in range(k):
d=1
for j in range(i,n-k,k):
#print(t[j])
if t[j]==t[j+k]:
d+=1
else:
a-=(-d//2)*eval(t[j])
#print(d,t[j],a)
d=1
a-=(-d//2)*eval(t[j+k])
#p... |
p03137 | s004209340 | Accepted | N,M = [int(x) for x in input().split()]
X = [int(x) for x in input().split()]
X.sort()
diff = []
for i in range(1,len(X)):
diff.append((X[i] - X[i-1]))
diff.sort()
diff = diff[:M-N]
if(N<M):
print(sum(diff))
else:
print("0")
|
p02730 | s683653284 | Accepted | s=input()
if len(s)%2==0:
if s[:len(s)//2]==s[len(s)//2:]:
print("Yes")
else:
print("No")
else:
if s[:len(s)//2]==s[len(s)//2+1:]:
print("Yes")
else:
print("No")
|
p03493 | s110828485 | Accepted | s=input()
print(s.count('1')) |
p02813 | s821430925 | Wrong Answer | import itertools
n=int(input())
p=tuple(map(int,input().split()))
q=tuple(map(int,input().split()))
l=[]
for i in range(1,n+1):
l.append(i)
l=list(itertools.permutations(l))
l=sorted(l)
k=1
for i in range(1,n+1):
k*=i
pp=0
qq=0
for j in range(k):
if l[j]==p:
pp=j+1
elif l[j]==q:
qq=j+1
p... |
p03035 | s721144469 | Accepted | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
A, B = map(int, input().split())
if A <= 5:
print(0)
elif A <= 12:
print(int(B/2))
else:
print(B)
|
p02553 | s865910622 | Accepted | a, b , c ,d = map(int, input().split())
print(max(a*c,b*d,a*d,b*c)) |
p02994 | s381164551 | Accepted | N, L = map(int, input().split())
ans = 0
tmp = 300
for i in range(N):
if abs(L + i) < tmp:
tmp = abs(L + i)
num = i
for i in range(N):
ans += (L + i)
ans -= (L + num)
print(ans) |
p02554 | s102937974 | Wrong Answer | n = int(input())
mod = 1000000007
print(pow(10, n, mod) - pow(9, n, mod) - pow(9, n, mod) + pow(8, n, mod)) |
p02970 | s700615265 | Accepted | N, D = map(int, input().split())
area = 2 * D + 1
if N % area != 0:
print(N // area + 1)
else:
print(N // area)
|
p02793 | s017465251 | Accepted | import sys
from functools import reduce
MOD = 10 ** 9 + 7
def gcd(a, b):
while b:
a, b = b, a % b
return abs(a)
def lcm(a, b):
return abs(a // gcd(a, b) * b)
n, *A = map(int, sys.stdin.read().split())
def main():
l = reduce(lcm, A, 1) % MOD
res = 0
for a in A:
res += l * po... |
p02792 | s280841003 | Accepted | N=int(input())
ab=[[0 for i in range(9)] for j in range(9)]
for i in range(1,N+1):
if(i%10!=0):
s=str(i)
ab[int(s[0])-1][int(s[-1])-1]+=1
ans=0
for i in range(9):
for j in range(9):
ans+=ab[i][j]*ab[j][i]
print(ans) |
p02862 | s984439462 | Wrong Answer | x,y=map(int,input().split())
mod=10**9+7
def modinv(a, mod=10**9+7):
return pow(a, mod-2, mod)
def mod_combinations_count(n, r, mod):
r = min(r, n-r)
res = 1
for i in range(r):
res = res * (n - i) * modinv(i+1, mod) % mod
return res
if (x+y)%3!=0:
print(0)
else:
n=(x+y)//3
m=(-... |
p02813 | s277739151 | Accepted | import itertools
n = int(input())
p = tuple(list(map(int, input().split())))
q = tuple(list(map(int, input().split())))
counter = 0
a = 0
b = 0
for i in itertools.permutations(range(1, n+1)):
counter += 1
if p == i:
a = counter
if q == i:
b = counter
print(abs(a - b)) |
p02628 | s088715112 | Accepted | fruits_sum, num = map(int, input().split())
value_list = list(map(int, input().split()))
value_list.sort()
sum = 0
for i in range(num):
sum += value_list[i]
print(sum)
|
p03419 | s404903774 | Accepted | N, M = map(int, input().split())
if N == 1:
if M == 1:
print(1)
else:
print(M - 2)
exit()
elif M == 1:
print(N - 2)
exit()
elif N == 2 or M == 2:
print(0)
exit()
else:
print((N - 2) * (M - 2)) |
p03699 | s623897369 | Wrong Answer | # Problem C - Bugged
# input
N = int(input())
# initialization
max_score = 0
score_list = []
for i in range(N):
tmp = int(input())
score_list.append(tmp)
score_list = sorted(score_list, reverse=True)
# score update
for score in score_list:
tmp = max_score + score
if tmp%10==0:
tmp = 0
max... |
p03730 | s117497842 | Accepted | def computeGCD(x, y):
if x > y:
small = y
else:
small = x
for i in range(1, small+1):
if((x % i == 0) and (y % i == 0)):
gcd = i
return gcd
a,b,c=map(int,input().split())
r=computeGCD(a,b)
if c%r==0:
print('YES')
else:
print('NO') |
p03475 | s694879476 | Wrong Answer | N = int(input())
li = [list(map(int, input().split())) for i in range(N - 1)]
for n in range(N):
if n == N - 1:
print(0)
break
ans = 0
for index, i in enumerate(li):
if index < n:
continue
if ans < i[1]:
ans += i[1] - ans
else:
if ans % i[1] != 0:
ans += i[2] - (... |
p02873 | s901675345 | Accepted | s = list(input())
n = len(s)
a = [0] * (n+1)
for i in range(n):
if s[i] == '<':
a[i+1] = a[i]+1
for i in reversed(range(n)):
if s[i] == '>':
a[i] = max(a[i+1]+1,a[i])
print(sum(a)) |
p02687 | s772460975 | Accepted |
s = input()
if s == 'ABC':
print('ARC')
else:
print('ABC')
|
p02848 | s581848309 | Wrong Answer | n=int(input())
s=input()
s_len=len(s)
ans=""
for i in range(s_len):
char=97+(ord(s[i])+n-97)%26
ans+=chr(char)
print(ans) |
p02971 | s436755998 | Accepted | N=int(input())
A=[int(input()) for i in range(N)]
temp=sorted(A,reverse=True)
maxi=temp[0]
secmaxi=temp[1]
for a in A:
if a!=maxi:
print(maxi)
else:
print(secmaxi) |
p02700 | s714812903 | Accepted | A, B, C, D = (int(x) for x in input().split())
while A > 0 and C > 0:
C = C - B
if C <= 0:
print ("Yes")
else:
A = A - D
if A <= 0:
print ("No")
else:
continue |
p03804 | s547175361 | Accepted | import numpy as np
N,M=map(int, input().split())
A=[]
for i in range(N):
a=list(input())
A.append(a)
B=[]
for i in range(M):
b=list(input())
B.append(b)
A=np.array(A)
B=np.array(B)
ans="No"
for i in range(N):
for j in range(N):
if i+M<=N and j+M<=N:
if (A[i:i+M, j:j+M]==B).all(... |
p03438 | s801094420 | Accepted | # https://atcoder.jp/contests/apc001/tasks/apc001_b
n = int(input())
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
t = sum(b) - sum(a)
pos = 0
neg = 0
for i in range(n):
d = a[i] - b[i]
if d > 0:
pos += d
elif d < 0:
neg += -1 * d // 2
if pos <= neg:
print(... |
p02859 | s634270777 | Accepted | r = int(input())
Sr = 3 * r ** 2
S1 = 3 * 1 ** 2
print(Sr // S1) |
p03611 | s675429659 | Wrong Answer | import collections
N=int(input())
a=list(map(int, input().split()))
a.sort(reverse=True)
piv=a[0]
#print(a)
max=0
c=collections.Counter(a)
value=list(c.values())
key=list(c.keys())
for i in range(1,piv-1):
#print(c[i],c[i+1],c[i+2])
if max<c[i]+c[i+1]+c[i+2]:
max=c[i]+c[i+1]+c[i+2]
print(max) |
p03371 | s669441308 | Accepted | a, b, c, x, y = map(int, input().split())
print(min(a*x+b*y, 2*c*x + b*max(0,y-x), 2*c*y + a*max(0, x-y))) |
p03131 | s942379389 | Accepted | k, a, b = map(int, input().split())
if 2 < (b-a):
if k-(a-1) >= 2:
q, r = divmod(k-(a-1), 2)
ans = (b-a)*q+r+a
else:
ans = k+1
else:
ans = k+1
print(ans)
|
p02675 | s985725531 | Accepted | N=int(input())
N=str(N)
N = int(N[-1])
if (N==2 or N==4 or N==5 or N==7 or N==9):
print("hon")
elif (N==0 or N==1 or N==6 or N==8):
print("pon")
else:
print("bon") |
p03317 | s541135875 | Wrong Answer | n,k = [int(x) for x in input().split()]
print(1 + (n-k)%(k-1)) |
p03208 | s474695232 | Wrong Answer | import numpy as np
N, K = map(int, input().split())
h = [int(input()) for _ in range(N)]
h = np.array(sorted(h))
diff_h = np.zeros(N, dtype=np.int16)
diff_h[1:] = np.diff(h)
print(h)
print(diff_h)
cum_diff_h = np.cumsum(diff_h)
print(cum_diff_h)
s = cum_diff_h[K - 1 :] - cum_diff_h[: -K + 1]
print(min(s)) |
p02727 | s528786132 | Accepted | X, Y, A, B, C = map(int, input().split())
pl = list(map(int, input().split()))
ql = list(map(int, input().split()))
rl = list(map(int, input().split()))
pl.sort(reverse=True)
ql.sort(reverse=True)
rl.sort(reverse=True)
total = pl[:X]+ql[:Y]+rl[:X+Y]
total.sort(reverse=True)
result = sum(total[:X+Y])
print(result) |
p03011 | s875193124 | Accepted | lis=list(map(int,input().split()))
print(sorted(lis)[0]+sorted(lis)[1]) |
p02888 | s619284946 | Wrong Answer | # coding: utf-8
n = int(input().rstrip())
bo = [j * -1 for j in sorted([int(i) * -1 for i in input().rstrip().split(" ")])]
ans = 0
for i in range(n-2):
for j in range(i+1,n-1):
canTriangle = True
for k in range(j+1,n):
if bo[j] + bo[k] < bo[i]:
canTriangle = False
... |
p03067 | s856084342 | Wrong Answer | A, B, C = map(int,input().split())
if (A - C) * (B - C) > 0:
print('Yes')
else:
print('No') |
p03206 | s876942099 | Accepted | d = int(input())
if d == 25:
print("Christmas")
elif d ==24:
print("Christmas Eve")
elif d ==23:
print("Christmas Eve Eve")
elif d == 22:
print("Christmas Eve Eve Eve")
|
p03705 | s368412125 | Accepted | N, A, B = map(int, input().split())
high = (N - 1) * B + A
low = (N - 1) * A + B
ans = high - low + 1
ans = max(0, ans)
print(ans)
|
p03767 | s905299258 | Accepted | N = int(input())
a = list(map(int, input().split()))
a.sort()
x = sum(a[N::2])
print(x)
|
p02900 | s126479132 | Wrong Answer | import math
A,B = map(int, input().split())
# 最大公約数の算出
y = max(A,B)
x = min(A,B)
while y%x != 0:
tmp = x
x = y%x
y = tmp
# 素数および割り切れる数の探索
p = [1]
if x % 2 == 0: p.append(2)
for val in range(3,int(x/2)+1):
flag = 1
if val % 2 != 0 and x % val == 0:
for i in range(2,int(math.sqrt(val))+1):
if val % ... |
p03162 | s465247441 | Accepted | N = int(input())
dp = [[0]*3 for _ in range(N+1)]
for i in range(N):
a, b, c = list(map(int, input().split()))
dp[i+1][0] = max(dp[i][1], dp[i][2]) + a
dp[i+1][1] = max(dp[i][2], dp[i][0]) + b
dp[i+1][2] = max(dp[i][0], dp[i][1]) + c
print(max(dp[N])) |
p04034 | s626429173 | Accepted | N,M = map(int,input().split())
A = [[0,1] for _ in range(N)]
A.insert(0,[0,0])
A[1][0] = 1
for _ in range(M):
x,y = map(int,input().split())
A[y][1] += 1
if A[x][0]==1:
A[y][0]=1
A[x][1] -= 1
if A[x][1]==0:
A[x][0]=0
cnt = 0
for i in range(1,N+1):
cnt += A[i][0]
print(cnt) |
p03030 | s802037937 | Accepted | from operator import itemgetter
N = int(input())
# table = [[i for i in input().split()] for j in range(N)]
table = []
for i in range(N):
value = list(input().split())
value[1] = int(value[1])
value.append(str(i + 1))
table.append(value)
point_sort = sorted(table, key=itemgetter(1), reverse=True)
alph... |
p03475 | s386287913 | Wrong Answer | n = int(input())
T = [0]*n
c,s,f = [0]*(n-1),[0]*(n-1),[0]*(n-1)
for i in range(n-1):
c[i],s[i],f[i] = map(int,input().split())
for i in range(n-1):
T[i] = s[i] + c[i]
for j in range(i+1,n-1):
if T[i] > s[j]:
T[i] += (s[j-1] + c[j-1])%(f[j]) + c[j]
else:
T[i] = s[j] + c[j]
print(T[i])
print(0) |
p04033 | s106877936 | Accepted | a,b= list(map(int,input().split()))
if a==0 or b==0:
print("Zero")
elif a>0 and b>0:
print("Positive")
elif a<0 and b>0:
print("Zero")
else:
c = abs(b-a)
if c%2 == 0:
print("Negative")
else:
print("Positive")
|
p03680 | s390930530 | Wrong Answer | N = int(input())
L = []
light = [0]*(N+1)
light[0] = 1
cnt = 0
for i in range(N):
L.append(int(input()) - 1)
for i in range(N+1):
if light[i] == 1 and light[L[i]] == 0:
light[i], light[L[i]] = 0, 1
cnt += 1
if light[1] == 1:
print(cnt)
exit()
print(-1)
|
p02785 | s080039508 | Wrong Answer | a,b=input().split()
a=int(a)
b=int(b)
c=list(map(int,input().split()))
c.sort()
d=sum(c)
e=0
if a<b:
print(0)
else:
for i in range(b):
e=e+c[-b]
print(d-e) |
p02918 | s478943784 | Accepted | n, k = map(int,input().split())
s = input()
press = []
temp = s[0]
cnt = 0
for string in s:
if temp == string:
cnt += 1
else:
press.append(cnt)
temp = string
cnt = 1
press.append(cnt)
if len(press) - 2 * k <= 0:
print(n-1)
exit()
ans = 2 * k
for i in press:
ans += ... |
p02570 | s213378371 | Wrong Answer | inputArr = input().split(" ")
print(inputArr)
if int(inputArr[0]) * int(inputArr[2]) <= int(inputArr[1]):
print('Yes')
else:
print('No')
|
p03433 | s889497280 | Accepted | n = int(input())
a = int(input())
d = n%500
if a >= d:
print("Yes")
else: print("No") |
p03659 | s422137387 | Wrong Answer | n=int(input())
dp=[0]*n
a=list(map(int,input().split()))
s=sum(a)
dp[0]=a[0]
ans=s
for i in range(1,n):
dp[i]=dp[i-1]+a[i]
for j in range(n):
ans=min(ans,abs(dp[j]*2-s))
print(ans) |
p02783 | s533109811 | Wrong Answer | import math
H, A = map(int, input().split())
print(math.ceil(10 / 4)) |
p03455 | s967424741 | Accepted | a,b = map(int,input().split())
if a*b%2==0: print('Even')
else: print('Odd') |
p03076 | s779009586 | Accepted | import math
List = [int(input()) for i in range(5)]
last = list(map(lambda x: x % 10, List))
lastnum = 0
last = sorted(last)
for i in range(5):
if last[i] == 0:
lastnum = 10
else :
lastnum = last[i]
break
tensum = list(map(lambda x: (math.ceil(x / 10))*10, List))
print(sum(tensum) - 10 + lastnum) |
p03799 | s398059206 | Accepted | S, C = [int(i) for i in input().split()]
if S*2 <= C:
setn = S
C -= S*2
setn += C//4
else:
setn = C//2
print(setn) |
p03408 | s155793370 | Wrong Answer | N=int(input())
s=[input() for _ in range(N)]
M=int(input())
t=[input() for _ in range(M)]
ans_1=0
ans=""
for S in s:
ans_1=s.count(S)
if s.count(S)>=ans_1:
ans_1=s.count(S)
ans=S
if ans_1>t.count(ans):
print(ans_1-t.count(ans))
else :
print("0") |
p03680 | s667667742 | Accepted | N = int(input())
array = [int(input()) for _ in range(N)]
next_i = 0
cnt = 0
ans = -1
for i in range(N):
if next_i == 1:
ans = cnt
break
next_i = array[next_i]-1
cnt += 1
print(ans) |
p02602 | s386830203 | Accepted | N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
for i in range(K,N):
if A[i-K] < A[i]:
print("Yes")
else:
print("No")
|
p03211 | s650454757 | Wrong Answer | S = list(input())
ans = 100000
for i in range(len(S)-2):
ans = min(ans,abs(753-int(''.join(S[i:i+3]))))
for i in range(len(S)-3):
ans = min(ans,abs(753-int(''.join(S[i:i+4]))))
print(ans) |
p03352 | s963911774 | Accepted | x=int(input())
ans=1
for i in range(1,1000+1):
for j in range(2,11):
if i**j<=x:
ans=max(ans,i**j)
print(ans) |
p03796 | s023600507 | Accepted | def training(N) :
power = 1
for i in range(1, N + 1) :
power = (power * i) % (10 ** 9 + 7)
return power
N = int(input())
print(training(N)) |
p02995 | s095538315 | Wrong Answer | a,b,c,d = map(int,input().split())
bc = b//c
bd = b//d
import math
bcd = c*d/math.gcd(c,d)
ac = (a-1)//c
ad = (a-1)//d
acd = c*d//math.gcd(c,d)
ans = (b-(bc+bd-bcd))-((a-1)-(ac+ad-acd))
print(int(ans))
|
p02608 | s536208959 | Accepted | n = int(input())
ans = [0 for _ in range(10050)]
for i in range(1, 101):
for j in range(1, 101):
for k in range(1, 101):
v = i*i+j*j+k*k+i*j+j*k+k*i;
if v < 10050:
ans[v] += 1
for i in range(n):
print(ans[i+1])
|
p02873 | s057956184 | Wrong Answer | s = str(input())
a = [0]
l = len(s)
k = 0
for i in range(l):
if(s[i]=="<"):
a.append(a[-1]+1)
else:
a.append(a[-1]-1)
k = min(a[-1],k)
ans = sum(a)
if(k<0):
ans += (l+1)*abs(k)
print(ans) |
p02911 | s205658402 | Accepted | n,k,q =map(int,input().split())
a_li = [int(input()) for _ in range(q)]
from collections import Counter
c = Counter(a_li)
for x in range(n):
if q-k<0:
print('Yes')
else:
if c[x+1]>q-k:
print('Yes')
else:
print('No') |
p02897 | s392329152 | Accepted | n = int(input())
print(1-(n//2)/n) |
p02838 | s086685736 | Accepted | import sys
import numpy as np
input = sys.stdin.readline
MOD = 10**9 + 7
N = int(input())
A = np.array(list(map(int, input().split())), np.int64)
ans = 0
for n in range(64):
Anb = (A >> n) & 1
cnt_one = np.count_nonzero(Anb)
cnt_zero = N - cnt_one
x = cnt_one * cnt_zero
for i in range(n):
x *= 2
x %= MOD
a... |
p03161 | s552894441 | Accepted | import numpy as np
def solve():
N, K = map(int, input().split())
h = np.array(list(map(int, input().split())))
dp = np.full(N, 10**9, dtype=np.int)
dp[0] = 0
for i in range(1, N):
dp[i:i + K] = np.fmin(
dp[i:i + K],
dp[i - 1] + np.abs(h[i:i + K] - h[i - 1])
... |
p02731 | s414982289 | Wrong Answer | ##C
L = int(input())
(L/3)**3 |
p03243 | s717032413 | Accepted | print(0--int(input())//111*111) |
p02747 | s141920579 | Accepted | S = input()
hitachi = 'hi'
i = 1
while True:
corect = hitachi * i
if S == corect:
print('Yes')
break
i += 1
if i == 20:
print('No')
break |
p03524 | s828384669 | Accepted | from collections import Counter
c = Counter(list(input()))
if len(c) == 1:
if list(c.values())[0] == 1:
print('YES')
else:
print('NO')
elif len(c) == 2:
if all(v == 1 for v in c.values()):
print('YES')
else:
print('NO')
else:
if max(c.values()) >= min(c.values()) + 2:
print('NO')
else:
... |
p03286 | s539548872 | Wrong Answer | n = int(input())
cnt, now = 1, 0
ans = ''
for i in range(100):
if n == now:
break
if (n - now) % (2**(i + 1)) != 0:
ans = ans + '1'
now += pow(-2, i)
else:
ans = ans + '0'
print(ans[::-1])
|
p03797 | s592477428 | Accepted | n,m = map(int,input().split())
if m >= 2*n:
m -= 2*n
print(n+int(m/4))
else:
print(int(m/2))
|
p02645 | s499590655 | Accepted | S=input()
print(S[0:3]) |
p03639 | s974476627 | Wrong Answer | N=int(input())
A=list(map(int,input().split()))
count_4=0
count_2=0
count_1=0
for i in A:
if i%4==0:
count_4+=1
elif i%2==0:
count_2+=1
else:
count_1+=1
if count_2<2:
if count_1+count_2<=count_4:
print("Yes")
else:
print("No")
else:
if count_1<=count_4:
... |
p03331 | s337288895 | Wrong Answer | N = int(input())
num = 0
for i in range(N+1):
g = N -i
a=sum(map(int,list(str(g))))
b=sum(map(int,list(str(i))))
ans = a + b
if ans == 0:
num += ans
elif num >= ans:
num += ans
else:
continue
print(num) |
p02924 | s828026312 | Accepted | n=int(input())
ans=(n*(n-1))//2
print(ans) |
p03624 | s107224523 | Accepted | s = set(list(input()))
strings = [chr(i) for i in range(97, 97+26)]
for i in strings:
if not i in s:
print(i)
exit()
print(None)
|
p02700 | s005832867 | Wrong Answer | a,b,c,d = map(int, input().split())
if a//d >= b//c:
print("Yes")
else:
print("No")
|
p03815 | s965239251 | Accepted | import sys
import math
N = int(input())
a = N//11*2
if N%11 == 0:
print(N//11*2)
else:
print(N//11*2+(1 if N%11<7 else 2)) |
p02631 | s301212711 | Accepted | N=int(input())
*A,=map(int,input().split())
total=0
for i in range(N):
total ^= A[i]
print(*[total^A[i] for i in range(N)]) |
p02767 | s453998785 | Accepted | N = int(input())
X = list(map(int, input().split()))
mm = 0
for x in X:
mm += x**2
for i in range(min(X), max(X) + 1):
s = 0
for x in X:
s += (x - i)**2
if s < mm:
mm = s
print(mm)
|
p03162 | s004587935 | Accepted | n = int(input())
init = int(pow(10, 9))
dp = [[init, init, init] for _ in range(n)]
dp[0] = list(map(int, input().split()))
for i in range(1, n):
line = list(map(int, input().split()))
dp[i][0] = line[0] + max(dp[i-1][1], dp[i-1][2])
dp[i][1] = line[1] + max(dp[i-1][0], dp[i-1][2])
dp[i][2] = line[2] + ... |
p03767 | s165508702 | Accepted | n=int(input())
a=list(map(int,input().split()))
a.sort()
print(sum(a[n::2])) |
p02789 | s047093040 | Wrong Answer | n, m = map(int, input().split())
if n == m:
print("AC")
else:
print("WA")
|
p02663 | s428087473 | Accepted | H1, M1, H2, M2, K = map(int, input().split())
diff = 60 * H2 + M2 - (60 * H1 + M1)
print(max(0, diff - K)) |
p03804 | s458088788 | Wrong Answer | N, M = map(int, input().split())
A = [list(input()) for _ in range(N)]
B = [list(input()) for _ in range(M)]
for i in range(N-M):
for j in range(N-M):
c = 1
for k in range(M):
if A[i+k][j:j+M] != B[k]:
c = 0
if c == 1:
print('Yes')
exit()
p... |
p02577 | s767284837 | Wrong Answer | import sys
N = str(input())
n = list(map(int, N))
if sum(n) == 0:
print('No')
elif sum(n) % 9 != 0:
print('No')
else:
print('Yes')
|
p03109 | s170674783 | Wrong Answer | S=input().split("/")
if int(S[0])>=2019 and int(S[1])>=5:
print("TBD")
else:
print("heisei") |
p02627 | s043937795 | Accepted | import re
a = input()
if re.match(r"[A-Z]", a):
print("A")
else:
print("a")
|
p03943 | s727574751 | Wrong Answer | a,b,c=map(int,input().split())
if a+b==c or b+c==a or a+c==b:
print('YES')
else:
print('NO')
|
p03284 | s128589862 | Accepted | n,k = map(int,input().split())
print(0 if n%k == 0 else 1) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.