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 |
|---|---|---|---|---|---|---|
out = []
append = out.append
cnt = int(raw_input())
while cnt > 0:
trans = {}
for i in range(cnt):
k,v = raw_input().split()
trans[k] = v.rsplit()
leng = int(raw_input())
ans = ''
for i in range(leng):
load = raw_input().rsplit()
ans += (load in trans and trans[load])... | out = []
while True:
n = int(raw_input())
if n == 0: break
trans = {}
for i in range(n):
k,v = raw_input().split()
trans[k] = v.rstrip()
cnt = int(raw_input())
res = ""
for j in range(cnt):
a = raw_input().rstrip()
if a in trans: a = trans[a]
res += a
out.append(res)
for o in out: pr... | s441829454 | s774399513 | p00424 | python | Runtime Error |
out = []
while True:
n = int(raw_input())
if n == 0: break
trans = {}
for i in range(n):
k,v = raw_input().split()
trans[k] = v.rstrip()
cnt = int(raw_input())
res = ""
for j in range(n):
a = raw_input().rstrip()
if a in trans: a = trans[a]
res += a
out.append(a)
for o in out: print ... | out = []
while True:
n = int(raw_input())
if n == 0: break
trans = {}
for i in range(n):
k,v = raw_input().split()
trans[k] = v.rstrip()
cnt = int(raw_input())
res = ""
for j in range(cnt):
a = raw_input().rstrip()
if a in trans: a = trans[a]
res += a
out.append(res)
for o in out: pr... | s645768337 | s774399513 | p00424 | python | Runtime Error |
def fact(a): return a and a*fact(a-1) or 1
n,m,r = map(int,input().split())
r-=n*m
if r < 0:
print(0)
else:
print(fact(r+n-1)//fact(n-1)//fact(r)) | def fact(n):
res = 1
for i in range(1, n+1):
res *= i
return res
def combination(n, k):
return fact(n)//fact(n-k)//fact(k)
n, m, r = list(map(int, input().split()))
print(combination(r - n*m + n - 1, n-1)) | s265334331 | s795097093 | p00514 | python | Runtime Error |
def operate( cmd, text, cur ):
lentxt = len(text)
if cmd == "forward char":
if cur < lentxt: cur += 1
elif cmd == "backward char":
if cur > 0: cur -= 1
elif cmd == "forward word":
while cur < lentxt and text[cur] == ' ': cur += 1
while cur < lentxt and text[cur] != ' ': c... | def operate( cmd, text, cur ):
lentxt = len(text)
if cmd == "forward char":
if cur < lentxt: cur += 1
elif cmd == "backward char":
if cur > 0: cur -= 1
elif cmd == "forward word":
while cur < lentxt and text[cur] == ' ': cur += 1
while cur < lentxt and text[cur] != ' ': c... | s283229828 | s543830833 | p00683 | python | Runtime Error |
while True:
n, m, a = map(int, input().split())
if n + m + a == 0:
break
lines = list(reversed(sorted([tuple(map(int, input().split())) for _ in range(m)])))
replace = list(range(1, n+1))
for l in lines:
h, p, q = l
p -= 1
q -= 1
replace[p], replace[q] =... |
while True:
# num_columns: ????£?????????°
# num_lines: ?¨??£?????????°(???????????????2????´???????????????°)
# entry: ????????????????????????????§?????????´????????????
num_columns, num_lines, entry = map(int, input().split())
if num_columns == 0 and num_lines == 0 and entry == 0:
brea... | s329578307 | s172242748 | p01126 | python | Runtime Error |
from sys import stdin
d_num = int(stdin.readline().strip())
graph = [[] for _ in range(d_num+1)]
for _ in range(d_num):
u, k, *neighbors = map(int, stdin.readline().split())
for v in neighbors:
graph[u].append(v)
visited = set()
timestamps = [None for _ in range(d_num+1)]
def dfs(u, stmp):
visit... | from sys import stdin
d_num = int(stdin.readline().strip())
graph = [[] for _ in range(d_num+1)]
for _ in range(d_num):
u, k, *neighbors = map(int, stdin.readline().split())
for v in neighbors:
graph[u].append(v)
visited = set()
timestamps = [None for _ in range(d_num+1)]
def dfs(u, stmp):
visit... | s861036808 | s573931392 | p02238 | python | Runtime Error |
import sys
def get_prime_list(max_num):
res = range(2, max_num + 1)
for i in range(2, max_num/2 + 1):
res = filter(lambda x: not ((x % i == 0) and (x != i)), res)
return res
def is_include(array, num):
right = len(array) - 1
left = 0
while right >= left:
index = (right ... | n = int(input())
ans = 0
for x in (int(input()) for _ in range(n)):
flg = True
for y in range(2, int(x**0.5+1)):
if x % y == 0:
flg = False
break
if flg:
ans += 1
print(ans) | s762896750 | s210184539 | p02257 | python | Time Limit Exceeded |
class Node(object):
def __init__(self, num, prv = None, nxt = None):
self.num = num
self.prv = prv
self.nxt = nxt
class DoublyLinkedList(object):
def __init__(self):
self.start = self.last = None
def insert(self, num):
new_elem = Node(num)
if self.start is... | class Node(object):
def __init__(self, num, prv = None, nxt = None):
self.num = num
self.prv = prv
self.nxt = nxt
class DoublyLinkedList(object):
def __init__(self):
self.start = self.last = None
def insert(self, num):
new_elem = Node(num)
if self.star... | s204053454 | s089433615 | p02265 | python | Time Limit Exceeded |
class Node(object):
def __init__(self, num, prv = None, nxt = None):
self.num = num
self.prv = prv
self.nxt = nxt
class DoublyLinkedList(object):
def __init__(self):
self.start = self.last = None
def insert(self, num):
new_elem = Node(num)
if self.start is... | class Node(object):
def __init__(self, num, prv = None, nxt = None):
self.num = num
self.prv = prv
self.nxt = nxt
class DoublyLinkedList(object):
def __init__(self):
self.start = self.last = None
def insert(self, num):
new_elem = Node(num)
if self.star... | s364116769 | s089433615 | p02265 | python | Runtime Error |
import sys
class Node:
def __init__(self, num):
self.prev = None
self.next_node = None
self.num = num
def delete(self):
if self.prev is not None:
self.prev.next_node = self.next_node
if self.next_node is not None:
self.next_node.prev = self.prev
... | class Node(object):
def __init__(self, num, prv = None, nxt = None):
self.num = num
self.prv = prv
self.nxt = nxt
class DoublyLinkedList(object):
def __init__(self):
self.start = self.last = None
def insert(self, num):
new_elem = Node(num)
if self.star... | s044459750 | s089433615 | p02265 | python | Time Limit Exceeded |
import sys
class Node:
def __init__(self, num):
self.prev = None
self.next_node = None
self.num = num
def delete(self):
if self.prev is not None:
self.prev.next_node = self.next_node
if self.next_node is not None:
self.next_node.prev = self.prev
... | class Node(object):
def __init__(self, num, prv = None, nxt = None):
self.num = num
self.prv = prv
self.nxt = nxt
class DoublyLinkedList(object):
def __init__(self):
self.start = self.last = None
def insert(self, num):
new_elem = Node(num)
if self.star... | s335818797 | s089433615 | p02265 | python | Time Limit Exceeded |
import sys
class Node:
def __init__(self, num):
self.prev = None
self.next_node = None
self.num = num
def delete(self):
if self.prev is not None:
self.prev.next_node = self.next_node
if self.next_node is not None:
self.next_node.prev = self.prev
... | class Node(object):
def __init__(self, num, prv = None, nxt = None):
self.num = num
self.prv = prv
self.nxt = nxt
class DoublyLinkedList(object):
def __init__(self):
self.start = self.last = None
def insert(self, num):
new_elem = Node(num)
if self.star... | s508234152 | s089433615 | p02265 | python | Time Limit Exceeded |
import sys
class Node:
def __init__(self, num):
self.prev = None
self.next_node = None
self.num = num
def delete(self):
if self.prev is not None:
self.prev.next_node = self.next_node
if self.next_node is not None:
self.next_node.prev = self.prev
... | class Node(object):
def __init__(self, num, prv = None, nxt = None):
self.num = num
self.prv = prv
self.nxt = nxt
class DoublyLinkedList(object):
def __init__(self):
self.start = self.last = None
def insert(self, num):
new_elem = Node(num)
if self.star... | s396928111 | s089433615 | p02265 | python | Time Limit Exceeded |
from sys import stdin
class Node:
def __init__(self, num):
self.prev = None
self.next_node = None
self.num = num
def delete(self):
if self.prev is not None:
self.prev.next_node = self.next_node
if self.next_node is not None:
self.next_node.prev = ... | class Node(object):
def __init__(self, num, prv = None, nxt = None):
self.num = num
self.prv = prv
self.nxt = nxt
class DoublyLinkedList(object):
def __init__(self):
self.start = self.last = None
def insert(self, num):
new_elem = Node(num)
if self.star... | s394046237 | s089433615 | p02265 | python | Time Limit Exceeded |
from sys import stdin
class Node:
def __init__(self, num):
self.prev = None
self.next_node = None
self.num = num
def delete(self):
if self.prev is not None:
self.prev.next_node = self.next_node
if self.next_node is not None:
self.next_node.prev = ... | class Node(object):
def __init__(self, num, prv = None, nxt = None):
self.num = num
self.prv = prv
self.nxt = nxt
class DoublyLinkedList(object):
def __init__(self):
self.start = self.last = None
def insert(self, num):
new_elem = Node(num)
if self.star... | s529008081 | s089433615 | p02265 | python | Time Limit Exceeded |
from sys import stdin
class Node:
def __init__(self, num):
self.prev = None
self.next_node = None
self.num = num
def delete(self):
if self.prev is not None:
self.prev.next_node = self.next_node
if self.next_node is not None:
self.next_node.prev = ... | class Node(object):
def __init__(self, num, prv = None, nxt = None):
self.num = num
self.prv = prv
self.nxt = nxt
class DoublyLinkedList(object):
def __init__(self):
self.start = self.last = None
def insert(self, num):
new_elem = Node(num)
if self.star... | s998089063 | s089433615 | p02265 | python | Time Limit Exceeded |
sec = int(input())
print('{}:{}:{}'.format(sec//3600, (sec//60)%60, sec%60)javascript:void(0) | sec = int(input())
print('{}:{}:{}'.format(sec//3600, (sec//60)%60, sec%60)) | s444861941 | s405650609 | p02390 | python | Runtime Error |
a,b = map(int,raw_input().split(' '))
print a*b 2*(a+b) | a,b = map(int,raw_input().split(' '))
print a*b,2*(a+b) | s044082673 | s027575578 | p02481 | python | Runtime Error |
from sys import stdin
x = [int(input()) for i range(10)]
x.sort(reverse=True)
for i in x[:3]: print(i) | from sys import stdin
x = [int(input()) for i in range(10)]
x.sort(reverse=True)
for i in x[:3]: print(i) | s837829729 | s726815866 | p00001 | python | Runtime Error |
from sys import stdin
x = [int(input()) for i range(10)]
x.sort(reverse=True)
for i in x[:3]: print(i) | from sys import stdin
x = [int(input()) for i in range(10)]
x.sort(reverse=True)
for i in x[:3]: print(i) | s025229258 | s726815866 | p00001 | python | Runtime Error |
import sys, string
alpha = 'abcdefghijklmnopqrstuvwxyza'
t = string.maketrans(alpha[:-1], alpha[1:])
for s in sys.stdin:
while not('the' in s or 'this' in s or 'than' in s):
s = s.translate(t)
print s | import sys, string
alpha = 'abcdefghijklmnopqrstuvwxyza'
tbl = string.maketrans(alpha[:-1], alpha[1:])
for s in sys.stdin:
while not('the' in s or 'this' in s or 'that' in s):
s = s.translate(tbl)
print s[:-1] | s859136077 | s977061343 | p00017 | python | Time Limit Exceeded |
import sys, string
alpha = 'abcdefghijklmnopqrstuvwxyza'
t = string.maketrans(alpha[:-1], alpha[1:])
for s in sys.stdin:
while not('the' in s or 'this' in s or 'than' in s):
s = s.translate(t)
print s[:-1] | import sys, string
alpha = 'abcdefghijklmnopqrstuvwxyza'
tbl = string.maketrans(alpha[:-1], alpha[1:])
for s in sys.stdin:
while not('the' in s or 'this' in s or 'that' in s):
s = s.translate(tbl)
print s[:-1] | s339352296 | s977061343 | p00017 | python | Time Limit Exceeded |
import sys, string
alpha = 'abcdefghijklmnopqrstuvwxyza'
tbl = string.maketrans(alpha[:-1], alpha[1:])
for s in sys.stdin:
while not('the' in s or 'this' in s or 'than' in s):
s = s.translate(tbl)
print s[:-1] | import sys, string
alpha = 'abcdefghijklmnopqrstuvwxyza'
tbl = string.maketrans(alpha[:-1], alpha[1:])
for s in sys.stdin:
while not('the' in s or 'this' in s or 'that' in s):
s = s.translate(tbl)
print s[:-1] | s397044962 | s977061343 | p00017 | python | Time Limit Exceeded |
#include <iostream>
using namespace std;
int m[12][12];
bool valid(int y, int x){
if(0 <= y && y < 12){
if(0 <= x && x < 12){
if(m[y][x] == 1) return true;
}
}
return false;
}
void remove_island(int y, int x) {
int nx, ny;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
m[y][x]... | def get_map():
map = []
while True:
try:
tmp = list(raw_input())
if len(tmp) != 12: break
map.append(tmp)
except:
break
return map
def remove_island(x, y, map):
map[x][y] = 0
move = [[1, 0], [0, 1], [-1, 0], [0, -1]]
for i, j in move:
if 0 <= x + i <= 11 and 0 <= y + j <... | s619501160 | s877356232 | p00067 | python | Runtime Error |
import sys, math
step = [1,1,2,4] + [0]*26
for i in range(4,30):
step[i] = step[i-1] + step[i-2] + step[i-3]
for s in sys.stdin:
n = int(s)
if n == 0: break
print int(math.ceil(step[n]/3650.0)) | import math
steps=[1, 1, 2, 4]+ [0]*27
for i in range(4, 31):
steps[i] = steps[i-1] + steps[i-2] + steps[i-3]
while True:
n = input()
if n == 0: break
print int(math.ceil(steps[n]/3650.0)) | s773879893 | s141018739 | p00168 | python | Runtime Error |
import sys, math
step = [1,1,2,4] + [0]*26
for i in range(4,31):
step[i] = step[i-1] + step[i-2] + step[i-3]
for s in sys.stdin:
n = int(s)
if n == 0: break
print int(math.ceil(step[n]/3650.0)) | import math
steps=[1, 1, 2, 4]+ [0]*27
for i in range(4, 31):
steps[i] = steps[i-1] + steps[i-2] + steps[i-3]
while True:
n = input()
if n == 0: break
print int(math.ceil(steps[n]/3650.0)) | s282302819 | s141018739 | p00168 | python | Runtime Error |
import math
step = [1,1,2,4] + [0]*27
for i in range(4,31):
step[i] = step[i-1] + step[i-2] + step[i-3]
while True:
n = int(s)
if n == 0: break
print int(math.ceil(step[n]/3650.0)) | import math
steps=[1, 1, 2, 4]+ [0]*27
for i in range(4, 31):
steps[i] = steps[i-1] + steps[i-2] + steps[i-3]
while True:
n = input()
if n == 0: break
print int(math.ceil(steps[n]/3650.0)) | s117989403 | s141018739 | p00168 | python | Runtime Error |
from sys import stdin
import math
lines = [line for line in stdin]
for line in lines:
a, b = [float(n) for n in line]
print(math.floor(math.log10(a + b)))
# x1, y1, x2, y2, x3, y3, xp, yp = [float(r) for r in line]
# print(x1, y1, x2, y2, x3, y3, xp, yp) | from sys import stdin
import math
import fileinput
for line in fileinput.input():
a, b = [int(n) for n in line.split()]
print(math.floor(math.log10(a + b) + 1))
# x1, y1, x2, y2, x3, y3, xp, yp = [float(r) for r in line]
# print(x1, y1, x2, y2, x3, y3, xp, yp) | s731333626 | s158306742 | p00002 | python | Runtime Error |
import sys
#list = sys.stdin.readlines()
i=0
list = []
for line in sys.stdin.readlines():
list.append(int(line.strip("\n")))
print soted(list, reverse=True)[0]
print soted(list, reverse=True)[1]
print soted(list, reverse=True)[2] | import sys
#list = sys.stdin.readlines()
i=0
list = []
for line in sys.stdin.readlines():
list.append(int(line.strip("\n")))
print sorted(list, reverse=True)[0]
print sorted(list, reverse=True)[1]
print sorted(list, reverse=True)[2] | s877724815 | s827339834 | p00001 | python | Runtime Error |
# PrimeNumber
from itertools import product
import math
def nOfPrime(m):
return m * 2
if __name__ == "__main__":
while True:
try:
n = int(input())
prm = 1
nlist = []
nlist2 = []
plist = []
for i in range(2, n + 1):
... | if __name__ == "__main__":
maxn = 1000000
plist = [False if i%2==0 or i%3==0 or i%5==0 else True for i in range(maxn)]
plist[0] = plist[1] = False
plist[2] = plist[3] = plist[5] = True
for chki in range(3, maxn, 2):
for j in range(chki**2, maxn, chki):
plist[j] = False
while True:
try:
#start = time.... | s302976155 | s659054472 | p00009 | python | Runtime Error |
# PrimeNumber
from itertools import product
import math
if __name__ == "__main__":
while True:
try:
n = int(input())
nlist = []
nlist2 = []
plist = []
for i in range(2, n + 1):
nlist.append(i) # [2,3,4,5,6,...,n]
wh... | if __name__ == "__main__":
maxn = 1000000
plist = [False if i%2==0 or i%3==0 or i%5==0 else True for i in range(maxn)]
plist[0] = plist[1] = False
plist[2] = plist[3] = plist[5] = True
for chki in range(3, maxn, 2):
for j in range(chki**2, maxn, chki):
plist[j] = False
while True:
try:
#start = time.... | s820709123 | s659054472 | p00009 | python | Runtime Error |
# PrimeNumber
from itertools import product
import math
if __name__ == "__main__":
while True:
try:
n = int(input())
nlist = []
nlist2 = []
plist = []
for i in range(2, n + 1):
nlist.append(i) # [2,3,4,5,6,...,n]
wh... | if __name__ == "__main__":
maxn = 1000000
plist = [False if i%2==0 or i%3==0 or i%5==0 else True for i in range(maxn)]
plist[0] = plist[1] = False
plist[2] = plist[3] = plist[5] = True
for chki in range(3, maxn, 2):
for j in range(chki**2, maxn, chki):
plist[j] = False
while True:
try:
#start = time.... | s353639755 | s659054472 | p00009 | python | Runtime Error |
# PrimeNumber
# エラトステネスの篩
from itertools import product
import math
if __name__ == "__main__":
while True:
try:
# 数値の入力があった
n = int(input())
nlist = []
nlist2 = []
plist = []
# for i in range(2, n + 1):
# nlist.append(... | if __name__ == "__main__":
maxn = 1000000
plist = [False if i%2==0 or i%3==0 or i%5==0 else True for i in range(maxn)]
plist[0] = plist[1] = False
plist[2] = plist[3] = plist[5] = True
for chki in range(3, maxn, 2):
for j in range(chki**2, maxn, chki):
plist[j] = False
while True:
try:
#start = time.... | s557591073 | s659054472 | p00009 | python | Runtime Error |
# PrimeNumber
# エラトステネスの篩
from itertools import product
import math
if __name__ == "__main__":
while True:
try:
# 数値の入力があった
n = int(input())
nlist = []
nlist2 = []
plist = []
# for i in range(2, n + 1):
# nlist.append(... | if __name__ == "__main__":
maxn = 1000000
plist = [False if i%2==0 or i%3==0 or i%5==0 else True for i in range(maxn)]
plist[0] = plist[1] = False
plist[2] = plist[3] = plist[5] = True
for chki in range(3, maxn, 2):
for j in range(chki**2, maxn, chki):
plist[j] = False
while True:
try:
#start = time.... | s201996930 | s659054472 | p00009 | python | Runtime Error |
# PrimeNumber
# エラトステネスの篩
import math
if __name__ == "__main__":
while True:
try:
# 数値の入力があった
n = int(input())
nlist = []
nlist2 = []
plist = []
# for i in range(2, n + 1):
# nlist.append(i) # [2,3,4,5,6,...,n]
... | if __name__ == "__main__":
maxn = 1000000
plist = [False if i%2==0 or i%3==0 or i%5==0 else True for i in range(maxn)]
plist[0] = plist[1] = False
plist[2] = plist[3] = plist[5] = True
for chki in range(3, maxn, 2):
for j in range(chki**2, maxn, chki):
plist[j] = False
while True:
try:
#start = time.... | s636571932 | s659054472 | p00009 | python | Runtime Error |
if __name__ == "__main__":
nset = int(input())
for i in range(0, nset):
sa = input()
sb = input()
a = int(sa)
b = int(sb)
c = a + b
if len(sa) > 80 or len(sb) > 80 or len(str(c)) > 80:
print("overflow")
else:
print(c) | if __name__ == "__main__":
nset = int(input())
for i in range(0, nset):
sa = input()
sb = input()
a = int(sa)
b = int(sb)
c = a + b
if len(sa) > 80 or len(sb) > 80 or len(str(c)) > 80:
print("overflow")
else:
print(c) | s980090524 | s274296928 | p00015 | python | Runtime Error |
# Edit: 2014/11/15
# Lang: Python3
# Time: 00.xxs
# File: pc0021.py
if __name__ == "__main__":
nset = int(input())
for i in range(0, nset):
x1, y1, x2, y2, x3, y3, x4, y4 = list(map(float, input().strip("\n").split(" ")))
vABx = x2 - x1
vABy = y2 - y1
vCDx = x4 - x3
... | # Edit: 2014/11/15
# Lang: Python3
# Time: 00.xxs
# File: pc0021.py
if __name__ == "__main__":
nset = int(input())
for i in range(0, nset):
x1, y1, x2, y2, x3, y3, x4, y4 = list(map(float, input().strip("\n").split(" ")))
vABx = x2 - x1
vABy = y2 - y1
vCDx = x4 - x3
... | s157400132 | s023488041 | p00021 | python | Runtime Error |
# Edit: 2014/11/15
# Lang: Python3
# Time: 00.xxs
# File: pc0021.py
if __name__ == "__main__":
nset = int(input())
for i in range(0, nset):
x1, y1, x2, y2, x3, y3, x4, y4 = list(map(float, input().strip("\n").split(" ")))
vABx = x2 - x1
vABy = y2 - y1
vCDx = x4 - x3
... | # Edit: 2014/11/15
# Lang: Python3
# Time: 00.xxs
# File: pc0021.py
if __name__ == "__main__":
nset = int(input())
for i in range(0, nset):
x1, y1, x2, y2, x3, y3, x4, y4 = list(map(float, input().strip("\n").split(" ")))
vABx = x2 - x1
vABy = y2 - y1
vCDx = x4 - x3
... | s852123499 | s023488041 | p00021 | python | Runtime Error |
n = int(input())
# print("n:",n)
hl = []
for i in range(n):
hl.append(int(input()))
#print(hl)
#hl = [5, 5]
#hl = [10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
# hl = [1,2,3,4,5]
#hl = [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
i = 0
ans = 1
"""
for h in hl:
d = i/... | # Edit: 2014/09/14
# Lang: Python3
# Time: .00s
if __name__ == "__main__":
n = int(input())
# print("n:",n)
hl = []
for i in range(n):
hl.append(int(input()))
# print(hl)
# hl = [5, 5]
# hl = [10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
# hl = [1,2,3,4,5]
# hl = [1, 1, 1, 1, ... | s438399428 | s430723703 | p00992 | python | Runtime Error |
from collections import Counter
def add(s, tw):
if tw in s:
s[tw] += 1
else:
s[tw] = 1
while 1:
ws, hs, w, h = {}, {}, [], []
n, m = map(int, raw_input().split())
if n|m == 0: break
for i in range(n):
t = s = input()
add(ws, s)
for pw in reversed(w):
... | from collections import defaultdict
while 1:
ws, hs, w, h = defaultdict(int), defaultdict(int), [], []
n, m = map(int, raw_input().split())
if n|m == 0: break
for i in range(n):
t = s = input()
ws[s]+=1
for pw in reversed(w):
s+=pw
ws[s]+=1
w.app... | s007877628 | s374259387 | p01140 | python | Runtime Error |
from collections import defaultdict
while 1:
ws, hs, w, h = defaultdict(lambda:0), defaultdict(lambda:0), [], []
n, m = map(int, raw_input().split())
if n|m == 0: break
for i in range(n):
t = s = input()
ws[s]+=1
for pw in reversed(w):
s+=pw
ws[s]+=1
... | from collections import defaultdict
while 1:
ws, hs, w, h = defaultdict(int), defaultdict(int), [], []
n, m = map(int, raw_input().split())
if n|m == 0: break
for i in range(n):
t = s = input()
ws[s]+=1
for pw in reversed(w):
s+=pw
ws[s]+=1
w.app... | s054582194 | s374259387 | p01140 | python | Runtime Error |
while 1:
i = input().split()
if not i:
break
print(len(str(sum(map(int, i))))) | try:
while 1:
print(len(str(sum(map(int, input().split())))))
except Exception:
pass | s846258609 | s608659542 | p00002 | python | Runtime Error |
while 1:
i = input()
if not i:
break
print(len(str(sum(map(int, i.split()))))) | try:
while 1:
print(len(str(sum(map(int, input().split())))))
except Exception:
pass | s697070536 | s608659542 | p00002 | python | Runtime Error |
while 1:
try:
y = 4.9 * (float(input()) / 9.8) ** 2
N = 1
while N * 5 - 5 < y:
N += 1
print(N)
except:
pass | try:
while 1:
y = 4.9 * (float(input()) / 9.8) ** 2
N = 1
while N * 5 - 5 < y:
N += 1
print(N)
except:
pass | s600820540 | s694621031 | p00024 | python | Time Limit Exceeded |
def f2(cnt, n, ci):
if n < ci:
return 0
elif n == ci and cnt > 1:
return 0
elif n == ci and cnt == 1:
return 1
else:
v = f2(cnt - 1, n - ci, ci + 1)
v += f2(cnt, n, ci + 1)
return v
while 1:
n, s = map(int, input().split())
if n == 0 and s == 0:
... | def f2(cnt, n, ci):
if ci >= 10 or n > 45:
return 0
elif n < ci:
return 0
elif n == ci and cnt > 1:
return 0
elif n == ci and cnt == 1:
return 1
else:
v = f2(cnt - 1, n - ci, ci + 1)
v += f2(cnt, n, ci + 1)
return v
while 1:
n, s = map(in... | s617384707 | s861783603 | p00030 | python | Time Limit Exceeded |
from collections import Counter
n, q = list(map(int, input().split()))
cnt = Counter()
for _ in range(q):
a, v = list(map(int, input().split()))
cnt[a] += v
mx = max(cnt.values())
if mx == 0:
print("1 0")
else:
print(str(min([key for key, value in cnt.items() if value == mx])) + ' '... | n, q = list(map(int, input().split()))
cnt = [0 for _ in range(n + 1)]
cnt[0] = -9999999999
mx = [0, cnt[0]]
def spam():
max_v = max(cnt)
idx = min([i for i, value in enumerate(cnt) if value == max_v])
return idx, max_v
for _ in range(q):
a, v = list(map(int, input().split()))
cnt[a] += v
if ... | s358036766 | s433669354 | p00099 | python | Time Limit Exceeded |
n, q = list(map(int, input().split()))
cnt = [0 for _ in range(n + 1)]
for _ in range(q):
a, v = list(map(int, input().split()))
cnt[a] += v
mx = max(cnt)
if mx == 0:
print("1 0")
else:
print(str(min([key for key, value in enumerate(cnt) if value == mx])) + ' ' + str(mx)) | n, q = list(map(int, input().split()))
cnt = [0 for _ in range(n + 1)]
cnt[0] = -9999999999
mx = [0, cnt[0]]
def spam():
max_v = max(cnt)
idx = min([i for i, value in enumerate(cnt) if value == max_v])
return idx, max_v
for _ in range(q):
a, v = list(map(int, input().split()))
cnt[a] += v
if ... | s485405037 | s433669354 | p00099 | python | Time Limit Exceeded |
n, q = list(map(int, input().split()))
cnt = [0 for _ in range(n + 1)]
cnt[0] = -1
mx = [0, -1]
for _ in range(q):
a, v = list(map(int, input().split()))
cnt[a] += v
if mx[0] == a and v > 0:
mx[1] += v
elif mx[0] == a and v < 0:
def spam():
max_v = max(cnt)
idx =... | n, q = list(map(int, input().split()))
cnt = [0 for _ in range(n + 1)]
cnt[0] = -9999999999
mx = [0, cnt[0]]
def spam():
max_v = max(cnt)
idx = min([i for i, value in enumerate(cnt) if value == max_v])
return idx, max_v
for _ in range(q):
a, v = list(map(int, input().split()))
cnt[a] += v
if ... | s249199137 | s433669354 | p00099 | python | Runtime Error |
n, q = list(map(int, input().split()))
cnt = [0 for _ in range(n + 1)]
cnt[0] = -1
mx = [0, -1]
def spam():
max_v = max(cnt)
idx = min([i for i, value in enumerate(cnt) if value == max_v])
return idx, max_v
for _ in range(q):
a, v = list(map(int, input().split()))
cnt[a] += v
if mx[0] == a an... | n, q = list(map(int, input().split()))
cnt = [0 for _ in range(n + 1)]
cnt[0] = -9999999999
mx = [0, cnt[0]]
def spam():
max_v = max(cnt)
idx = min([i for i, value in enumerate(cnt) if value == max_v])
return idx, max_v
for _ in range(q):
a, v = list(map(int, input().split()))
cnt[a] += v
if ... | s319946515 | s433669354 | p00099 | python | Runtime Error |
n, q = list(map(int, input().split()))
cnt = [0 for _ in range(n + 1)]
cnt[0] = -1
mx = [0, -1]
def spam():
# max_v = max(cnt)
# idx = min([i for i, value in enumerate(cnt) if value == max_v])
# return idx, max_v
return 1,1
for _ in range(q):
a, v = list(map(int, input().split()))
cnt[a] += v
... | n, q = list(map(int, input().split()))
cnt = [0 for _ in range(n + 1)]
cnt[0] = -9999999999
mx = [0, cnt[0]]
def spam():
max_v = max(cnt)
idx = min([i for i, value in enumerate(cnt) if value == max_v])
return idx, max_v
for _ in range(q):
a, v = list(map(int, input().split()))
cnt[a] += v
if ... | s566254758 | s433669354 | p00099 | python | Runtime Error |
n, q = list(map(int, input().split()))
cnt = [0 for _ in range(n + 1)]
cnt[0] = -1
mx = [0, -1]
def spam():
max_v = max(cnt)
idx = min([i for i, value in enumerate(cnt) if value == max_v])
return idx, max_v
for _ in range(q):
a, v = list(map(int, input().split()))
cnt[a] += v
if mx[0] == a an... | n, q = list(map(int, input().split()))
cnt = [0 for _ in range(n + 1)]
cnt[0] = -9999999999
mx = [0, cnt[0]]
def spam():
max_v = max(cnt)
idx = min([i for i, value in enumerate(cnt) if value == max_v])
return idx, max_v
for _ in range(q):
a, v = list(map(int, input().split()))
cnt[a] += v
if ... | s734270444 | s433669354 | p00099 | python | Time Limit Exceeded |
def fizz_buzz():
c = 1
while True:
res = ''
if c % 3 == 0:
res = res + 'Fizz'
if c % 5 == 0:
res = res + 'Buzz'
if res == '':
yield str(c)
else:
yield res
c += 1
while True:
m,n = map(int,raw_input().split())
... | def fizz_buzz():
c = 1
while True:
res = ''
if c % 3 == 0:
res = res + 'Fizz'
if c % 5 == 0:
res = res + 'Buzz'
if res == '':
yield str(c)
else:
yield res
c += 1
while True:
m,n = map(int,input().split())
if... | s844616465 | s829232401 | p00221 | python | Runtime Error |
def fizz_buzz():
c = 1
while True:
res = ''
if c % 3 == 0:
res = res + 'Fizz'
if c % 5 == 0:
res = res + 'Buzz'
if res == '':
yield str(c)
else:
yield res
c += 1
while True:
m,n = map(int,raw_input().split())
... | def fizz_buzz():
c = 1
while True:
res = ''
if c % 3 == 0:
res = res + 'Fizz'
if c % 5 == 0:
res = res + 'Buzz'
if res == '':
yield str(c)
else:
yield res
c += 1
while True:
m,n = map(int,input().split())
if... | s141305794 | s829232401 | p00221 | python | Runtime Error |
def fizz_buzz():
c = 1
while True:
res = ''
if c % 3 == 0:
res = res + 'Fizz'
if c % 5 == 0:
res = res + 'Buzz'
if res == '':
yield str(c)
else:
yield res
c += 1
while True:
m,n = map(int,input().split())
if... | def fizz_buzz():
c = 1
while True:
res = ''
if c % 3 == 0:
res = res + 'Fizz'
if c % 5 == 0:
res = res + 'Buzz'
if res == '':
yield str(c)
else:
yield res
c += 1
while True:
m,n = map(int,input().split())
if... | s330950091 | s829232401 | p00221 | python | Runtime Error |
def fizz_buzz():
c = 1
while True:
res = ''
if c % 3 == 0:
res = res + 'Fizz'
if c % 5 == 0:
res = res + 'Buzz'
if res == '':
yield str(c)
else:
yield res
c += 1
while True:
m,n = map(int,input().split())
if... | def fizz_buzz():
c = 1
while True:
res = ''
if c % 3 == 0:
res = res + 'Fizz'
if c % 5 == 0:
res = res + 'Buzz'
if res == '':
yield str(c)
else:
yield res
c += 1
while True:
m,n = map(int,input().split())
if... | s405896752 | s829232401 | p00221 | python | Runtime Error |
def fizz_buzz():
c = 1
while True:
res = ''
if c % 3 == 0:
res = res + 'Fizz'
if c % 5 == 0:
res = res + 'Buzz'
if res == '':
yield str(c)
else:
yield res
c += 1
while True:
m,n = map(int,input().split())
if... | def fizz_buzz():
c = 1
while True:
res = ''
if c % 3 == 0:
res = res + 'Fizz'
if c % 5 == 0:
res = res + 'Buzz'
if res == '':
yield str(c)
else:
yield res
c += 1
while True:
m,n = map(int,input().split())
if... | s684872353 | s829232401 | p00221 | python | Runtime Error |
def fizz_buzz():
c = 1
while True:
res = ''
if c % 3 == 0:
res = res + 'Fizz'
if c % 5 == 0:
res = res + 'Buzz'
if res == '':
yield str(c)
else:
yield res
c += 1
while True:
m,n = map(int,input().split())
if... | def fizz_buzz():
c = 1
while True:
res = ''
if c % 3 == 0:
res = res + 'Fizz'
if c % 5 == 0:
res = res + 'Buzz'
if res == '':
yield str(c)
else:
yield res
c += 1
while True:
m,n = map(int,input().split())
if... | s741702818 | s829232401 | p00221 | python | Runtime Error |
def fizz_buzz():
c = 1
while True:
res = ''
if c % 3 == 0:
res = res + 'Fizz'
if c % 5 == 0:
res = res + 'Buzz'
if res == '':
yield str(c)
else:
yield res
c += 1
while True:
m,n = map(int,input().split())
if... | def fizz_buzz():
c = 1
while True:
res = ''
if c % 3 == 0:
res = res + 'Fizz'
if c % 5 == 0:
res = res + 'Buzz'
if res == '':
yield str(c)
else:
yield res
c += 1
while True:
m,n = map(int,input().split())
if... | s591366676 | s829232401 | p00221 | python | Runtime Error |
def make_sosu_tbl():
for i in range(2, MAX_N):
if sos[i]:
for j in range(i+i, MAX_N+1, i):
sos[j] = 0
if i**2 >= MAX_N:break
while 1:
MAX_N = int(input())
if not MAX_N: break
sos = [1] * (MAX_N+1)
make_sosu_tbl()
for i in reversed(range(13,MAX_N+1)):... | # from datetime import datetime
# measure_start = datetime.now()
move = [[[10, 10], [4, 4]], [[8, 2],[4, 2]]]
MAX_N = 10000000+1
sos = [1] * (MAX_N+1)
sos[0] = sos[1] = 0
for i in range(2, int(MAX_N**0.5)+1):
if sos[i]:
for j in range(i+i, MAX_N+1, i):
sos[j] = 0
while 1:
try:
n =... | s683701961 | s457782363 | p00222 | python | Time Limit Exceeded |
MAX_N = 10000000+1
def make_sosu_tbl():
for i in range(2, MAX_N):
if sos[i]:
for j in range(i+i, MAX_N+1, i):
sos[j] = 0
if i**2 >= MAX_N:break
sos = [1] * (MAX_N+1)
make_sosu_tbl()
while 1:
# MAX_N = int(input())
# if not MAX_N: break
#
n = int(input())
... | # from datetime import datetime
# measure_start = datetime.now()
move = [[[10, 10], [4, 4]], [[8, 2],[4, 2]]]
MAX_N = 10000000+1
sos = [1] * (MAX_N+1)
sos[0] = sos[1] = 0
for i in range(2, int(MAX_N**0.5)+1):
if sos[i]:
for j in range(i+i, MAX_N+1, i):
sos[j] = 0
while 1:
try:
n =... | s857922977 | s457782363 | p00222 | python | Runtime Error |
MAX_N = 10000000+1
def make_sosu_tbl():
for i in range(2, MAX_N):
if sos[i]:
for j in range(i+i, MAX_N+1, i):
sos[j] = 0
if i**2 >= MAX_N:break
sos = [1] * (MAX_N+1)
make_sosu_tbl()
while 1:
# MAX_N = int(input())
# if not MAX_N: break
#
n = int(input())
... | # from datetime import datetime
# measure_start = datetime.now()
move = [[[10, 10], [4, 4]], [[8, 2],[4, 2]]]
MAX_N = 10000000+1
sos = [1] * (MAX_N+1)
sos[0] = sos[1] = 0
for i in range(2, int(MAX_N**0.5)+1):
if sos[i]:
for j in range(i+i, MAX_N+1, i):
sos[j] = 0
while 1:
try:
n =... | s504863364 | s457782363 | p00222 | python | Runtime Error |
MAX_N = 10000000+1
def make_sosu_tbl():
for i in range(2, MAX_N):
if sos[i]:
for j in range(i+i, MAX_N+1, i):
sos[j] = 0
if i**2 >= MAX_N:break
sos = [1] * (MAX_N+1)
make_sosu_tbl()
while 1:
n = int(input())
if not n: break
for i in reversed(range(13, n+1)):... | # from datetime import datetime
# measure_start = datetime.now()
move = [[[10, 10], [4, 4]], [[8, 2],[4, 2]]]
MAX_N = 10000000+1
sos = [1] * (MAX_N+1)
sos[0] = sos[1] = 0
for i in range(2, int(MAX_N**0.5)+1):
if sos[i]:
for j in range(i+i, MAX_N+1, i):
sos[j] = 0
while 1:
try:
n =... | s433735597 | s457782363 | p00222 | python | Runtime Error |
MAX_N = 10000000+1
sos = [1] * (MAX_N+1)
for i in range(2, MAX_N):
if sos[i]:
for j in range(i+i, MAX_N+1, i):
sos[j] = 0
if i**2 >= MAX_N:break
while 1:
try:
n = int(input())
if not n: break
for i in reversed(range(13, n+1)):
if sos[i] and sos[i-2]... | # from datetime import datetime
# measure_start = datetime.now()
move = [[[10, 10], [4, 4]], [[8, 2],[4, 2]]]
MAX_N = 10000000+1
sos = [1] * (MAX_N+1)
sos[0] = sos[1] = 0
for i in range(2, int(MAX_N**0.5)+1):
if sos[i]:
for j in range(i+i, MAX_N+1, i):
sos[j] = 0
while 1:
try:
n =... | s978728366 | s457782363 | p00222 | python | Time Limit Exceeded |
MAX_N = 10000000+1
SQRT_MAX = 3163
sos = [1] * (MAX_N+1)
for i in range(2, SQRT_MAX+1):
if sos[i]:
for j in range(i+i, MAX_N+1, i):
sos[j] = 0
while 1:
try:
n = int(input())
if not n: break
for i in reversed(range(13, n+1)):
if sos[i] and sos[i-2] and so... | # from datetime import datetime
# measure_start = datetime.now()
move = [[[10, 10], [4, 4]], [[8, 2],[4, 2]]]
MAX_N = 10000000+1
sos = [1] * (MAX_N+1)
sos[0] = sos[1] = 0
for i in range(2, int(MAX_N**0.5)+1):
if sos[i]:
for j in range(i+i, MAX_N+1, i):
sos[j] = 0
while 1:
try:
n =... | s273957992 | s457782363 | p00222 | python | Time Limit Exceeded |
# from datetime import datetime
# measure_start = datetime.now()
MAX_N = 10000000+1
sos = [1] * (MAX_N+1)
sos[0] = sos[1] = 0
for i in range(2, int(MAX_N**0.5)+1):
if sos[i]:
for j in range(i+i, MAX_N+1, i):
sos[j] = 0
while 1:
try:
n = int(input())
if not n: break
... | # from datetime import datetime
# measure_start = datetime.now()
move = [[[10, 10], [4, 4]], [[8, 2],[4, 2]]]
MAX_N = 10000000+1
sos = [1] * (MAX_N+1)
sos[0] = sos[1] = 0
for i in range(2, int(MAX_N**0.5)+1):
if sos[i]:
for j in range(i+i, MAX_N+1, i):
sos[j] = 0
while 1:
try:
n =... | s295486958 | s457782363 | p00222 | python | Time Limit Exceeded |
move = [[[10, 10], [4, 4]], [[8, 2],[4, 2]]]
MAX_N = 10000000+1
sos = [1] * (MAX_N+1)
sos[0] = sos[1] = 0
for i in range(2, int(MAX_N**0.5)+1):
if sos[i]:
for j in range(i+i, MAX_N+1, i):
sos[j] = 0
while 1:
n = int(input())
if not n: break
n -= (n%2 == 0)
while n >= 13:
... | # from datetime import datetime
# measure_start = datetime.now()
move = [[[10, 10], [4, 4]], [[8, 2],[4, 2]]]
MAX_N = 10000000+1
sos = [1] * (MAX_N+1)
sos[0] = sos[1] = 0
for i in range(2, int(MAX_N**0.5)+1):
if sos[i]:
for j in range(i+i, MAX_N+1, i):
sos[j] = 0
while 1:
try:
n =... | s595471930 | s457782363 | p00222 | python | Runtime Error |
direc = ((1,0),(-1,0),(0,1),(0,-1))
#d = [[[[0 for i in range(Y+1)] for i in range(X+1)] for i in range(Y+1)] for i in range(X+1)]
#d[1][1][2][2]=3
# print(d)
while 1:
X, Y = list(map(int,input().split()))
if X == 0: break
ftx, fty = list(map(lambda x: x-1, map(int, input().split())))
fkx, fky = list... | direc = ((1,0),(-1,0),(0,1),(0,-1))
#d = [[[[0 for i in range(Y+1)] for i in range(X+1)] for i in range(Y+1)] for i in range(X+1)]
#d[1][1][2][2]=3
# print(d)
while 1:
X, Y = list(map(int,input().split()))
if X == 0: break
ftx, fty = list(map(lambda x: x-1, map(int, input().split())))
fkx, fky = list... | s052862371 | s821369946 | p00223 | python | Runtime Error |
while True:
n,m = list(map(int,input().split()))
if n == 0 and m == 0:
break
amari = n % m
yasai = list(map(int,input().split()))
yasai.sort()
s = 0
if amari > 0:
s = sum(yasai[0:amari])
i = 0
for y in yasai[amari:]:
if i % m > 0:
s += y
... | while True:
try:
n,m = list(map(int,input().split()))
if n == 0 and m == 0:
break
amari = n % m
yasai = list(map(int,input().split()))
yasai.sort()
s = 0
for i in range(n):
if (i+1) % m > 0:
s += yasai[-i-1]
pr... | s254109919 | s466917444 | p00227 | python | Runtime Error |
while True:
n,m = list(map(int,input().split()))
if n == 0 and m == 0:
break
amari = n % m
yasai = list(map(int,input().split()))
yasai.sort()
s = 0
if amari > 0:
s = sum(yasai[0:amari])
i = 0
for y in yasai[amari:]:
pass
print(s) | while True:
try:
n,m = list(map(int,input().split()))
if n == 0 and m == 0:
break
amari = n % m
yasai = list(map(int,input().split()))
yasai.sort()
s = 0
for i in range(n):
if (i+1) % m > 0:
s += yasai[-i-1]
pr... | s440319197 | s466917444 | p00227 | python | Runtime Error |
while True:
n,m = list(map(int,input().split()))
if n == 0 and m == 0:
break
amari = int(n % m)
yasai = list(map(int,input().split()))
yasai.sort()
s = 0
if amari > 0:
s = sum(yasai[0:amari])
i = 0
for y in yasai[amari:]:
pass
if i % m > 0:
... | while True:
try:
n,m = list(map(int,input().split()))
if n == 0 and m == 0:
break
amari = n % m
yasai = list(map(int,input().split()))
yasai.sort()
s = 0
for i in range(n):
if (i+1) % m > 0:
s += yasai[-i-1]
pr... | s788391393 | s466917444 | p00227 | python | Runtime Error |
while True:
n,m = list(map(int,input().split()))
if n == 0 and m == 0:
break
amari = int(n % m)
yasai = list(map(int,input().split()))
print(amari) | while True:
try:
n,m = list(map(int,input().split()))
if n == 0 and m == 0:
break
amari = n % m
yasai = list(map(int,input().split()))
yasai.sort()
s = 0
for i in range(n):
if (i+1) % m > 0:
s += yasai[-i-1]
pr... | s494687397 | s466917444 | p00227 | python | Runtime Error |
while True:
n,m = list(map(int,input().split()))
print(amari) | while True:
try:
n,m = list(map(int,input().split()))
if n == 0 and m == 0:
break
amari = n % m
yasai = list(map(int,input().split()))
yasai.sort()
s = 0
for i in range(n):
if (i+1) % m > 0:
s += yasai[-i-1]
pr... | s460424976 | s466917444 | p00227 | python | Runtime Error |
while True:
#n,m = list(map(int,input().split()))
spam = input().split()
n = int(spam[0])
m = int(spam[1])
if n == 0 and m == 0:
break
print(1) | while True:
try:
n,m = list(map(int,input().split()))
if n == 0 and m == 0:
break
amari = n % m
yasai = list(map(int,input().split()))
yasai.sort()
s = 0
for i in range(n):
if (i+1) % m > 0:
s += yasai[-i-1]
pr... | s416311223 | s466917444 | p00227 | python | Runtime Error |
while True:
#n,m = list(map(int,input().split()))
spam = input().split()
print(1) | while True:
try:
n,m = list(map(int,input().split()))
if n == 0 and m == 0:
break
amari = n % m
yasai = list(map(int,input().split()))
yasai.sort()
s = 0
for i in range(n):
if (i+1) % m > 0:
s += yasai[-i-1]
pr... | s551817601 | s466917444 | p00227 | python | Runtime Error |
while True:
#n,m = list(map(int,input().split()))
spam = input()
print(1) | while True:
try:
n,m = list(map(int,input().split()))
if n == 0 and m == 0:
break
amari = n % m
yasai = list(map(int,input().split()))
yasai.sort()
s = 0
for i in range(n):
if (i+1) % m > 0:
s += yasai[-i-1]
pr... | s355205329 | s466917444 | p00227 | python | Runtime Error |
while True:
#n,m = list(map(int,input().split()))
#spam = input()
print(1) | while True:
try:
n,m = list(map(int,input().split()))
if n == 0 and m == 0:
break
amari = n % m
yasai = list(map(int,input().split()))
yasai.sort()
s = 0
for i in range(n):
if (i+1) % m > 0:
s += yasai[-i-1]
pr... | s771879854 | s466917444 | p00227 | python | Time Limit Exceeded |
while True:
n,m = map(int,raw_input().split())
if n == 0 and m == 0:
break
amari = n % m
yasai = map(int,raw_input().split())
yasai.sort()
s = 0
if amari > 0:
s = sum(yasai[0:amari])
i = 0
for y in yasai[amari:]:
if i % m > 0:
s += y
i+=... | while True:
try:
n,m = list(map(int,input().split()))
if n == 0 and m == 0:
break
amari = n % m
yasai = list(map(int,input().split()))
yasai.sort()
s = 0
for i in range(n):
if (i+1) % m > 0:
s += yasai[-i-1]
pr... | s954737843 | s466917444 | p00227 | python | Runtime Error |
while True:
n,m = map(int,raw_input().split())
if n == 0 and m == 0:
break
amari = n % m
yasai = map(int,raw_input().split())
yasai.sort()
s = 0
if amari > 0:
s = sum(yasai[0:amari])
i = 0
for y in yasai[amari:]:
if i % m > 0:
s += y
i+=... | while True:
try:
n,m = list(map(int,input().split()))
if n == 0 and m == 0:
break
amari = n % m
yasai = list(map(int,input().split()))
yasai.sort()
s = 0
for i in range(n):
if (i+1) % m > 0:
s += yasai[-i-1]
pr... | s619657621 | s466917444 | p00227 | python | Runtime Error |
while True:
n,m = map(int,raw_input().split())
| while True:
try:
n,m = list(map(int,input().split()))
if n == 0 and m == 0:
break
amari = n % m
yasai = list(map(int,input().split()))
yasai.sort()
s = 0
for i in range(n):
if (i+1) % m > 0:
s += yasai[-i-1]
pr... | s385523379 | s466917444 | p00227 | python | Runtime Error |
while True:
n,m = map(int,raw_input().split(' ')) | while True:
try:
n,m = list(map(int,input().split()))
if n == 0 and m == 0:
break
amari = n % m
yasai = list(map(int,input().split()))
yasai.sort()
s = 0
for i in range(n):
if (i+1) % m > 0:
s += yasai[-i-1]
pr... | s194227838 | s466917444 | p00227 | python | Runtime Error |
while True:
a = raw_input()
print 'a' | while True:
try:
n,m = list(map(int,input().split()))
if n == 0 and m == 0:
break
amari = n % m
yasai = list(map(int,input().split()))
yasai.sort()
s = 0
for i in range(n):
if (i+1) % m > 0:
s += yasai[-i-1]
pr... | s005069079 | s466917444 | p00227 | python | Runtime Error |
while True:
a = input()
print('a') | while True:
try:
n,m = list(map(int,input().split()))
if n == 0 and m == 0:
break
amari = n % m
yasai = list(map(int,input().split()))
yasai.sort()
s = 0
for i in range(n):
if (i+1) % m > 0:
s += yasai[-i-1]
pr... | s103292306 | s466917444 | p00227 | python | Runtime Error |
while True:
a = input()
print('a') | while True:
try:
n,m = list(map(int,input().split()))
if n == 0 and m == 0:
break
amari = n % m
yasai = list(map(int,input().split()))
yasai.sort()
s = 0
for i in range(n):
if (i+1) % m > 0:
s += yasai[-i-1]
pr... | s177266676 | s466917444 | p00227 | python | Runtime Error |
while 1:
t = int(input())
if t == 0:break
n = int(input())
x = 0
for i in range(n):
x += (lambda lst:lst[-1] - lst[0])(list(map(int,input().split())))
print('OK' if t<=x else (t-x))
while 1:
t = int(input())
if t == 0:break
#n = int(input())
#x = 0
#for i in range(n):... | while 1:
t = int(input())
if t == 0:break
t -= sum(map(lambda lst:lst[-1] - lst[0],[ list(map(int,input().split())) for i in range(int(input())) ]))
print('OK' if t<=0 else t) | s377899098 | s681237765 | p00238 | python | Runtime Error |
while 1:
N = int(input())
if N == 0:break
lst = list(map(int,input().split()))
s_len = 1
n = lst[-1]
# for v in reversed(lst[:-1]):
# if v == n-1:
# s_len += 1
# n -= 1
# else:
# break
result = -1
for i in range(10000):
flg = Tru... | import math
def is_sankaku(v):
x = (math.sqrt(8*v + 1) - 1 ) / 2
return x == int(x)
def check(lst):
for i,v in enumerate(lst):
if v != i + 1:
return False
elif i == len(lst)-1:
return True
while 1:
N = int(input())
if N == 0:break
lst = list(map(int,inp... | s143582566 | s440895161 | p00262 | python | Runtime Error |
BIN = [0] * 32
v = 1
for i in range(24, 0, -1):
BIN[i] = v
v *= 2
v = float(1) / 2
for i in range(25, 32):
BIN[i] = v
v /= 2
while 1:
Q = int(input())
if not Q:break
for i in range(Q):
inp = format(int(input(),16),'b').zfill(32)
res = float(0)
for j, v in enumerate... | BIN = [0] * 32
v = 1
for i in range(24, 0, -1):
BIN[i] = v
v *= 2
v = float(1) / 2
for i in range(25, 32):
BIN[i] = v
v /= 2
Q = int(input())
for i in range(Q):
inp = format(int(input(),16),'b').zfill(32)
res = float(0)
for j, v in enumerate(list(inp)[1:]):
#print(str(BIN[j]) + ' ... | s449208045 | s555667830 | p00263 | python | Runtime Error |
N,Q = list(map(int,input().split()))
C = list(map(int,input().split()))
for i in range(Q):
m = -1
spam = int(input())
for n in C:
ham =n%spam
m = max(m,ham)
print(m) | N,Q = list(map(int,input().split()))
C = list(map(int,input().split()))
M = max(C)+1
t1 = [0]*(M)
for v in C:
t1[v] = 1
t2 = [0]*(M)
v = 0
for i in range(M):
if t1[i]:
v = i
t2[i] = v
for i in range(Q):
t = int(input())
n_v = M-1
m = 0
while n_v != 0:
amr = n_v % t
... | s834069022 | s812603824 | p00265 | python | Time Limit Exceeded |
def next_max(lst,mi,v):
l, r = 0, mi-1
while l <= r:
mid = int((l+r)/2)
if lst[mid] == v: return mid -1
if lst[mid] > v:
r = mid - 1
else:
l = mid + 1
return r
N,Q = list(map(int,input().split()))
C = list(map(int,input().split()))
C.sort()
for i in ... | N,Q = list(map(int,input().split()))
C = list(map(int,input().split()))
M = max(C)+1
t1 = [0]*(M)
for v in C:
t1[v] = 1
t2 = [0]*(M)
v = 0
for i in range(M):
if t1[i]:
v = i
t2[i] = v
for i in range(Q):
t = int(input())
n_v = M-1
m = 0
while n_v != 0:
amr = n_v % t
... | s636152345 | s812603824 | p00265 | python | Time Limit Exceeded |
N,Q = list(map(int,input().split()))
C = list(map(int,input().split()))
C.sort()
def next_max(mi,v):
l, r = 0, mi-1
while l <= r:
mid = int((l+r)/2)
if C[mid] == v: return mid - 1
if C[mid] > v:
r = mid - 1
else:
l = mid + 1
return r
for i in range(Q... | N,Q = list(map(int,input().split()))
C = list(map(int,input().split()))
M = max(C)+1
t1 = [0]*(M)
for v in C:
t1[v] = 1
t2 = [0]*(M)
v = 0
for i in range(M):
if t1[i]:
v = i
t2[i] = v
for i in range(Q):
t = int(input())
n_v = M-1
m = 0
while n_v != 0:
amr = n_v % t
... | s506394749 | s812603824 | p00265 | python | Time Limit Exceeded |
N,Q = list(map(int,input().split()))
C = list(map(int,input().split()))
M = max(C)+1
t1 = [0]*(M)
for v in C:
t1[v] = 1
t2 = [0]*(M)
v = 0
for i in range(M):
if t1[i]:
v = i
t2[i] = v
for i in range(Q):
t = int(input())
n_v = M-1
m = 0
while n_v != 0:
amr = n_v % t
... | N,Q = list(map(int,input().split()))
C = list(map(int,input().split()))
M = max(C)+1
t1 = [0]*(M)
for v in C:
t1[v] = 1
t2 = [0]*(M)
v = 0
for i in range(M):
if t1[i]:
v = i
t2[i] = v
for i in range(Q):
t = int(input())
n_v = M-1
m = 0
while n_v != 0:
amr = n_v % t
... | s741311115 | s812603824 | p00265 | python | Time Limit Exceeded |
for i in range(int(input())):
res = 0
c,a,n = list(map(int,input().split()))
res = min(n,a,c)
c -= res
a -= res
if c >= 2 and a >= 1:
cca += min(c//2,a)
c -= cca*2
if c >=3:
res += c//3
print(res) | for i in range(int(input())):
res = 0
c,a,n = list(map(int,input().split()))
res = min(n,a,c)
c -= res
a -= res
if c >= 2 and a >= 1:
cca = min(c//2,a)
c -= cca*2
res += cca
if c >=3:
res += c//3
print(res) | s168434568 | s825549119 | p00276 | python | Runtime Error |
S = [0 for i in range(300000)]
A = [-1, 1]
for i in range(1, int(300000 / 7) + 1):
d = 7 * i
for a in A:
da = d + a
if da < 300000 and S[da] == 0:
S[da] = 1
for j in range(2, int(300000 / 2)):
if da * j >= 300000:break
S[da * j] = -1
while... | S = [0 for i in range(300000)]
S2 = []
A = [-1, 1]
for i in range(1, int(300000 / 7) + 1):
d = 7 * i
for a in A:
da = d + a
if da < 300000 and S[da] == 0:
S2.append(da)
for j in range(2, int(300000 / 2)):
if da * j >= 300000:break
S[da * j]... | s767297753 | s100747476 | p00735 | python | Time Limit Exceeded |
S = [0 for i in range(300000)]
S2 = []
A = [-1, 1]
for i in range(1, int(300000 / 7) + 1):
d = 7 * i
for a in A:
da = d + a
if da < 300000 and S[da] == 0:
S2.append(str(da))
for j in range(2, int(300000 / 2)):
if da * j >= 300000:break
S[da... | S = [0 for i in range(300000)]
S2 = []
A = [-1, 1]
for i in range(1, int(300000 / 7) + 1):
d = 7 * i
for a in A:
da = d + a
if da < 300000 and S[da] == 0:
S2.append(da)
for j in range(2, int(300000 / 2)):
if da * j >= 300000:break
S[da * j]... | s716132638 | s100747476 | p00735 | python | Time Limit Exceeded |
S = [0 for i in range(300000)]
S2 = []
A = [-1, 1]
for i in range(1, int(300000 / 7) + 1):
d = 7 * i
for a in A:
da = d + a
if da < 300000 and S[da] == 0:
S2.append(str(da))
for j in range(2, int(300000 / 2)):
if da * j >= 300000:break
S[da... | S = [0 for i in range(300000)]
S2 = []
A = [-1, 1]
for i in range(1, int(300000 / 7) + 1):
d = 7 * i
for a in A:
da = d + a
if da < 300000 and S[da] == 0:
S2.append(da)
for j in range(2, int(300000 / 2)):
if da * j >= 300000:break
S[da * j]... | s978097277 | s100747476 | p00735 | python | Time Limit Exceeded |
while 1:
W, H = list(map(int,input().split()))
if W == 0:break
C = [list(map(int, input().split())) for i in range(H) ]
def work(x,y):
ax = [-1, 0, 1, -1, 1, -1, 0, 1]
ay = [-1, -1, -1, 0, 0, 1, 1, 1]
if C[y][x] != 1:return False
C[y][x] = -1 #mark
for _ax in ... | while 1:
W, H = list(map(int,input().split()))
if W == 0:break
C = [list(map(int, input().split())) for i in range(H) ]
def work(x,y):
ax = [-1, 0, 1, -1, 1, -1, 0, 1]
ay = [-1, -1, -1, 0, 0, 1, 1, 1]
if C[y][x] != 1:return False
stack = [(x,y)]
while len(... | s330983816 | s976391114 | p00741 | python | Runtime Error |
import sys
#最大公約数
def gcd(x, y):
s = x / y
r = x % y
if r == 0:
return y
else:
return gcd(y, r)
#最小公倍数
def lcm(x, y):
return x*y/gcd(x, y)
def main():
#print ("a")
tmp = sys.stdin.readline().split(" ")
#print ("b")
while 1:
a = int(tmp[0])
b = int(t... | import sys
#最大公約数
def gcd(x, y):
s = x / y
r = x % y
if r == 0:
return y
else:
return gcd(y, r)
#最小公倍数
def lcm(x, y):
return x*y/gcd(x, y)
def main():
#print ("a")
for line in iter(sys.stdin.readline, ""):
#print (line)
#tmp = sys.stdin.readline().split(" "... | s919635147 | s531063834 | p00005 | python | Runtime Error |
import sys
#最大公約数
def gcd(x, y):
s = x / y
r = x % y
if r == 0:
return y
else:
return gcd(y, r)
#最小公倍数
def lcm(x, y):
return x*y/gcd(x, y)
def main():
#print ("a")
tmp = sys.stdin.readline().split(" ")
#print ("b")
while 1:
a = int(tmp[0])
b = int(t... | import sys
#最大公約数
def gcd(x, y):
s = x / y
r = x % y
if r == 0:
return y
else:
return gcd(y, r)
#最小公倍数
def lcm(x, y):
return x*y/gcd(x, y)
def main():
#print ("a")
for line in iter(sys.stdin.readline, ""):
#print (line)
#tmp = sys.stdin.readline().split(" "... | s054585069 | s531063834 | p00005 | python | Runtime Error |
import sys
#最大公約数
def gcd(x, y):
s = x / y
r = x % y
if r == 0:
return y
else:
return gcd(y, r)
#最小公倍数
def lcm(x, y):
return x*y/gcd(x, y)
def main():
#print ("a")
tmp = sys.stdin.readline().split(" ")
#print ("b")
while 1:
a = long(tmp[0])
b = long... | import sys
#最大公約数
def gcd(x, y):
s = x / y
r = x % y
if r == 0:
return y
else:
return gcd(y, r)
#最小公倍数
def lcm(x, y):
return x*y/gcd(x, y)
def main():
#print ("a")
for line in iter(sys.stdin.readline, ""):
#print (line)
#tmp = sys.stdin.readline().split(" "... | s255505419 | s531063834 | p00005 | python | Runtime Error |
import sys
def main():
tmp = sys.stdin.readline().split(" ")
a = long(tmp[0])
b = long(tmp[1])
print ("Hello World")
if __name__ == "__main__":
main() | import sys
#最大公約数
def gcd(x, y):
s = x / y
r = x % y
if r == 0:
return y
else:
return gcd(y, r)
#最小公倍数
def lcm(x, y):
return x*y/gcd(x, y)
def main():
#print ("a")
for line in iter(sys.stdin.readline, ""):
#print (line)
#tmp = sys.stdin.readline().split(" "... | s077958511 | s531063834 | p00005 | python | Runtime Error |
import sys
def main():
tmp = sys.stdin.readline().split(" ")
while 1:
if a > b:
c = a
d = b
else:
c = b
d = a
tmp = sys.stdin.readline()
if len(tmp) == 1:
break
if __name__ == "__main__":
main() | import sys
#最大公約数
def gcd(x, y):
s = x / y
r = x % y
if r == 0:
return y
else:
return gcd(y, r)
#最小公倍数
def lcm(x, y):
return x*y/gcd(x, y)
def main():
#print ("a")
for line in iter(sys.stdin.readline, ""):
#print (line)
#tmp = sys.stdin.readline().split(" "... | s275245972 | s531063834 | p00005 | python | Runtime Error |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.