problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03456 | s557178745 | Wrong Answer | """
author : halo2halo
date : 24, Jan, 2020
"""
import sys
import itertools
# import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, A = readline().decode('utf8').split()
S = int(N + A)
print('Yes' if S == S ** .5 * S ** .5 else 'No')
|
p02860 | s493222553 | Accepted | n = int(input())
s= list(input())
ans = 'Yes'
if n%2==1:
ans = 'No'
else:
for i in range(n//2):
if s[i]!=s[n//2+i]:
ans = 'No'
print(ans) |
p02820 | s127545351 | Accepted | n, k = list(map(int, input().split(' ')))
r, s, p = list(map(int, input().split(' ')))
d = dict(r=p,
s=r,
p=s)
ttt = input()
ans = 0
prevs = []
for i in range(n):
if i < k or ttt[i] != prevs[i-k]:
ans += d[ttt[i]]
prevs.append(ttt[i])
else:
prevs.append('hoge')
print(ans)
|
p02881 | s809071672 | Accepted | n = int(input())
waru = int(n**0.5)
while True:
if n%waru == 0:
a = waru
b = n//waru
break
else:
waru -= 1
print(a+b-2)
|
p02732 | s533730464 | Wrong Answer | n=int(input())
a=list(map(int, input().split()))
k=len(a)
for i in range(k):
del a[i]
ans=0
for j in range(n):
ac=a.count(j)
ans+=ac*(ac-1)//2
print(ans)
a.insert(k, 'k') |
p03435 | s044695639 | Accepted | c = [list(map(int,input().split())) for _ in range(3)]
for a1 in range(100):
b1 = c[0][0] -a1
b2 = c[0][1] -a1
b3 = c[0][2] -a1
a2 = c[1][0] -b1
a3 = c[2][0] -b1
if (a2+b2)==c[1][1] and (a2+b3)==c[1][2] and (a3+b2)==c[2][1] and (a3+b3)==c[2][2]:
print("Yes")
break
else:
print("No") |
p02813 | s312758546 | Wrong Answer | import itertools
N=int(input())
I=[str(i) for i in range(1,N+1)]
P=''.join(input().split())
Q=''.join(input().split())
li=list(itertools.permutations(I,N))
a=0
b=0
for i in range(len(li)):
if(''.join(li[i])==P):
a=i
elif(''.join(li[i])==Q):
b=i
print(abs(b-a)) |
p03252 | s149781752 | Wrong Answer | from collections import defaultdict
s=list(input())
t=list(input())
change_st=defaultdict(int)
change_ts=defaultdict(int)
for i in range(len(s)):
if change_st[s[i]]==0:
change_st[s[i]]=t[i]
else:
if change_st[s[i]]!=t[i]:
print("No")
break
if change_ts[t[i]]==0:
change_ts[t[i]]==0
else:
if change_ts[t[i]]!=s[i]:
pritn("No")
break
else:
print("Yes") |
p03556 | s112613981 | Wrong Answer | n=int(input())
a=0
for i in range(n):
if i**2>=n:
break
else:
a=i
print(a)
|
p02684 | s437226967 | Wrong Answer | N, K = map(int, input().split())
A = list(map(int, input().split()))
route = [1]
current_town = 1
loop = False
while not loop:
current_town = A[current_town-1]
if current_town in route:
route.append(current_town)
loop = True
else:
route.append(current_town)
start_index = route.index(route[-1])
loop_cnt = len(route) - (start_index+1)
K -= route.index(route[-1])
add_num = K % loop_cnt
print(route[start_index+add_num]) |
p03037 | s426124863 | Wrong Answer | N,M=map(int, input().split())
a=[[int(j) for j in input().split()] for i in range(M)]
ans = a[0][1]-a[-1][0]+1
print(ans) |
p03161 | s074174276 | Wrong Answer | import sys
input = sys.stdin.readline
def main():
N, K = map(int, input().split())
H = list(map(int, input().split()))
dp = [10**4]*N
dp[0] = 0
for i in range(N):
for j in range(1, min(K+1, N-i)):
dp[i+j] = min(dp[i+j], abs(H[i+j] - H[i]) + dp[i])
print(dp.pop())
main() |
p02811 | s882286058 | Accepted | a, b = map(int,input().split())
if 500*a >= b:
print("Yes")
else:
print("No") |
p03556 | s100853673 | Accepted | #abc077 b
import math
n=int(input())
m=int(math.sqrt(n))
print(m*m) |
p03796 | s971030202 | Accepted | N = int(input())
P = 1
for i in range(2,N+1):
P = P*i
P = P % (10 ** 9 + 7)
print(P)
|
p03456 | s834637498 | Wrong Answer | import numpy as np
import sys
input = sys.stdin.readline
a,b = input().split()
c = int(a+b)
for i in range(1,1000):
if c/i == i:
print(i)
print("Yes")
exit()
print("No")
|
p03852 | s984677237 | Accepted |
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def main():
mod=10**9+7
c=input()
L=["a","i","u","e","o"]
f=0
for i in range(5):
if c==L[i]:
f=1
if f==1:
print("vowel")
else:
print("consonant")
main()
|
p02659 | s875639212 | Wrong Answer | A, B = map(float, input().split())
A = int(A)
B = int(B*100)
x = A*B/100
ans = int(x)
print(ans)
|
p03030 | s509509446 | Accepted | N = int(input())
s = list()
for a in range(1, N+1):
S, P = input().split()
P = int(P)
s.append([S, P, a])
s = sorted(s, key=lambda x: (x[0], -x[1])) # 複数のキーでソートしたい時 昇順と降順を混ぜたい時はマイナスつける
for a in range(N):
print(s[a][2])
|
p03632 | s866871330 | Wrong Answer | def main():
a, b, c, d = map(int, input().split())
if b <= c:
ans = 0
else:
if b <= d:
ans = b - c
else:
ans = d - c
print(ans)
if __name__ == "__main__":
main()
|
p02982 | s344968548 | Accepted | import sys
input = sys.stdin.readline
import math
def main():
N, D = map(int, input().split())
X = [list(map(int, input().split())) for i in range(N)]
DIST, CNT = 0, 0
for i in range(N-1):
for j in range(i+1,N):
for d in range(D):
DIST += abs(X[i][d] - X[j][d])**2
if math.sqrt(DIST).is_integer():
CNT +=1
DIST = 0
print(CNT)
if __name__ == '__main__':
main() |
p03087 | s373281155 | Accepted | N,Q=map(int,input().split())
S=input()
count=[0]*N
for i in range(1,N):
count[i]+=count[i-1]
if S[i-1:i+1]=="AC":count[i]+=1
for i in range(Q):
l,r=map(int,input().split())
print(count[r-1]-count[l-1]) |
p02548 | s037223285 | Accepted | N = int(input())
ans = 0
for i in range(1,N):
ans += N//i
if N%i == 0:
ans -= 1
print(ans) |
p03109 | s549644674 | Accepted | S = input()
if int(S[5:7]) <= 4:
print("Heisei")
else:
print("TBD") |
p02690 | s759778810 | Wrong Answer | x = int(input())
num = [x ** 5 for x in range(-63, 63)]
for i in range(-63, 63):
flag = False
for j in range(-63, 63):
tmp = i ** 5 - j ** 5
if tmp == x:
print('{} {}'.format(i, j))
flag = True
break
if flag:
break
|
p03665 | s387697492 | Wrong Answer | N,P = map(int,input().split())
A = list(map(int,input().split()))
c = [0,0]
for a in A:
c[a%2] += 1
print(2**(c[0]+c[1]-1))
|
p02848 | s830810187 | Wrong Answer | N = int(input())
S = input()
s = list(S)
for i in range(len(S)):
if ord(s[i]) + N == 90:
p = 64 + 26
else:
p = (ord(s[i]) - 64 + N) % 26 + 64
s[i] = chr(p)
print("".join(s)) |
p04020 | s582316183 | Accepted | import sys
N = int(sys.stdin.readline())
A = [int(sys.stdin.readline()) for _ in range(N)]
ans = 0
for i in range(1, N):
ans += (A[i - 1] + A[i]) // 2
if A[i]:
A[i] = (A[i - 1] + A[i]) % 2
print(A[0] // 2 if N == 1 else ans) |
p02582 | s025527545 | Wrong Answer | weather = input()
if len(weather) != 3:
print("0")
if weather in ["RRR"]:
print("3")
elif weather in ["SRR","RSR","RRS"]:
print("2")
elif weather in ["SSR","SRS","RSS"]:
print("1")
else:
print("0")
|
p03061 | s501373570 | Accepted | from fractions import gcd
N=int(input())
A=list(map(int,input().split()))
Asort = sorted(A)[:: -1]
L=[0]*N
R=[0]*N
L[0]=A[0]
R[0]=A[N-1]
for n in range(1,N):
L[n]=gcd(A[n],L[n-1])
R[n]=gcd(A[N-n-1],R[n-1])
ans=max(L[N-2],R[N-2])
for i in range(1,N-1):
ans=max(ans,gcd(L[i-1],R[N-i-2]))
print(ans) |
p02681 | s785424565 | Accepted | s1=list(str(input()))
s2=list(str(input()))
a=s2.pop()
if(s1==s2):
print("Yes")
else:
print("No") |
p02630 | s858768226 | Accepted | #!python3
LI = lambda: list(map(int, input().split()))
# input
N = int(input())
A = LI()
Q = int(input())
BC = [LI() for _ in range(Q)]
MAX = 10 ** 5
def main():
d = {i: 0 for i in range(MAX + 1)}
s = 0
for a in A:
d[a] += 1
s += a
for b, c in BC:
x = d[b]
s += (c - b) * x
print(s)
d[c] += d[b]
d[b] = 0
if __name__ == "__main__":
main()
|
p02813 | s440694662 | Accepted | #C
import itertools
N = int(input())
P = tuple(map(int,input().split()))
Q = tuple(map(int,input().split()))
l = [i+1 for i in range(N)]
p_list = list(itertools.permutations(l, N))
p_list.sort()
a = p_list.index(P)
b = p_list.index(Q)
print(abs(a-b))
#print(p_list)
|
p02899 | s535847506 | Wrong Answer | n = int(input())
order = input().split()
a = dict.fromkeys(range(1, n+1, 1))
for i in a:
a[i] = order[i-1]
print(a)
for key, value in sorted(a.items(), key=lambda item: item[1]):
print(key, end = '')
if(value != str(n)):
print(end = ' ')
|
p03944 | s149292726 | Wrong Answer | W, H, N = map(int, input().split())
x = [0, W]
y = [0, H]
a = []
for i in range(N):
A = list(map(int, input().split()))
a.append(A)
for j in a:
if j[2] == 1:
x[0] = j[0]
elif j[2] == 2:
x[1] = j[0]
elif j[2] == 3:
y[0] = j[1]
else:
y[1] = j[1]
if x[0] >= x[1] or y[0] >= y[1]:
print('0')
else:
ans = (x[1] - x[0]) * (y[1] - y[0])
print(int(ans)) |
p02621 | s532287986 | Wrong Answer | N=int(input())
ans=0
for i in range(1,N+1):
a=N//i
ans+=(a*(a+1)*i)//2
print(ans) |
p02553 | s078915409 | Wrong Answer | a, b, c, d = map(int, input().split())
if a >= 0 and b >= 0 and c < 0 and d < 0:
print(min(a, b) * max(c, d))
elif a < 0 and b < 0 and c >= 0 and d >= 0:
print(min(c, d) * max(a, b))
else:
print(max(abs(a), abs(b)) * max(abs(c), abs(d))) |
p02754 | s707876611 | Wrong Answer | n,a,b=map(int,input().split())
if(n<=a):
print(n)
elif(n<=a+b):
print(a)
else:
print(n//(a+b)+n%(a+b)) |
p03910 | s693533627 | Accepted | import sys
import math
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7
def main():
N = int(readline())
n = math.ceil((-1 + math.sqrt(1+8*N))/2)
jokyo = n*(n+1)//2 - N
for i in range(1,n+1):
if i == jokyo:
continue
else:
print(i)
if __name__ == '__main__':
main()
|
p03705 | s568894172 | Accepted | N, A, B = map(int, input().split())
if A > B:
print(0)
elif N == 1:
if A == B:
print(1)
else:
print(0)
elif N == 2:
print(1)
else:
temp = (N - 2) * (B - A) + 1
print(temp)
|
p03486 | s253144343 | Accepted |
import numpy as np
s="".join(sorted(input()))
t="".join(sorted(input(),reverse=True))
if(s<t):
print("Yes")
else:
print("No") |
p03038 | s285131714 | Accepted | N,M = map(int,input().rstrip().split(" "))
A = list(map(int,input().rstrip().split(" ")))
A.sort(reverse = True)
Q = []
for i in range(M):
B,C = map(int,input().rstrip().split(" "))
Q.append([C,B])
Q.sort(reverse = True)
p = 0
j = 0
while p < N and j < M:
for i in range(Q[j][1]):
if i + p > N:
break
A.append(Q[j][0])
p += Q[j][1]
j += 1
ans = 0
A.sort(reverse = True)
for i in range(N):
ans += A[i]
print(ans)
|
p02771 | s956378155 | Accepted | A = [int(i) for i in input().split()]
if len(set(A)) == 2:print('Yes')
else:print('No') |
p03077 | s971180108 | Accepted | n=int(input())
a=[int(input())for _ in range(5)]
print(4--n//min(a)) |
p02691 | s178869865 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
count = 0
for i in range(1, n-1):
ans_list = []
for j in range(n-i):
ans_list.append(a[j]+a[j+i])
count += ans_list.count(i)
print(count) |
p04033 | s532193442 | Wrong Answer | a,b = [int(i) for i in input().split()]
if a<=0 and 0<=b:
print("Zero")
elif a>0:
print("Positive")
else:
print("Negative") |
p03485 | s274496854 | Accepted | import math
def plusup(a , b):
return math.ceil((a + b) / 2)
def main():
a , b = map(int , input().split())
print(plusup(a , b))
if __name__ == '__main__':
main()
|
p03282 | s429218754 | Accepted | S = str(input())
K = int(input())
if len(S) == 1:
print(S[0])
exit(0)
i = 0
while S[i] == '1' and i <= len(S)-2:
if K <= i + 1:
print(S[i])
exit(0)
i += 1
print(S[i]) |
p03146 | s764322723 | Wrong Answer | s = int(input())
a = s
ar = []
for i in range(1, 100000000):
if(a % 2 == 0):
a = a/2
else:
a = 3*a + 1
if(ar.count(a) == 1):
print(i+1)
break
# print(a)
ar.append(a)
|
p02732 | s587621904 | Wrong Answer | import copy
n = int(input())
a = list(map(int,input().split()))
a_2 = set(a)
ans = 0
for i in a_2:
p = a.count(i)
ans += int((p * (p-1)) / (2 * 1))
#print(ans)
final = [ans for i in range(n)]
for i in range(n):
a_2 = copy.copy(a)
del a_2[i]
h = a_2.count(a[i])
final[i] -= int((h-1))
for i in final:
print(i)
|
p02744 | s210539208 | Accepted | n=int(input())
def dfs(s):
if len(s)==n:print(s)
else:
for i in range(97,ord(max(s))+1+1):
dfs(s+chr(i))
dfs("a")
|
p03075 | s964325618 | Wrong Answer | a = [int(input()) for _ in range(5)]
k = int(input())
if k > a[4] - a[0]:
print("Yay!")
else:
print(":(") |
p02641 | s721263177 | Wrong Answer | X,N = map(int,input().split())
p = list(map(int, input().split()))
n =max(X,N)
for i in range(n):
if X-i not in p:
print(X-i)
break
elif X+i not in p:
print(X+i)
break
else:
continue |
p03386 | s003943611 | Wrong Answer | a,b,k=map(int,input().split())
m=[i for i in range(a,min(a+k,b))]
M=[i for i in range(b,max(b-k,a),-1)]
ans=sorted(set(m)|set(M))
for i in ans:
print(i) |
p02900 | s060455152 | Accepted | import math
import fractions
A, B = map(int,input().split())
gcd = fractions.gcd(A,B)
N = int(math.ceil(math.sqrt(gcd)))
cd = []
for i in range(1,N):
if A%i==0 and B%i==0:
cd.append(i)
cd.append(gcd//i)
if N==1:
cd.append(N)
ans=0
cd.sort()
for i in range(len(cd)):
tr=1
for j in range(1,i):
if cd[i]%cd[j]==0:
tr=0
break
if tr==1:
ans+=1
print(ans) |
p03041 | s407435541 | Wrong Answer | n,k=map(int,input().split())
def count(k,i):
cnt=0
while k>i:
i**=2
cnt+=1
return cnt
p=0
for i in range(1,n+1):
p+=((1/2)**(count(k,i)))
print(p/n) |
p03797 | s623694371 | Wrong Answer | n,m=map(int,input().split())
print(n+max(m-2*n,0)//4) |
p03103 | s914729601 | Wrong Answer | n,m = map(int,input().split())
drink=[]
for _ in range(n):
a,b = map(int,input().split())
drink.append((a,b))
drink.sort(reverse=1)
ans = 0
while m<0:
a,b = drink.pop(-1)
ans += a*min(m, b)
m -= b
print(ans)
|
p03951 | s183469252 | Wrong Answer | from collections import Counter
n = int(input())
s = input() + input()
c = Counter(list(s))
l = len(list(filter(lambda x : x > 1, c.values())))
if l == 0:
print(2*n)
else:
print(2*n - l) |
p02720 | s332842819 | Accepted | from collections import deque
K = int(input())
d = [-1, 0, 1]
que = deque([])
for i in range(1, 10):
que.append(i)
cnt = 0
while que:
p = que.popleft()
cnt += 1
if cnt == K:
print(p)
break
for i in d:
if 0 <= int(str(p)[-1]) + i <= 9:
que.append(int(str(p) + str(int(str(p)[-1]) + i))) |
p03971 | s775887021 | Wrong Answer | N, A, B = map(int, input().split())
S = input()
a = 0
b = 0
for s in S:
if s == 'a' and a+b < A+B:
print('YES')
a += 1
elif s == 'b' and a+b < A+B and b < B:
print('YES')
b += 1
else:
print('NO')
|
p03605 | s490607255 | Accepted | N = input()
print('Yes' if '9' in N else 'No') |
p03861 | s825023128 | Wrong Answer | a, b, x = map(int, input().split())
result = 0
if a % x == 0:
result += 1
result += ((b - a) // x)
print(result) |
p02583 | s638323089 | Accepted | n=int(input())
l=list(map(int,input().split()))
l.sort()
ans=0
for i in range(n-2):
for j in range(i+1,n-1):
for k in range(j+1,n):
if l[i]+l[j]>l[k] and l[i]!=l[j]!=l[k]:
ans+=1
print(ans) |
p03069 | s818030724 | Accepted | N=int(input())
S=input()
cnt=0
black=[0]*N
white=[0]*N
for i in range(N):
if S[i]==".":
white[i]=1
else:
black[i]=1
if i>=1:
white[i]+=white[i-1]
black[i]+=black[i-1]
B=black[-1]
W=white[-1]
ans=min(B,W)
for i in range(1,N):
num=black[i-1]+W-white[i-1]
ans=min(ans,num)
print(ans) |
p02948 | s565950694 | Accepted | import heapq
N, M = map(int, input().split())
ab = [list(map(int, input().split())) for _ in range(N)]
day = {i+1: [] for i in range(M)}
for a, b in ab:
if a <= M:
day[a] += [-b]
q = []
heapq.heapify(q)
pay = 0
for i in range(M):
for b in day[i+1]:
heapq.heappush(q, b)
if len(q) > 0:
pay += -heapq.heappop(q)
print(pay)
|
p03042 | s317136708 | Accepted | S=input()
a=int(S[:2])
b=int(S[2:])
if 1<=a<=12 and 1<=b<=12:
print("AMBIGUOUS")
elif 1<=a<=12 and (b>=13 or b==0):
print("MMYY")
elif a>=13 and (b>=13 or b==0):
print("NA")
elif a>=13 and 1<=b<=12:
print("YYMM")
elif a==0 and (b>=13 or b==0):
print("NA")
elif a==0 and (1<=b<=12):
print("YYMM") |
p03071 | s799702457 | Accepted | a, b = map(int, input().split())
x = 2*(max(a,b))-1
y = a+b
print(x if x > y else y) |
p03556 | s367576989 | Accepted | n = int(input())
i=0
while (n-i)**0.5 % 1 != 0:
i+=1
print(n-i)
|
p02790 | s281762054 | Accepted | ab = input().split(' ')
print(min(ab[0]*int(ab[1]), ab[1]*int(ab[0]))) |
p02744 | s087925339 | Accepted | def dfs(a='', b=chr(ord('a'))):
if len(a) == N:
print(a)
else:
i = chr(ord('a'))
while i < b:
dfs(a + i, b)
i = chr(ord(i) + 1)
dfs(a + b, chr(ord(b) + 1))
N = int(input())
dfs() |
p02881 | s738321681 | Accepted | #!/usr/bin/env python
# coding: utf-8
# In[2]:
import math
# In[14]:
N = int(input())
# In[15]:
for x in range(1,int(math.sqrt(N)+1))[::-1]:
if N%x == 0:
print((x-1)+(N//x-1))
break
# In[ ]:
|
p02595 | s293454225 | Wrong Answer | n,d=map(int,input().split(" "))
c = 0
d *= d
for i in range(n):
a,b=map(int,input().split(" "))
if(a**2+b**2==d):
c+=1
print(c) |
p03281 | s570880490 | Accepted | N = int(input())
cnt = 0
for i in range(1,N+1,2):
ans=0
for j in range(1,i+1):
if i % j == 0:
ans += 1
else:
pass
if ans == 8:
cnt += 1
else:
pass
print(cnt) |
p02802 | s389379318 | Wrong Answer | #C
n, m = map(int, input().split())
probrem = [0] * n
warn = [0] * n
for i in range(m):
a, b = map(str, input().split())
a=int(a)
if probrem[a - 1] == 0 and b == 'AC':
probrem[a - 1] = 1
if probrem[a - 1] == 0 and b == "WA":
warn[a - 1] += 1
# print(probrem,warn)
print(sum(probrem),sum(warn)) |
p03309 | s967833648 | Accepted | def median(array):
L = len(array)
if L%2==0:
return (array[L//2-1]+array[L//2])/2
else:
return array[L//2]
N = int(input())
A = []
for i, a in enumerate(map(int, input().split())):
A.append(a-i)
A.sort()
b = median(A)
res = 0
for a in A:
res += abs(a-b)
print(round(res)) |
p02700 | s975136238 | Wrong Answer | a,b,c,d = map(int,input().split())
aoki = c - b
takahasi = a - d
for i in range(100):
if i % 2 == 0:
c -= b
if c <= 0:
print('Yes')
exit()
elif i % 2 == 1:
a -= d
if a <= 0:
print('No')
exit()
|
p02661 | s893650270 | Wrong Answer | from statistics import median
N = int(input())
A = []
B = []
for i in range(N):
a, b = map(int, input().split())
A.append(a)
B.append(b)
ans = int(median(B)-median(A))
if N%2==0:
ans = ans*2
print(ans+1) |
p02663 | s867683584 | Accepted | input_str = input().split()
input_nums=[]
for i in range(5):
input_nums.append(int(input_str[i]))
diff_hour = input_nums[2] - input_nums[0]
diff_hour_to_min = diff_hour * 60
diff_min = input_nums[3] - input_nums[1]
total_wake_min = diff_hour_to_min + diff_min
print(total_wake_min - input_nums[4]) |
p02832 | s105785503 | Accepted | N = int(input())
A = [int(i) for i in input().split()]
k = 1
S = 0
for a in A:
if k == a:
S += 1
k += 1
if S:
print(N-S)
else:
print(-1)
|
p02939 | s794869587 | Accepted | S = input()
prev = ""
curr = ""
ans = 0
for s in S:
curr += s
if (prev != curr):
prev = curr
curr = ""
ans += 1
print(ans)
|
p02760 | s486835656 | Wrong Answer | a = []
for i in range(3):
a.append(list(map(int,input().split())))
for i in range(int(input())):
b = int(input())
for j in range(3):
for k in range(3):
if a[j][k] == b:
a[j][k] = 0
def bingo():
for i in range(3):
if sum(a[i]) == 0 or a[0][i] + a[0][j] + a[0][k] == 0:
return 'Yes'
if a[0][0] + a[1][1] + a[2][2] == 0 or a[0][2] + a[1][1] + a[2][0] == 0:
return 'Yes'
return 'No'
print(bingo()) |
p03469 | s767416908 | Accepted | print(input().replace("2017","2018")) |
p03284 | s804341649 | Accepted | A,B=map(int,input().split())
if A%B==0:
print(0)
else:
print(1) |
p03030 | s340041689 | Accepted | n = int(input())
SP = []
for i in range(n):
s, p = input().split()
SP += [[s,int(p),i+1]]
SP.sort(key=lambda A:(A[0],-A[1]))
for sp in SP:
print(sp[2]) |
p02873 | s736526805 | Accepted | S = input()
n = [0]*(len(S)+1)
if S[0]=='<':
n[0]==0
for i in range(0,len(S)):
if S[i]=='>':
n[i+1]=0
else:
n[i+1]=n[i]+1
for i in range(len(S)-1,-1,-1):
if S[i]=='>':
n[i]=max(n[i],n[i+1]+1)
print(sum(n)) |
p03471 | s846609796 | Accepted | import sys
n, y = map(int, input().split())
for a in range(n+1):
for b in range(n+1-a):
if 10000 * a + 5000 * b + 1000 * (n - a - b) == y:
ans = [a, b, n - a - b]
print(*ans, sep=" ")
sys.exit()
print("-1 -1 -1") |
p02701 | s474661482 | Accepted | Row = int(input())
List = [input() for i in range(Row)]
print(len((set(List)))) |
p02923 | s468089589 | Accepted | n = int(input())
h = [int(i) for i in input().split()]
max_cnt, cnt = 0, 0
for i in range(n - 1):
if h[i] >= h[i + 1]:
cnt += 1
else:
cnt = 0
max_cnt = max(max_cnt, cnt)
print(max_cnt) |
p03698 | s989256736 | Accepted | S = input()
if len(S) == len(set(S)):
print('yes')
else:
print('no') |
p02833 | s818440596 | Wrong Answer | n = int(input())
if n % 2 != 0:
print(0)
elif n == 0:
print(1)
else:
ans = 0
for i in range(1, 100):
ans += n//(5**i*2)
print(ans)
|
p02861 | s334304835 | Wrong Answer | from itertools import combinations
from math import sqrt
# input
N = int(input())
xy = []
append = xy.append
for n in range(N):
x, y = map(int, input().split())
append((x, y))
nC2 = list(combinations(xy, 2))
dist = 0
for a, b in nC2:
dist += sqrt((a[0] - b[0]) ** 2 + (a[1] - b[1]) ** 2)
print(dist / len(nC2)) |
p02602 | s332263418 | Accepted | from sys import stdin, stdout
input = stdin.readline
print = stdout.write
from functools import reduce
n, k = map(int,input().split())
a = list(map(int,input().split()))
prod = a[0]
ans = []
for i in range(k,n):
prod = a[i-k]
prodt = a[i]
if prodt>prod:
ans.append('Yes')
else:
ans.append('No')
ans = '\n'.join(ans)
print(ans) |
p03796 | s344159093 | Accepted | # N = int(input())
# power = 1
# for i in range(1, N+1):
# power *= i
# print(power % (10 ** 9 + 7))
# TLEとなってしまう
# modの世界を使う
N = int(input())
power = 1
for i in range(1, N+1):
power = power * i % (10 ** 9 + 7)
print(power) |
p02754 | s807286622 | Accepted | line = input().split()
N = int(line[0])
nB = int(line[1])
nR = int(line[2])
if nB == 0:
print(0)
quit()
nball = nB + nR
nGroup = N // nball
nAdditional = N % nball
if nAdditional > nB:
nAdditional = nB
nBlueTotal = nB * nGroup + nAdditional
print(nBlueTotal)
|
p02547 | s354859689 | Accepted | n = int(input())
a = [0]*n
for i in range(n):
d1, d2 = map(int, input().split())
if d1 == d2:
a[i] = 1
ans = 'No'
for i in range(n-2):
if a[i]*a[i+1]*a[i+2] ==1:
ans = 'Yes'
print(ans) |
p03324 | s011642043 | Wrong Answer | #!/usr/bin/env python3
import sys
def main():
D, N = map(int, input().split())
print((100**D)*N)
return
if __name__ == '__main__':
main()
|
p02584 | s636396398 | Accepted | X, K, D = map(int, input().split())
a, b = abs(X)//D, abs(X)%D
if K <= a:
if X >= 0:
ans = X - K*D
else:
ans = X + K*D
else:
K = (K - a) % 2
if X >= 0:
ans = X - a*D
else:
ans = X + a*D
if K == 1:
if abs(X+D) < abs(X-D):
ans += D
else:
ans -= D
print(abs(ans)) |
p03624 | s674866863 | Accepted | s = input()
s = set(s)
alpha = set([chr(ord('a')+i) for i in range(26)])
alpha -= s
alpha = list(alpha)
alpha.sort()
if len(alpha) == 0:
print('None')
else:
print(alpha[0])
|
p03994 | s125506130 | Wrong Answer | s = input()
k = int(input())
alp = 'bcdefghijklmnopqrstuvwxyza'
for i in range(len(s)):
t = alp.index(s[i])
if k >= 25-t:
s = s[:i] + 'a' + s[i+1:]
k -= 25-t
elif i == len(s)-1:
s = s[:i] + alp[k+t%26]
print(s) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.