problem_id
stringclasses 428
values | submission_id
stringlengths 10
10
| status
stringclasses 2
values | code
stringlengths 5
816
|
|---|---|---|---|
p03037
|
s120994164
|
Accepted
|
N, M = map(int, input().split())
left = 1
right = N
for _ in range(M):
l, r = map(int, input().split())
if left < l:
left = l
if right > r:
right = r
ans = right - left
print(ans + 1 if ans >= 0 else 0)
|
p02897
|
s145491246
|
Accepted
|
# 142 A
n = int(input())
odd = 0
for i in range(1, n+1):
if i % 2 != 0:
odd += 1
x = odd/n
print('%.10f' % x)
|
p02744
|
s346278211
|
Accepted
|
n = int(input())
al = [chr(i) for i in range(97,97+26)]
dpn = ['a']
dpp = []
if n == 1:
print('a')
exit()
for i in range(1,n):
for j in dpn:
for k in al[:max(list(map(ord,list(j))))-97+2]:
if i != n-1:
dpp.append(j + k)
else:
print(j+k)
if i != n-1:
dpn = dpp
dpp = []
|
p02790
|
s058853330
|
Wrong Answer
|
x,y = map(int,input().split())
if int(str(x)*y) >= int(str(y)*x):
print(int(str(y)*x))
else:
print(int(str(y)*x))
|
p02690
|
s069444652
|
Accepted
|
X=int(input())
sig=[[1,1],[1,-1],[-1,1],[-1,-1]]
f=False
for i in range(200):
for j in range(200):
for s in sig:
A=s[0]*i
B=s[1]*j
if A**5-B**5==X:
f=True
break
if f:
break
if f:
break
print(A,B)
|
p02795
|
s731060109
|
Wrong Answer
|
a = int(input())
b = int(input())
c = int(input())
d = max(a,b)
e = c // d
f = c % d
if d == 0:
print(e)
elif d != 0:
print(int(e) + int(1))
|
p03001
|
s321420267
|
Accepted
|
W, H, x, y = map(int, input().split())
if x == W / 2 and y == H / 2:
print((W * H) / 2, 1)
else:
print((W * H) / 2, 0)
'''
長方形を分割するためには長方形の中心を通る必要がある
ただし、指定された座標が中心の場合は無限に直線が弾ける
'''
|
p02608
|
s265429745
|
Accepted
|
N = int(input())
res = {i+1: 0 for i in range(N)}
for i in range(1, int(N**0.5)):
for j in range(1, int(N**0.5)):
for k in range(1, int(N**0.5)):
n = i**2 + j**2 + k**2 + i*j + j*k + k*i
if n in res:
res[n] += 1
for r in res.values():
print(r)
|
p03012
|
s453617806
|
Wrong Answer
|
url = "https://atcoder.jp//contests/abc129/tasks/abc129_b"
def main():
n = int(input())
t = list(map(int, input().split()))
ans = 1000000000
sums = sum(t)
for v in t:
sums -= v
ans = min(sums, ans)
print(ans)
if __name__ == '__main__':
main()
|
p02882
|
s985568776
|
Accepted
|
import math
def v(a, b, t):
if (b * math.tan(math.pi / 2 - t * math.pi / 180) <= a):
return a * b * b * math.tan(math.pi / 2 - t * math.pi / 180) / 2
else:
return a * a * (b - a * math.tan(t * math.pi / 180) / 2)
a, b, x = map(int, input().split())
left = 0
right = 90
eps = 1e-7
for _ in range(1000):
mid = (left + right) / 2
if (v(a, b, mid) > x):
left = mid
else:
right = mid
print(mid)
|
p04030
|
s415976456
|
Wrong Answer
|
s=input()
ans = []
for i in range(len(s)):
ans.append(s[i])
j=1
while True:
if ans[0]=="B":
ans.pop(0)
elif j>=len(ans):
break
elif ans[j]=="B":
ans.pop(j-1)
ans.pop(j-1)
else:
j+=1
print(*ans,sep="")
|
p03250
|
s657508572
|
Accepted
|
a, b, c = reversed(sorted(input().split()))
print(int(a + b) + int(c))
|
p02730
|
s829110605
|
Accepted
|
s = input()
n = len(s)
s1 = s[:int((n-1)/2)]
s2 = s[int((n+1)/2):]
s1_rev = s1[::-1]
s2_rev = s2[::-1]
if s == s[::-1]:
if s1 == s1_rev and s2 == s2_rev:
print('Yes')
else:
print('No')
else:
print('No')
|
p02779
|
s471521493
|
Accepted
|
n = int(input())
an = list(map(int, input().split()))
def distinct_or_not(an):
an_dict = {}
for a in an:
if a in an_dict:
return False
else:
an_dict[a] = 1
return True
if distinct_or_not(an):
print('YES')
else:
print('NO')
|
p03673
|
s260472538
|
Accepted
|
from collections import deque
n = int(input())
a = list(map(int, input().split()))
stack = deque()
for i in range(n):
if i % 2 == 0: stack.append(a[i])
else: stack.appendleft(a[i])
ans = list(stack)
if n % 2 != 0: ans = ans[::-1]
print(" ".join(map(str, ans)))
|
p03041
|
s216566047
|
Accepted
|
number = input().split(" ")
N = int(number[0])
K = int(number[1])
word = input()
words = []
for i in word:
words.append(i)
if words[K-1] == "A":
words[K-1] = "a"
elif words[K-1] == "B":
words[K-1] = "b"
else:
words[K-1] = "c"
for i in words:
print(i,end="")
|
p03126
|
s174667651
|
Accepted
|
import sys
input = sys.stdin.readline
def main():
N, M = map(int, input().split())
like_food = [0] * M
for _ in range(N):
_, *A = map(int, input().split())
for a in A:
like_food[a - 1] += 1
ans = like_food.count(N)
print(ans)
if __name__ == "__main__":
main()
|
p02731
|
s181515056
|
Wrong Answer
|
import sys
def resolve(in_):
L = int(in_.read())
return L ** -3
def main():
answer = resolve(sys.stdin)
print(answer)
if __name__ == '__main__':
main()
|
p03013
|
s145227829
|
Accepted
|
Num = 10 ** 9 + 7
N, M = map(int, input().split())
danger = -1
if M != 0:
danger = int(input())
count = 1
l = [1, 1]
for i in range(1, N):
if i == danger:
l[1] = 0
if count < M:
danger = int(input())
count += 1
l = [l[1] % Num, l[0] + l[1]]
if l == [0, 0]:
break
if N == danger:
l[1] = 0
print(l[1] % Num)
|
p03711
|
s139530306
|
Wrong Answer
|
a,b = map(int, input().split())
listb = [4,6,9,11]
tmp = a in listb
print(tmp)
if (a == 2 and b ==2):
print("YES")
elif (a in listb and b in listb):
print("YES")
else:
print("NO")
|
p02789
|
s237585781
|
Wrong Answer
|
input_nm = input().split(' ')
n = input_nm[0]
m = input_nm[1]
if n == m :
print('yes')
else:
print('no')
|
p03486
|
s579022404
|
Wrong Answer
|
s = input()
t = input()
def sort(S):
l = []
for i in range(len(S)):
l.append(S[i])
l.sort(reverse=True)
result = ''
for i in range(len(l)):
result += l[i]
return result
if sort(s) < sort(t):
print('Yes')
else:
print('No')
|
p03994
|
s251890353
|
Accepted
|
s=input()
k=int(input())
l=list(s)
for i in range(len(s)):
f=(-ord(s[i])+ord("z")+1)%26
if f<=k:
l[i]="a"
k-=f
k=k%26
a=ord(l[-1])+k
if a> ord("z"):a-=26
l[-1]=chr(a)
print("".join(l))
|
p03815
|
s135634592
|
Accepted
|
n=int(input())
ans=(n//11)*2
if n%11==0:
print(ans)
elif n%11<=6:
print(ans+1)
else:
print(ans+2)
|
p02664
|
s023974467
|
Accepted
|
t = input().strip()
ans = t.replace('?', 'D')
print(ans)
|
p02624
|
s876537146
|
Accepted
|
N = int(input())
RL = [0] * (10 ** 7 + 10)
for i in range(1, 10 ** 7 + 10):
RL[i] = RL[i-1] + i
#print("step")
ans = 0
for i in range(1, N+1):
a = N // i
#print(i, a)
ans += RL[a] * i
print(ans)
|
p03327
|
s585568328
|
Wrong Answer
|
import sys
import heapq
# \n
def input():
return sys.stdin.readline().rstrip()
def main():
N =int(input())
if N>999:
print(f"ABD{N-1000:03}")
else:
print(f"ABC{N:03}")
if __name__ == "__main__":
main()
|
p03695
|
s783891670
|
Wrong Answer
|
n = int(input())
a = list(map(int, input().split()))
l = [False]*9
ov = 0
for i in range(n):
if a[i] < 3200:
l[a[i]//400] = True
else:
ov += 1
ans = l.count(True)
print(ans, min(ans + ov, 8))
|
p03817
|
s593361236
|
Accepted
|
x = int(input())
ans = x//11 * 2
mod = x%11
if 0 < mod < 7:
ans += 1
elif mod >= 7:
ans += 2
print(ans)
|
p02899
|
s105016943
|
Wrong Answer
|
n = int(input())
A = list(map(int, input().split()))
dic = {}
for i in range(n):
dic[i+1] = A[i]
ans = [dic[i+1] for i in range(n)]
print(*ans)
|
p02897
|
s984738936
|
Accepted
|
n = int(input())
if n == 1:
print(1)
elif n == 2:
print(0.5)
elif n%2 == 0:
print(0.5)
else:
print((n+1)/2/n)
|
p02705
|
s979171688
|
Wrong Answer
|
LI = lambda: list(map(int,input().split()))
MI = lambda: map(int,input().split())
yes = lambda: print("YES")
no = lambda: print("NO")
I = lambda: list(input())
J = lambda x: "".join(x)
II = lambda: int(input())
SI = lambda: input()
#---khan17---template
t = int(input())
print(3.14*t**2)
|
p02847
|
s309914757
|
Wrong Answer
|
S = input()
def judge(S):
dow = 'SUN,MON,TUE,WED,THU,FRI,SAT'.split(',')
if (S == dow[0]):
return 7
for i in range(1, len(dow)):
if (S == dow[i]):
return i
print(judge(S))
|
p02743
|
s915957133
|
Accepted
|
a, b, c = map(int, input().split())
i = (max(0, c - (a + b)))**2
j = 4 * a * b
if i > j:
print('Yes')
else:
print('No')
|
p02959
|
s374411971
|
Accepted
|
n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
ans=0
for i in range(n):
ans+=min(a[i],b[i])
if b[i]-a[i]>0:
ans+=min(b[i]-a[i],a[i+1])
a[i+1]-=min(b[i]-a[i],a[i+1])
print(ans)
|
p02676
|
s507785658
|
Accepted
|
K = int(input())
S = input()
if K >= len(S):
print(S)
else:
Sk = S[:K]
print(Sk+'...')
|
p02880
|
s543577082
|
Accepted
|
N = int(input())
for i in range(1,10):
if 1 <= (N // i) <= 9 and i * (N // i) == N:
print('Yes')
exit()
print('No')
|
p02694
|
s845955817
|
Accepted
|
X=int(input())
ans=0
Y=100
while Y<X:
Y+=Y//100
ans+=1
print(ans)
|
p03071
|
s300747349
|
Accepted
|
A,B = list(map(int,input().split()))
ans = 0
for i in range(2):
if A == max(A,B):
ans += A
A -= 1
else:
ans += B
B -= 1
print(ans)
|
p03013
|
s886042289
|
Accepted
|
M=10**9+7
import sys
f=sys.stdin.readline
n,m=map(int,f().split())
s,t=0,1
u=0 if m<1 else int(f())
for i in range(n):
if i==u-1:
s,t=t,0
try: u=int(f())
except: pass
else: s,t=t,(s+t)%M
print(t)
|
p02911
|
s149972383
|
Accepted
|
N, K, Q = map(int, input().split())
A = [int(input()) for i in range(Q)]
correct = [0 for i in range(N)]
for i in range(Q):
correct[A[i]-1] += 1
for i in range(N):
if Q - correct[i] < K:
print("Yes")
else:
print("No")
|
p03073
|
s651256692
|
Accepted
|
# -*- coding: utf-8 -*-
s = input().strip()
flag=0
ans=[]
for flag in [0,1]:
calc=0
for i in range(len(s)):
if s[i] != str( (i%2 == flag)*1 ):
calc += 1
ans += [calc]
print(min(ans))
|
p02862
|
s107725156
|
Accepted
|
X, Y = map(int, input().split())
a, b = divmod(2*X-Y, 3)
c, d = divmod(2*Y-X, 3)
if (not b == d == 0) or (2*X < Y) or (2*Y < X):
print(0)
else:
m, n = 1, 1
mod = 10**9+7
for i in range(1, min(a, c)+1):
m = (m * (a+c-i+1)) % mod
n = (n * i) % mod
ans = (m * pow(n, mod-2, mod)) % mod
print(ans)
|
p02552
|
s341866685
|
Accepted
|
print(int(not(int(input()))))
|
p03679
|
s599804669
|
Accepted
|
#!/usr/bin/env python3
X, A, B = map(int, input().split())
if B <= A:
print('delicious')
elif B - A <= X:
print('safe')
else:
print('dangerous')
|
p02576
|
s279958149
|
Accepted
|
N, X, T = map(int, input().split())
ans = (N // X) * T
if N % X == 0:
print(ans)
exit()
else:
ans += T
print(ans)
|
p02743
|
s535681494
|
Wrong Answer
|
import math
a, b, c = list(map(int, input().split(' ')))
if math.sqrt(a) + math.sqrt(b) < math.sqrt(c):
print('Yes')
else:
print('No')
# left = 4 * a * b
# right = (c - (a + b))**2
# if left < right:
# print('Yes')
# else:
# print('No')
|
p02953
|
s243032249
|
Wrong Answer
|
n=int(input())
h=list(map(int,input().split()))
mx=max(h)
for i in range(n):
if mx-h[i]>=2:
print('No')
exit()
print('Yes')
|
p02983
|
s057907491
|
Accepted
|
l,r = map(int,input().split())
mod = 2019
ans = 2018
if r-l>=2018:
print(0)
else:
for i in range(l,r+1):
for j in range(i+1,r+1):
ans = min(ans,(i*j)%mod)
print(ans)
|
p03127
|
s654780199
|
Accepted
|
import math
N = int(input())
A_list = list(map(int, input().split()))
ans = A_list[0]
for i in range(N-1):
ans = math.gcd(A_list[i+1], ans)
print(ans)
|
p02818
|
s047440832
|
Accepted
|
A, B, T = map(int,input().split())
t = A - T
if t >= 0:
print(t, B)
elif B+t >= 0:
print(0, B+t)
else:
print(0, 0)
|
p02783
|
s794725953
|
Accepted
|
h,a = map(int,input().split())
print(-(-h // a))
|
p02861
|
s637470998
|
Accepted
|
from math import sqrt, pow
def get_distance(xi, yi, xj, yj):
return sqrt(pow(xi - xj, 2) + pow(yi - yj, 2))
def solve():
n = int(input())
locations = [list(map(int, input().split())) for _ in range(n)]
distance = 0
for xi, yi in locations:
for xj, yj in locations:
distance += get_distance(xi, yi, xj, yj)
return distance / n
print(solve())
|
p03659
|
s830212958
|
Accepted
|
def main():
input()
t = list(map(int, input().split()))
# if len(t) == 2:
# print(abs(t[0] - t[1]))
# exit()
all = sum(t)
left = t[0]
right = all - t[0]
ans = abs(left-right)
for i in range(1, len(t)-1):
left += t[i]
if ans > abs(left-(all-left)):
ans = abs(left-(all-left))
print(ans)
if __name__ == '__main__':
main()
|
p02689
|
s287032070
|
Accepted
|
n,m = map(int,input().split())
h = list(map(int,input().split()))
ans = [1]*n
for i in range(m):
a,b = map(int,input().split())
if h[a-1] > h[b-1]:
ans[b-1] = 0
elif h[a-1] == h[b-1]:
ans[a-1] = ans[b-1] = 0
else:
ans[a-1] = 0
print(ans.count(1))
|
p02719
|
s162127721
|
Accepted
|
def listint():
a = input().split()
for i in range(len(a)):
a[i] = int(a[i])
return a
def main(n,k):
z = n % k
if z > k-z:
return k-z
else:
return z
n,k = listint()
print(main(n,k))
|
p03427
|
s820075136
|
Wrong Answer
|
N = [int(i) for i in list(input())]
# コーナーケース
if len(N) == 1:
print(N[0])
exit()
elif set(N) == set([9]):
print(len(N) * 9)
exit()
ans = 0
s = 0
for i in range(len(N)):
if N[i] == 0:
continue
ans = max(ans, s + (N[i] - 1) + 9 * (len(N) - 1 - i))
s += N[i]
print(ans)
|
p03548
|
s251813420
|
Wrong Answer
|
x,y,z = map(int,input().split())
width = y + z
print((x-x) // width)
|
p03252
|
s639091308
|
Accepted
|
s = input()
t = input()
x = []
y = []
for i in range(len(s)):
if s[i] not in x:
x.append(s[i])
if t[i] not in y:
y.append(t[i])
for i in range(len(x)):
s = s.replace(x[i], str(i))
for i in range(len(y)):
t = t.replace(y[i], str(i))
if s == t:
print("Yes")
else:
print("No")
|
p04033
|
s547030335
|
Accepted
|
a,b = map(int,input().split())
if a <= 0 and b >= 0:
print('Zero')
exit()
if a > 0 and b > 0:
print('Positive')
exit()
d = b - a
if d % 2 == 0:
print('Negative')
else:
print('Positive')
|
p02623
|
s670298124
|
Accepted
|
n, m, k = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
a_, b_ = [0], [0]
for i in range(n):
a_.append(a_[i] + a[i])
for i in range(m):
b_.append(b_[i] + b[i])
ans, j = 0, m
for i in range(n + 1):
if a_[i] > k:
break
while b_[j] > k - a_[i]:
j -= 1
ans = max(ans, i + j)
print(ans)
|
p03239
|
s420496378
|
Wrong Answer
|
N, T = map(int, input().split())
ct = []
for i in range(N):
ct.append(list(map(int, input().split())))
ct = sorted(ct, key=lambda h: (h[1], h[0]))
if ct[0][1]<=T:
print(ct[0][0])
else:
print('TLE')
|
p03625
|
s196141276
|
Accepted
|
from collections import Counter
n = int(input())
a = map(int, input().split())
c = Counter(a)
s = [(k, v) for k, v in c.items() if v >= 2]
s1 = s2 = 0 # s1 >= s2
for k, v in s:
if k > s1:
if v >= 4:
s1 = s2 = k
else:
s1, s2 = k, s1
elif k > s2:
s2 = k
print(s1 * s2)
|
p02881
|
s506204287
|
Wrong Answer
|
N = int(input())
def divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
tmp = []
tmp.append(i)
if i != n // i:
tmp.append(n//i)
if len(tmp)>1:
divisors.append(tmp)
return divisors
L = divisors(N)
ans = float('inf')
for l in L:
tmp = sum(l) - 2
ans = min(ans,tmp)
print(ans)
|
p02899
|
s340919123
|
Accepted
|
n = int(input())
a = [int(i) for i in input().split()]
arr = list(zip(range(1,n+1), a))
arr.sort(key=lambda x: x[1])
print(' '.join([str(i[0]) for i in arr]))
|
p02911
|
s773215267
|
Accepted
|
n ,k,q = map(int,input().split())
a = [int(input()) for i in range(q)]
point = [k-q]*n
for i in range(q):
point[a[i]-1] += 1
for j in range(n):
if point[j] > 0:
print('Yes')
else:
print('No')
|
p02684
|
s618626688
|
Wrong Answer
|
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
route = [1]
next = A[0]
while(True):
if next not in route:
route.append(next)
next = A[next-1]
elif A[0] == next:
break
else:
route = route[route.index(next):]
break
print( A[K % len(route)])
|
p02860
|
s939912186
|
Accepted
|
N = int(input())
S = input()
tmp1 = S[:int(N / 2)]
tmp2 = S[int(N / 2):]
if tmp1 == tmp2:
print("Yes")
else:
print("No")
|
p03637
|
s176008585
|
Accepted
|
import collections
n,ais = int(raw_input()), map(int, raw_input().split())
cc = collections.Counter()
for ai in ais:
if ai % 4 == 0: cc[0] += 1
elif ai % 2 == 0: cc[1] += 1
else: cc[2] += 1
q,h = collections.deque([0]), [[2,1,0],[1],[0]]
while(n):
b = False
for u in h[q[-1]] + [-1]:
if u == -1: b = True
if cc[u] > 0:
q.append(u)
q.popleft()
cc[u] -=1
n -=1
break
if b: break
print 'Yes' if n == 0 else 'No'
|
p03481
|
s150142968
|
Accepted
|
import sys
from collections import deque, Counter, defaultdict
from fractions import gcd
input = sys.stdin.readline
def eprint(s):
sys.stderr.write('DEBUG: {}\n'.format(s))
return
def main():
x, y = map(int, input().split())
cnt = 1
a = x
while True:
eprint(a)
if a*2 > y:
print(cnt)
return
else:
a *= 2
cnt += 1
return
if __name__ == '__main__':
main()
|
p02784
|
s245039341
|
Accepted
|
H,N = map(int, input().split())
A = list(map(int, input().split()))
print('No' if sum(A) < H else 'Yes')
|
p02618
|
s833665207
|
Accepted
|
d=int(input())
c=list(map(int,input().split()))
s=[]
for i in range(d):
t=list(map(int,input().split()))
s.append(t)
import random
for i in range(d):
print(random.randrange(1,27))
|
p02554
|
s531692130
|
Accepted
|
from sys import stdin
N = int(stdin.readline())
print(((10**N)-2*(9**N)+(8**N))%(10**9 + 7))
|
p03681
|
s493408259
|
Accepted
|
n, m = map(int, input().split())
mod = 1000000007
fact = [1]
for i in range(max(n, m)):
fact.append(fact[-1] * (i + 1) % mod)
if n == m:
print(2 * fact[n] * fact[m] % mod)
elif abs(n - m) == 1:
print(fact[n] * fact[m] % mod)
else:
print(0)
|
p02957
|
s667986530
|
Accepted
|
A, B = map(int, input().split())
ans = abs(A+B)
if ans % 2 == 0:
print(ans // 2)
else:
print('IMPOSSIBLE')
|
p02664
|
s602137466
|
Wrong Answer
|
t=list(input())
if t[-1]=='?':
t[-1]='D'
for i in range(len(t)-1,0,-1):
if t[i]=='?':
if t[i-1]=='D':
t[i]='P'
else:
t[i]='D'
print(''.join(t))
|
p02790
|
s198724827
|
Accepted
|
a, b = input().split()
a_b = a * int(b)
b_a = b * int(a)
print(b_a) if (a_b > b_a) else print(a_b)
|
p03815
|
s020453289
|
Wrong Answer
|
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
MOD = 10**9 + 7
x = int(input())
cnt = 0
if x<=6:
print(1)
elif x<=11:
print(2)
else:
if x%11 == 0:
print((x//11)*2)
elif x%11 > 6:
print(((x+1)//11)*2)
else:
print((x//11)*2 + 1)
|
p03408
|
s512885728
|
Wrong Answer
|
from collections import Counter
N=int(input())
A=[input() for _ in range(N)]
M=int(input())
B=[input() for _ in range(M)]
a=Counter(A)
b=Counter(B)
ans=0
for p in A:
print(p)
ans=max(ans,a[p]-b[p])
print(ans)
|
p02786
|
s349523171
|
Accepted
|
H = int(input())
cnt = 0
ans = 0
while(H > 0):
H = int(H / 2)
cnt += 1
for i in range(cnt):
ans += 2 ** i
print(ans)
|
p02645
|
s302813339
|
Accepted
|
name = input()
print(name[0:3])
|
p02765
|
s555694585
|
Wrong Answer
|
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#l = list(map(int, input().split()))
n,k = map(int, input().split())
if (n >= 10):
print(k)
else:
print(k-100*(10-n))
|
p03435
|
s056804556
|
Accepted
|
a = [list(map(int, input().split())) for _ in range(3)]
if a[0][1] - a[0][0] == a[1][1] - a[1][0] == a[2][1] - a[2][0] and a[0][2] - a[0][0] == a[1][2] - a[1][0] == a[2][2] - a[2][0]:
print('Yes')
else:
print('No')
|
p03448
|
s569190578
|
Accepted
|
a = int(input())
b = int(input())
c = int(input())
x = int(input())
ans = 0
for i in range(a + 1):
for j in range(b + 1):
for k in range(c + 1):
if i * 500 + j * 100 + k * 50 == x:
ans += 1
print(ans)
|
p02700
|
s679883602
|
Accepted
|
a, b, c, d = map(int, input().split())
ta = c//b if c % b == 0 else c//b + 1
aa = a//d if a % d == 0 else a//d + 1
print('No' if ta > aa else 'Yes')
|
p02708
|
s169280469
|
Wrong Answer
|
n,k=map(int,input().split())
al=[0]*(n+1)
bl=[0]*(n+1)
bl[0]=n
for i in range(1,n+1):
al[i]=i+al[i-1]
bl[i]=(n+1-i-1)+bl[i-1]
ans=0
for i in range(k,n+2):
ans+=bl[i-1]-al[i-1]+1
print(ans%(1e9+7))
|
p02627
|
s769419434
|
Accepted
|
import re
t = input()
pattern = r'[a-z]'
repattern = re.compile(pattern)
result = repattern.match(t)
if result:
print('a')
else:
print('A')
|
p03719
|
s835989335
|
Wrong Answer
|
a,b,c=map(int,input().split())
print("Yes" if a>=c<=b else "No")
|
p03250
|
s343951349
|
Accepted
|
A,B,C=map(int,input().split())
D=max(A,B,C)
print(A+B+C+9*D)
|
p02665
|
s928976904
|
Accepted
|
n=int(input())
a=list(map(int,input().split()))
if n==0:
print(1 if a[0]==1 else -1)
exit()
e=[1-a[0]]
for i in range(n):
e.append(max(e[i]-a[i],0)*2)
#print(e)
p=[i for i in a]
for i in range(n-1,-1,-1):
if -p[i+1]//2*-1+p[i]>e[i]:
print(-1)
exit()
if p[i+1]+p[i]>e[i]:
p[i]=e[i]
else:
p[i]+=p[i+1]
print(sum(p))
#print(p)
|
p03127
|
s610483605
|
Wrong Answer
|
N = int(input())
M_List = list(map(int,input().split()))
M_List = sorted(M_List)
a,b = M_List[0],M_List[1]
while a*b > 0:
if a > b:
a -= b
else:
b -= a
if a > 0:
print(a)
else:
print(b)
|
p03071
|
s637603644
|
Accepted
|
A, B = map(int, input().split())
if A == B:
ans = 2 * A
else:
ans = max(A, B) * 2 - 1
print(ans)
|
p04044
|
s990296399
|
Wrong Answer
|
i = input().split()
if i.count("7") == 1 and i.count("5") == 2:
print("YES")
else:
print("NO")
|
p02726
|
s870378244
|
Accepted
|
import collections
N, X, Y = list(map(int, input().split()))
dists = [
min(abs(j-i), abs(X-1-i)+1+abs(Y-1-j), abs(Y-1-i)+1+abs(X-1-j))
for i in range(N-1) for j in range(i+1, N)
]
c = collections.Counter(dists)
ans = [c[K] for K in range(1,N)]
print(*ans, sep='\n')
|
p02729
|
s403619562
|
Accepted
|
a = list(map(int,input().split()))
from operator import mul
from functools import reduce
def combinations_count(n, r):
r = min(r, n - r)
numer = reduce(mul, range(n, n - r, -1), 1)
denom = reduce(mul, range(1, r + 1), 1)
return numer // denom
x = a[0]
y = a[1]
if(x != 1) and (x != 0):
c = (combinations_count(x, 2))
else:
c = 0
if(y != 1) and (y != 0):
d = (combinations_count(y, 2))
else:
d = 0
print(c + d)
|
p03371
|
s997499670
|
Accepted
|
a, b, c, x, y = map(int, input().split())
if 2 * c == min(2 * c, a, b):
print(c * 2 * max(x, y))
elif 2 * c <= max(a, b) and a == max(a, b):
print(c * 2 * x + b * max(y - x, 0))
elif 2 * c <= max(a, b) and b == max(a, b):
print(c * 2 * y + a * max(x - y, 0))
elif 2 * c <= a + b and x <= y:
print(c * 2 * x + b * (y - x))
elif 2 * c <= a + b and x > y:
print(c * 2 * y + a * (x - y))
else:
print(a * x + b * y)
|
p02628
|
s579355127
|
Accepted
|
N, K = map(int, input().split())
p_list = sorted(list(map(int, input().split())))
print(sum(p_list[:K]))
|
p02777
|
s423192507
|
Wrong Answer
|
S, T = map(str,input().split())
A, B = map(int, input().split())
U = str(input())
if S == T:
A -= 1
else:
B -= 1
print(A, B)
|
p03317
|
s436548965
|
Accepted
|
N,K=map(int,input().split())
A=list(map(int,input().split()))
b=min(A)
p=0
for i in range(N):
if A[i]!=b:
p+=1
if p%(K-1)==0:
print(p//(K-1))
else:
print(p//(K-1)+1)
|
p03289
|
s835178279
|
Accepted
|
S = input()
print("AC" if(S[0] == "A" and 'C' in S[2:-1]
and S[1:].replace("C", '', 1).islower()) else "WA")
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.