buggy stringlengths 1 618k | fixed stringlengths 16 618k | buggy_submission_id stringlengths 10 10 | fixed_submission_id stringlengths 10 10 | problem_id stringlengths 6 6 | lang stringclasses 1
value | buggy_verdict stringclasses 2
values |
|---|---|---|---|---|---|---|
while True:
N = input()
if N == "0000":
break
ans = 0
if all([1 if s == N[-1] else 0 for s in N[:-1]]):
print("NA")
continue
while int(N) != 6174:
a, b, c, d = N[0], N[1], N[2], N[3]
S = sorted([a, b, c, d])
L = int([''.join(S[::-1])][0])
S = ... | while True:
N = input()
if N == "0000":
break
ans = 0
if int(N) % 1111 == 0:
print("NA")
continue
while N != '6174':
N = list(N)
S = int(''.join(sorted(N)))
L = int(''.join(sorted(N)[::-1]))
ans += 1
N = str(L-S).zfill(4)
print(ans) | s762027190 | s096369745 | p00254 | python | Runtime Error |
while True:
N = input()
if N == "0000":
break
ans = 0
if int(N) % 1111 == 0:
print("NA")
continue
while int(N) != 6174:
a, b, c, d = N[0], N[1], N[2], N[3]
S = sorted([a, b, c, d])
L = int([''.join(S[::-1])][0])
S = int([''.join(S)][0])
... | while True:
N = input()
if N == "0000":
break
ans = 0
if int(N) % 1111 == 0:
print("NA")
continue
while N != '6174':
N = list(N)
S = int(''.join(sorted(N)))
L = int(''.join(sorted(N)[::-1]))
ans += 1
N = str(L-S).zfill(4)
print(ans) | s081435033 | s096369745 | p00254 | python | Runtime Error |
while True:
N = input()
if N == "0000":
break
ans = 0
if int(N) % 1111 == 0:
print("NA")
continue
while int(N) != 6174:
N = list(N)
S = int(''.join(sorted(N)))
L = int(''.join(sorted(N)[::-1]))
ans += 1
N = str(L-S)
print(ans) | while True:
N = input()
if N == "0000":
break
ans = 0
if int(N) % 1111 == 0:
print("NA")
continue
while N != '6174':
N = list(N)
S = int(''.join(sorted(N)))
L = int(''.join(sorted(N)[::-1]))
ans += 1
N = str(L-S).zfill(4)
print(ans) | s215399636 | s096369745 | p00254 | python | Time Limit Exceeded |
while True:
N = int(input())
if N==0:break
dataset = input()
mens = ["" for _ in range(N)]
i = 0
p = ""
while dataset:
if i == N: i = 0
card, dataset = dataset[0], dataset[1:]
if card == "M":
mens[i] += card
elif card == "S":
p += card ... | while True:
N = int(input())
if N==0:break
dataset = input()
mens = ["" for _ in range(N)]
i = 0
p = ""
while dataset:
if i == N: i = 0
card, dataset = dataset[0], dataset[1:]
if card == "M":
mens[i] += card
elif card == "S":
p += card ... | s969349336 | s031758019 | p00275 | python | Runtime Error |
while True:
N = int(input())
if N==0:break
dataset = input()
mens = ["" for _ in range(N)]
i = 0
p = ""
while dataset:
if i == N: i = 0
card, dataset = dataset[0], dataset[1:]
if card == "M":
mens[i] += card
elif card == "S":
p += card ... | while True:
N = int(input())
if N==0:break
dataset = input()
mens = ["" for _ in range(N)]
i = 0
p = ""
while dataset:
if i == N: i = 0
card, dataset = dataset[0], dataset[1:]
if card == "M":
mens[i] += card
elif card == "S":
p += card ... | s983495764 | s031758019 | p00275 | python | Runtime Error |
print(sum(map(int, input().split())) | print(sum(map(int, input().split())))
| s231846835 | s707636040 | p00310 | python | Runtime Error |
print(sum(divmod(map(int, input().split()))) | D, L = map(int, input().split())
print(D//L + D%L) | s440110071 | s314196585 | p00312 | python | Runtime Error |
N = int(input())
p = list(map(int, input().split()))
score = [0] * 101
for x in p:
score[x] += 1
while True:
if sum(score[i:]) < i:
break
i += 1
print(i-1) | N = int(input())
p = list(map(int, input().split()))
score = [0] * 101
for x in p:
score[x] += 1
print(max(i * (sum(score[i:]) >= i) for i in range(101))) | s670071951 | s263976093 | p00314 | python | Runtime Error |
e = sorted(map(int, input().split()))
print("yes" if e[0] == e[1] and e[2] == e[3]) | e = sorted(map(int, input().split()))
print("yes" if e[0] == e[1] and e[2] == e[3] else "no") | s071293288 | s917763981 | p00340 | python | Runtime Error |
while True:
n = int(input())
if n == 0:
break
score = [0, 0]
for _ in range(n):
A, B = map(int, input().split())
if A == B:
score += [A, B]
else:
score[A > B] += A+B
print(*score) | while True:
n = int(input())
if n == 0:
break
score = [0, 0]
for _ in range(n):
A, B = map(int, input().split())
if A == B:
score[0] += A
score[1] += B
else:
score[A < B] += A+B
print(*score) | s385054327 | s215506563 | p00423 | python | Runtime Error |
while True:
x = int(input())
if x == 0:
break
dcl = dict()
for i in range(x):
inp = list(map(str, input().split()))
dcl[inp[0]] = inp[1]
ans = ""
x = int(input())
y = str(input())
for i in range(x):
y = str(input())
if y in dcl:
ans += ... | while True:
n = int(input())
if n == 0:
break
converter = {}
for _ in range(n):
k, v = input().split()
converter[k] = v
m = int(input())
ans = []
for _ in range(m):
v = input().strip()
try:
ans.append(converter[v])
except:
... | s843172593 | s227093344 | p00424 | python | Runtime Error |
while True:
n = int(input())
if n == 0:
break
d = {}
for _ in range(n):
a, b = input().split()
d[a] = b
m = int(input())
tmp = [input().strip() for _ in range(int(input()))]
ans = [d[a] if a in d.keys() else a for a in tmp]
print("".join(ans)) | while True:
n = int(input())
if n == 0:
break
converter = {}
for _ in range(n):
k, v = input().split()
converter[k] = v
m = int(input())
ans = []
for _ in range(m):
v = input().strip()
try:
ans.append(converter[v])
except:
... | s482366385 | s227093344 | p00424 | python | Runtime Error |
operation = {"North": (1, 5, 2, 3, 0, 4),
"East": (3, 1, 0, 5, 4, 2),
"West": (2, 1, 5, 0, 4, 3),
"South": (4, 0, 2, 3, 5, 1),
"Right": (0, 2, 4, 1, 3, 5),
"Left": (0, 3, 1, 4, 2, 5)}
while True:
n = int(input())
if n == 0:
break
dice... | operation = {"North": (1, 5, 2, 3, 0, 4),
"East": (3, 1, 0, 5, 4, 2),
"West": (2, 1, 5, 0, 4, 3),
"South": (4, 0, 2, 3, 5, 1),
"Right": (0, 2, 4, 1, 3, 5),
"Left": (0, 3, 1, 4, 2, 5)}
while True:
n = int(input())
if n == 0:
break
dice... | s009525028 | s413202397 | p00425 | python | Runtime Error |
while True:
n, k = map(int, input().split())
if n==0:break
a = [int(input()) for _ in range(n)]
print(max([sum(a[i:i+k]) for i in range(n) if len(a[i:i+k])==k])) | from collections import deque
while True:
n, k = map(int, input().split())
if n==0:break
a = deque(int(input()) for _ in range(k))
ans=tmp=sum(a)
for _ in range(n-k):
x = a.popleft()
y = int(input())
a.append(y)
tmp += y - x
ans = max(ans, tmp)
print(ans) | s604192186 | s892897102 | p00439 | python | Time Limit Exceeded |
from collections import deque
while True:
n, k = map(int, input().split())
if n==0:break
a = deque(int(input()) for _ in range(k))
ans = sum(a)
for _ in range(n-k):
a.popleft()
a.append(int(input()))
tmp = sum(a)
if ans < tmp: ans = tmp
print(ans) | from collections import deque
while True:
n, k = map(int, input().split())
if n==0:break
a = deque(int(input()) for _ in range(k))
ans=tmp=sum(a)
for _ in range(n-k):
x = a.popleft()
y = int(input())
a.append(y)
tmp += y - x
ans = max(ans, tmp)
print(ans) | s513786418 | s892897102 | p00439 | python | Time Limit Exceeded |
n = int(input())
values = list(map(int, input().split()))
minv = min(vs)+1
print(1)
i = 2
ng_value = [1]*minv
while i < minv:
if not 0 in [1 if values[k] % i == 0 else 0 for k in range(n)]:
print(i)
else:
for j in range(i, minv, i):
ng_value[j] = 0
b = True
for j in range(i+1... | n = int(input())
values = list(map(int, input().split()))
minv = min(values)+1
print(1)
i = 2
ng_value = [1]*minv
while i < minv:
if not 0 in [1 if values[k] % i == 0 else 0 for k in range(n)]:
print(i)
else:
for j in range(i, minv, i):
ng_value[j] = 0
b = True
for j in range... | s483598771 | s488288087 | p00506 | python | Runtime Error |
A = int(input())
B = int(input())
C = int(input())
D = int(input())
P = int(input())
print(min(P*A, B if C <= P else B+(P-C)*D) | A = int(input())
B = int(input())
C = int(input())
D = int(input())
P = int(input())
print(min(P*A, B if C >= P else B+(P-C)*D)) | s071217397 | s494958979 | p00531 | python | Runtime Error |
from math import gcd
while True:
try:
a, b= map(int, input().split())
print(gcd(a, b))
except:
break | while True:
try:
a, b= map(int, input().split())
while b!= 0:
a, b= b, a%b
print(a)
except:
break | s716719312 | s294277734 | p00595 | python | Runtime Error |
while True:
n = int(input())
if n == 0: break
print(sum([int(input()) for _ in range(n)])) | while True:
n = int(input())
if n == 0:
break
print(sum(int(input()) for i in range(n // 4))) | s663477059 | s592118957 | p00627 | python | Runtime Error |
while True:
n, m = map(int, input().split())
if n == 0:
break
flag = 1
for i in range(m):
if int(input()) == 1:
flag = 0
print('{:.10f}'.format(n/2 if flag else 0)) | while True:
n, m = map(int, input().split())
if n == 0:
break
p = sorted(list(map(int, input().split())))
flag = 0 if p[0]==1 else 1
print('{:.10f}'.format(n/2 if flag else 0)) | s500271573 | s147313721 | p00661 | python | Runtime Error |
primes = [0, 0] + [1]*996
for i in range(2, 32):
if primes[i]:
for j in range(i*i, 998, i):
primes[j] = 0
while True:
n = int(input())
if n == 0:
break
m = n
while not primes[m]:
m -= 1
pnum = [i for i in range(m+1) if primes[i]]
ans = 0
for i in range... | primes = [0, 0] + [1]*9999
for i in range(2, 101):
if primes[i]:
for j in range(i*i, 10001, i):
primes[j] = 0
pnums = [i for i in range(10001) if primes[i]]
while True:
n = int(input())
if n == 0:
break
m = n
while not primes[m]:
m -= 1
ans = 0
end = pnums... | s869723653 | s922721140 | p00836 | python | Runtime Error |
primes = [0, 0] + [1]*999
for i in range(2, 32):
if primes[i]:
for j in range(i*i, 1001, i):
primes[j] = 0
while True:
n = int(input())
if n == 0:
break
m = n
while not primes[m]:
m -= 1
pnum = [i for i in range(m+1) if primes[i]]
ans = 0
for i in rang... | primes = [0, 0] + [1]*9999
for i in range(2, 101):
if primes[i]:
for j in range(i*i, 10001, i):
primes[j] = 0
pnums = [i for i in range(10001) if primes[i]]
while True:
n = int(input())
if n == 0:
break
m = n
while not primes[m]:
m -= 1
ans = 0
end = pnums... | s453626675 | s922721140 | p00836 | python | Runtime Error |
import sys
n = int(input())
length = int(n / 19) + 1
d = []
for i in range(length):
d += list(map(int, input().split()))
start, end = 1, 10
l = []
flag = False
for j in range(1, len(d)+1):
for i in range(0, len(d)):
tmp = ''.join(map(str, d[i:i+j]))
if len(tmp) > 1 and tmp[0] == '0':
... | n = int(input())
length = int(n / 19) + 1
if n > 19 and n % 19 == 0:
length -= 1
d = []
for i in range(length):
d += list(map(int, input().split()))
start, end = 1, 10
l = []
flag = False
for j in range(1, len(d)+1):
for i in range(0, len(d)):
tmp = ''.join(map(str, d[i:i+j]))
if len(tmp) > ... | s320400392 | s250861057 | p00935 | python | Runtime Error |
n = int(input())
length = int(n / 19) + 1
d = []
for i in range(length):
d += list(map(int, input().split()))
start, end = 1, 10
l = []
flag = False
for j in range(1, len(d)+1):
for i in range(0, len(d)):
tmp = ''.join(map(str, d[i:i+j]))
if len(tmp) > 1 and tmp[0] == '0':
pass
... | n = int(input())
length = int(n / 19) + 1
if n > 19 and n % 19 == 0:
length -= 1
d = []
for i in range(length):
d += list(map(int, input().split()))
start, end = 1, 10
l = []
flag = False
for j in range(1, len(d)+1):
for i in range(0, len(d)):
tmp = ''.join(map(str, d[i:i+j]))
if len(tmp) > ... | s522109018 | s250861057 | p00935 | python | Runtime Error |
from collections import deque
n, m = map(int, input().split())
e = [int(input()) for _ in range(m)]
d = deque(i for i in range(1, n+1))
for v in e[::-1]:
try:
d.remove(v)
print(v)
except ValueError:
pass
while d:
print(d.popleft()) | n, m = map(int, input().split())
e = [int(input()) for _ in range(m)]
b = [1] * (n+1)
for v in e[::-1]:
if b[v]:
b[v] = 0
print(v)
for i in range(1, n+1):
if b[i]:
print(i) | s564678125 | s049215571 | p00946 | python | Time Limit Exceeded |
from collections import deque
n, m = map(int, input().split())
e = [int(input()) for _ in range(m)]
d = deque(i for i in range(1, n+1))
for v in e[::-1]:
try:
d.remove(v)
print(v)
except ValueError:
pass
while d:
print(d.popleft()) | n, m = map(int, input().split())
e = [int(input()) for _ in range(m)]
b = [1] * (n+1)
for v in e[::-1]:
if b[v]:
b[v] = 0
print(v)
for i in range(1, n+1):
if b[i]:
print(i) | s269930852 | s049215571 | p00946 | python | Time Limit Exceeded |
t = int(input())
for _ in range(t):
n = int(input())
h = list(map(int, input().split()))
maxv = 0, minv = 0
for i in range(len(h)-1):
maxv = max(maxv, h[i+1]-h[i])
minv = max(minv, h[i]-h[i+1])
print(maxv, minv) | t = int(input())
for _ in range(t):
n = int(input())
blocks = list(map(int, input().split()))
maxv = minv = 0
for i in range(1, n):
maxv = max(maxv, blocks[i] - blocks[i-1])
minv = max(minv, blocks[i-1] - blocks[i])
print(maxv, minv)
| s569224925 | s084043698 | p01223 | python | Runtime Error |
def nCm(n, k):
C = [1] + [0 for i in range(1, k+1)]
for i in range(1, n+1):
j = min(i, k)
while j > 0:
C[j] += C[j-1]
j -= 1
return C[k]
n = int(input())
k = 1
while nCm(n, k) % 2:
k += 1
print(k) | n = int(input()) + 1
print(n &- n) | s464958038 | s937955572 | p02116 | python | Time Limit Exceeded |
from math import gcd
x, y = map(int, input().split())
print(gcd(x, y)) | x, y = map(int, input().split())
while y>0: x, y = y, x%y
print(x) | s180093388 | s121712902 | p02256 | python | Runtime Error |
from math import gcd
x, y = map(int, input().split())
print(gcd(x, y)) | x, y = map(int, input().split())
while y>0: x, y = y, x%y
print(x) | s375725354 | s121712902 | p02256 | python | Runtime Error |
n = int(input())
l = []
for _ in range(n):
ss = input().split()
order, string = ss[0], ss[1]
if order == "insert":
l.append(string)
else:
print('yes' if string in l else 'no') | n = int(input())
l = {}
for _ in range(n):
ss = input().split()
order, string = ss[0], ss[1]
if order == "insert":
l[string] = 1
else:
print('yes' if string in l else 'no') | s052005537 | s331282989 | p02269 | python | Time Limit Exceeded |
from collections import deque
n = int(input())
l = deque()
for _ in range(n):
ss = input().split()
order, string = ss[0], ss[1]
if order == "insert":
l.append(string)
else:
print('yes' if string in l else 'no') | n = int(input())
l = {}
for _ in range(n):
ss = input().split()
order, string = ss[0], ss[1]
if order == "insert":
l[string] = 1
else:
print('yes' if string in l else 'no') | s436739097 | s331282989 | p02269 | python | Time Limit Exceeded |
def merge(A, left, mid, right):
global cnt
inf = 5000001
n1, n2 = mid - left, right - mid
L, R = A[left:left+n1]+[inf], A[mid:mid+n2]+[inf]
i = j = 0
for k in range(left, right):
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
... | def merge(A, left, mid, right):
global cnt
inf = 100000000001
n1, n2 = mid - left, right - mid
L, R = A[left:left+n1]+[inf], A[mid:mid+n2]+[inf]
i = j = 0
for k in range(left, right):
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
... | s205605474 | s723043875 | p02272 | python | Runtime Error |
def merge(A, left, mid, right):
global cnt
inf = 50000001
n1, n2 = mid - left, right - mid
L, R = A[left:left+n1]+[inf], A[mid:mid+n2]+[inf]
i = j = 0
for k in range(left, right):
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
... | def merge(A, left, mid, right):
global cnt
inf = 100000000001
n1, n2 = mid - left, right - mid
L, R = A[left:left+n1]+[inf], A[mid:mid+n2]+[inf]
i = j = 0
for k in range(left, right):
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
... | s881669549 | s723043875 | p02272 | python | Runtime Error |
def merge(A, left, mid, right):
global cnt
inf = 500000001
n1, n2 = mid - left, right - mid
L, R = A[left:left+n1]+[inf], A[mid:mid+n2]+[inf]
i = j = 0
for k in range(left, right):
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
... | def merge(A, left, mid, right):
global cnt
inf = 100000000001
n1, n2 = mid - left, right - mid
L, R = A[left:left+n1]+[inf], A[mid:mid+n2]+[inf]
i = j = 0
for k in range(left, right):
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
... | s639539595 | s723043875 | p02272 | python | Runtime Error |
def merge(A, left, mid, right):
global cnt
inf = 500000001
n1, n2 = mid - left, right - mid
L, R = A[left:left+n1]+[inf], A[mid:mid+n2]+[inf]
i = j = 0
for k in range(left, right):
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
... | def merge(A, left, mid, right):
global cnt
inf = 100000000001
n1, n2 = mid - left, right - mid
L, R = A[left:left+n1]+[inf], A[mid:mid+n2]+[inf]
i = j = 0
for k in range(left, right):
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
... | s239441587 | s723043875 | p02272 | python | Runtime Error |
def partition(A, p, r):
x = A[r]
i = p-1
for j in range(p, r):
if A[j] <= x:
i += 1
A[i], A[j] = A[j], A[i]
A[i+1], A[r] = A[r], A[i+1]
return i+1
n = int(input())
A = list(map(int, input().split()))
i = partition(A, 0, n)
A[i] = "["+str(A[i])+"]"
print(*A) | def partition(A, p, r):
x = A[r]
i = p-1
for j in range(p, r):
if A[j] <= x:
i += 1
A[i], A[j] = A[j], A[i]
A[i+1], A[r] = A[r], A[i+1]
return i+1
n = int(input())
A = list(map(int, input().split()))
i = partition(A, 0, n-1)
A[i] = "["+str(A[i])+"]"
print(*A) | s394720646 | s874738937 | p02276 | python | Runtime Error |
dice = {v: k for k, v in enumerate(list(map(int, input().split())))}
adjacent = {k: v for k, v in enumerate(sorted(dice.keys()))}
q = int(input())
p = [(-1,2,4,1,3,-1),(3,-1,0,5,-1,2),(1,5,-1,-1,0,4),(4,0,-1,-1,5,1),(2,-1,5,0,-1,3),(-1,3,1,4,2,-1)]
for _ in range(q):
top, front = map(int, input().split())
x = d... | dice = {v: k for k, v in enumerate(list(map(int, input().split())))}
adjacent = {k: v for k, v in enumerate(sorted(dice.keys()))}
q = int(input())
p = [(-1,2,4,1,3,-1),(3,-1,0,5,-1,2),(1,5,-1,-1,0,4),(4,0,-1,-1,5,1),(2,-1,5,0,-1,3),(-1,3,1,4,2,-1)]
for _ in range(q):
top, front = map(int, input().split())
x = d... | s788227405 | s433847069 | p02384 | python | Runtime Error |
dice = {v: k for k, v in enumerate(list(map(int, input().split())))}
adjacent = {k: v for k, v in enumerate(sorted(dice.keys()))}
q = int(input())
p = [(-1,2,4,1,3,-1),(3,-1,0,5,-1,2),(1,5,-1,-1,0,4),(4,0,-1,-1,5,1),(2,-1,5,0,-1,3),(-1,3,1,4,2,-1)]
for _ in range(q):
top, front = map(int, input().split())
x = d... | dice = {v: k for k, v in enumerate(list(map(int, input().split())))}
adjacent = {k: v for k, v in enumerate(sorted(dice.keys()))}
q = int(input())
p = [(-1,2,4,1,3,-1),(3,-1,0,5,-1,2),(1,5,-1,-1,0,4),(4,0,-1,-1,5,1),(2,-1,5,0,-1,3),(-1,3,1,4,2,-1)]
for _ in range(q):
top, front = map(int, input().split())
x = d... | s791172405 | s433847069 | p02384 | python | Runtime Error |
p = [(-1,2,4,1,3,-1),
(3,-1,0,5,-1,2),
(1,5,-1,-1,0,4),
(4,0,-1,-1,5,1),
(2,-1,5,0,-1,3),
(-1,3,1,4,2,-1)]
d1 = list(map(int, input().split()))
top, front, right = d1[0], d1[1], d1[2]
d2 = list(map(int, input().split()))
d1 = {v: k for k, v in enumerate(d1)}
d2 = {v: k for k, v in enumerate(d2... | p = [(-1,2,4,1,3,-1),
(3,-1,0,5,-1,2),
(1,5,-1,-1,0,4),
(4,0,-1,-1,5,1),
(2,-1,5,0,-1,3),
(-1,3,1,4,2,-1)]
d1 = list(map(int, input().split()))
top, front, right = d1[0], d1[1], d1[2]
d2 = list(map(int, input().split()))
da1 = {v: k for k, v in enumerate(d1)}
da2 = {v: k for k, v in enumerate(... | s693655843 | s851861085 | p02385 | python | Runtime Error |
p = [(-1,2,4,1,3,-1),
(3,-1,0,5,-1,2),
(1,5,-1,-1,0,4),
(4,0,-1,-1,5,1),
(2,-1,5,0,-1,3),
(-1,3,1,4,2,-1)]
d1 = list(map(int, input().split()))
top, front, right = d1[0], d1[1], d1[2]
d2 = list(map(int, input().split()))
d1 = {v: k for k, v in enumerate(d1)}
d2 = {v: k for k, v in enumerate(d2... | p = [(-1,2,4,1,3,-1),
(3,-1,0,5,-1,2),
(1,5,-1,-1,0,4),
(4,0,-1,-1,5,1),
(2,-1,5,0,-1,3),
(-1,3,1,4,2,-1)]
d1 = list(map(int, input().split()))
top, front, right = d1[0], d1[1], d1[2]
d2 = list(map(int, input().split()))
da1 = {v: k for k, v in enumerate(d1)}
da2 = {v: k for k, v in enumerate(... | s165022350 | s851861085 | p02385 | python | Runtime Error |
x = input()
print(x*x*x) | x = int(input())
print(x*x*x) | s153297044 | s238847647 | p02388 | python | Runtime Error |
while True:
m, f, r = map(int, input().split())
if (m, f, r) = (-1, -1, -1):
break
if m+f >= 80:
print("A")
elif m+f >= 65 and m+f < 80:
print("B")
elif m+f >= 50 and m+f < 65:
print("C")
elif m+f >= 30 and m+f < 50:
if r >= 50:
print("C")
... | while True:
m, f, r = map(int, input().split())
if (m, f, r) == (-1, -1, -1):
break
if m == -1 or f == -1:
print("F")
elif m+f >= 80:
print("A")
elif m+f >= 65 and m+f < 80:
print("B")
elif m+f >= 50 and m+f < 65:
print("C")
elif m+f >= 30 and m+f < 50... | s914356298 | s334341836 | p02411 | python | Runtime Error |
n, m, l = map(int, input().split())
A = [list(map(int, input().split())) for i in range(n)]
B = [list(map(int, input().split())) for i in range(m)]
C = [[0 for i in range(n)] for j in range(l)]
for i in range(n):
for j in range(l):
for k in range(m):
C[i][j] += A[i][k]*B[k][j]
for i in range(n):... | n, m, l = map(int, input().split())
A = [list(map(int, input().split())) for i in range(n)]
B = [list(map(int, input().split())) for i in range(m)]
C = [[0 for i in range(l)] for j in range(n)]
for i in range(n):
for j in range(l):
for k in range(m):
C[i][j] += A[i][k]*B[k][j]
for i in range(n):... | s002102408 | s825352027 | p02414 | python | Runtime Error |
n, m, l = map(int, input().split())
A = [list(map(int, input().split())) for i in range(n)]
B = [list(map(int, input().split())) for i in range(m)]
C = [[0 for i in range(n)] for j in range(l)]
for i in range(n):
for j in range(l):
for k in range(m):
C[i][j] += A[i][k]*B[k][j]
for i in range(n):... | n, m, l = map(int, input().split())
A = [list(map(int, input().split())) for i in range(n)]
B = [list(map(int, input().split())) for i in range(m)]
C = [[0 for i in range(l)] for j in range(n)]
for i in range(n):
for j in range(l):
for k in range(m):
C[i][j] += A[i][k]*B[k][j]
for i in range(n):... | s876276909 | s825352027 | p02414 | python | Runtime Error |
n = int(input())
st, sh = 0, 0
for i in range(n):
t, h = map(str, input().split())
if ord(t[0]) > ord(h[0]):
st += 3
elif ord(t[0]) < ord(h[1]):
sh += 3
else:
m = h if len(t) > len(h) else t
l = 1
for j in range(m):
if ord(t[j]) > ord(h[j]):
... | n = int(input())
st, sh = 0, 0
for i in range(n):
t, h = map(str, input().split())
if t > h:
st += 3
elif t < h:
sh += 3
else:
st += 1
sh += 1
print(st, sh) | s493461240 | s499601111 | p02421 | python | Runtime Error |
n = int(input())
st, sh = 0, 0
for i in range(n):
t, h = map(str, input().split())
if ord(t[0]) > ord(h[0]):
st += 3
elif ord(t[0]) < ord(h[0]):
sh += 3
else:
m = h if len(t) > len(h) else t
l = 1
for j in range(m):
if ord(t[j]) > ord(h[j]):
... | n = int(input())
st, sh = 0, 0
for i in range(n):
t, h = map(str, input().split())
if t > h:
st += 3
elif t < h:
sh += 3
else:
st += 1
sh += 1
print(st, sh) | s143300348 | s499601111 | p02421 | python | Runtime Error |
def isPrime(x):
if x == 2:
return True
if x < 2 or x % 2 == 0:
return False
i = 3
xx = int(pow(x, 0.5))
while i <= xx:
if x % i == 0:
return False
i += 2
return True
n = int(input())
rx = int(pow(n, 0.5))
l = rx+1
ps = []
for i in range(n):
if is... | n = int(input())
print("{}:".format(n), end='')
x = int(pow(n, 0.5))+1
for i in range(2, x):
while n % i == 0:
print(" {}".format(i), end='')
n //= i
print(' {}'.format(n) if n != 1 else '') | s847852694 | s203729742 | p02467 | python | Runtime Error |
def isPrime(x):
if x == 2:
return True
if x < 2 or x % 2 == 0:
return False
i = 3
xx = int(pow(x, 0.5))
while i <= xx:
if x % i == 0:
return False
i += 2
return True
n = int(input())
rx = int(pow(n, 0.5))
l = rx+1
ps = []
for i in range(n):
if is... | n = int(input())
print("{}:".format(n), end='')
x = int(pow(n, 0.5))+1
for i in range(2, x):
while n % i == 0:
print(" {}".format(i), end='')
n //= i
print(' {}'.format(n) if n != 1 else '') | s815052168 | s203729742 | p02467 | python | Runtime Error |
def isPrime(x):
if x == 2:
return True
if x < 2 or x % 2 == 0:
return False
i = 3
xx = int(pow(x, 0.5))
while i <= xx:
if x % i == 0:
return False
i += 2
return True
n = int(input())
rx = int(pow(n, 0.5))
l = rx+1
ps = []
for i in range(n):
if is... | n = int(input())
print("{}:".format(n), end='')
x = int(pow(n, 0.5))+1
for i in range(2, x):
while n % i == 0:
print(" {}".format(i), end='')
n //= i
print(' {}'.format(n) if n != 1 else '') | s804813522 | s203729742 | p02467 | python | Runtime Error |
def isPrime(x):
if x == 2:
return True
if x < 2 or x % 2 == 0:
return False
i = 3
xx = int(pow(x, 0.5))
while i <= xx:
if x % i == 0:
return False
i += 2
return True
n = int(input())
rx = int(pow(n, 0.5))
l = rx+1
ps = []
for i in range(n):
if is... | n = int(input())
print("{}:".format(n), end='')
x = int(pow(n, 0.5))+1
for i in range(2, x):
while n % i == 0:
print(" {}".format(i), end='')
n //= i
print(' {}'.format(n) if n != 1 else '') | s813529494 | s203729742 | p02467 | python | Time Limit Exceeded |
m, n = map(int, input().split())
print(divmod(pow(m, n), 1000000007)[1]) | m, n = map(int, input().split())
print(pow(m, n, 1000000007)) | s422029737 | s004955400 | p02468 | python | Time Limit Exceeded |
def main():
num = int(input())
for i in range(num):
X = " " + input()
Y = " " + input()
lx = len(X)
ly = len(Y)
max = 0
XY = [[0] * ly for i in range(lx)]
for j in range(1,lx):
for k in range(1,ly):
if X[j] == Y[k]:
... | def main():
num = int(input())
A = []
for i in range(num):
X = input()
Y = " " + input()
lx = len(X)
ly = len(Y)
T = [0] * ly
for j in range(lx):
xj = X[j]
C = T[:]
for k in range(1,ly):
k1 = k-1
... | s219554203 | s440383776 | p02235 | python | Runtime Error |
def main():
num = int(input())
for i in range(num):
X = " " + input()
Y = " " + input()
lx = len(X)
ly = len(Y)
max = 0
XY = [[0] * ly for i in range(lx)]
for j in range(1,lx):
for k in range(1,ly):
if X[j] == Y[k]:
... | def main():
num = int(input())
A = []
for i in range(num):
X = input()
Y = " " + input()
lx = len(X)
ly = len(Y)
T = [0] * ly
for j in range(lx):
xj = X[j]
C = T[:]
for k in range(1,ly):
k1 = k-1
... | s921594859 | s440383776 | p02235 | python | Time Limit Exceeded |
def lcs1d(X,Y):
lx = len(X)
ly = len(Y)
T = [0] * ly
for j in range(1,lx):
C = T[:]
for k in range(1,ly):
k1 = k-1
if X[j] == Y[k]:
T[k] = C[k1] + 1
elif C[k] > T[k1]:
T[k] = C[k]
else:
T[k] =... | def main():
num = int(input())
A = []
for i in range(num):
X = input()
Y = " " + input()
lx = len(X)
ly = len(Y)
T = [0] * ly
for j in range(lx):
xj = X[j]
C = T[:]
for k in range(1,ly):
k1 = k-1
... | s163442422 | s440383776 | p02235 | python | Time Limit Exceeded |
num = int(input())
for i in range(num):
X = " " + input()
Y = " " + input()
lx = len(X)
ly = len(Y)
T = [0] * ly
for j in range(1,lx):
C = T[:]
for k in range(1,ly):
k1 = k-1
if X[j] == Y[k]:
T[k] = C[k1] + 1
elif C[k] > T[k1]:
... | def main():
num = int(input())
A = []
for i in range(num):
X = input()
Y = " " + input()
lx = len(X)
ly = len(Y)
T = [0] * ly
for j in range(lx):
xj = X[j]
C = T[:]
for k in range(1,ly):
k1 = k-1
... | s185635123 | s440383776 | p02235 | python | Time Limit Exceeded |
def main():
num = int(input())
for i in range(num):
X = " " + input()
Y = " " + input()
lx = len(X)
ly = len(Y)
T = [0] * ly
for j in range(1,lx):
C = T[:]
for k in range(1,ly):
k1 = k-1
if X[j] == Y[k]:
... | def main():
num = int(input())
A = []
for i in range(num):
X = input()
Y = " " + input()
lx = len(X)
ly = len(Y)
T = [0] * ly
for j in range(lx):
xj = X[j]
C = T[:]
for k in range(1,ly):
k1 = k-1
... | s579203835 | s440383776 | p02235 | python | Time Limit Exceeded |
def main():
num = int(input())
for i in range(num):
X = " " + input()
Y = " " + input()
lx = len(X)
ly = len(Y)
T = [0] * ly
for j in range(1,lx):
C = T[:]
for k in range(1,ly):
k1 = k-1
if X[j] == Y[k]:
... | def main():
num = int(input())
A = []
for i in range(num):
X = input()
Y = " " + input()
lx = len(X)
ly = len(Y)
T = [0] * ly
for j in range(lx):
xj = X[j]
C = T[:]
for k in range(1,ly):
k1 = k-1
... | s042548141 | s440383776 | p02235 | python | Time Limit Exceeded |
def srch(i, l, Lng, Dst):
if Lng[i] > l:
Lng[i] = l
if Dst[i] is not None and len(Dst[i]) > 0:
for c in Dst[i]:
srch(c,l+1, Lng, Dst)
def main():
num = int(input())
Dst = [None for i in range(num + 1)]
Lng = [999] * (num + 1)
for n in range(1, num+1):
... | def srch(i, l, Lng, Dst):
if Lng[i] != -1 and Lng[i] < l:
return
Lng[i] = l
if Dst[i] is not None and len(Dst[i]) > 0:
for c in Dst[i]:
srch(c,l+1, Lng, Dst)
def main():
num = int(input())
Dst = [None for i in range(num + 1)]
Lng = [-1] * (num + 1)
for n in ... | s261952728 | s866981613 | p02239 | python | Runtime Error |
import sys
def srch(i, end, l, Dst, Lng):
if Lng[i] != -1 and Lng[i] < l:
return
Lng[i] = l
if i == end:
return
if Dst[i] is not None and len(Dst[i]) > 0:
for c in Dst[i]:
srch(c, end, l+1, Dst, Lng)
def main():
istr = sys.stdin.read()
ilist = []
for i i... | import sys
def Grouping(F):
n = len(F)
G = [None for i in range(n)]
for u in range(n):
if G[u] is None:
G[u] = u
S = [u]
while(len(S) > 0):
u1 = S.pop()
for u2 in F[u1]:
if G[u2] is None:
... | s085659536 | s358454757 | p02240 | python | Runtime Error |
import sys
def srch(i, end, l, Dst, Lng):
if Lng[i] != -1 and Lng[i] < l:
return
Lng[i] = l
if i == end:
return
if Dst[i] is not None and len(Dst[i]) > 0:
for c in Dst[i]:
srch(c, end, l+1, Dst, Lng)
def main():
istr = sys.stdin.read()
ilist = []
for i i... | import sys
def Grouping(F):
n = len(F)
G = [None for i in range(n)]
for u in range(n):
if G[u] is None:
G[u] = u
S = [u]
while(len(S) > 0):
u1 = S.pop()
for u2 in F[u1]:
if G[u2] is None:
... | s405559070 | s358454757 | p02240 | python | Time Limit Exceeded |
import sys
def srch(id1, id2, D, L):
cnt = 0
S = [id1]
while(len(S) > 0):
u = S.pop()
#print("cnt:{} id2:{} u:{} D:{} S:{}".format(cnt, id2, u, D[u], S))
if L[u] == -1:
L[u] = cnt
cnt += 1
if u == id2:
return
if D[u] i... | import sys
def Grouping(F):
n = len(F)
G = [None for i in range(n)]
for u in range(n):
if G[u] is None:
G[u] = u
S = [u]
while(len(S) > 0):
u1 = S.pop()
for u2 in F[u1]:
if G[u2] is None:
... | s530335361 | s358454757 | p02240 | python | Time Limit Exceeded |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
?????§?????????
FX????????§????????°?????????????????¨????????????????????¨??§????????????????????????????????¨?????§????????????
????????°????????????100???????????? 1000???????????????????????????????????? 1?????? 108???????????£??????????£??????¨???
(108??? ?????? 10... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
?????§?????????
FX????????§????????°?????????????????¨????????????????????¨??§????????????????????????????????¨?????§????????????
????????°????????????100???????????? 1000???????????????????????????????????? 1?????? 108???????????£??????????£??????¨???
(108??? ?????? 10... | s444071200 | s233601230 | p02258 | python | Time Limit Exceeded |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
???????????£????????????
??\?????????????????????????????????????????£???????????????????£??????????????????????
insert x: ??£?????????????????????????????? x ?????????????´?????¶?????¶???????
delete x: ?????? x ??????????????????????´??????£???????????????????????????... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
???????????£????????????
??\?????????????????????????????????????????£???????????????????£??????????????????????
insert x: ??£?????????????????????????????? x ?????????????´?????¶?????¶???????
delete x: ?????? x ??????????????????????´??????£???????????????????????????... | s982374246 | s583022148 | p02265 | python | Runtime Error |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
???????????£????????????
??\?????????????????????????????????????????£???????????????????£??????????????????????
insert x: ??£?????????????????????????????? x ?????????????´?????¶?????¶???????
delete x: ?????? x ??????????????????????´??????£???????????????????????????... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
???????????£????????????
??\?????????????????????????????????????????£???????????????????£??????????????????????
insert x: ??£?????????????????????????????? x ?????????????´?????¶?????¶???????
delete x: ?????? x ??????????????????????´??????£???????????????????????????... | s952865795 | s583022148 | p02265 | python | Time Limit Exceeded |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
???????????£????????????
??\?????????????????????????????????????????£???????????????????£??????????????????????
insert x: ??£?????????????????????????????? x ?????????????´?????¶?????¶???????
delete x: ?????? x ??????????????????????´??????£???????????????????????????... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
???????????£????????????
??\?????????????????????????????????????????£???????????????????£??????????????????????
insert x: ??£?????????????????????????????? x ?????????????´?????¶?????¶???????
delete x: ?????? x ??????????????????????´??????£???????????????????????????... | s071234378 | s583022148 | p02265 | python | Runtime Error |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
???????????£????????????
??\?????????????????????????????????????????£???????????????????£??????????????????????
insert x: ??£?????????????????????????????? x ?????????????´?????¶?????¶???????
delete x: ?????? x ??????????????????????´??????£???????????????????????????... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
???????????£????????????
??\?????????????????????????????????????????£???????????????????£??????????????????????
insert x: ??£?????????????????????????????? x ?????????????´?????¶?????¶???????
delete x: ?????? x ??????????????????????´??????£???????????????????????????... | s956975721 | s583022148 | p02265 | python | Runtime Error |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
???????????£????????????
??\?????????????????????????????????????????£???????????????????£??????????????????????
insert x: ??£?????????????????????????????? x ?????????????´?????¶?????¶???????
delete x: ?????? x ??????????????????????´??????£???????????????????????????... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
???????????£????????????
??\?????????????????????????????????????????£???????????????????£??????????????????????
insert x: ??£?????????????????????????????? x ?????????????´?????¶?????¶???????
delete x: ?????? x ??????????????????????´??????£???????????????????????????... | s444572851 | s583022148 | p02265 | python | Time Limit Exceeded |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
???????????£????????????
??\?????????????????????????????????????????£???????????????????£??????????????????????
insert x: ??£?????????????????????????????? x ?????????????´?????¶?????¶???????
delete x: ?????? x ??????????????????????´??????£???????????????????????????... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
???????????£????????????
??\?????????????????????????????????????????£???????????????????£??????????????????????
insert x: ??£?????????????????????????????? x ?????????????´?????¶?????¶???????
delete x: ?????? x ??????????????????????´??????£???????????????????????????... | s663684165 | s583022148 | p02265 | python | Time Limit Exceeded |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
???????????£????????????
??\?????????????????????????????????????????£???????????????????£??????????????????????
insert x: ??£?????????????????????????????? x ?????????????´?????¶?????¶???????
delete x: ?????? x ??????????????????????´??????£???????????????????????????... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
???????????£????????????
??\?????????????????????????????????????????£???????????????????£??????????????????????
insert x: ??£?????????????????????????????? x ?????????????´?????¶?????¶???????
delete x: ?????? x ??????????????????????´??????£???????????????????????????... | s940066357 | s583022148 | p02265 | python | Time Limit Exceeded |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
???????????£????????????
??\?????????????????????????????????????????£???????????????????£??????????????????????
insert x: ??£?????????????????????????????? x ?????????????´?????¶?????¶???????
delete x: ?????? x ??????????????????????´??????£???????????????????????????... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
???????????£????????????
??\?????????????????????????????????????????£???????????????????£??????????????????????
insert x: ??£?????????????????????????????? x ?????????????´?????¶?????¶???????
delete x: ?????? x ??????????????????????´??????£???????????????????????????... | s748818357 | s583022148 | p02265 | python | Time Limit Exceeded |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
???????????£????????????
??\?????????????????????????????????????????£???????????????????£??????????????????????
insert x: ??£?????????????????????????????? x ?????????????´?????¶?????¶???????
delete x: ?????? x ??????????????????????´??????£???????????????????????????... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
???????????£????????????
??\?????????????????????????????????????????£???????????????????£??????????????????????
insert x: ??£?????????????????????????????? x ?????????????´?????¶?????¶???????
delete x: ?????? x ??????????????????????´??????£???????????????????????????... | s023845222 | s583022148 | p02265 | python | Time Limit Exceeded |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
???????????£????????????
??\?????????????????????????????????????????£???????????????????£??????????????????????
insert x: ??£?????????????????????????????? x ?????????????´?????¶?????¶???????
delete x: ?????? x ??????????????????????´??????£???????????????????????????... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
???????????£????????????
??\?????????????????????????????????????????£???????????????????£??????????????????????
insert x: ??£?????????????????????????????? x ?????????????´?????¶?????¶???????
delete x: ?????? x ??????????????????????´??????£???????????????????????????... | s307356716 | s583022148 | p02265 | python | Time Limit Exceeded |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
???????????£????????????
??\?????????????????????????????????????????£???????????????????£??????????????????????
insert x: ??£?????????????????????????????? x ?????????????´?????¶?????¶???????
delete x: ?????? x ??????????????????????´??????£???????????????????????????... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
???????????£????????????
??\?????????????????????????????????????????£???????????????????£??????????????????????
insert x: ??£?????????????????????????????? x ?????????????´?????¶?????¶???????
delete x: ?????? x ??????????????????????´??????£???????????????????????????... | s262394836 | s583022148 | p02265 | python | Time Limit Exceeded |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
???????????£????????????
??\?????????????????????????????????????????£???????????????????£??????????????????????
insert x: ??£?????????????????????????????? x ?????????????´?????¶?????¶???????
delete x: ?????? x ??????????????????????´??????£???????????????????????????... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
???????????£????????????
??\?????????????????????????????????????????£???????????????????£??????????????????????
insert x: ??£?????????????????????????????? x ?????????????´?????¶?????¶???????
delete x: ?????? x ??????????????????????´??????£???????????????????????????... | s725571577 | s583022148 | p02265 | python | Time Limit Exceeded |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
???????????£????????????
??\?????????????????????????????????????????£???????????????????£??????????????????????
insert x: ??£?????????????????????????????? x ?????????????´?????¶?????¶???????
delete x: ?????? x ??????????????????????´??????£???????????????????????????... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
???????????£????????????
??\?????????????????????????????????????????£???????????????????£??????????????????????
insert x: ??£?????????????????????????????? x ?????????????´?????¶?????¶???????
delete x: ?????? x ??????????????????????´??????£???????????????????????????... | s013780242 | s583022148 | p02265 | python | Time Limit Exceeded |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
Binary Search
n ????????´??°???????????°??? S ??¨???q ????????°????????´??°???????????°??? T ??????????????????
T ?????????????????´??°????????§ S ?????????????????????????????° C ???????????????????????°????????????????????????????????????
"""
def bsrch(l, a):
""" ... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
Binary Search
n ????????´??°???????????°??? S ??¨???q ????????°????????´??°???????????°??? T ??????????????????
T ?????????????????´??°????????§ S ?????????????????????????????° C ???????????????????????°????????????????????????????????????
"""
def bsrch(l, s, e, a):
... | s542475644 | s038519623 | p02268 | python | Time Limit Exceeded |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
??\????????????????????????????°?????????????????????????????£??????????????????????
insert str: ????????? str ??????????????????
find str: ????????? str ?????????????????´??? 'yes'??¨????????????????????´??? 'no'??¨???????????????
??????????????????????????????'A', '... | import sys
def main():
""" MAIN """
num = int(input().strip())
istr = sys.stdin.read()
cmds = list(istr.splitlines())
D = {}
for i in cmds:
if i[0] == "i":
D[i[7:]] = 1
elif i[0] == "f":
if i[5:] in D:
print("yes")
else:
... | s049435595 | s781746377 | p02269 | python | Runtime Error |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
??\????????????????????????????°?????????????????????????????£??????????????????????
insert str: ????????? str ??????????????????
find str: ????????? str ?????????????????´??? 'yes'??¨????????????????????´??? 'no'??¨???????????????
??????????????????????????????'A', '... | import sys
def main():
""" MAIN """
num = int(input().strip())
istr = sys.stdin.read()
cmds = list(istr.splitlines())
D = {}
for i in cmds:
if i[0] == "i":
D[i[7:]] = 1
elif i[0] == "f":
if i[5:] in D:
print("yes")
else:
... | s456804424 | s781746377 | p02269 | python | Time Limit Exceeded |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
??\????????????????????????????°?????????????????????????????£??????????????????????
insert str: ????????? str ??????????????????
find str: ????????? str ?????????????????´??? 'yes'??¨????????????????????´??? 'no'??¨???????????????
??????????????????????????????'A', '... | import sys
def main():
""" MAIN """
num = int(input().strip())
istr = sys.stdin.read()
cmds = list(istr.splitlines())
D = {}
for i in cmds:
if i[0] == "i":
D[i[7:]] = 1
elif i[0] == "f":
if i[5:] in D:
print("yes")
else:
... | s916460209 | s781746377 | p02269 | python | Time Limit Exceeded |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
Allocation
????????????????????? wi(i=0,1,...n???1) ??? n ??????????????????
????????????????????¢????????????????????????????????????
????????????????????? k ??°?????????????????????????????????
???????????????????????£?¶??????? 0 ?????\??????????????????????????¨????... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
Allocation
????????????????????? wi(i=0,1,...n???1) ??? n ??????????????????
????????????????????¢????????????????????????????????????
????????????????????? k ??°?????????????????????????????????
???????????????????????£?¶??????? 0 ?????\??????????????????????????¨????... | s564514028 | s022725397 | p02270 | python | Time Limit Exceeded |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
Allocation
????????????????????? wi(i=0,1,...n???1) ??? n ??????????????????
????????????????????¢????????????????????????????????????
????????????????????? k ??°?????????????????????????????????
???????????????????????£?¶??????? 0 ?????\??????????????????????????¨????... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
Allocation
????????????????????? wi(i=0,1,...n???1) ??? n ??????????????????
????????????????????¢????????????????????????????????????
????????????????????? k ??°?????????????????????????????????
???????????????????????£?¶??????? 0 ?????\??????????????????????????¨????... | s473938015 | s022725397 | p02270 | python | Time Limit Exceeded |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
Allocation
????????????????????? wi(i=0,1,...n???1) ??? n ??????????????????
????????????????????¢????????????????????????????????????
????????????????????? k ??°?????????????????????????????????
???????????????????????£?¶??????? 0 ?????\??????????????????????????¨????... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
Allocation
????????????????????? wi(i=0,1,...n???1) ??? n ??????????????????
????????????????????¢????????????????????????????????????
????????????????????? k ??°?????????????????????????????????
???????????????????????£?¶??????? 0 ?????\??????????????????????????¨????... | s174471383 | s022725397 | p02270 | python | Time Limit Exceeded |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
????????????
?????? n ?????°??? A ??¨??´??° m ???????????????A ???????´?????????????????????????????´?????¶????????????????
m ???????????????????????????????????????????????°????????????????????????????????????
AA ??????????´???????????????????????????¨?????§???????????... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
????????????
?????? n ?????°??? A ??¨??´??° m ???????????????A ???????´?????????????????????????????´?????¶????????????????
m ???????????????????????????????????????????????°????????????????????????????????????
AA ??????????´???????????????????????????¨?????§???????????... | s385595552 | s026450099 | p02271 | python | Time Limit Exceeded |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
????????????
?????? n ?????°??? A ??¨??´??° m ???????????????A ???????´?????????????????????????????´?????¶????????????????
m ???????????????????????????????????????????????°????????????????????????????????????
AA ??????????´???????????????????????????¨?????§???????????... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
????????????
?????? n ?????°??? A ??¨??´??° m ???????????????A ???????´?????????????????????????????´?????¶????????????????
m ???????????????????????????????????????????????°????????????????????????????????????
AA ??????????´???????????????????????????¨?????§???????????... | s222119985 | s026450099 | p02271 | python | Time Limit Exceeded |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
????????????
?????? n ?????°??? A ??¨??´??° m ???????????????A ???????´?????????????????????????????´?????¶????????????????
m ???????????????????????????????????????????????°????????????????????????????????????
AA ??????????´???????????????????????????¨?????§???????????... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
????????????
?????? n ?????°??? A ??¨??´??° m ???????????????A ???????´?????????????????????????????´?????¶????????????????
m ???????????????????????????????????????????????°????????????????????????????????????
AA ??????????´???????????????????????????¨?????§???????????... | s782903562 | s026450099 | p02271 | python | Time Limit Exceeded |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
?????????????????????Merge Sort??????????????±??????????????\??????????????¢?????´???????????§???
?¬?????????????????£????????????¨?????§????????????
merge(A, left, mid, right)
n1 = mid - left;
n2 = right - mid;
L[0...n1], R[0...n2] ?????????
for i = 0 to n1-1
... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
?????????????????????Merge Sort??????????????±??????????????\??????????????¢?????´???????????§???
?¬?????????????????£????????????¨?????§????????????
merge(A, left, mid, right)
n1 = mid - left;
n2 = right - mid;
L[0...n1], R[0...n2] ?????????
for i = 0 to n1-1
... | s829425009 | s438129074 | p02272 | python | Runtime Error |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
?????????????????????Merge Sort??????????????±??????????????\??????????????¢?????´???????????§???
?¬?????????????????£????????????¨?????§????????????
merge(A, left, mid, right)
n1 = mid - left;
n2 = right - mid;
L[0...n1], R[0...n2] ?????????
for i = 0 to n1-1
... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
?????????????????????Merge Sort??????????????±??????????????\??????????????¢?????´???????????§???
?¬?????????????????£????????????¨?????§????????????
merge(A, left, mid, right)
n1 = mid - left;
n2 = right - mid;
L[0...n1], R[0...n2] ?????????
for i = 0 to n1-1
... | s923965578 | s438129074 | p02272 | python | Time Limit Exceeded |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
def main():
""" ????????? """
num = int(input().strip())
A = list(map(int,input().split()))
cnt = 0
for i in range(num-1):
for j in range(i,num):
if i > j:
cnt++
if cnt % 2 == 0:
cnt += 1
else:
... | MAX = 1000000001
def merge(A, left, mid, right, cnt):
n1 = mid - left
n2 = right - mid
L = A[left:mid]
R = A[mid:right]
ls = len(L)
L.append(MAX)
R.append(MAX)
i = 0
j = 0
for k in range(left, right):
if L[i] <= R[j]:
A[k] = L[i]
i = i + 1
... | s205424197 | s290496742 | p02274 | python | Runtime Error |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
def main():
""" ????????? """
num = int(input().strip())
A = list(map(int,input().split()))
cnt = 0
for i in range(num-1):
for j in range(i,num):
if A[i] > A[j]:
cnt+= 1
print(cnt)
if __name__ == '__main__':
... | MAX = 1000000001
def merge(A, left, mid, right, cnt):
n1 = mid - left
n2 = right - mid
L = A[left:mid]
R = A[mid:right]
ls = len(L)
L.append(MAX)
R.append(MAX)
i = 0
j = 0
for k in range(left, right):
if L[i] <= R[j]:
A[k] = L[i]
i = i + 1
... | s634660537 | s290496742 | p02274 | python | Time Limit Exceeded |
import sys
def swap(A, i, j):
x = A[i]
A[i] = A[j]
A[j] = x
def partition(A, p, r, idx):
x = A[r][idx] # 1 x = A[r]
i = p - 1 # 2 i = p-1
for j in range(p, r): # 3 for j = p to r-1
if A[j][idx] <= x: # 4 if A[j] <= x
i += 1... | def swap(A, i, j):
# print("\tswap Aj:{} Ai:{}\n".format(A[j], A[i]))
x = A[i]
A[i] = A[j]
A[j] = x
def partition(A, p, r):
x = A[r]
i = p - 1
for j in range(p, r):
if A[j] <= x:
i += 1
swap(A, i, j)
# print("j:{} Aj:{} i:{} Ai:{} Ar:{}".format(j, i, A[... | s773487402 | s893709315 | p02276 | python | Runtime Error |
I = 0
L = 1
R = 2
P = 3
B = 4
D = 5
H = 6
def search(N, A, B, num):
""" N ??? Nodes A???Preorder?????? B???Inorder??????
??????????????????????????§??? root ??? index ????????? """
# print(A)
# print(B)
root = A[0]
ld = num
for i in range(num):
if B[i] == root:
ld = i
... | I = 0
L = 1
R = 2
P = 3
B = 4
D = 5
H = 6
def getidx(Tree,value):
idx = -1
for i in range(len(Tree)):
if Tree[i][I] == value:
idx = i
break
return idx
def search(Tree, A, B, num):
root = A[0]
rootidx = getidx(Tree,root)
ld = num
for i in range(num):
... | s114150247 | s546758481 | p02282 | python | Runtime Error |
I = 0
L = 1
R = 2
P = 3
B = 4
D = 5
H = 6
def getidx(Tree,value):
idx = -1
for i in range(len(Tree)):
if Tree[i][I] == value:
idx = i
break
return idx
def search(Tree, A, B, num):
""" Tree ??? Tree A???Preorder?????? B???Inorder??????
??????????????????????????§... | I = 0
L = 1
R = 2
P = 3
B = 4
D = 5
H = 6
def getidx(Tree,value):
idx = -1
for i in range(len(Tree)):
if Tree[i][I] == value:
idx = i
break
return idx
def search(Tree, A, B, num):
root = A[0]
rootidx = getidx(Tree,root)
ld = num
for i in range(num):
... | s341251132 | s546758481 | p02282 | python | Runtime Error |
import sys
YES = "yes"
NO = "no"
class Node:
def __init__(self, value, p = None, l = None, r = None):
self.key = value
self.p = p
self.left = l
self.right = r
def chgchild(parent, old, new = None):
if parent == None:
return
else:
# print("parent:{}".format(... |
import sys
YES = "yes"
NO = "no"
class Node:
def __init__(self, value, p = None, l = None, r = None):
self.key = value
self.p = p
self.left = l
self.right = r
def chgchild(parent, old, new = None):
if parent == None:
return
else:
# print("\tparent:{}".forma... | s423814458 | s065554197 | p02285 | python | Runtime Error |
def swap(A, x, y):
i = A[x]
A[x] = A[y]
A[y] = i
def left(i):
return ((i+1) * 2) - 1
def right(i):
return (i+1) * 2
def maxHeapify(A, i, H):
l = left(i)
r = right(i)
# print("i:{} left:{} right:{} MAX:{}".format(i,l,r,H))
# ????????????????????????????????§???????????§???????????... | import sys
def extractMax(A):
x = A[0]
A[0] = A[-1]
A.pop()
H = len(A)
i = 0
while i < H: # ???????????????
v = A[i]
rv = 0
lv = 0
r = (i+1) * 2
l = r - 1
if l < H:
lv = A[l]
if r < H:
rv = A[r]
if ... | s556057415 | s423175365 | p02289 | python | Time Limit Exceeded |
def extractMax(A):
x = A[0]
A[0] = A[-1]
A.pop()
H = len(A)
i = 0
while i < H:
r = (i+1) * 2
l = r - 1
if l < H:
lv = A[l]
else:
lv = 0
if r < H:
rv = A[r]
else:
rv = 0
if lv == 0 and rv == 0:... | import sys
def extractMax(A):
x = A[0]
A[0] = A[-1]
A.pop()
H = len(A)
i = 0
while i < H: # ???????????????
v = A[i]
rv = 0
lv = 0
r = (i+1) * 2
l = r - 1
if l < H:
lv = A[l]
if r < H:
rv = A[r]
if ... | s326807284 | s423175365 | p02289 | python | Time Limit Exceeded |
def extractMax(A):
x = A[0]
A[0] = A[-1]
A.pop()
H = len(A)
i = 0
while i < H:
r = (i+1) * 2
l = r - 1
if l < H:
lv = A[l]
else:
lv = 0
if r < H:
rv = A[r]
else:
rv = 0
if lv == 0 and rv == 0:... | import sys
def extractMax(A):
x = A[0]
A[0] = A[-1]
A.pop()
H = len(A)
i = 0
while i < H: # ???????????????
v = A[i]
rv = 0
lv = 0
r = (i+1) * 2
l = r - 1
if l < H:
lv = A[l]
if r < H:
rv = A[r]
if ... | s006361410 | s423175365 | p02289 | python | Time Limit Exceeded |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
?????¢
"""
import math
x1, y1, x2, y2 = map(int,input().strip().split())
x = x1 - x2
y = y1 - y2
distance = math.sqrt(x * x + y * y)
print(distance) | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
?????¢
"""
import math
x1, y1, x2, y2 = map(float,input().strip().split())
x = x1 - x2
y = y1 - y2
distance = math.sqrt(x * x + y * y)
print(distance) | s326201057 | s987487934 | p02379 | python | Runtime Error |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
???????????? 4
?¬?????±??????????????????????????????????????????¢??????????????\??¬????????§????????????????????°????????????????????????????????????
+--+
???|???|
+--+--+--+--+
|???|???|???|???|
+--+--+--+--+
???|???|
+--+
"""
class Dice:
T = 0
S = ... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
???????????? 4
?¬?????±??????????????????????????????????????????¢??????????????\??¬????????§????????????????????°????????????????????????????????????
+--+
???|???|
+--+--+--+--+
|???|???|???|???|
+--+--+--+--+
???|???|
+--+
"""
class Dice:
T = 0
S = ... | s980857138 | s985946327 | p02386 | python | Runtime Error |
# -*- coding: utf-8 -*-
for c in range(3000):
l = input().strip().split()
x = int(l[0])
y = int(l[1])
if(x < 1 and y < 0):
break
elif(x > y):
print("Case {0}: {1}".format(y,x))
else:
print("Case {0}: {1}".format(x,y)) | # -*- coding: utf-8 -*-
for c in range(3000):
l = input().strip().split()
x = int(l[0])
y = int(l[1])
if((x < 1) and (y < 1)):
break
elif(x > y):
print("{0} {1}".format(y,x))
else:
print("{0} {1}".format(x,y)) | s192571589 | s405687628 | p02397 | python | Runtime Error |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.