s_id string | p_id string | u_id string | date string | language string | original_language string | filename_ext string | status string | cpu_time string | memory string | code_size string | code string | error string | stdout string |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
s161974152 | p00088 | u193025715 | 1396171473 | Python | Python | py | Runtime Error | 0 | 0 | 1178 | encode = {' ':'101', '\'':'000000', ',':'000011', '-':'1001000', '.':'010001', '?':'000001', 'A':'100101', 'B':'10011010', 'C':'0101', 'D':'0001', 'E':'110', 'F':'01001', 'G':'10011011', 'H':'010000', 'I':'0111', 'J':'10011000', 'K':'0110', 'L':'00100', 'M':'10011001', 'N':'10011110', 'O':'00101', 'P':'111', 'Q':'10011111', 'R':'1000', 'S':'00110', 'T':'00111', 'U':'10011100', 'V':'10011101', 'W':'000010', 'X':'10010010', 'Y':'10010011', 'X':'10010000'}
decode = {'00000':'A', '00001':'B', '00010':'C', '00011':'D', '00100':'E','00101':'F','00110':'G','00111':'H','01000':'I','01001':'J','01010':'K','01011':'L','01100':'M','01101':'N','01110':'O','01111':'P','10000':'Q','10001':'R','10010':'S','10011':'T','10100':'U','10101':'V','10110':'W','10111':'X','11000':'Y','11001':'Z','11010':' ','11011':'.','11100':',','11101':'-','11110':'\'','11111':'?'}
while True:
try:
string = raw_input()
except EOFError:
break
# encode
e, ans = "", ""
for s in string:
e += encode[s]
tmp = []
while len(e) > 4:
tmp.append(e[0:5])
e = e[5:]
if len(e) != 0:
e += '0' * (5 - len(e))
tmp.append(e)
print tmp
# decode
for s in tmp:
ans += decode[s]
print ans | File "/tmp/tmp1tggxfdk/tmpib_4s0bk.py", line 21
print tmp
^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s476185701 | p00088 | u912237403 | 1398571888 | Python | Python | py | Runtime Error | 0 | 0 | 520 | import sys
A=" ',-.?ABCDEFGHIJKLMNOPQRSTUVWXYZ"
B="101 000000 000011 10010001 010001 000001 100101 10011010 "\
"0101 0001 110 01001 10011011 010000 0111 10011000 "\
"0110 00100 10011001 10011110 00101 111 10011111 1000 "\
"00110 00111 10011100 10011101 000010 10010010 10010011 10010000".split()
C="ABCDEFGHIJKLMNOPQRSTUVWXYZ .,-'?"
d1={}
for i in range(26):d1[A[i]]=B[i]
for s in sys.stdin:
x=""
for c in s[:-1]:x+=d1[c]
x+="0"*(-len(x)%5)
s=""
for i in range(0,len(x),5):s+=C[int(x[i:i+5],2)]
print s | File "/tmp/tmpnuf7un9a/tmpj7ltkvos.py", line 16
print s
^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s203044721 | p00089 | u506132575 | 1417788164 | Python | Python | py | Runtime Error | 0 | 0 | 382 | import sys
def index(x,n):
if x < 0: return 0
if n < x: return n
return x
las = map(int,raw_input())
for s in sys.stdin:
now = map(int,s.split(","))
nin,lin = len(now)-1,len(las)-1
if nin > lin: d = -1
if nin < lin: d = 1
for i in xrange(nin+1):
now[i] += max(las[index(i+d,lin)],las[index(i,lin)])
if not nin: print now[0]
las = now | File "/tmp/tmp2yr03eii/tmphdn5d410.py", line 15
if not nin: print now[0]
^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s250243719 | p00089 | u633068244 | 1396084162 | Python | Python | py | Runtime Error | 0 | 0 | 400 | def mx(p,w,h,l):
if h <= c/2:
if w == 0: p[h][w] += p[h-1][w]
elif w == l-1: p[h][w] += p[h-1][w-1]
else: p[h][w] += max(p[h-1][w],p[h-1][w-1])
else:
p[h][w] += max(p[h-1][w],p[h-1][w+1])
return p
c = 0
p = []
while True:
try:
p.append(map(int, raw_put().split(",")))
c += 1
except:
break
for h in range(1,c):
l = len(p[h])
for w in range(l):
p = mx(p,w,h,l)
print p[c-1][0] | File "/tmp/tmpc4yjjtoe/tmppa3dhz91.py", line 23
print p[c-1][0]
^^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s679862985 | p00090 | u462831976 | 1494127637 | Python | Python3 | py | Runtime Error | 0 | 0 | 1194 | # -*- coding: utf-8 -*-
import sys
import os
import math
for s in sys.stdin:
n = int(s)
if n == 0:
break
P = []
for i in range(n):
x, y = map(float, input().split(','))
P.append(complex(x, y))
def get_intersections(p0, p1):
"""
:type p0: complex
:type p1: complex
:return:
"""
dist = abs(p0 - p1)
if dist > 2:
return []
elif dist == 2:
return [(p0 + p1) / 2]
else:
m = (p0 + p1) / 2
v = m - p0
w = complex(v.imag, -v.real)
n = w / abs(w)
d = abs(v)
l = math.sqrt(1 - d ** 2)
inter0 = m + l * n
inter1 = m - l * n
return [inter0, inter1]
intersections = []
for i in range(n):
for j in range(i+1, n):
intersections += get_intersections(P[i], P[j])
counts = []
# each intersection, it is in how many circles?
for intersection in intersections:
cnt = 0
for p in P:
if abs(intersection - p) <= 1:
cnt += 1
counts.append(cnt)
print(max(counts)) | ||
s263563126 | p00090 | u024715419 | 1522316091 | Python | Python3 | py | Runtime Error | 0 | 0 | 1345 | import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2*(o1[0]**2 + o1[1]**2 - 1) + c**2 + 2*b*c*o1[1]
x1 = (-b2 + math.sqrt(b2**2 - a2*c2))/a2
x2 = (-b2 - math.sqrt(b2**2 - a2*c2))/a2
if b == 0:
y1 = (o1[1] + o2[1])/2
y2 = (o1[1] + o2[1])/2
else:
y1 = -(a*x1 + c)/b
y2 = -(a*x2 + c)/b
if b2**2 - a2*c2 < 10e-6:
return [x1, y1], [None, None]
else:
return [x1, y1], [x2, y2]
while True:
n = int(input())
if n == 0:
break
p = []
for i in range(n):
p.append(list(map(float, input().split(","))))
ans = 0
for i in range(n - 1):
for j in range(i + 1, n):
if not overlap(p[i], p[j], 4):
continue
p1, p2 = intersection(p[i], p[j])
cnt1 = 0
cnt2 = 0
for k in range(n):
if overlap(p1, p[k], 1):
cnt1 += 1
if p2[0] != None and overlap(p2, p[k], 1):
cnt2 += 1
ans = max([ans, cnt1, cnt2])
print(ans)
| Traceback (most recent call last):
File "/tmp/tmpqdezl6p1/tmpynjukh5x.py", line 28, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s559412775 | p00090 | u024715419 | 1522316109 | Python | Python3 | py | Runtime Error | 0 | 0 | 1345 | import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2*(o1[0]**2 + o1[1]**2 - 1) + c**2 + 2*b*c*o1[1]
x1 = (-b2 + math.sqrt(b2**2 - a2*c2))/a2
x2 = (-b2 - math.sqrt(b2**2 - a2*c2))/a2
if b == 0:
y1 = (o1[1] + o2[1])/2
y2 = (o1[1] + o2[1])/2
else:
y1 = -(a*x1 + c)/b
y2 = -(a*x2 + c)/b
if b2**2 - a2*c2 < 10e-6:
return [x1, y1], [None, None]
else:
return [x1, y1], [x2, y2]
while True:
n = int(input())
if n == 0:
break
p = []
for i in range(n):
p.append(list(map(float, input().split(","))))
ans = 0
for i in range(n - 1):
for j in range(i + 1, n):
if not overlap(p[i], p[j], 4):
continue
p1, p2 = intersection(p[i], p[j])
cnt1 = 0
cnt2 = 0
for k in range(n):
if overlap(p1, p[k], 1):
cnt1 += 1
if p2[0] != None and overlap(p2, p[k], 1):
cnt2 += 1
ans = max([ans, cnt1, cnt2])
print(ans)
| Traceback (most recent call last):
File "/tmp/tmp0w4gp1ba/tmptexf6dm3.py", line 28, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s705426371 | p00090 | u024715419 | 1522316167 | Python | Python3 | py | Runtime Error | 0 | 0 | 1344 | import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2*(o1[0]**2 + o1[1]**2 - 1) + c**2 + 2*b*c*o1[1]
x1 = (-b2 + math.sqrt(b2**2 - a2*c2))/a2
x2 = (-b2 - math.sqrt(b2**2 - a2*c2))/a2
if b == 0:
y1 = (o1[1] + o2[1])/2
y2 = (o1[1] + o2[1])/2
else:
y1 = -(a*x1 + c)/b
y2 = -(a*x2 + c)/b
if b2**2 - a2*c2 < 10e-6:
return [x1, y1], [None, None]
else:
return [x1, y1], [x2, y2]
while True:
n = int(input())
if n == 0:
break
p = []
for i in range(n):
p.append(list(map(float, input().split(","))))
ans = 0
for i in range(n - 1):
for j in range(i + 1, n):
if not overlap(p[i], p[j], 4):
continue
p1, p2 = intersection(p[i], p[j])
cnt1 = 0
cnt2 = 0
for k in range(n):
if overlap(p1, p[k], 1):
cnt1 += 1
if p2[0] != None and overlap(p2, p[k], 1):
cnt2 += 1
ans = max([ans, cnt1, cnt2])
print(ans)
| Traceback (most recent call last):
File "/tmp/tmpjlm6e_dx/tmp4mib5miz.py", line 28, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s815109226 | p00090 | u024715419 | 1522316193 | Python | Python3 | py | Runtime Error | 0 | 0 | 1340 | import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2*(o1[0]**2 + o1[1]**2 - 1) + c**2 + 2*b*c*o1[1]
x1 = (-b2 + math.sqrt(b2**2 - a2*c2))/a2
x2 = (-b2 - math.sqrt(b2**2 - a2*c2))/a2
if b == 0:
y1 = (o1[1] + o2[1])/2
y2 = (o1[1] + o2[1])/2
else:
y1 = -(a*x1 + c)/b
y2 = -(a*x2 + c)/b
if b2**2 - a2*c2 < 10e-6:
return [x1, y1], [None, None]
else:
return [x1, y1], [x2, y2]
while True:
n = int(input())
if n == 0:
break
p = []
for i in range(n):
p.append(list(map(float, input().split(","))))
ans = 0
for i in range(n - 1):
for j in range(i + 1, n):
if not overlap(p[i], p[j], 4):
continue
p1, p2 = intersection(p[i], p[j])
cnt1 = 0
cnt2 = 0
for k in range(n):
if overlap(p1, p[k], 1):
cnt1 += 1
if p2[0] != None and overlap(p2, p[k], 1):
cnt2 += 1
ans = max([ans, cnt1, cnt2])
print(ans)
| Traceback (most recent call last):
File "/tmp/tmpj281qg51/tmpcqb_xydz.py", line 27, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s728797119 | p00090 | u024715419 | 1522316250 | Python | Python3 | py | Runtime Error | 0 | 0 | 1340 | import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2*(o1[0]**2 + o1[1]**2 - 1) + c**2 + 2*b*c*o1[1]
x1 = (-b2 + math.sqrt(b2**2 - a2*c2))/a2
x2 = (-b2 - math.sqrt(b2**2 - a2*c2))/a2
if b == 0:
y1 = (o1[1] + o2[1])/2
y2 = (o1[1] + o2[1])/2
else:
y1 = -(a*x1 + c)/b
y2 = -(a*x2 + c)/b
if b2**2 - a2*c2 < 10e-6:
return [x1, y1], [None, None]
else:
return [x1, y1], [x2, y2]
while True:
n = int(input())
if n == 0:
break
p = []
for i in range(n):
p.append(list(map(float, input().split(","))))
ans = 0
for i in range(n - 1):
for j in range(i + 1, n):
if not overlap(p[i], p[j], 4):
continue
p1, p2 = intersection(p[i], p[j])
cnt1 = 0
cnt2 = 0
for k in range(n):
if overlap(p1, p[k], 1):
cnt1 += 1
if p2[0] != None and overlap(p2, p[k], 1):
cnt2 += 1
ans = max([ans, cnt1, cnt2])
print(ans)
| Traceback (most recent call last):
File "/tmp/tmp383gi39v/tmplwrxj9d0.py", line 27, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s777396027 | p00090 | u024715419 | 1522316275 | Python | Python3 | py | Runtime Error | 0 | 0 | 1340 | import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2*(o1[0]**2 + o1[1]**2 - 1) + c**2 + 2*b*c*o1[1]
x1 = (-b2 + math.sqrt(b2**2 - a2*c2))/a2
x2 = (-b2 - math.sqrt(b2**2 - a2*c2))/a2
if b == 0:
y1 = (o1[1] + o2[1])/2
y2 = (o1[1] + o2[1])/2
else:
y1 = -(a*x1 + c)/b
y2 = -(a*x2 + c)/b
if b2**2 - a2*c2 < 10e-6:
return [x1, y1], [None, None]
else:
return [x1, y1], [x2, y2]
while True:
n = int(input())
if n == 0:
break
p = []
for i in range(n):
p.append(list(map(float, input().split(","))))
ans = 0
for i in range(n - 1):
for j in range(i + 1, n):
if not overlap(p[i], p[j], 4):
continue
p1, p2 = intersection(p[i], p[j])
cnt1 = 0
cnt2 = 0
for k in range(n):
if overlap(p1, p[k], 1):
cnt1 += 1
if p2[0] != None and overlap(p2, p[k], 1):
cnt2 += 1
ans = max([ans, cnt1, cnt2])
print(ans)
| Traceback (most recent call last):
File "/tmp/tmp58kwz86u/tmpm_5zrx7h.py", line 27, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s093903565 | p00090 | u024715419 | 1522316428 | Python | Python3 | py | Runtime Error | 0 | 0 | 1340 | import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2*(o1[0]**2 + o1[1]**2 - 1) + c**2 + 2*b*c*o1[1]
x1 = (-b2 + math.sqrt(b2**2 - a2*c2))/a2
x2 = (-b2 - math.sqrt(b2**2 - a2*c2))/a2
if b == 0:
y1 = (o1[1] + o2[1])/2
y2 = (o1[1] + o2[1])/2
else:
y1 = -(a*x1 + c)/b
y2 = -(a*x2 + c)/b
if b2**2 - a2*c2 < 10e-6:
return [x1, y1], [None, None]
else:
return [x1, y1], [x2, y2]
while True:
n = int(input())
if n == 0:
break
p = []
for i in range(n):
p.append(list(map(float, input().split(","))))
ans = 0
for i in range(n - 1):
for j in range(i + 1, n):
if not overlap(p[i], p[j], 4):
continue
p1, p2 = intersection(p[i], p[j])
cnt1 = 0
cnt2 = 0
for k in range(n):
if overlap(p1, p[k], 1):
cnt1 += 1
if p2[0] != None and overlap(p2, p[k], 1):
cnt2 += 1
ans = max([ans, cnt1, cnt2])
print(ans)
| Traceback (most recent call last):
File "/tmp/tmp38dyokzh/tmpozkuqyw_.py", line 27, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s563706308 | p00090 | u024715419 | 1522396173 | Python | Python3 | py | Runtime Error | 0 | 0 | 1340 | import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2*(o1[0]**2 + o1[1]**2 - 1) + c**2 + 2*b*c*o1[1]
x1 = (-b2 + math.sqrt(b2**2 - a2*c2))/a2
x2 = (-b2 - math.sqrt(b2**2 - a2*c2))/a2
if b == 0:
y1 = (o1[1] + o2[1])/2
y2 = (o1[1] + o2[1])/2
else:
y1 = -(a*x1 + c)/b
y2 = -(a*x2 + c)/b
if b2**2 - a2*c2 < 10e-6:
return [x1, y1], [None, None]
else:
return [x1, y1], [x2, y2]
while True:
n = int(input())
if n == 0:
break
p = []
for i in range(n):
p.append(list(map(float, input().split(","))))
ans = 0
for i in range(n - 1):
for j in range(i + 1, n):
if not overlap(p[i], p[j], 4):
continue
p1, p2 = intersection(p[i], p[j])
cnt1 = 0
cnt2 = 0
for k in range(n):
if overlap(p1, p[k], 1):
cnt1 += 1
if p2[0] != None and overlap(p2, p[k], 1):
cnt2 += 1
ans = max([ans, cnt1, cnt2])
print(ans)
| Traceback (most recent call last):
File "/tmp/tmpt7imtbjf/tmpb5jwvt11.py", line 27, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s700517780 | p00090 | u024715419 | 1522397200 | Python | Python3 | py | Runtime Error | 0 | 0 | 1340 | import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2*(o1[0]**2 + o1[1]**2 - 1) + c**2 + 2*b*c*o1[1]
x1 = (-b2 + math.sqrt(b2**2 - a2*c2))/a2
x2 = (-b2 - math.sqrt(b2**2 - a2*c2))/a2
if b == 0:
y1 = (o1[1] + o2[1])/2
y2 = (o1[1] + o2[1])/2
else:
y1 = -(a*x1 + c)/b
y2 = -(a*x2 + c)/b
if b2**2 - a2*c2 < 10e-6:
return [x1, y1], [None, None]
else:
return [x1, y1], [x2, y2]
while True:
n = int(input())
if n == 0:
break
p = []
for i in range(n):
p.append(list(map(float, input().split(","))))
ans = 0
for i in range(n - 1):
for j in range(i + 1, n):
if not overlap(p[i], p[j], 4):
continue
p1, p2 = intersection(p[i], p[j])
cnt1 = 0
cnt2 = 0
for k in range(n):
if overlap(p1, p[k], 1):
cnt1 += 1
if p2[0] != None and overlap(p2, p[k], 1):
cnt2 += 1
ans = max([ans, cnt1, cnt2])
print(ans)
| Traceback (most recent call last):
File "/tmp/tmpoj41pab5/tmpt0sz6cc0.py", line 27, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s475461386 | p00090 | u024715419 | 1522397209 | Python | Python3 | py | Runtime Error | 0 | 0 | 1327 | def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2*(o1[0]**2 + o1[1]**2 - 1) + c**2 + 2*b*c*o1[1]
x1 = (-b2 + math.sqrt(b2**2 - a2*c2))/a2
x2 = (-b2 - math.sqrt(b2**2 - a2*c2))/a2
if b == 0:
y1 = (o1[1] + o2[1])/2
y2 = (o1[1] + o2[1])/2
else:
y1 = -(a*x1 + c)/b
y2 = -(a*x2 + c)/b
if b2**2 - a2*c2 < 10e-6:
return [x1, y1], [None, None]
else:
return [x1, y1], [x2, y2]
while True:
n = int(input())
if n == 0:
break
p = []
for i in range(n):
p.append(list(map(float, input().split(","))))
ans = 0
for i in range(n - 1):
for j in range(i + 1, n):
if not overlap(p[i], p[j], 4):
continue
p1, p2 = intersection(p[i], p[j])
cnt1 = 0
cnt2 = 0
for k in range(n):
if overlap(p1, p[k], 1):
cnt1 += 1
if p2[0] != None and overlap(p2, p[k], 1):
cnt2 += 1
ans = max([ans, cnt1, cnt2])
print(ans)
| Traceback (most recent call last):
File "/tmp/tmpx2eogjbg/tmp9_40nc3b.py", line 25, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s314719186 | p00090 | u024715419 | 1522397657 | Python | Python3 | py | Runtime Error | 0 | 0 | 1410 | import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2*(o1[0]**2 + o1[1]**2 - 1) + c**2 + 2*b*c*o1[1]
x1 = (-b2 + math.sqrt(b2**2 - a2*c2))/a2
x2 = (-b2 - math.sqrt(b2**2 - a2*c2))/a2
if b == 0:
y1 = (o1[1] + o2[1])/2
y2 = (o1[1] + o2[1])/2
else:
y1 = -(a*x1 + c)/b
y2 = -(a*x2 + c)/b
if b2**2 - a2*c2 < 10e-6:
return [x1, y1], [None, None]
else:
return [x1, y1], [x2, y2]
while True:
n = int(input())
if n == 0:
break
p = []
for i in range(n):
p.append(list(map(float, input().split(","))))
ans = 0
for i in range(n - 1):
for j in range(i + 1, n):
if not overlap(p[i], p[j], 4):
continue
elif overlap(p[i], p[j], 10e-6):
continue
p1, p2 = intersection(p[i], p[j])
cnt1 = 0
cnt2 = 0
for k in range(n):
if overlap(p1, p[k], 1):
cnt1 += 1
if p2[0] != None and overlap(p2, p[k], 1):
cnt2 += 1
ans = max([ans, cnt1, cnt2])
print(ans)
| Traceback (most recent call last):
File "/tmp/tmp0uoyzntq/tmpyma6u8_h.py", line 27, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s129204235 | p00090 | u024715419 | 1522398503 | Python | Python3 | py | Runtime Error | 0 | 0 | 1471 | import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
if a2 < 10e-6:
return [None, None], [None, None]
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2*(o1[0]**2 + o1[1]**2 - 1) + c**2 + 2*b*c*o1[1]
x1 = (-b2 + math.sqrt(b2**2 - a2*c2))/a2
x2 = (-b2 - math.sqrt(b2**2 - a2*c2))/a2
if b == 0:
y1 = (o1[1] + o2[1])/2
y2 = (o1[1] + o2[1])/2
else:
y1 = -(a*x1 + c)/b
y2 = -(a*x2 + c)/b
if b2**2 - a2*c2 < 10e-6:
return [x1, y1], [None, None]
else:
return [x1, y1], [x2, y2]
while True:
n = int(input())
if n == 0:
break
p = []
for i in range(n):
p.append(list(map(float, input().split(","))))
ans = 0
for i in range(n - 1):
for j in range(i + 1, n):
if not overlap(p[i], p[j], 4):
continue
elif overlap(p[i], p[j], 10e-6):
continue
p1, p2 = intersection(p[i], p[j])
cnt1 = 0
cnt2 = 0
for k in range(n):
if overlap(p1, p[k], 1):
cnt1 += 1
if p2[0] != None and overlap(p2, p[k], 1):
cnt2 += 1
ans = max([ans, cnt1, cnt2])
print(ans)
| Traceback (most recent call last):
File "/tmp/tmp4d8u_l9n/tmpx2cnn1pq.py", line 29, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s311494622 | p00090 | u024715419 | 1522398713 | Python | Python3 | py | Runtime Error | 0 | 0 | 1470 | import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2*(o1[0]**2 + o1[1]**2 - 1) + c**2 + 2*b*c*o1[1]
x1 = (-b2 + math.sqrt(b2**2 - a2*c2))/a2
x2 = (-b2 - math.sqrt(b2**2 - a2*c2))/a2
if b == 0:
y1 = (o1[1] + o2[1])/2
y2 = (o1[1] + o2[1])/2
else:
y1 = -(a*x1 + c)/b
y2 = -(a*x2 + c)/b
if b2**2 - a2*c2 < 10e-6:
return [x1, y1], [None, None]
else:
return [x1, y1], [x2, y2]
while True:
n = int(input())
if n == 0:
break
p = []
for i in range(n):
p.append(list(map(float, input().split(","))))
ans = 0
for i in range(n - 1):
for j in range(i + 1, n):
if not overlap(p[i], p[j], 4):
continue
elif overlap(p[i], p[j], 10e-6):
continue
p1, p2 = intersection(p[i], p[j])
print(p1,p2)
cnt1 = 0
cnt2 = 0
for k in range(n):
if overlap(p1, p[k], 1):
cnt1 += 1
if p2[0] != None and overlap(p2, p[k], 1):
cnt2 += 1
print(ans, cnt1, cnt2)
ans = max([ans, cnt1, cnt2])
print(ans)
| Traceback (most recent call last):
File "/tmp/tmp8qld4e1b/tmphccy_8zr.py", line 27, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s158235758 | p00090 | u024715419 | 1522398843 | Python | Python3 | py | Runtime Error | 0 | 0 | 1421 | import math
import sys
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2*(o1[0]**2 + o1[1]**2 - 1) + c**2 + 2*b*c*o1[1]
x1 = (-b2 + math.sqrt(b2**2 - a2*c2))/a2
x2 = (-b2 - math.sqrt(b2**2 - a2*c2))/a2
if b == 0:
y1 = (o1[1] + o2[1])/2
y2 = (o1[1] + o2[1])/2
else:
y1 = -(a*x1 + c)/b
y2 = -(a*x2 + c)/b
if b2**2 - a2*c2 < 10e-6:
return [x1, y1], [None, None]
else:
return [x1, y1], [x2, y2]
while True:
n = int(input())
if n == 0:
break
p = []
for i in range(n):
p.append(list(map(float, input().split(","))))
ans = 0
for i in range(n - 1):
for j in range(i + 1, n):
if not overlap(p[i], p[j], 4):
continue
elif overlap(p[i], p[j], 10e-6):
continue
p1, p2 = intersection(p[i], p[j])
cnt1 = 0
cnt2 = 0
for k in range(n):
if overlap(p1, p[k], 1):
cnt1 += 1
if p2[0] != None and overlap(p2, p[k], 1):
cnt2 += 1
ans = max([ans, cnt1, cnt2])
print(ans)
| Traceback (most recent call last):
File "/tmp/tmp3zro_sr6/tmphpok0047.py", line 28, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s307378979 | p00090 | u024715419 | 1522398863 | Python | Python3 | py | Runtime Error | 0 | 0 | 1413 | import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2*(o1[0]**2 + o1[1]**2 - 1) + c**2 + 2*b*c*o1[1]
x1 = (-b2 + math.sqrt(b2**2 - a2*c2))/a2
x2 = (-b2 - math.sqrt(b2**2 - a2*c2))/a2
if b < 10e-6:
y1 = (o1[1] + o2[1])/2
y2 = (o1[1] + o2[1])/2
else:
y1 = -(a*x1 + c)/b
y2 = -(a*x2 + c)/b
if b2**2 - a2*c2 < 10e-6:
return [x1, y1], [None, None]
else:
return [x1, y1], [x2, y2]
while True:
n = int(input())
if n == 0:
break
p = []
for i in range(n):
p.append(list(map(float, input().split(","))))
ans = 0
for i in range(n - 1):
for j in range(i + 1, n):
if not overlap(p[i], p[j], 4):
continue
elif overlap(p[i], p[j], 10e-6):
continue
p1, p2 = intersection(p[i], p[j])
cnt1 = 0
cnt2 = 0
for k in range(n):
if overlap(p1, p[k], 1):
cnt1 += 1
if p2[0] != None and overlap(p2, p[k], 1):
cnt2 += 1
ans = max([ans, cnt1, cnt2])
print(ans)
| Traceback (most recent call last):
File "/tmp/tmp9s3ajvpr/tmpj6zicsqp.py", line 27, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s265367778 | p00090 | u024715419 | 1522828085 | Python | Python3 | py | Runtime Error | 0 | 0 | 1413 | import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2*(o1[0]**2 + o1[1]**2 - 1) + c**2 + 2*b*c*o1[1]
x1 = (-b2 + math.sqrt(b2**2 - a2*c2))/a2
x2 = (-b2 - math.sqrt(b2**2 - a2*c2))/a2
if b < 10e-6:
y1 = (o1[1] + o2[1])/2
y2 = (o1[1] + o2[1])/2
else:
y1 = -(a*x1 + c)/b
y2 = -(a*x2 + c)/b
if b2**2 - a2*c2 < 10e-6:
return [x1, y1], [None, None]
else:
return [x1, y1], [x2, y2]
while True:
n = int(input())
if n == 0:
break
p = []
for i in range(n):
p.append(list(map(float, input().split(","))))
ans = 0
for i in range(n - 1):
for j in range(i + 1, n):
if not overlap(p[i], p[j], 4):
continue
elif overlap(p[i], p[j], 10e-6):
continue
p1, p2 = intersection(p[i], p[j])
cnt1 = 0
cnt2 = 0
for k in range(n):
if overlap(p1, p[k], 1):
cnt1 += 1
if p2[0] != None and overlap(p2, p[k], 1):
cnt2 += 1
ans = max([ans, cnt1, cnt2])
print(ans)
| Traceback (most recent call last):
File "/tmp/tmp3s5lylck/tmpl_2onb7y.py", line 27, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s230477463 | p00090 | u024715419 | 1522828635 | Python | Python3 | py | Runtime Error | 0 | 0 | 1413 | import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2*(o1[0]**2 + o1[1]**2 - 1) + c**2 + 2*b*c*o1[1]
x1 = (-b2 + math.sqrt(b2**2 + a2*c2))/a2
x2 = (-b2 - math.sqrt(b2**2 + a2*c2))/a2
if b < 10e-6:
y1 = (o1[1] + o2[1])/2
y2 = (o1[1] + o2[1])/2
else:
y1 = -(a*x1 + c)/b
y2 = -(a*x2 + c)/b
if b2**2 - a2*c2 < 10e-6:
return [x1, y1], [None, None]
else:
return [x1, y1], [x2, y2]
while True:
n = int(input())
if n == 0:
break
p = []
for i in range(n):
p.append(list(map(float, input().split(","))))
ans = 0
for i in range(n - 1):
for j in range(i + 1, n):
if not overlap(p[i], p[j], 4):
continue
elif overlap(p[i], p[j], 10e-6):
continue
p1, p2 = intersection(p[i], p[j])
cnt1 = 0
cnt2 = 0
for k in range(n):
if overlap(p1, p[k], 1):
cnt1 += 1
if p2[0] != None and overlap(p2, p[k], 1):
cnt2 += 1
ans = max([ans, cnt1, cnt2])
print(ans)
| Traceback (most recent call last):
File "/tmp/tmpkv7us716/tmp6ityukvw.py", line 27, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s814436837 | p00090 | u024715419 | 1522828660 | Python | Python3 | py | Runtime Error | 0 | 0 | 1413 | import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2*(o1[0]**2 + o1[1]**2 - 1) + c**2 + 2*b*c*o1[1]
x1 = (-b2 + math.sqrt(b2**2 + a2*c2))/a2
x2 = (-b2 - math.sqrt(b2**2 + a2*c2))/a2
if b < 10e-6:
y1 = (o1[1] + o2[1])/2
y2 = (o1[1] + o2[1])/2
else:
y1 = -(a*x1 + c)/b
y2 = -(a*x2 + c)/b
if b2**2 - a2*c2 < 10e-6:
return [x1, y1], [None, None]
else:
return [x1, y1], [x2, y2]
while True:
n = int(input())
if n == 0:
break
p = []
for i in range(n):
p.append(list(map(float, input().split(","))))
ans = 0
for i in range(n - 1):
for j in range(i + 1, n):
if not overlap(p[i], p[j], 4):
continue
elif overlap(p[i], p[j], 10e-6):
continue
p1, p2 = intersection(p[i], p[j])
cnt1 = 0
cnt2 = 0
for k in range(n):
if overlap(p1, p[k], 1):
cnt1 += 1
if p2[0] != None and overlap(p2, p[k], 1):
cnt2 += 1
ans = max([ans, cnt1, cnt2])
print(ans)
| Traceback (most recent call last):
File "/tmp/tmpcyn6dicy/tmpsboa7nwx.py", line 27, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s295198399 | p00090 | u024715419 | 1522829009 | Python | Python3 | py | Runtime Error | 0 | 0 | 1409 | import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2*(o1[0]**2 + o1[1]**2 - 1) + c**2 + 2*b*c*o1[1]
x1 = (-b2 + math.sqrt(b2**2 - a2*c2))/a2
x2 = (-b2 - math.sqrt(b2**2 - a2*c2))/a2
if b < 10e-6:
y1 = (o1[1] + o2[1])/2
y2 = (o1[1] + o2[1])/2
else:
y1 = -(a*x1 + c)/b
y2 = -(a*x2 + c)/b
if b2**2 - a2*c2 < 10e-6:
return [x1, y1], [x2, y2]
else:
return [x1, y1], [x2, y2]
while True:
n = int(input())
if n == 0:
break
p = []
for i in range(n):
p.append(list(map(float, input().split(","))))
ans = 0
for i in range(n - 1):
for j in range(i + 1, n):
if not overlap(p[i], p[j], 4):
continue
elif overlap(p[i], p[j], 10e-6):
continue
p1, p2 = intersection(p[i], p[j])
cnt1 = 0
cnt2 = 0
for k in range(n):
if overlap(p1, p[k], 1):
cnt1 += 1
if p2[0] != None and overlap(p2, p[k], 1):
cnt2 += 1
ans = max([ans, cnt1, cnt2])
print(ans)
| Traceback (most recent call last):
File "/tmp/tmp15ey3phm/tmp36q1jhk1.py", line 27, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s309225317 | p00090 | u024715419 | 1522829074 | Python | Python3 | py | Runtime Error | 0 | 0 | 1418 | import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2*(o1[0]**2 + o1[1]**2 - 1) + c**2 + 2*b*c*o1[1]
x1 = (-b2 + math.sqrt(b2**2 - a2*c2))/a2
x2 = (-b2 - math.sqrt(b2**2 - a2*c2))/a2
if b < 0.0001:
y1 = (o1[1] + o2[1])/2
y2 = (o1[1] + o2[1])/2
else:
y1 = -(a*x1 + c)/b
y2 = -(a*x2 + c)/b
if b2**2 - a2*c2 < 0.0001:
return [x1, y1], [None, None]
else:
return [x1, y1], [x2, y2]
while True:
n = int(input())
if n == 0:
break
p = []
for i in range(n):
p.append(list(map(float, input().split(","))))
ans = 0
for i in range(n - 1):
for j in range(i + 1, n):
if not overlap(p[i], p[j], 4):
continue
elif overlap(p[i], p[j], 0.000001):
continue
p1, p2 = intersection(p[i], p[j])
cnt1 = 0
cnt2 = 0
for k in range(n):
if overlap(p1, p[k], 1):
cnt1 += 1
if p2[0] != None and overlap(p2, p[k], 1):
cnt2 += 1
ans = max([ans, cnt1, cnt2])
print(ans)
| Traceback (most recent call last):
File "/tmp/tmprp7xzi3l/tmpqsn7y8wj.py", line 27, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s000228292 | p00090 | u024715419 | 1522829129 | Python | Python3 | py | Runtime Error | 0 | 0 | 1423 | import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2*(o1[0]**2 + o1[1]**2 - 1) + c**2 + 2*b*c*o1[1]
x1 = (-b2 + math.sqrt(b2**2 - a2*c2))/a2
x2 = (-b2 - math.sqrt(b2**2 - a2*c2))/a2
if abs(b) < 10e-6:
y1 = (o1[1] + o2[1])/2
y2 = (o1[1] + o2[1])/2
else:
y1 = -(a*x1 + c)/b
y2 = -(a*x2 + c)/b
if abs(b2**2 - a2*c2) < 10e-6:
return [x1, y1], [None, None]
else:
return [x1, y1], [x2, y2]
while True:
n = int(input())
if n == 0:
break
p = []
for i in range(n):
p.append(list(map(float, input().split(","))))
ans = 0
for i in range(n - 1):
for j in range(i + 1, n):
if not overlap(p[i], p[j], 4):
continue
elif overlap(p[i], p[j], 10e-6):
continue
p1, p2 = intersection(p[i], p[j])
cnt1 = 0
cnt2 = 0
for k in range(n):
if overlap(p1, p[k], 1):
cnt1 += 1
if p2[0] != None and overlap(p2, p[k], 1):
cnt2 += 1
ans = max([ans, cnt1, cnt2])
print(ans)
| Traceback (most recent call last):
File "/tmp/tmp44fjs7ns/tmp2fe84k1q.py", line 27, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s657835663 | p00090 | u024715419 | 1522913451 | Python | Python3 | py | Runtime Error | 0 | 0 | 1353 | import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d**2
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2*(o1[0]**2 + o1[1]**2 - 1) + c**2 + 2*b*c*o1[1]
x1 = (-b2 + math.sqrt(b2**2 - a2*c2))/a2
x2 = (-b2 - math.sqrt(b2**2 - a2*c2))/a2
if abs(b) == 0:
tmp = math.sqrt(1 - (x1 - o1[0])**2)
y1 = o1[1] + math.sqrt(1 - (x1 - o1[0])**2)
y2 = o1[1] - math.sqrt(1 - (x1 - o1[0])**2)
else:
y1 = -(a*x1 + c)/b
y2 = -(a*x2 + c)/b
return [x1, y1], [x2, y2]
while True:
n = int(input())
if n == 0:
break
p = []
for i in range(n):
p.append(list(map(float, input().split(","))))
ans = 0
for i in range(n - 1):
for j in range(i + 1, n):
if not overlap(p[i], p[j], 2):
continue
p1, p2 = intersection(p[i], p[j])
cnt1 = 0
cnt2 = 0
for k in range(n):
if overlap(p1, p[k], 1):
cnt1 += 1
if p2[0] != None and overlap(p2, p[k], 1):
cnt2 += 1
ans = max([ans, cnt1, cnt2])
print(ans)
| Traceback (most recent call last):
File "/tmp/tmpmgrmq9mj/tmpesrvg4aq.py", line 25, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s236327135 | p00090 | u024715419 | 1522922474 | Python | Python3 | py | Runtime Error | 0 | 0 | 1290 | import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d**2
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2*(o1[0]**2 + o1[1]**2 - 1) + c**2 + 2*b*c*o1[1]
x1 = (-b2 + math.sqrt(b2**2 - a2*c2))/a2
x2 = (-b2 - math.sqrt(b2**2 - a2*c2))/a2
if abs(b) == 0:
y1 = o1[1] + math.sqrt(1 - (x1 - o1[0])**2)
y2 = o1[1] - math.sqrt(1 - (x1 - o1[0])**2)
else:
y1 = -(a*x1 + c)/b
y2 = -(a*x2 + c)/b
return [x1, y1], [x2, y2]
while True:
n = int(input())
if n == 0:
break
p = []
for i in range(n):
p.append(list(map(float, input().split(","))))
ans = 1
for i in range(n - 1):
for j in range(i + 1, n):
if not overlap(p[i], p[j], 2):
continue
p1, p2 = intersection(p[i], p[j])
cnt1 = 0
cnt2 = 0
for k in range(n):
if overlap(p1, p[k], 1):
cnt1 += 1
if overlap(p2, p[k], 1):
cnt2 += 1
ans = max([ans, cnt1, cnt2])
print(ans)
| Traceback (most recent call last):
File "/tmp/tmp673zqutg/tmppo7qh6mj.py", line 24, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s875163946 | p00090 | u024715419 | 1522922780 | Python | Python3 | py | Runtime Error | 0 | 0 | 1289 | import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 < d**2
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2*(o1[0]**2 + o1[1]**2 - 1) + c**2 + 2*b*c*o1[1]
x1 = (-b2 + math.sqrt(b2**2 - a2*c2))/a2
x2 = (-b2 - math.sqrt(b2**2 - a2*c2))/a2
if abs(b) == 0:
y1 = o1[1] + math.sqrt(1 - (x1 - o1[0])**2)
y2 = o1[1] - math.sqrt(1 - (x1 - o1[0])**2)
else:
y1 = -(a*x1 + c)/b
y2 = -(a*x2 + c)/b
return [x1, y1], [x2, y2]
while True:
n = int(input())
if n == 0:
break
p = []
for i in range(n):
p.append(list(map(float, input().split(","))))
ans = 1
for i in range(n - 1):
for j in range(i + 1, n):
if not overlap(p[i], p[j], 2):
continue
p1, p2 = intersection(p[i], p[j])
cnt1 = 0
cnt2 = 0
for k in range(n):
if overlap(p1, p[k], 1):
cnt1 += 1
if overlap(p2, p[k], 1):
cnt2 += 1
ans = max([ans, cnt1, cnt2])
print(ans)
| Traceback (most recent call last):
File "/tmp/tmpsph3iijy/tmp76y4mco2.py", line 24, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s002537637 | p00090 | u024715419 | 1522923281 | Python | Python3 | py | Runtime Error | 0 | 0 | 1320 | import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d**2
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2*(o1[0]**2 + o1[1]**2 - 1) + c**2 + 2*b*c*o1[1]
x1 = (-b2 + math.sqrt(b2**2 - a2*c2))/a2
x2 = (-b2 - math.sqrt(b2**2 - a2*c2))/a2
if abs(b) == 0:
y1 = o1[1] + math.sqrt(1 - (x1 - o1[0])**2)
y2 = o1[1] - math.sqrt(1 - (x1 - o1[0])**2)
else:
y1 = -(a*x1 + c)/b
y2 = -(a*x2 + c)/b
return [x1, y1], [x2, y2]
while True:
n = int(input())
if n == 0:
break
p = []
for i in range(n):
p.append(list(map(float, input().split(","))))
ans = 1
for i in range(n - 1):
for j in range(i + 1, n):
if not overlap(p[i], p[j], 2) or overlap(p[i], p[j], 1e-10):
continue
p1, p2 = intersection(p[i], p[j])
cnt1 = 0
cnt2 = 0
for k in range(n):
if overlap(p1, p[k], 1):
cnt1 += 1
if overlap(p2, p[k], 1):
cnt2 += 1
ans = max([ans, cnt1, cnt2])
print(ans)
| Traceback (most recent call last):
File "/tmp/tmpx2e141cr/tmpp88trsio.py", line 24, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s586536149 | p00090 | u024715419 | 1522923611 | Python | Python3 | py | Runtime Error | 0 | 0 | 1292 | import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d**2
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2*(o1[0]**2 + o1[1]**2 - 1) + c**2 + 2*b*c*o1[1]
x1 = (-b2 + math.sqrt(b2**2 - a2*c2))/a2
x2 = (-b2 - math.sqrt(b2**2 - a2*c2))/a2
if abs(b) == 0:
y1 = o1[1] + math.sqrt(1 - (x1 - o1[0])**2)
y2 = o1[1] - math.sqrt(1 - (x1 - o1[0])**2)
else:
y1 = -(a*x1 + c)/b
y2 = -(a*x2 + c)/b
return [[x1, y1], [x2, y2]]
while True:
n = int(input())
if n == 0:
break
p = []
for i in range(n):
p.append(list(map(float, input().split(","))))
ans = 1
for i in range(n - 1):
for j in range(i + 1, n):
if not overlap(p[i], p[j], 2):
continue
p1, p2 = intersection(p[i], p[j])
cnt1 = 0
cnt2 = 0
for k in range(n):
if overlap(p1, p[k], 1):
cnt1 += 1
if overlap(p2, p[k], 1):
cnt2 += 1
ans = max([ans, cnt1, cnt2])
print(ans)
| Traceback (most recent call last):
File "/tmp/tmphd7fngpq/tmpf_dqfmar.py", line 24, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s294848920 | p00090 | u024715419 | 1522925039 | Python | Python3 | py | Runtime Error | 0 | 0 | 1279 | import math
def dist(p1, p2):
return math.sqrt((p1[0] - p2[0])**2 + (p1[1] - p2[1])**2)
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2*(o1[0]**2 + o1[1]**2 - 1) + c**2 + 2*b*c*o1[1]
x1 = (-b2 + math.sqrt(b2**2 - a2*c2))/a2
x2 = (-b2 - math.sqrt(b2**2 - a2*c2))/a2
if abs(b) == 0:
y1 = o1[1] + math.sqrt(1 - (x1 - o1[0])**2)
y2 = o1[1] - math.sqrt(1 - (x1 - o1[0])**2)
else:
y1 = -(a*x1 + c)/b
y2 = -(a*x2 + c)/b
return [x1, y1], [x2, y2]
while True:
n = int(input())
if n == 0:
break
p = []
for i in range(n):
p.append(list(map(float, input().split(","))))
ans = 1
for i in range(n - 1):
for j in range(i + 1, n):
if dist(p[i], p[j]) > 2:
continue
p1, p2 = intersection(p[i], p[j])
cnt1 = 0
cnt2 = 0
for k in range(n):
if dist(p1, p[k]) <= 1:
cnt1 += 1
if dist(p2, p[k]) <= 1:
cnt2 += 1
ans = max([ans, cnt1, cnt2])
print(ans)
| Traceback (most recent call last):
File "/tmp/tmpli6uf0bu/tmp1y4qic21.py", line 24, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s426291203 | p00090 | u024715419 | 1524032618 | Python | Python3 | py | Runtime Error | 0 | 0 | 1290 | import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d**2
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2*(o1[0]**2 + o1[1]**2 - 1) + c**2 + 2*b*c*o1[1]
x1 = (-b2 + math.sqrt(b2**2 - a2*c2))/a2
x2 = (-b2 - math.sqrt(b2**2 - a2*c2))/a2
if abs(b) == 0:
y1 = o1[1] + math.sqrt(1 - (x1 - o1[0])**2)
y2 = o1[1] - math.sqrt(1 - (x1 - o1[0])**2)
else:
y1 = -(a*x1 + c)/b
y2 = -(a*x2 + c)/b
return [x1, y1], [x2, y2]
while True:
n = int(input())
if n == 0:
break
p = []
for i in range(n):
p.append(list(map(float, input().split(","))))
ans = 1
for i in range(n - 1):
for j in range(i + 1, n):
if not overlap(p[i], p[j], 2):
continue
p1, p2 = intersection(p[i], p[j])
cnt1 = 0
cnt2 = 0
for k in range(n):
if overlap(p1, p[k], 1):
cnt1 += 1
if overlap(p2, p[k], 1):
cnt2 += 1
ans = max([ans, cnt1, cnt2])
print(ans)
| Traceback (most recent call last):
File "/tmp/tmp2zfad0pf/tmpomftsc49.py", line 24, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s376445301 | p00090 | u024715419 | 1524034512 | Python | Python3 | py | Runtime Error | 0 | 0 | 1310 | import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 - d**2
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2*(o1[0]**2 + o1[1]**2 - 1) + c**2 + 2*b*c*o1[1]
x1 = (-b2 + math.sqrt(b2**2 - a2*c2))/a2
x2 = (-b2 - math.sqrt(b2**2 - a2*c2))/a2
if abs(b) == 0:
y1 = o1[1] + math.sqrt(1 - (x1 - o1[0])**2)
y2 = o1[1] - math.sqrt(1 - (x1 - o1[0])**2)
else:
y1 = -(a*x1 + c)/b
y2 = -(a*x2 + c)/b
return [x1, y1], [x2, y2]
err = 1.0e-6
while True:
n = int(input())
if n == 0:
break
p = []
for i in range(n):
p.append(list(map(float, input().split(","))))
ans = 1
for i in range(n - 1):
for j in range(i + 1, n):
if overlap(p[i], p[j], 2) > 0:
continue
p1, p2 = intersection(p[i], p[j])
cnt1 = 0
cnt2 = 0
for k in range(n):
if overlap(p1, p[k], 1) < 0:
cnt1 += 1
if overlap(p2, p[k], 1) < 0:
cnt2 += 1
ans = max([ans, cnt1, cnt2])
print(ans)
| Traceback (most recent call last):
File "/tmp/tmpsteba4jf/tmp_bqmz1lj.py", line 25, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s875479376 | p00090 | u024715419 | 1524035326 | Python | Python3 | py | Runtime Error | 0 | 0 | 1493 | import math
def overlap(p1, p2, d):
return (p1[0] - p2[0])**2 + (p1[1] - p2[1])**2 <= d**2
def intersection(o1,o2):
a = 2*(o2[0] - o1[0])
b = 2*(o2[1] - o1[1])
c = (o1[0] - o2[0])*(o1[0] + o2[0]) + (o1[1] - o2[1])*(o1[1] + o2[1])
a2 = a**2 + b**2
b2 = a*c + a*b*o1[1] - b**2*o1[0]
c2 = b**2*(o1[0]**2 + o1[1]**2 - 1) + c**2 + 2*b*c*o1[1]
judge = b2**2 - a2*c2
if judge < 0:
return None, None
elif abs(judge) < 1.0e-6:
x = -b2/a2
y = -(a*x + c)/b
return [x,y], None
else:
x1 = (-b2 + math.sqrt(b2**2 - a2*c2))/a2
x2 = (-b2 - math.sqrt(b2**2 - a2*c2))/a2
if abs(b) == 0:
y1 = o1[1] + math.sqrt(1 - (x1 - o1[0])**2)
y2 = o1[1] - math.sqrt(1 - (x1 - o1[0])**2)
else:
y1 = -(a*x1 + c)/b
y2 = -(a*x2 + c)/b
return [x1, y1], [x2, y2]
while True:
n = int(input())
if n == 0:
break
p = []
for i in range(n):
p.append(list(map(float, input().split(","))))
ans = 1
for i in range(n - 1):
for j in range(i + 1, n):
if not overlap(p[i], p[j], 2):
continue
p1, p2 = intersection(p[i], p[j])
cnt1 = 0
cnt2 = 0
for k in range(n):
if p1 and overlap(p1, p[k], 1):
cnt1 += 1
if p2 and overlap(p2, p[k], 1):
cnt2 += 1
ans = max([ans, cnt1, cnt2])
print(ans)
| Traceback (most recent call last):
File "/tmp/tmp6aaxslt4/tmp1q147zkz.py", line 32, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s615018048 | p00090 | u150984829 | 1525315616 | Python | Python3 | py | Runtime Error | 0 | 0 | 574 | def x(p0, p1):
d = abs(p0 - p1)
if d > 2:
return []
elif d == 2:
return [(p0 + p1) / 2]
else:
m = (p0 + p1) / 2
v = m - p0
w = complex(v.imag, -v.real)
l = abs(w)
h = (1 - l ** 2) ** .5 * w / l
return [m + h, m - h]
for e in iter(input, '0'):
n = int(e)
P = [complex(*map(float, input().split(','))) for _ in [0] * n]
Q = []
for i in range(n):
for j in range(i + 1, n):
Q += x(P[i], P[j])
print(max(1, *[sum(1.01 >= abs(q - p) for p in P) for q in Q]))
| Traceback (most recent call last):
File "/tmp/tmp6rww04hd/tmprpa8fh6g.py", line 15, in <module>
for e in iter(input, '0'):
EOFError: EOF when reading a line
| |
s878900486 | p00090 | u104911888 | 1380866971 | Python | Python | py | Runtime Error | 0 | 0 | 1280 | from __future__ import division
import math
def cross(p1,p2):
a,b,c,d=p1[0],p1[1],p2[0],p2[1]
t=pow(a,2)+pow(c,2)+pow(d,2)-pow(b,2)-2*a*c
alpha=4*(pow(b-d,2)+pow(c-a,2))
beta=4*(t*(b-d)-2*b*pow(c-a,2))
gamma=pow(t,2)+4*pow(b,2)*pow(c-a,2)-4*pow(c-a,2)
judge=pow(beta,2)-4*alpha*gamma
if judge>0:
y1=(-beta+math.sqrt(judge))/(2*alpha)
y2=(-beta-math.sqrt(judge))/(2*alpha)
x1=(2*(b-d)*y1+pow(c,2)+pow(d,2)-pow(a,2)-pow(b,2))/(2*(c-a))
x2=(2*(b-d)*y2+pow(c,2)+pow(d,2)-pow(a,2)-pow(b,2))/(2*(c-a))
return ((x1,y1),(x2,y2))
elif judge==0:
y=-beta/(2*alpha)
x=(2*(b-d)*y+pow(c,2)+pow(d,2)-pow(a,2)-pow(b,2))/(2*(c-a))
return x,y
else:
return -100,-100
def maxNum(P,L):
ans=0
for x,y in P:
cnt=0
for px,py in L:
d=math.sqrt(pow(px-x,2)+pow(py-y,2))
if d<=1:
cnt+=1
ans=max(ans,cnt)
return ans
while True:
n=input()
if n==0:break
L=[map(float,raw_input().split(",")) for i in range(n)]
ans=0
P=[]
for i in range(n-1):
for j in range(i+1,n):
points=cross(L[i],L[j])
if points!=(-100,-100):
P.extend(points)
print maxNum(P,L) | File "/tmp/tmp6zb1uedp/tmp71wg906m.py", line 46
print maxNum(P,L)
^^^^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s262533337 | p00090 | u104911888 | 1380867252 | Python | Python | py | Runtime Error | 0 | 0 | 1322 | from __future__ import division
import math
def cross(p1,p2):
a,b,c,d=p1[0],p1[1],p2[0],p2[1]
t=pow(a,2)+pow(c,2)+pow(d,2)-pow(b,2)-2*a*c
alpha=4*(pow(b-d,2)+pow(c-a,2))
beta=4*(t*(b-d)-2*b*pow(c-a,2))
gamma=pow(t,2)+4*pow(b,2)*pow(c-a,2)-4*pow(c-a,2)
judge=pow(beta,2)-4*alpha*gamma
if c-a==0 or alpha==0:
return -100,-100
if judge>0:
y1=(-beta+math.sqrt(judge))/(2*alpha)
y2=(-beta-math.sqrt(judge))/(2*alpha)
x1=(2*(b-d)*y1+pow(c,2)+pow(d,2)-pow(a,2)-pow(b,2))/(2*(c-a))
x2=(2*(b-d)*y2+pow(c,2)+pow(d,2)-pow(a,2)-pow(b,2))/(2*(c-a))
return ((x1,y1),(x2,y2))
elif judge==0:
y=-beta/(2*alpha)
x=(2*(b-d)*y+pow(c,2)+pow(d,2)-pow(a,2)-pow(b,2))/(2*(c-a))
return x,y
else:
return -100,-100
def maxNum(P,L):
ans=1
for x,y in P:
cnt=0
for px,py in L:
d=math.sqrt(pow(px-x,2)+pow(py-y,2))
if d<=1:
cnt+=1
ans=max(ans,cnt)
return ans
while True:
n=input()
if n==0:break
L=[map(float,raw_input().split(",")) for i in range(n)]
P=[]
for i in range(n-1):
for j in range(i+1,n):
points=cross(L[i],L[j])
if points!=(-100,-100):
P.extend(points)
print maxNum(P,L) | File "/tmp/tmpi3h8h6cw/tmp688f88ck.py", line 47
print maxNum(P,L)
^^^^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s226041494 | p00090 | u104911888 | 1380867631 | Python | Python | py | Runtime Error | 0 | 0 | 1277 | from __future__ import division
import math
def cross(p1,p2):
a,b,c,d=p1[0],p1[1],p2[0],p2[1]
t=pow(a,2)+pow(c,2)+pow(d,2)-pow(b,2)-2*a*c
alpha=4*(pow(b-d,2)+pow(c-a,2))
beta=4*(t*(b-d)-2*b*pow(c-a,2))
gamma=pow(t,2)+4*pow(b,2)*pow(c-a,2)-4*pow(c-a,2)
judge=pow(beta,2)-4*alpha*gamma
if judge>0:
y1=(-beta+math.sqrt(judge))/(2*alpha)
y2=(-beta-math.sqrt(judge))/(2*alpha)
x1=(2*(b-d)*y1+pow(c,2)+pow(d,2)-pow(a,2)-pow(b,2))/(2*(c-a))
x2=(2*(b-d)*y2+pow(c,2)+pow(d,2)-pow(a,2)-pow(b,2))/(2*(c-a))
return ((x1,y1),(x2,y2))
elif judge==0:
y=-beta/(2*alpha)
x=(2*(b-d)*y+pow(c,2)+pow(d,2)-pow(a,2)-pow(b,2))/(2*(c-a))
return ((x,y),)
else:
return (-100,-100)
def maxNum(P,L):
ans=1
for x,y in P:
cnt=0
for px,py in L:
d=math.sqrt(pow(px-x,2)+pow(py-y,2))
if d<=1:
cnt+=1
ans=max(ans,cnt)
return ans
while True:
n=input()
if n==0:break
L=[map(float,raw_input().split(",")) for i in range(n)]
P=[]
for i in range(n-1):
for j in range(i+1,n):
points=cross(L[i],L[j])
if points!=(-100,-100):
P.extend(points)
print maxNum(P,L) | File "/tmp/tmp981tl1tp/tmpz1ke1xax.py", line 45
print maxNum(P,L)
^^^^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s554838866 | p00090 | u104911888 | 1380868101 | Python | Python | py | Runtime Error | 0 | 0 | 1297 | from __future__ import division
import math
def cross(p1,p2):
a,b,c,d=p1[0],p1[1],p2[0],p2[1]
t=pow(a,2)+pow(c,2)+pow(d,2)-pow(b,2)-2*a*c
alpha=4*(pow(b-d,2)+pow(c-a,2))
beta=4*(t*(b-d)-2*b*pow(c-a,2))
gamma=pow(t,2)+4*pow(b,2)*pow(c-a,2)-4*pow(c-a,2)
judge=pow(beta,2)-4*alpha*gamma
if judge>0:
y1=(-beta+math.sqrt(judge))/(2*alpha)
y2=(-beta-math.sqrt(judge))/(2*alpha)
x1,x2=1,1
# x1=(2*(b-d)*y1+pow(c,2)+pow(d,2)-pow(a,2)-pow(b,2))/(2*(c-a))
# x2=(2*(b-d)*y2+pow(c,2)+pow(d,2)-pow(a,2)-pow(b,2))/(2*(c-a))
return ((x1,y1),(x2,y2))
elif judge==0:
y=-beta/(2*alpha)
x=(2*(b-d)*y+pow(c,2)+pow(d,2)-pow(a,2)-pow(b,2))/(2*(c-a))
return ((x,y),)
else:
return (-100,-100)
def maxNum(P,L):
ans=1
for x,y in P:
cnt=0
for px,py in L:
d=math.sqrt(pow(px-x,2)+pow(py-y,2))
if d<=1:
cnt+=1
ans=max(ans,cnt)
return ans
while True:
n=input()
if n==0:break
L=[map(float,raw_input().split(",")) for i in range(n)]
P=[]
for i in range(n-1):
for j in range(i+1,n):
points=cross(L[i],L[j])
if points!=(-100,-100):
P.extend(points)
print maxNum(P,L) | File "/tmp/tmpxmdvfynk/tmpy_gvgwm7.py", line 46
print maxNum(P,L)
^^^^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s717768025 | p00090 | u104911888 | 1380868136 | Python | Python | py | Runtime Error | 0 | 0 | 1297 | from __future__ import division
import math
def cross(p1,p2):
a,b,c,d=p1[0],p1[1],p2[0],p2[1]
t=pow(a,2)+pow(c,2)+pow(d,2)-pow(b,2)-2*a*c
alpha=4*(pow(b-d,2)+pow(c-a,2))
beta=4*(t*(b-d)-2*b*pow(c-a,2))
gamma=pow(t,2)+4*pow(b,2)*pow(c-a,2)-4*pow(c-a,2)
judge=pow(beta,2)-4*alpha*gamma
if judge>0:
y1,y2=1,1
# y1=(-beta+math.sqrt(judge))/(2*alpha)
# y2=(-beta-math.sqrt(judge))/(2*alpha)
x1=(2*(b-d)*y1+pow(c,2)+pow(d,2)-pow(a,2)-pow(b,2))/(2*(c-a))
x2=(2*(b-d)*y2+pow(c,2)+pow(d,2)-pow(a,2)-pow(b,2))/(2*(c-a))
return ((x1,y1),(x2,y2))
elif judge==0:
y=-beta/(2*alpha)
x=(2*(b-d)*y+pow(c,2)+pow(d,2)-pow(a,2)-pow(b,2))/(2*(c-a))
return ((x,y),)
else:
return (-100,-100)
def maxNum(P,L):
ans=1
for x,y in P:
cnt=0
for px,py in L:
d=math.sqrt(pow(px-x,2)+pow(py-y,2))
if d<=1:
cnt+=1
ans=max(ans,cnt)
return ans
while True:
n=input()
if n==0:break
L=[map(float,raw_input().split(",")) for i in range(n)]
P=[]
for i in range(n-1):
for j in range(i+1,n):
points=cross(L[i],L[j])
if points!=(-100,-100):
P.extend(points)
print maxNum(P,L) | File "/tmp/tmp3w2mdor2/tmpf8fzpnsj.py", line 46
print maxNum(P,L)
^^^^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s214811219 | p00090 | u104911888 | 1380868256 | Python | Python | py | Runtime Error | 0 | 0 | 1257 | from __future__ import division
import math
def cross(p1,p2):
a,b,c,d=p1[0],p1[1],p2[0],p2[1]
t=pow(a,2)+pow(c,2)+pow(d,2)-pow(b,2)-2*a*c
alpha=4*(pow(b-d,2)+pow(c-a,2))
beta=4*(t*(b-d)-2*b*pow(c-a,2))
gamma=pow(t,2)+4*pow(b,2)*pow(c-a,2)-4*pow(c-a,2)
judge=pow(beta,2)-4*alpha*gamma
if judge>0:
y1=(-beta+math.sqrt(judge))/(2*alpha)
y2=(-beta-math.sqrt(judge))/(2*alpha)
x1=(2*(b-d)*y1+pow(c,2)+pow(d,2)-pow(a,2)-pow(b,2))/(2*(c-a))
x2=(2*(b-d)*y2+pow(c,2)+pow(d,2)-pow(a,2)-pow(b,2))/(2*(c-a))
return ((x1,y1),(x2,y2))
elif judge==0:
y=-beta/(2*alpha)
x=(2*(b-d)*y+pow(c,2)+pow(d,2)-pow(a,2)-pow(b,2))/(2*(c-a))
return ((x,y),)
else:
return None
def maxNum(P,L):
ans=1
for x,y in P:
cnt=0
for px,py in L:
d=math.sqrt(pow(px-x,2)+pow(py-y,2))
if d<=1:
cnt+=1
ans=max(ans,cnt)
return ans
while True:
n=input()
if n==0:break
L=[map(float,raw_input().split(",")) for i in range(n)]
P=[]
for i in range(n-1):
for j in range(i+1,n):
points=cross(L[i],L[j])
if points:
P.extend(points)
print maxNum(P,L) | File "/tmp/tmpu4x7xq4t/tmpqy9jmny7.py", line 45
print maxNum(P,L)
^^^^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s098133722 | p00090 | u104911888 | 1380868287 | Python | Python | py | Runtime Error | 0 | 0 | 1272 | from __future__ import division
import math
def cross(p1,p2):
a,b,c,d=p1[0],p1[1],p2[0],p2[1]
t=pow(a,2)+pow(c,2)+pow(d,2)-pow(b,2)-2*a*c
alpha=4*(pow(b-d,2)+pow(c-a,2))
beta=4*(t*(b-d)-2*b*pow(c-a,2))
gamma=pow(t,2)+4*pow(b,2)*pow(c-a,2)-4*pow(c-a,2)
judge=pow(beta,2)-4*alpha*gamma
if judge>0:
y1=(-beta+math.sqrt(judge))/(2*alpha)
y2=(-beta-math.sqrt(judge))/(2*alpha)
x1=(2*(b-d)*y1+pow(c,2)+pow(d,2)-pow(a,2)-pow(b,2))/(2*(c-a))
x2=(2*(b-d)*y2+pow(c,2)+pow(d,2)-pow(a,2)-pow(b,2))/(2*(c-a))
return ((x1,y1),(x2,y2))
elif judge==0:
y=-beta/(2*alpha)
x=(2*(b-d)*y+pow(c,2)+pow(d,2)-pow(a,2)-pow(b,2))/(2*(c-a))
return ((x,y),)
else:
return None
def maxNum(P,L):
ans=1
return ans
for x,y in P:
cnt=0
for px,py in L:
d=math.sqrt(pow(px-x,2)+pow(py-y,2))
if d<=1:
cnt+=1
ans=max(ans,cnt)
return ans
while True:
n=input()
if n==0:break
L=[map(float,raw_input().split(",")) for i in range(n)]
P=[]
for i in range(n-1):
for j in range(i+1,n):
points=cross(L[i],L[j])
if points:
P.extend(points)
print maxNum(P,L) | File "/tmp/tmpr7fmo5n_/tmpaup6ij1h.py", line 46
print maxNum(P,L)
^^^^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s496693546 | p00090 | u104911888 | 1380868385 | Python | Python | py | Runtime Error | 0 | 0 | 1274 | from __future__ import division
import math
def cross(p1,p2):
a,b,c,d=p1[0],p1[1],p2[0],p2[1]
t=pow(a,2)+pow(c,2)+pow(d,2)-pow(b,2)-2*a*c
alpha=4*(pow(b-d,2)+pow(c-a,2))
beta=4*(t*(b-d)-2*b*pow(c-a,2))
gamma=pow(t,2)+4*pow(b,2)*pow(c-a,2)-4*pow(c-a,2)
judge=pow(beta,2)-4*alpha*gamma
if judge>0:
y1=(-beta+math.sqrt(judge))/(2*alpha)
y2=(-beta-math.sqrt(judge))/(2*alpha)
x1=(2*(b-d)*y1+pow(c,2)+pow(d,2)-pow(a,2)-pow(b,2))/(2*(c-a))
x2=(2*(b-d)*y2+pow(c,2)+pow(d,2)-pow(a,2)-pow(b,2))/(2*(c-a))
return ((x1,y1),(x2,y2))
elif judge==0:
y=-beta/(2*alpha)
x=(2*(b-d)*y+pow(c,2)+pow(d,2)-pow(a,2)-pow(b,2))/(2*(c-a))
return ((x,y),)
else:
return None
def maxNum(P,L):
ans=1
return ans
for x,y in P:
cnt=0
for px,py in L:
d=math.sqrt(pow(px-x,2)+pow(py-y,2))
if d<=1:
cnt+=1
ans=max(ans,cnt)
return ans
while True:
n=input()
if n==0:break
L=[map(float,raw_input().split(",")) for i in range(n)]
P=[]
for i in range(n-1):
for j in range(i+1,n):
points=cross(L[i],L[j])
# if points:
# P.extend(points)
print maxNum(P,L) | File "/tmp/tmpms8nb17i/tmpyn0jwlkm.py", line 46
print maxNum(P,L)
^^^^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s048459903 | p00090 | u104911888 | 1380869394 | Python | Python | py | Runtime Error | 0 | 0 | 1280 | from __future__ import division
import math
def cross(p1,p2):
a,b,c,d=p1[0],p1[1],p2[0],p2[1]
t=pow(a,2)+pow(c,2)+pow(d,2)-pow(b,2)-2*a*c
alpha=4*(pow(b-d,2)+pow(c-a,2))
beta=4*(t*(b-d)-2*b*pow(c-a,2))
gamma=pow(t,2)+4*pow(b,2)*pow(c-a,2)-4*pow(c-a,2)
judge=pow(beta,2)-4*alpha*gamma
EPS=1e-5
if judge>EPS:
y1=(-beta+math.sqrt(judge))/(2*alpha)
y2=(-beta-math.sqrt(judge))/(2*alpha)
x1=(2*(b-d)*y1+pow(c,2)+pow(d,2)-pow(a,2)-pow(b,2))/(2*(c-a))
x2=(2*(b-d)*y2+pow(c,2)+pow(d,2)-pow(a,2)-pow(b,2))/(2*(c-a))
return ((x1,y1),(x2,y2))
elif -EPS<=judge<=EPS:
y=-beta/(2*alpha)
x=(2*(b-d)*y+pow(c,2)+pow(d,2)-pow(a,2)-pow(b,2))/(2*(c-a))
return ((x,y),)
else:
return None
def maxNum(P,L):
ans=1
for x,y in P:
cnt=0
for px,py in L:
d=math.sqrt(pow(px-x,2)+pow(py-y,2))
if d<=1:
cnt+=1
ans=max(ans,cnt)
return ans
while True:
n=input()
if n==0:break
L=[map(float,raw_input().split(",")) for i in range(n)]
P=[]
for i in range(n-1):
for j in range(i+1,n):
points=cross(L[i],L[j])
if points:
P.extend(points)
print maxNum(P,L) | File "/tmp/tmp2lwzsxcv/tmpi7rwq_i9.py", line 46
print maxNum(P,L)
^^^^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s378942449 | p00090 | u104911888 | 1380869475 | Python | Python | py | Runtime Error | 0 | 0 | 1295 | from __future__ import division
import math
def cross(p1,p2):
a,b,c,d=p1[0],p1[1],p2[0],p2[1]
t=pow(a,2)+pow(c,2)+pow(d,2)-pow(b,2)-2*a*c
alpha=4*(pow(b-d,2)+pow(c-a,2))
beta=4*(t*(b-d)-2*b*pow(c-a,2))
gamma=pow(t,2)+4*pow(b,2)*pow(c-a,2)-4*pow(c-a,2)
judge=pow(beta,2)-4*alpha*gamma
EPS=1e-5
return 1,1
if judge>EPS:
y1=(-beta+math.sqrt(judge))/(2*alpha)
y2=(-beta-math.sqrt(judge))/(2*alpha)
x1=(2*(b-d)*y1+pow(c,2)+pow(d,2)-pow(a,2)-pow(b,2))/(2*(c-a))
x2=(2*(b-d)*y2+pow(c,2)+pow(d,2)-pow(a,2)-pow(b,2))/(2*(c-a))
return ((x1,y1),(x2,y2))
elif -EPS<=judge<=EPS:
y=-beta/(2*alpha)
x=(2*(b-d)*y+pow(c,2)+pow(d,2)-pow(a,2)-pow(b,2))/(2*(c-a))
return ((x,y),)
else:
return None
def maxNum(P,L):
ans=1
for x,y in P:
cnt=0
for px,py in L:
d=math.sqrt(pow(px-x,2)+pow(py-y,2))
if d<=1:
cnt+=1
ans=max(ans,cnt)
return ans
while True:
n=input()
if n==0:break
L=[map(float,raw_input().split(",")) for i in range(n)]
P=[]
for i in range(n-1):
for j in range(i+1,n):
points=cross(L[i],L[j])
if points:
P.extend(points)
print maxNum(P,L) | File "/tmp/tmpab0vcfoq/tmpyb_rwpy4.py", line 47
print maxNum(P,L)
^^^^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s263946829 | p00090 | u104911888 | 1380871534 | Python | Python | py | Runtime Error | 0 | 0 | 1611 | from __future__ import division
import math
def cross(p1,p2):
a,b,c,d=p1[0],p1[1],p2[0],p2[1]
t=pow(a,2)+pow(c,2)+pow(d,2)-pow(b,2)-2*a*c
alpha=4*(pow(b-d,2)+pow(c-a,2))
beta=4*(t*(b-d)-2*b*pow(c-a,2))
gamma=pow(t,2)+4*pow(b,2)*pow(c-a,2)-4*pow(c-a,2)
judge=pow(beta,2)-4*alpha*gamma
EPS=1e-5
if c==a:
y=(pow(a,2)+pow(b,2)-pow(c,2)-pow(d,2))/(2*(b-d))
bd=pow(b-d,2)
a1=4*bd
b1=-8*a*bd
c1=4*a*a*bd+pow(a*a-b*b-c*c-d*d+2*b*d,2)-4*bd
inroot=pow(b1,2)-4*a1*c1
x1=(-b1+math.sqrt(inroot))/(2*a1)
x2=(-b1-math.sqrt(inroot))/(2*a1)
return ((x1,y),(x2,y))
if judge>EPS:
y1=(-beta+math.sqrt(judge))/(2*alpha)
y2=(-beta-math.sqrt(judge))/(2*alpha)
x1=(2*(b-d)*y1+pow(c,2)+pow(d,2)-pow(a,2)-pow(b,2))/(2*(c-a))
x2=(2*(b-d)*y2+pow(c,2)+pow(d,2)-pow(a,2)-pow(b,2))/(2*(c-a))
return ((x1,y1),(x2,y2))
elif -EPS<=judge<=EPS:
y=-beta/(2*alpha)
x=(2*(b-d)*y+pow(c,2)+pow(d,2)-pow(a,2)-pow(b,2))/(2*(c-a))
return ((x,y),)
else:
return None
def maxNum(P,L):
ans=1
for x,y in P:
cnt=0
for px,py in L:
d=math.sqrt(pow(px-x,2)+pow(py-y,2))
if d<=1:
cnt+=1
ans=max(ans,cnt)
return ans
while True:
n=input()
if n==0:break
L=[map(float,raw_input().split(",")) for i in range(n)]
P=[]
for i in range(n-1):
for j in range(i+1,n):
points=cross(L[i],L[j])
if points:
P.extend(points)
print maxNum(P,L) | File "/tmp/tmp9rohd2i1/tmpbedp06yb.py", line 57
print maxNum(P,L)
^^^^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s820206345 | p00090 | u633068244 | 1396180996 | Python | Python | py | Runtime Error | 0 | 0 | 902 | def isOver(a,b):
return True if (a[0]-b[0])**2 + (a[1]-b[1])**2 < 4.0+1.0e-12 else False
def largestGroup(mtrx,num):
mx = 1
ls = [num]
for i in mtrx[num]:
if i == num:
continue
m = youKnow(mtrx,ls,i)
mx = max(mx,m)
return mx
def youKnow(mtrx,ls,num):
mx = len(ls)
if set(ls) <= set(mtrx[num]):
if num not in ls:
ls.append(num)
for i in list(set(mtrx[num])-set(ls)):
m = youKnow(mtrx,ls,i)
mx = max(mx,m)
return mx
max_over = 0
while True:
n = int(raw_input())
if n == 0: break
seals = [map(float, raw_input().split(",")) for i in range(n)]
overs = []
for i in range(n):
over = []
for j in range(n):
if isOver(seals[i],seals[j]):
over.append(j)
overs.append(over)
ref = [i for i in range(n)]
for i in ref:
num_over = largestGroup(overs,i)
for j in overs[i]:
ref.remove(j)
if num_over > max_over:
max_over = num_over
print max_over | File "/tmp/tmpf986t0pg/tmp1y9sm7pw.py", line 45
print max_over
^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s863214172 | p00090 | u633068244 | 1396181027 | Python | Python | py | Runtime Error | 0 | 0 | 902 | def isOver(a,b):
return True if (a[0]-b[0])**2 + (a[1]-b[1])**2 < 4.0+1.0e-12 else False
def largestGroup(mtrx,num):
mx = 1
ls = [num]
for i in mtrx[num]:
if i == num:
continue
m = youKnow(mtrx,ls,i)
mx = max(mx,m)
return mx
def youKnow(mtrx,ls,num):
mx = len(ls)
if set(ls) <= set(mtrx[num]):
if num not in ls:
ls.append(num)
for i in list(set(mtrx[num])-set(ls)):
m = youKnow(mtrx,ls,i)
mx = max(mx,m)
return mx
max_over = 0
while True:
n = int(raw_input())
if n == 0: break
seals = [map(float, raw_input().split(",")) for i in range(n)]
overs = []
for i in range(n):
over = []
for j in range(n):
if isOver(seals[i],seals[j]):
over.append(j)
overs.append(over)
ref = [i for i in range(n)]
for i in ref:
num_over = largestGroup(overs,i)
for j in overs[i]:
ref.remove(j)
if num_over > max_over:
max_over = num_over
print max_over | File "/tmp/tmpypbldi38/tmpaorri0so.py", line 45
print max_over
^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s458885608 | p00090 | u633068244 | 1396181087 | Python | Python | py | Runtime Error | 0 | 0 | 903 | def isOver(a,b):
return True if (a[0]-b[0])**2 + (a[1]-b[1])**2 < 4.0+1.0e-12 else False
def largestGroup(mtrx,num):
mx = 1
ls = [num]
for i in mtrx[num]:
if i == num:
continue
m = youKnow(mtrx,ls,i)
mx = max(mx,m)
return mx
def youKnow(mtrx,ls,num):
mx = len(ls)
if set(ls) <= set(mtrx[num]):
if num not in ls:
ls.append(num)
for i in list(set(mtrx[num])-set(ls)):
m = youKnow(mtrx,ls,i)
mx = max(mx,m)
return mx
while True:
max_over = 0
n = int(raw_input())
if n == 0: break
seals = [map(float, raw_input().split(",")) for i in range(n)]
overs = []
for i in range(n):
over = []
for j in range(n):
if isOver(seals[i],seals[j]):
over.append(j)
overs.append(over)
ref = [i for i in range(n)]
for i in ref:
num_over = largestGroup(overs,i)
for j in overs[i]:
ref.remove(j)
if num_over > max_over:
max_over = num_over
print max_over | File "/tmp/tmp_odjolp2/tmp78hk0yfr.py", line 45
print max_over
^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s829295623 | p00090 | u633068244 | 1396181186 | Python | Python | py | Runtime Error | 0 | 0 | 903 | def isOver(a,b):
return True if (a[0]-b[0])**2 + (a[1]-b[1])**2 < 4.0+1.0e-12 else False
def largestGroup(mtrx,num):
mx = 1
ls = [num]
for i in mtrx[num]:
if i == num:
continue
m = youKnow(mtrx,ls,i)
mx = max(mx,m)
return mx
def youKnow(mtrx,ls,num):
mx = len(ls)
if set(ls) <= set(mtrx[num]):
if num not in ls:
ls.append(num)
for i in list(set(mtrx[num])-set(ls)):
m = youKnow(mtrx,ls,i)
mx = max(mx,m)
return mx
while True:
max_over = 0
n = int(raw_input())
if n == 0: break
seals = [map(float, raw_input().split(",")) for i in range(n)]
overs = []
for i in range(n):
over = []
for j in range(n):
if isOver(seals[i],seals[j]):
over.append(j)
overs.append(over)
ref = [i for i in range(n)]
for i in ref:
num_over = largestGroup(overs,i)
for j in overs[i]:
ref.remove(j)
if num_over > max_over:
max_over = num_over
print max_over | File "/tmp/tmpngiibcnk/tmp7kqwy2u_.py", line 45
print max_over
^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s474124124 | p00090 | u633068244 | 1396181325 | Python | Python | py | Runtime Error | 0 | 0 | 1086 | def isOver(a,b):
return True if (a[0]-b[0])**2 + (a[1]-b[1])**2 < 4.0+1.0e-12 else False
def largestGroup(mtrx,num):
mx = 1
ls = [num]
for i in mtrx[num]:
if i == num:
continue
m = youKnow(mtrx,ls,i)
mx = max(mx,m)
return mx
def youKnow(mtrx,ls,num):
mx = len(ls)
if set(ls) <= set(mtrx[num]):
if num not in ls:
ls.append(num)
for i in list(set(mtrx[num])-set(ls)):
m = youKnow(mtrx,ls,i)
mx = max(mx,m)
return mx
while True:
max_over = 0
n = int(raw_input())
if n == 0: break
seals = [map(float, raw_input().split(",")) for i in range(n)]
overs = []
for i in range(n):
over = []
for j in range(n):
if isOver(seals[i],seals[j]):
over.append(j)
overs.append(over)
ref = [i for i in range(n)]
for i in ref:
num_over = largestGroup(overs,i)
for j in overs[i]:
ref.remove(j)
if num_over > max_over:
max_over = num_over
print max_over | File "/tmp/tmpx338ghcr/tmp2s1iea7_.py", line 45
print max_over
^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s753325881 | p00090 | u633068244 | 1396181385 | Python | Python | py | Runtime Error | 0 | 0 | 896 | def isOver(a,b):
return True if (a[0]-b[0])**2 + (a[1]-b[1])**2 =< 4.0 else False
def largestGroup(mtrx,num):
mx = 1
ls = [num]
for i in mtrx[num]:
if i == num:
continue
m = youKnow(mtrx,ls,i)
mx = max(mx,m)
return mx
def youKnow(mtrx,ls,num):
mx = len(ls)
if set(ls) <= set(mtrx[num]):
if num not in ls:
ls.append(num)
for i in list(set(mtrx[num])-set(ls)):
m = youKnow(mtrx,ls,i)
mx = max(mx,m)
return mx
while True:
max_over = 0
n = int(raw_input())
if n == 0: break
seals = [map(float, raw_input().split(",")) for i in range(n)]
overs = []
for i in range(n):
over = []
for j in range(n):
if isOver(seals[i],seals[j]):
over.append(j)
overs.append(over)
ref = [i for i in range(n)]
for i in ref:
num_over = largestGroup(overs,i)
for j in overs[i]:
ref.remove(j)
if num_over > max_over:
max_over = num_over
print max_over | File "/tmp/tmp01d35g9s/tmpxt988qb1.py", line 2
return True if (a[0]-b[0])**2 + (a[1]-b[1])**2 =< 4.0 else False
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
SyntaxError: expected 'else' after 'if' expression
| |
s220310432 | p00090 | u633068244 | 1396181835 | Python | Python | py | Runtime Error | 0 | 0 | 1096 | def isOver(a,b):
return True if (a[0]-b[0])**2 + (a[1]-b[1])**2 <= 4.0 else False
def largestGroup(mtrx,num):
mx = 1
ls = [num]
for i in mtrx[num]:
if i == num:
continue
m = youKnow(mtrx,ls,i)
mx = max(mx,m)
return mx
def youKnow(mtrx,ls,num):
mx = len(ls)
if set(ls) <= set(mtrx[num]):
if num not in ls:
ls.append(num)
for i in list(set(mtrx[num])-set(ls)):
m = youKnow(mtrx,ls,i)
mx = max(mx,m)
return mx
while True:
max_over = 0
n = int(raw_input())
if n == 0: break
seals = [map(float, raw_input().split(",")) for i in range(n)]
overs = []
for i in range(n):
over = []
for j in range(n):
if isOver(seals[i],seals[j]):
over.append(j)
overs.append(over)
ref = [i for i in range(n)]
for i in ref:
num_over = largestGroup(overs,i)
for j in overs[i]:
ref.remove(j)
if num_over > max_over:
max_over = num_over
print max_over | File "/tmp/tmpxn0eyqzh/tmpv0r4dqfw.py", line 45
print max_over
^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s830898738 | p00090 | u633068244 | 1396182001 | Python | Python | py | Runtime Error | 0 | 0 | 1109 | def isOver(a,b):
return True if (a[0]-b[0])**2 + (a[1]-b[1])**2 <= 4.0 else False
def largestGroup(mtrx,num):
mx = 1
ls = [num]
for i in mtrx[num]:
if i == num:
continue
m = youKnow(mtrx,ls,i)
mx = max(mx,m)
return mx
def youKnow(mtrx,ls,num):
mx = len(ls)
if set(ls) <= set(mtrx[num]):
if num not in ls:
ls.append(num)
for i in list(set(mtrx[num])-set(ls)):
m = youKnow(mtrx,ls,i)
mx = max(mx,m)
return mx
while True:
max_over = 0
n = int(raw_input())
if n == 0: break
seals = [map(float, raw_input().split(",")) for i in range(n)]
print "OK"
overs = []
for i in range(n):
over = []
for j in range(n):
if isOver(seals[i],seals[j]):
over.append(j)
overs.append(over)
ref = [i for i in range(n)]
for i in ref:
num_over = largestGroup(overs,i)
for j in overs[i]:
ref.remove(j)
if num_over > max_over:
max_over = num_over
print max_over | File "/tmp/tmpzzo5c7bb/tmp74en6bww.py", line 29
print "OK"
^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s072732549 | p00090 | u633068244 | 1396182062 | Python | Python | py | Runtime Error | 0 | 0 | 1109 | def isOver(a,b):
return True if (a[0]-b[0])**2 + (a[1]-b[1])**2 <= 4.0 else False
def largestGroup(mtrx,num):
mx = 1
ls = [num]
for i in mtrx[num]:
if i == num:
continue
m = youKnow(mtrx,ls,i)
mx = max(mx,m)
return mx
def youKnow(mtrx,ls,num):
mx = len(ls)
if set(ls) <= set(mtrx[num]):
if num not in ls:
ls.append(num)
for i in list(set(mtrx[num])-set(ls)):
m = youKnow(mtrx,ls,i)
mx = max(mx,m)
return mx
while True:
max_over = 0
n = int(raw_input())
print "OK"
if n == 0: break
seals = [map(float, raw_input().split(",")) for i in range(n)]
overs = []
for i in range(n):
over = []
for j in range(n):
if isOver(seals[i],seals[j]):
over.append(j)
overs.append(over)
ref = [i for i in range(n)]
for i in ref:
num_over = largestGroup(overs,i)
for j in overs[i]:
ref.remove(j)
if num_over > max_over:
max_over = num_over
print max_over | File "/tmp/tmptng9ym84/tmpe31oq6fw.py", line 27
print "OK"
^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s406652996 | p00090 | u633068244 | 1396182080 | Python | Python | py | Runtime Error | 0 | 0 | 1109 | def isOver(a,b):
return True if (a[0]-b[0])**2 + (a[1]-b[1])**2 <= 4.0 else False
def largestGroup(mtrx,num):
mx = 1
ls = [num]
for i in mtrx[num]:
if i == num:
continue
m = youKnow(mtrx,ls,i)
mx = max(mx,m)
return mx
def youKnow(mtrx,ls,num):
mx = len(ls)
if set(ls) <= set(mtrx[num]):
if num not in ls:
ls.append(num)
for i in list(set(mtrx[num])-set(ls)):
m = youKnow(mtrx,ls,i)
mx = max(mx,m)
return mx
while True:
print "OK"
max_over = 0
n = int(raw_input())
if n == 0: break
seals = [map(float, raw_input().split(",")) for i in range(n)]
overs = []
for i in range(n):
over = []
for j in range(n):
if isOver(seals[i],seals[j]):
over.append(j)
overs.append(over)
ref = [i for i in range(n)]
for i in ref:
num_over = largestGroup(overs,i)
for j in overs[i]:
ref.remove(j)
if num_over > max_over:
max_over = num_over
print max_over | File "/tmp/tmphw80ushq/tmpg1c60m2i.py", line 25
print "OK"
^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s825932335 | p00090 | u633068244 | 1396182284 | Python | Python | py | Runtime Error | 0 | 0 | 1077 | def isOver(a,b):
return True if (a[0]-b[0])**2 + (a[1]-b[1])**2 <= 4.0 else False
def largestGroup(mtrx,num):
mx = 1
ls = [num]
for i in mtrx[num]:
if i != num:
m = youKnow(mtrx,ls,i)
mx = max(mx,m)
return mx
def youKnow(mtrx,ls,num):
mx = len(ls)
if set(ls) <= set(mtrx[num]):
if num not in ls:
ls.append(num)
for i in list(set(mtrx[num])-set(ls)):
m = youKnow(mtrx,ls,i)
mx = max(mx,m)
return mx
while True:
max_over = 0
n = int(raw_input())
if n == 0: break
seals = [map(float, raw_input().split(",")) for i in range(n)]
overs = []
for i in range(n):
over = []
for j in range(n):
if isOver(seals[i],seals[j]):
over.append(j)
overs.append(over)
ref = [i for i in range(n)]
for i in ref:
num_over = largestGroup(overs,i)
for j in overs[i]:
ref.remove(j)
if num_over > max_over:
max_over = num_over
print max_over | File "/tmp/tmp__j_g3j3/tmpvg7nkd0t.py", line 44
print max_over
^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s056236566 | p00090 | u633068244 | 1396183264 | Python | Python | py | Runtime Error | 0 | 0 | 1093 | def isOver(a,b):
return True if (a[0]-b[0])**2 + (a[1]-b[1])**2 <= 4.0 else False
def largestGroup(mtrx,num):
mx = 1
ls = [num]
for i in mtrx[num]:
if i == num:
continue
m = youKnow(mtrx,ls,i)
mx = max(mx,m)
return mx
def youKnow(mtrx,ls,num):
mx = len(ls)
if set(ls) <= set(mtrx[num]):
if num not in ls:
ls.append(num)
for i in list(set(mtrx[num])-set(ls)):
m = youKnow(mtrx,ls,i)
mx = max(mx,m)
return mx
while True:
max_over = 0
n = int(raw_input())
if n == 0: break
seals = [map(float, raw_input().split(",")) for i in range(n)]
overs = []
for i in range(n):
over = []
for j in range(n):
if isOver(seals[i],seals[j]):
over.append(j)
overs.append(over)
ref = [i for i in range(n)]
for i in ref:
num_over = largestGroup(overs,i)
for j in overs[i]:
ref.remove(j)
if num_over > max_over:
max_over = num_over
print max_over | File "/tmp/tmpjn7ec3r5/tmpaut6t1an.py", line 45
print max_over
^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s592822718 | p00090 | u633068244 | 1396183389 | Python | Python | py | Runtime Error | 0 | 0 | 1093 | def isOver(a,b):
return True if (a[0]-b[0])**2 + (a[1]-b[1])**2 <= 4.0 else False
def largestGroup(mtrx,num):
mx = 1
ls = [num]
#for i in mtrx[num]:
# if i == num:
# continue
# m = youKnow(mtrx,ls,i)
# mx = max(mx,m)
return mx
def youKnow(mtrx,ls,num):
mx = len(ls)
if set(ls) <= set(mtrx[num]):
if num not in ls:
ls.append(num)
for i in list(set(mtrx[num])-set(ls)):
m = youKnow(mtrx,ls,i)
mx = max(mx,m)
return mx
while True:
max_over = 0
n = int(raw_input())
if n == 0: break
seals = [map(float, raw_input().split(",")) for i in range(n)]
overs = []
for i in range(n):
over = []
for j in range(n):
if isOver(seals[i],seals[j]):
over.append(j)
overs.append(over)
ref = [i for i in range(n)]
for i in ref:
num_over = largestGroup(overs,i)
for j in overs[i]:
ref.remove(j)
if num_over > max_over:
max_over = num_over
print max_over | File "/tmp/tmphng0nj51/tmplk801g6e.py", line 45
print max_over
^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s462333128 | p00090 | u633068244 | 1396183406 | Python | Python | py | Runtime Error | 0 | 0 | 1094 | def isOver(a,b):
return True if (a[0]-b[0])**2 + (a[1]-b[1])**2 <= 4.0 else False
def largestGroup(mtrx,num):
mx = 1
#ls = [num]
#for i in mtrx[num]:
# if i == num:
# continue
# m = youKnow(mtrx,ls,i)
# mx = max(mx,m)
return mx
def youKnow(mtrx,ls,num):
mx = len(ls)
if set(ls) <= set(mtrx[num]):
if num not in ls:
ls.append(num)
for i in list(set(mtrx[num])-set(ls)):
m = youKnow(mtrx,ls,i)
mx = max(mx,m)
return mx
while True:
max_over = 0
n = int(raw_input())
if n == 0: break
seals = [map(float, raw_input().split(",")) for i in range(n)]
overs = []
for i in range(n):
over = []
for j in range(n):
if isOver(seals[i],seals[j]):
over.append(j)
overs.append(over)
ref = [i for i in range(n)]
for i in ref:
num_over = largestGroup(overs,i)
for j in overs[i]:
ref.remove(j)
if num_over > max_over:
max_over = num_over
print max_over | File "/tmp/tmp12jhoy5s/tmpzd8ripd7.py", line 45
print max_over
^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s984656035 | p00090 | u633068244 | 1396183607 | Python | Python | py | Runtime Error | 0 | 0 | 1104 | def isOver(a,b):
return True if (a[0]-b[0])**2 + (a[1]-b[1])**2 <= 4.0 else False
def largestGroup(mtrx,num):
mx = 1
ls = [num]
for i in mtrx[num]:
if i == num:
continue
m = youKnow(mtrx,ls,i)
mx = max(mx,m)
return mx
def youKnow(mtrx,ls,num):
mx = len(ls)
if set(ls) <= set(mtrx[num]):
if num not in ls:
ls.append(num)
for i in list(set(mtrx[num])-set(ls)):
m = youKnow(mtrx,ls,i)
mx = max(mx,m)
return mx
while True:
max_over = 0
n = int(raw_input())
if n == 0: break
seals = [map(float, raw_input().split(",")) for i in range(n)]
overs = []
for i in range(n):
over = []
for j in range(n):
if isOver(seals[i],seals[j]):
over.append(j)
overs.append(over)
ref = [i for i in range(n)]
for i in ref:
num_over = largestGroup(overs,i)
for j in overs[i]:
if j in ref: ref.remove(j)
if num_over > max_over:
max_over = num_over
print max_over | File "/tmp/tmp_86vam9q/tmpmegqea8q.py", line 19
for i in list(set(mtrx[num])-set(ls)):
TabError: inconsistent use of tabs and spaces in indentation
| |
s189818225 | p00090 | u633068244 | 1396183828 | Python | Python | py | Runtime Error | 0 | 0 | 1032 | def isOver(a,b):
return True if (a[0]-b[0])**2 + (a[1]-b[1])**2 <= 4.0 else False
def largestGroup(mtrx,num):
mx = 1
ls = [num]
for i in mtrx[num]:
m = youKnow(mtrx,ls,i)
mx = max(mx,m)
return mx
def youKnow(mtrx,ls,num):
mx = len(ls)
if set(ls) <= set(mtrx[num]):
ls.append(num)
for i in list(set(mtrx[num])-set(ls)):
m = youKnow(mtrx,ls,i)
mx = max(mx,m)
return mx
while True:
max_over = 0
n = int(raw_input())
if n == 0: break
seals = [map(float, raw_input().split(",")) for i in range(n)]
overs = []
for i in range(n):
over = []
for j in range(n):
if isOver(seals[i],seals[j]) and i != j:
over.append(j)
overs.append(over)
ref = [i for i in range(n)]
for i in ref:
if len(overs[i]) > 0:
num_over = largestGroup(overs,i)
for j in overs[i]:
if j in ref: ref.remove(j)
if num_over > max_over:
max_over = num_over
print max_over | File "/tmp/tmpcinhp8rx/tmpgt062d9m.py", line 37
if len(overs[i]) > 0:
TabError: inconsistent use of tabs and spaces in indentation
| |
s000415978 | p00090 | u912237403 | 1398694385 | Python | Python | py | Runtime Error | 0 | 0 | 517 | import math,cmath
def f(m):
b*=1j
c=math.acos(a/2)
p1=cmath.exp(b+c)+p0
p2=cmath.exp(b-c)+p0
s1,s2=0,0
for k in N:
if k==i or k==j:continue
if abs(p1-X[k])<=1:s1+=1
if abs(p2-X[k])<=1:s2+=1
if s1>m:m=s1
if s2>m:m=s2
return m
while 1:
n=input()
if n==0:break
N=range(n)
X=[]
for i in range(n):
x,y=map(float,input())
X+=[complex(x,y)]
m=0
for i in N:
p0=X[i]
for j in N:
if i==j:continue
a,b=cmath.polar(p0-X[j])
if a<=2:m=f(m)
print m+2 | File "/tmp/tmp4h9uiin1/tmplc325036.py", line 31
print m+2
^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s531752162 | p00090 | u912237403 | 1398750520 | Python | Python | py | Runtime Error | 0 | 0 | 454 | e=1e-6
def f(m):
c=1j*math.acos(a/2)
p1=cmath.exp(b+c)+p
p2=cmath.exp(b-c)+p
s1,s2=2,2
for k in N:
if k in[i,i1]:continue
if abs(X[k]-p1)<1+e:s1+=1
if abs(X[k]-p2)<1+e:s2+=1
return max(m,s1,s2)
while 1:
n=input()
if n==0:break
N=range(n)
X=[]
for i in N:
x,y=input()
X+=[x+1j*y]
m=1
for i in N:
p=X[i]
for i1 in range(i+1,n):
a,b=cmath.polar(X[i1]-p)
b*=1j
if a<=2:m=f(m)
print m | File "/tmp/tmpg6yjznsv/tmp06xbv8u6.py", line 28
print m
^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s211199396 | p00090 | u912237403 | 1398760561 | Python | Python | py | Runtime Error | 0 | 0 | 725 | #include <complex>
#include <iostream>
#include <vector>
using namespace std;
typedef complex<double> cd;
vector<cd >A;
cd j=sqrt(-1),p,p1,p2;
double a,b;
int n;
int f(int m,int i1,int i2){
int i,s1=2,s2=2;
double c=acos(a/2);
p1=polar(1.0,b+c)+p;
p2=polar(1.0,b-c)+p;
for(i=0;i<n;i++){
if(i==i1||i==i2)continue;
if(abs(A[i]-p1)-1<1e-6)s1++;
if(abs(A[i]-p2)-1<1e-6)s2++;
}
if(m<s1)m=s1;
if(m<s2)m=s2;
return m;
}
int main(){
int m,i,i1;
char c;
while(cin>>n,n!=0){
A.clear();A.resize(n);
for(i=0;i<n;i++){
cin>>a>>c>>b;
A[i]=cd(a,b);
}
m=1;
for(i=0;i<n;i++){
p=A[i];
for(i1=i+1;i1<n;i1++){
a=abs(A[i1]-p);
b=arg(A[i1]-p);
if(a<=2)m=f(m,i,i1);
}
}
cout<<m<<endl;
}
} | File "/tmp/tmp6vtyay0v/tmppt4_1gvd.py", line 4
using namespace std;
^^^^^^^^^
SyntaxError: invalid syntax
| |
s471541885 | p00090 | u912237403 | 1398761474 | Python | Python | py | Runtime Error | 0 | 0 | 668 | #include <complex>
#include <iostream>
using namespace std;
typedef complex<double> cd;
cd A[100],j=sqrt(-1),p;
double a,b,d;
int n;
int f(int m,int i1,int i2){
int i,s1=2,s2=2;
cd p1=polar(1.0,b+d)+p,p2=polar(1.0,b-d)+p;
for(i=0;i<n;i++){
if(i==i1||i==i2)continue;
if(abs(A[i]-p1)-1<1e-6)s1++;
if(abs(A[i]-p2)-1<1e-6)s2++;
}
if(m<s1)m=s1;
if(m<s2)m=s2;
return m;
}
int main(){
int m,i,i1;
char c;
while(cin>>n,n!=0){
for(i=0;i<n;i++){
cin>>a>>c>>b;
A[i]=cd(a,b);
}
m=1;
for(i=0;i<n;i++){
p=A[i];
for(i1=i+1;i1<n;i1++){
a=abs(A[i1]-p);
b=arg(A[i1]-p);
d=acos(a/2);
if(a<=2)m=f(m,i,i1);
}
}
cout<<m<<endl;
}
} | File "/tmp/tmpd1cko763/tmp557npcbv.py", line 3
using namespace std;
^^^^^^^^^
SyntaxError: invalid syntax
| |
s504089392 | p00090 | u912237403 | 1398761611 | Python | Python | py | Runtime Error | 0 | 0 | 679 | #include <complex>
#include <iostream>
using namespace std;
complex<double> A[100],j=sqrt(-1),p;
double a,b,d;
int n;
int f(int m,int i1,int i2){
int i,s1=2,s2=2;
complex<double> p1=polar(1.0,b+d)+p,p2=polar(1.0,b-d)+p;
for(i=0;i<n;i++){
if(i==i1||i==i2)continue;
if(abs(A[i]-p1)-1<1e-6)s1++;
if(abs(A[i]-p2)-1<1e-6)s2++;
}
if(m<s1)m=s1;
if(m<s2)m=s2;
return m;
}
int main(){
int m,i,i1;
char c;
while(cin>>n,n!=0){
for(i=0;i<n;i++){
cin>>a>>c>>b;
A[i]=complex<double>(a,b);
}
m=1;
for(i=0;i<n;i++){
p=A[i];
for(i1=i+1;i1<n;i1++){
a=abs(A[i1]-p);
b=arg(A[i1]-p);
d=acos(a/2);
if(a<=2)m=f(m,i,i1);
}
}
cout<<m<<endl;
}
} | File "/tmp/tmplzah5nqe/tmpp2da7eud.py", line 3
using namespace std;
^^^^^^^^^
SyntaxError: invalid syntax
| |
s339939250 | p00090 | u912237403 | 1398763535 | Python | Python | py | Runtime Error | 0 | 0 | 669 | #include <complex>
#include <iostream>
#include <vector>
using namespace std;
typedef complex<double> P;
P A[100],j=sqrt(-1);
double a,b,d;
int n;
int f(int m,P p,P p1){
int i,s1=2,s2=2;
P p3=polar(1.0,b+d)+p,p4=polar(1.0,b-d)+p,q;
for(i=0;i<n;i++){
q=A[i];
if(q==p||q==p1)continue;
if(abs(q-p3)-1<1e-6)s1++;
if(abs(q-p4)-1<1e-6)s2++;
}
if(m<s1)m=s1;
if(m<s2)m=s2;
return m;
}
int main(){
int m,i,i1;
char c;
while(cin>>n,n!=0){
for(i=0;i<n;i++){
cin>>a>>c>>b;A[i]=P(a,b);
}
m=1;
for(i=0;i<n;i++){
P p=A[i],q;
for(i1=i+1;i1<n;i1++){
q=A[i1];a=abs(q-p);b=arg(q-p);d=acos(a/2);
if(a<=2)m=f(m,p,q);
}
}
cout<<m<<endl;
}
} | File "/tmp/tmpa3z6g3bc/tmppi9k4lgl.py", line 4
using namespace std;
^^^^^^^^^
SyntaxError: invalid syntax
| |
s096195226 | p00090 | u260980560 | 1400232512 | Python | Python | py | Runtime Error | 0 | 0 | 1859 | from math import sqrt
EPS = 10**(-8)
N = 100
def intersection(p, q, s, t):
a = 2*(p-s)
b = 2*(q-t)
c = (p**2+q**2) - (s**2+t**2)
A = a**2 + b**2
Bx = p*b**2 + a*(c-q*b)
Cx = (p**2+q**2-1)*b**2 - 2*b*c*q + c**2
Dx = Bx**2-A*Cx
#By = q*a**2 + b*(c-p*a)
#Cy = (p**2+q**2-1)*a**2 - 2*a*c*p + c**2
#Dy = By**2-A*Cy
x0 = (-sqrt(Dx)+Bx)/A; y0 = (-x0*a + c)/b;
x1 = (sqrt(Dx)+Bx)/A; y1 = (-x1*a + c)/b;
return [x0, y0], [x1, y1]
def dist(p, q, s, t):
return (p-s)**2 + (q-t)**2
while True:
n = input()
if n==0:
break
x,y = [0.0]*N,[0.0]*N
ans = 0
for i in xrange(n):
x[i], y[i] = map(float, raw_input().split(','))
for i in xrange(n):
for j in xrange(i+1, n):
rr = dist(x[i], y[i], x[j], y[j])
if rr<4.00+EPS:
if rr<EPS:
cnt = 2
for k in xrange(n):
if k==i or k==j:
continue
if dist(x[i], y[i], x[k], y[k])<1.00+EPS:
cnt += 1
ans = max(ans, cnt)
else:
xi = [0.0]*2; yi = [0.0]*2
[xi[0], yi[0]], [xi[1], yi[1]] = intersection(x[i], y[i], x[j], y[j])
for t in xrange(2):
#print xi[t],yi[t], "(", i, j,")"
cnt = 2
for k in xrange(n):
if k==i or k==j:
continue
rri = dist(xi[t], yi[t], x[k], y[k])
if rri<1.00+EPS:
cnt += 1
#print k, rri
#print ">>",cnt
ans = max(ans, cnt)
print ans | File "/tmp/tmpakme69c9/tmp4qt716nq.py", line 55
print ans
^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s115173394 | p00090 | u260980560 | 1400232708 | Python | Python | py | Runtime Error | 0 | 0 | 1827 | from math import sqrt
EPS = 10**(-8)
N = 100
def intersection(p, q, s, t):
a = 2*(p-s)
b = 2*(q-t)
c = (p**2+q**2) - (s**2+t**2)
A = a**2 + b**2
Bx = p*b**2 + a*(c-q*b)
Cx = (p**2+q**2-1)*b**2 - 2*b*c*q + c**2
Dx = Bx**2-A*Cx
#By = q*a**2 + b*(c-p*a)
#Cy = (p**2+q**2-1)*a**2 - 2*a*c*p + c**2
#Dy = By**2-A*Cy
x0 = (-sqrt(Dx)+Bx)/A; y0 = (-x0*a + c)/b;
x1 = (sqrt(Dx)+Bx)/A; y1 = (-x1*a + c)/b;
return x0, y0, x1, y1
def dist(p, q, s, t):
return (p-s)**2 + (q-t)**2
x,y = [0.0]*N,[0.0]*N
xi = [0.0]*2; yi = [0.0]*2
while True:
n = input()
if n==0:
break
ans = 1
for i in xrange(n):
x[i], y[i] = map(float, raw_input().split(','))
for i in xrange(n):
for j in xrange(i+1, n):
rr = dist(x[i], y[i], x[j], y[j])
if rr<4.00+EPS:
if rr<EPS:
cnt = 2
for k in xrange(n):
if k==i or k==j:
continue
if dist(x[i], y[i], x[k], y[k])<1.00+EPS:
cnt += 1
ans = max(ans, cnt)
else:
xi[0], yi[0], xi[1], yi[1] = intersection(x[i], y[i], x[j], y[j])
for t in xrange(2):
#print xi[t],yi[t], "(", i, j,")"
cnt = 2
for k in xrange(n):
if k==i or k==j:
continue
rri = dist(xi[t], yi[t], x[k], y[k])
if rri<1.00+EPS:
cnt += 1
#print k, rri
#print ">>",cnt
ans = max(ans, cnt)
print ans | File "/tmp/tmpwl3x89ar/tmpg805_wdk.py", line 55
print ans
^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s496115988 | p00090 | u260980560 | 1400233008 | Python | Python | py | Runtime Error | 0 | 0 | 2026 | from math import sqrt
EPS = 10**(-8)
N = 100
def intersection(p, q, s, t):
a = 2*(p-s)
b = 2*(q-t)
c = (p**2+q**2) - (s**2+t**2)
A = a**2 + b**2
x0, y0, x1, y1 = [0.0]*4
if A<EPS:
return p, q, s, t
Bx = p*b**2 + a*(c-q*b)
Cx = (p**2+q**2-1)*b**2 - 2*b*c*q + c**2
Dx = Bx**2-A*Cx
By = q*a**2 + b*(c-p*a)
Cy = (p**2+q**2-1)*a**2 - 2*a*c*p + c**2
Dy = By**2-A*Cy
if b>EPS:
x0 = (-sqrt(Dx)+Bx)/A; y0 = (-x0*a + c)/b;
x1 = (sqrt(Dx)+Bx)/A; y1 = (-x1*a + c)/b;
else:
x0 = (-y0*b + c)/a; y0 = (-sqrt(Dy)+By)/A;
x1 = (-y1*b + c)/a; y1 = (sqrt(Dy)+By)/A;
return x0, y0, x1, y1
def dist(p, q, s, t):
return (p-s)**2 + (q-t)**2
x,y = [0.0]*N,[0.0]*N
xi = [0.0]*2; yi = [0.0]*2
while True:
n = input()
if n==0:
break
ans = 1
for i in xrange(n):
x[i], y[i] = map(float, raw_input().split(','))
for i in xrange(n):
for j in xrange(i+1, n):
rr = dist(x[i], y[i], x[j], y[j])
if rr<4.00+EPS:
if rr<EPS:
cnt = 2
for k in xrange(n):
if k==i or k==j:
continue
if dist(x[i], y[i], x[k], y[k])<1.00+EPS:
cnt += 1
ans = max(ans, cnt)
else:
xi[0], yi[0], xi[1], yi[1] = intersection(x[i], y[i], x[j], y[j])
for t in xrange(2):
#print xi[t],yi[t], "(", i, j,")"
cnt = 2
for k in xrange(n):
if k==i or k==j:
continue
rri = dist(xi[t], yi[t], x[k], y[k])
if rri<1.00+EPS:
cnt += 1
#print k, rri
#print ">>",cnt
ans = max(ans, cnt)
print ans | File "/tmp/tmpu45nvyxf/tmp3n60kd_1.py", line 62
print ans
^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s094780427 | p00091 | u912237403 | 1413677581 | Python | Python | py | Runtime Error | 20 | 4664 | 2599 | #!/usr/bin/env python
# coding: utf-8
#from sys import stdin
import time
#import itertools,sys
#import time,copy
#import math
#from math import factorial
#from itertools import product, permutations
#NUM="0123456789"
#A2Z="abcdefghijklmnopqrstuvwxyz"
#import math,sys,time
#import numpy as np
#from q000 import xxxx
# coding: utf-8
#Q042 Coded triangle numbers
import math,sys,time
def read_data():
# f=open('in.txt')
# n=int(f.readline())
n=input()
x=[]
# for line in f:
# x.append(map(int,line.split()))
for i in range(10):
x.append(map(int,raw_input().split()))
return n, x
def is_area3(x,y):
if x>8 or y>6: return False
for dx in [0,1,2,1,0]:
A = P[y][x-dx:x+dx+1]
if A.count(0)>0: return False
y += 1
return True
def is_area2(x,y):
if x>7 or y>7: return False
for dy in [0,1,2]:
A = P[y+dy][x:x+3]
if A.count(0)>0: return False
return True
def is_area1(x,y):
if x>8 or y>8: return False
for dx in [0, 1, 0]:
A = P[y][x-dx:x+dx+1]
if A.count(0)>0: return False
y += 1
return True
def ink(x,y,s,m):
global P
for dy,dx in [[0,0],[1,0],[-1,0],[0,1],[0,-1]]:
P[y+dy][x+dx]+=m
if s==1: return
for dy,dx in [[1,1],[1,-1],[-1,1],[-1,-1]]:
P[y+dy][x+dx]+=m
if s==2: return
for dy,dx in [[2,0],[-2,0],[0,2],[0,-2]]:
P[y+dy][x+dx]+=m
return
drops, P = read_data()
M=[]
i=-1
step =3
while i<99:
i+=1
y = i / 10
x = i % 10
if P[y][x]==0: continue
# print
# print "i=",i
# print "Pi=",P
# print "Mi=",M
if step==3:
# print "step 3"
while is_area3(x,y):
M.append([x,y,3])
ink(x,y+2,3,-1)
if P[y][x]==0:
step = 3
# print "Po=",P
# print "Mo=",M
continue
else: step = 2
if step==2:
# print "step 2"
while is_area2(x,y):
M.append([x,y,2])
ink(x+1,y+1,2,-1)
if P[y][x]==0:
step = 3
# print "Po=",P
# print "Mo=",M
continue
else: step = 1
if step==1:
# print "step 1"
while is_area1(x,y):
M.append([x,y,1])
ink(x,y+1,1,-1)
if P[y][x]==0:
step = 3
# print "Po=",P
# print "Mo=",M
continue
else: step = 0
dx=0
dy=1
if step==0 and len(M)>0:
x,y,tmp = M.pop()
if tmp==3: dy=2
elif tmp==2: dx=1
ink(x+dx,y+dy,tmp,1)
i = y*10+x-1
step = tmp-1
else:
# print "unsolvable"
break
# print "changed io=",i+1
# print "Mo=",M
# print "Po=",P
# print
for x,y,s in M:
dx=0
dy=1
if s==3: dy=2
elif s==2: dx=1
print x+dx,y+dy,s
#start_time = time.clock()
#print time.clock() - start_time, "seconds" | File "/tmp/tmpqs71790m/tmp__nwh7ly.py", line 139
print x+dx,y+dy,s
^^^^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s495099091 | p00091 | u912237403 | 1413678596 | Python | Python | py | Runtime Error | 0 | 0 | 2625 | #!/usr/bin/env python
# coding: utf-8
#from sys import stdin
import time
#import itertools,sys
#import time,copy
#import math
#from math import factorial
#from itertools import product, permutations
#NUM="0123456789"
#A2Z="abcdefghijklmnopqrstuvwxyz"
#import math,sys,time
#import numpy as np
#from q000 import xxxx
# coding: utf-8
#Q042 Coded triangle numbers
import math,sys,time
def read_data():
f=open('in.txt')
n=int(f.readline())
# n=input()
x=[]
for line in f:
x.append(map(int,line.split()))
# for i in range(10):
# x.append(map(int,raw_input().split()))
return n, x
def is_area3(x,y):
if x>8 or y>6: return False
for dx in [0,1,2,1,0]:
A = P[y][x-dx:x+dx+1]
if A.count(0)>0: return False
y += 1
return True
def is_area2(x,y):
if x>7 or y>7: return False
for dy in [0,1,2]:
A = P[y+dy][x:x+3]
if A.count(0)>0: return False
return True
def is_area1(x,y):
if x>8 or y>8: return False
for dx in [0, 1, 0]:
A = P[y][x-dx:x+dx+1]
if A.count(0)>0: return False
y += 1
return True
def ink(x,y,s,m):
global P
for dy,dx in [[0,0],[1,0],[-1,0],[0,1],[0,-1]]:
P[y+dy][x+dx]+=m
if s==1: return
for dy,dx in [[1,1],[1,-1],[-1,1],[-1,-1]]:
P[y+dy][x+dx]+=m
if s==2: return
for dy,dx in [[2,0],[-2,0],[0,2],[0,-2]]:
P[y+dy][x+dx]+=m
return
drops, P = read_data()
M=[]
i=-1
step =3
while i<99:
i+=1
y = i / 10
x = i % 10
if P[y][x]==0: continue
# print
# print "i=",i
# print "Pi=",P
# print "Mi=",M
if step==3:
# print "step 3"
while is_area3(x,y):
M.append([x,y,3])
ink(x,y+2,3,-1)
if P[y][x]==0:
step = 3
# print "Po=",P
# print "Mo=",M
continue
else: step = 2
if step==2:
# print "step 2"
while is_area2(x,y):
M.append([x,y,2])
ink(x+1,y+1,2,-1)
if P[y][x]==0:
step = 3
# print "Po=",P
# print "Mo=",M
continue
else: step = 1
if step==1:
# print "step 1"
while is_area1(x,y):
M.append([x,y,1])
ink(x,y+1,1,-1)
if P[y][x]==0:
step = 3
# print "Po=",P
# print "Mo=",M
continue
else: step = 0
dx=0
dy=1
if step==0 and len(M)>0:
x,y,tmp = M.pop()
if tmp==3: dy=2
elif tmp==2: dx=1
ink(x+dx,y+dy,tmp,1)
i = y*10+x-1
step = tmp-1
else:
# print "unsolvable"
break
# print "changed io=",i+1
# print "Mo=",M
# print "Po=",P
# print
if len(M)<=12:
for x,y,s in M:
dx=0
dy=1
if s==3: dy=2
elif s==2: dx=1
print x+dx,y+dy,s
#start_time = time.clock()
#print time.clock() - start_time, "seconds" | File "/tmp/tmpbnd10aym/tmpr0pc1gv0.py", line 140
print x+dx,y+dy,s
^^^^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s707639466 | p00091 | u912237403 | 1413678639 | Python | Python | py | Runtime Error | 20 | 4668 | 2626 | #!/usr/bin/env python
# coding: utf-8
#from sys import stdin
import time
#import itertools,sys
#import time,copy
#import math
#from math import factorial
#from itertools import product, permutations
#NUM="0123456789"
#A2Z="abcdefghijklmnopqrstuvwxyz"
#import math,sys,time
#import numpy as np
#from q000 import xxxx
# coding: utf-8
#Q042 Coded triangle numbers
import math,sys,time
def read_data():
# f=open('in.txt')
# n=int(f.readline())
n=input()
x=[]
# for line in f:
# x.append(map(int,line.split()))
for i in range(10):
x.append(map(int,raw_input().split()))
return n, x
def is_area3(x,y):
if x>8 or y>6: return False
for dx in [0,1,2,1,0]:
A = P[y][x-dx:x+dx+1]
if A.count(0)>0: return False
y += 1
return True
def is_area2(x,y):
if x>7 or y>7: return False
for dy in [0,1,2]:
A = P[y+dy][x:x+3]
if A.count(0)>0: return False
return True
def is_area1(x,y):
if x>8 or y>8: return False
for dx in [0, 1, 0]:
A = P[y][x-dx:x+dx+1]
if A.count(0)>0: return False
y += 1
return True
def ink(x,y,s,m):
global P
for dy,dx in [[0,0],[1,0],[-1,0],[0,1],[0,-1]]:
P[y+dy][x+dx]+=m
if s==1: return
for dy,dx in [[1,1],[1,-1],[-1,1],[-1,-1]]:
P[y+dy][x+dx]+=m
if s==2: return
for dy,dx in [[2,0],[-2,0],[0,2],[0,-2]]:
P[y+dy][x+dx]+=m
return
drops, P = read_data()
M=[]
i=-1
step =3
while i<99:
i+=1
y = i / 10
x = i % 10
if P[y][x]==0: continue
# print
# print "i=",i
# print "Pi=",P
# print "Mi=",M
if step==3:
# print "step 3"
while is_area3(x,y):
M.append([x,y,3])
ink(x,y+2,3,-1)
if P[y][x]==0:
step = 3
# print "Po=",P
# print "Mo=",M
continue
else: step = 2
if step==2:
# print "step 2"
while is_area2(x,y):
M.append([x,y,2])
ink(x+1,y+1,2,-1)
if P[y][x]==0:
step = 3
# print "Po=",P
# print "Mo=",M
continue
else: step = 1
if step==1:
# print "step 1"
while is_area1(x,y):
M.append([x,y,1])
ink(x,y+1,1,-1)
if P[y][x]==0:
step = 3
# print "Po=",P
# print "Mo=",M
continue
else: step = 0
dx=0
dy=1
if step==0 and len(M)>0:
x,y,tmp = M.pop()
if tmp==3: dy=2
elif tmp==2: dx=1
ink(x+dx,y+dy,tmp,1)
i = y*10+x-1
step = tmp-1
else:
# print "unsolvable"
break
# print "changed io=",i+1
# print "Mo=",M
# print "Po=",P
# print
if len(M)<=12:
for x,y,s in M:
dx=0
dy=1
if s==3: dy=2
elif s==2: dx=1
print x+dx,y+dy,s
#start_time = time.clock()
#print time.clock() - start_time, "seconds" | File "/tmp/tmpaiv4tbb7/tmpeh1cn3qb.py", line 140
print x+dx,y+dy,s
^^^^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s654968891 | p00091 | u912237403 | 1413679634 | Python | Python | py | Runtime Error | 20 | 4668 | 2531 | #!/usr/bin/env python
# coding: utf-8
#from sys import stdin
import time
#import itertools,sys
#import time,copy
#import math
#from math import factorial
#from itertools import product, permutations
#NUM="0123456789"
#A2Z="abcdefghijklmnopqrstuvwxyz"
#import math,sys,time
#import numpy as np
#from q000 import xxxx
# coding: utf-8
#Q042 Coded triangle numbers
import math,sys,time
def read_data():
n=input()
x=[]
for i in range(10):
x.append(map(int,raw_input().split()))
return n, x
def is_area3(x,y):
if x>8 or y>6: return False
for dx in [0,1,2,1,0]:
A = P[y][x-dx:x+dx+1]
if A.count(0)>0: return False
y += 1
return True
def is_area2(x,y):
if x>7 or y>7: return False
for dy in [0,1,2]:
A = P[y+dy][x:x+3]
if A.count(0)>0: return False
return True
def is_area1(x,y):
if x>8 or y>8: return False
for dx in [0, 1, 0]:
A = P[y][x-dx:x+dx+1]
if A.count(0)>0: return False
y += 1
return True
def ink(x,y,s,m):
global P
for dy,dx in [[0,0],[1,0],[-1,0],[0,1],[0,-1]]:
P[y+dy][x+dx]+=m
if s==1: return
for dy,dx in [[1,1],[1,-1],[-1,1],[-1,-1]]:
P[y+dy][x+dx]+=m
if s==2: return
for dy,dx in [[2,0],[-2,0],[0,2],[0,-2]]:
P[y+dy][x+dx]+=m
return
drops, P = read_data()
M=[]
i=-1
step =3
while i<99:
i+=1
y = i / 10
x = i % 10
if P[y][x]==0: continue
# print
# print "i=",i
# print "Pi=",P
# print "Mi=",M
if step==3:
# print "step 3"
while is_area3(x,y):
M.append([x,y,3])
ink(x,y+2,3,-1)
if P[y][x]==0:
step = 3
# print "Po=",P
# print "Mo=",M
continue
else: step = 2
if step==2:
# print "step 2"
while is_area2(x,y):
M.append([x,y,2])
ink(x+1,y+1,2,-1)
if P[y][x]==0:
step = 3
# print "Po=",P
# print "Mo=",M
continue
else: step = 1
if step==1:
# print "step 1"
while is_area1(x,y):
M.append([x,y,1])
ink(x,y+1,1,-1)
if P[y][x]==0:
step = 3
# print "Po=",P
# print "Mo=",M
continue
else: step = 0
dx=0
dy=1
if step==0 and len(M)>0:
x,y,tmp = M.pop()
if tmp==3: dy=2
elif tmp==2: dx=1
ink(x+dx,y+dy,tmp,1)
i = y*10+x-1
step = tmp-1
else:
# print "unsolvable"
break
# print "changed io=",i+1
# print "Mo=",M
# print "Po=",P
# print
if len(M)==drops:
for x,y,s in M:
dx=0
dy=1
if s==3: dy=2
elif s==2: dx=1
print x+dx,y+dy,s
#start_time = time.clock()
#print time.clock() - start_time, "seconds" | File "/tmp/tmp8jmlo67r/tmp0vtbtb1z.py", line 136
print x+dx,y+dy,s
^^^^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s806213554 | p00091 | u912237403 | 1413679879 | Python | Python | py | Runtime Error | 20 | 4672 | 2545 | #!/usr/bin/env python
# coding: utf-8
#from sys import stdin
import time
#import itertools,sys
#import time,copy
#import math
#from math import factorial
#from itertools import product, permutations
#NUM="0123456789"
#A2Z="abcdefghijklmnopqrstuvwxyz"
#import math,sys,time
#import numpy as np
#from q000 import xxxx
# coding: utf-8
#Q042 Coded triangle numbers
import math,sys,time
def read_data():
n=input()
x=[]
for i in range(10):
x.append(map(int,raw_input().split()))
return n, x
def is_area3(x,y):
if x>8 or y>6: return False
for dx in [0,1,2,1,0]:
A = P[y][x-dx:x+dx+1]
if A.count(0)>0: return False
y += 1
return True
def is_area2(x,y):
if x>7 or y>7: return False
for dy in [0,1,2]:
A = P[y+dy][x:x+3]
if A.count(0)>0: return False
return True
def is_area1(x,y):
if x>8 or y>8: return False
for dx in [0, 1, 0]:
A = P[y][x-dx:x+dx+1]
if A.count(0)>0: return False
y += 1
return True
def ink(x,y,s,m):
global P
for dy,dx in [[0,0],[1,0],[-1,0],[0,1],[0,-1]]:
P[y+dy][x+dx]+=m
if s==1: return
for dy,dx in [[1,1],[1,-1],[-1,1],[-1,-1]]:
P[y+dy][x+dx]+=m
if s==2: return
for dy,dx in [[2,0],[-2,0],[0,2],[0,-2]]:
P[y+dy][x+dx]+=m
return
drops, P = read_data()
M=[]
i=-1
step =3
while i<99:
i+=1
y = i / 10
x = i % 10
if P[y][x]==0: continue
# print
# print "i=",i
# print "Pi=",P
# print "Mi=",M
if step==3:
# print "step 3"
while is_area3(x,y):
M.append([x,y,3])
ink(x,y+2,3,-1)
if P[y][x]==0:
step = 3
# print "Po=",P
# print "Mo=",M
continue
else: step = 2
if step==2:
# print "step 2"
while is_area2(x,y):
M.append([x,y,2])
ink(x+1,y+1,2,-1)
if P[y][x]==0:
step = 3
# print "Po=",P
# print "Mo=",M
continue
else: step = 1
if step==1:
# print "step 1"
while is_area1(x,y):
M.append([x,y,1])
ink(x,y+1,1,-1)
if P[y][x]==0:
step = 3
# print "Po=",P
# print "Mo=",M
continue
else: step = 0
dx=0
dy=1
if step==0 and len(M)>0:
x,y,tmp = M.pop()
if tmp==3: dy=2
elif tmp==2: dx=1
ink(x+dx,y+dy,tmp,1)
i = y*10+x-1
step = tmp-1
else:
# print "unsolvable"
break
# print "changed io=",i+1
# print "Mo=",M
# print "Po=",P
# print
if drops<=12 and len(M)==drops:
for x,y,s in M:
dx=0
dy=1
if s==3: dy=2
elif s==2: dx=1
print x+dx,y+dy,s
#start_time = time.clock()
#print time.clock() - start_time, "seconds" | File "/tmp/tmpvevozqqj/tmppyat9lvj.py", line 136
print x+dx,y+dy,s
^^^^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s263624668 | p00091 | u912237403 | 1413697613 | Python | Python | py | Runtime Error | 20 | 4672 | 2644 | #!/usr/bin/env python
# coding: utf-8
#from sys import stdin
import time
#import itertools,sys
#import time,copy
#import math
#from math import factorial
#from itertools import product, permutations
#NUM="0123456789"
#A2Z="abcdefghijklmnopqrstuvwxyz"
#import math,sys,time
#import numpy as np
#from q000 import xxxx
# coding: utf-8
#Q042 Coded triangle numbers
import math,sys,time
def read_data():
# f=open('in.txt')
# n=int(f.readline())
n=input()
x=[]
# for line in f:
# x.append(map(int,line.split()))
for i in range(10):
x.append(map(int,raw_input().split()))
return n, x
def is_area3(x,y):
if x>7 or y>6: return False
for dx in [0,1,2,1,0]:
A = P[y][x-dx:x+dx+1]
if A.count(0)>0: return False
y += 1
return True
def is_area2(x,y):
if x>7 or y>7: return False
for dy in [0,1,2]:
A = P[y+dy][x:x+3]
if A.count(0)>0: return False
return True
def is_area1(x,y):
if x>8 or y>8: return False
for dx in [0, 1, 0]:
A = P[y][x-dx:x+dx+1]
if A.count(0)>0: return False
y += 1
return True
def ink(x,y,s,m):
global P
for dy,dx in [[0,0],[1,0],[-1,0],[0,1],[0,-1]]:
P[y+dy][x+dx]+=m
if s==1: return
for dy,dx in [[1,1],[1,-1],[-1,1],[-1,-1]]:
P[y+dy][x+dx]+=m
if s==2: return
for dy,dx in [[2,0],[-2,0],[0,2],[0,-2]]:
P[y+dy][x+dx]+=m
return
drops, P = read_data()
M=[]
i=-1
step =3
while i<99:
i+=1
y = i / 10
x = i % 10
if P[y][x]==0: continue
# print
# print "i=",i
# print "Pi=",P
# print "Mi=",M
if step==3:
# print "step 3"
while is_area3(x,y):
M.append([x,y,3])
ink(x,y+2,3,-1)
if P[y][x]==0:
step = 3
# print "Po=",P
# print "Mo=",M
continue
else: step = 2
if step==2:
# print "step 2"
while is_area2(x,y):
M.append([x,y,2])
ink(x+1,y+1,2,-1)
if P[y][x]==0:
step = 3
# print "Po=",P
# print "Mo=",M
continue
else: step = 1
if step==1:
# print "step 1"
while is_area1(x,y):
M.append([x,y,1])
ink(x,y+1,1,-1)
if P[y][x]==0:
step = 3
# print "Po=",P
# print "Mo=",M
continue
else: step = 0
dx=0
dy=1
if step==0 and len(M)>0:
x,y,tmp = M.pop()
if tmp==3: dy=2
elif tmp==2: dx=1
ink(x+dx,y+dy,tmp,1)
i = y*10+x-1
step = tmp-1
else:
# print "unsolvable"
break
# print "changed io=",i+1
# print "Mo=",M
# print "Po=",P
# print
if drops <=12 and len(M)==drops:
for x,y,s in M:
dx=0
dy=1
if s==3: dy=2
elif s==2: dx=1
print x+dx,y+dy,s
#start_time = time.clock()
#print time.clock() - start_time, "seconds" | File "/tmp/tmpy318g2pw/tmphu25yi3g.py", line 140
print x+dx,y+dy,s
^^^^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s341526849 | p00091 | u912237403 | 1413700505 | Python | Python | py | Runtime Error | 0 | 0 | 1483 | def read_data():
n=input()
x=[]
for i in range(10): x.append(map(int,raw_input().split()))
return n, x
def is_area3(x,y):
if x>7 or y>5: return False
for dx in [0,1,2,1,0]:
A=P[y][x-dx:x+dx+1]
if A.count(0)>0: return False
y+=1
return True
def is_area2(x,y):
if x>7 or y>7: return False
for dy in [0,1,2]:
A=P[y+dy][x:x+3]
if A.count(0)>0: return False
return True
def is_area1(x,y):
if x>8 or y>7: return False
for dx in [0,1,0]:
A=P[y][x-dx:x+dx+1]
if A.count(0)>0: return False
y+=1
return True
def ink(x,y,s,m):
global P
dx = [0,1,-1,0,0,1,1,-1,-1,2,-2,0,0]
dy = [0,0,-0,1,-1,1,-1,1,-1,0,0,2,-2]
for i in range([5,9,13][s-1]): P[y+dy[i]][x+dx[i]]+=m
return
drops,P = read_data()
A=[]
i=-1
m=3
while i<99:
i+=1
y=i/10
x=i%10
if P[y][x]==0: continue
if m==3:
while is_area3(x,y):
A.append([x,y,3])
ink(x,y+2,3,-1)
if P[y][x]==0:
m=3
continue
else: m=2
if m==2:
while is_area2(x,y):
A.append([x,y,2])
ink(x+1,y+1,2,-1)
if P[y][x]==0:
m=3
continue
else: m=1
if m==1:
while is_area1(x,y):
A.append([x,y,1])
ink(x,y+1,1,-1)
if P[y][x]==0:
m=3
continue
else: m=0
dx=[0,1,0]
dy=[1,1,2]
if m==0 and len(A)>0:
x,y,m=A.pop()
m-=1
ink(x+dx[m],y+dy[m],m+1,1)
i = y*10+x-1
else: break
if drops <=12 and len(A)==drops:
for x,y,s in A: print x+dx[s-1],y+dy[s-1],s | File "/tmp/tmpdvlhry7v/tmplb1hohx2.py", line 84
for x,y,s in A: print x+dx[s-1],y+dy[s-1],s
^^^^^^^^^^^^^^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s042880800 | p00091 | u912237403 | 1413700569 | Python | Python | py | Runtime Error | 0 | 0 | 1490 | def read_data():
n=input()
x=[]
for i in range(10): x.append(map(int,raw_input().split()))
return n, x
def is_area3(x,y):
if x>7 or y>5: return False
for dx in [0,1,2,1,0]:
A=P[y][x-dx:x+dx+1]
if A.count(0)>0: return False
y+=1
return True
def is_area2(x,y):
if x>7 or y>7: return False
for dy in [0,1,2]:
A=P[y+dy][x:x+3]
if A.count(0)>0: return False
return True
def is_area1(x,y):
if x>8 or y>7: return False
for dx in [0,1,0]:
A=P[y][x-dx:x+dx+1]
if A.count(0)>0: return False
y+=1
return True
def ink(x,y,s,m):
global P
dx = [0,1,-1,0,0,1,1,-1,-1,2,-2,0,0]
dy = [0,0,-0,1,-1,1,-1,1,-1,0,0,2,-2]
for i in range([5,9,13][s-1]):
P[y+dy[i]][x+dx[i]]+=m
return
drops,P = read_data()
A=[]
i=-1
m=3
while i<99:
i+=1
y=i/10
x=i%10
if P[y][x]==0: continue
if m==3:
while is_area3(x,y):
A.append([x,y,3])
ink(x,y+2,3,-1)
if P[y][x]==0:
m=3
continue
else: m=2
if m==2:
while is_area2(x,y):
A.append([x,y,2])
ink(x+1,y+1,2,-1)
if P[y][x]==0:
m=3
continue
else: m=1
if m==1:
while is_area1(x,y):
A.append([x,y,1])
ink(x,y+1,1,-1)
if P[y][x]==0:
m=3
continue
else: m=0
dx=[0,1,0]
dy=[1,1,2]
if m==0 and len(A)>0:
x,y,m=A.pop()
m-=1
ink(x+dx[m],y+dy[m],m+1,1)
i = y*10+x-1
else:
break
if drops <=12 and len(A)==drops:
for x,y,s in A: print x+dx[s-1],y+dy[s-1],s | File "/tmp/tmpgaelfhcf/tmpe2vnpbmx.py", line 85
for x,y,s in A: print x+dx[s-1],y+dy[s-1],s
^^^^^^^^^^^^^^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s752665211 | p00091 | u912237403 | 1413700731 | Python | Python | py | Runtime Error | 0 | 0 | 1501 | import sys
def read_data():
n=input()
x=[]
for i in range(10): x.append(map(int,raw_input().split()))
return n, x
def is_area3(x,y):
if x>7 or y>5: return False
for dx in [0,1,2,1,0]:
A=P[y][x-dx:x+dx+1]
if A.count(0)>0: return False
y+=1
return True
def is_area2(x,y):
if x>7 or y>7: return False
for dy in [0,1,2]:
A=P[y+dy][x:x+3]
if A.count(0)>0: return False
return True
def is_area1(x,y):
if x>8 or y>7: return False
for dx in [0,1,0]:
A=P[y][x-dx:x+dx+1]
if A.count(0)>0: return False
y+=1
return True
def ink(x,y,s,m):
global P
dx = [0,1,-1,0,0,1,1,-1,-1,2,-2,0,0]
dy = [0,0,-0,1,-1,1,-1,1,-1,0,0,2,-2]
for i in range([5,9,13][s-1]):
P[y+dy[i]][x+dx[i]]+=m
return
drops,P = read_data()
A=[]
i=-1
m=3
while i<99:
i+=1
y=i/10
x=i%10
if P[y][x]==0: continue
if m==3:
while is_area3(x,y):
A.append([x,y,3])
ink(x,y+2,3,-1)
if P[y][x]==0:
m=3
continue
else: m=2
if m==2:
while is_area2(x,y):
A.append([x,y,2])
ink(x+1,y+1,2,-1)
if P[y][x]==0:
m=3
continue
else: m=1
if m==1:
while is_area1(x,y):
A.append([x,y,1])
ink(x,y+1,1,-1)
if P[y][x]==0:
m=3
continue
else: m=0
dx=[0,1,0]
dy=[1,1,2]
if m==0 and len(A)>0:
x,y,m=A.pop()
m-=1
ink(x+dx[m],y+dy[m],m+1,1)
i = y*10+x-1
else:
break
if drops <=12 and len(A)==drops:
for x,y,s in A: print x+dx[s-1],y+dy[s-1],s | File "/tmp/tmp5760i_bp/tmp9ctuhoym.py", line 86
for x,y,s in A: print x+dx[s-1],y+dy[s-1],s
^^^^^^^^^^^^^^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s984763361 | p00091 | u912237403 | 1413700914 | Python | Python | py | Runtime Error | 0 | 0 | 1507 | import sys
def read_data():
n=input()
x=[]
for i in range(10):
x.append(map(int,raw_input().split()))
return n, x
def is_area3(x,y):
if x>7 or y>5: return False
for dx in [0,1,2,1,0]:
A=P[y][x-dx:x+dx+1]
if A.count(0)>0: return False
y+=1
return True
def is_area2(x,y):
if x>7 or y>7: return False
for dy in [0,1,2]:
A=P[y+dy][x:x+3]
if A.count(0)>0: return False
return True
def is_area1(x,y):
if x>8 or y>7: return False
for dx in [0,1,0]:
A=P[y][x-dx:x+dx+1]
if A.count(0)>0: return False
y+=1
return True
def ink(x,y,s,m):
global P
dx = [0,1,-1,0,0,1,1,-1,-1,2,-2,0,0]
dy = [0,0,-0,1,-1,1,-1,1,-1,0,0,2,-2]
for i in range([5,9,13][s-1]):
P[y+dy[i]][x+dx[i]]+=m
return
drops,P = read_data()
A=[]
i=-1
m=3
while i<99:
i+=1
y=i/10
x=i%10
if P[y][x]==0: continue
if m==3:
while is_area3(x,y):
A.append([x,y,3])
ink(x,y+2,3,-1)
if P[y][x]==0:
m=3
continue
else: m=2
if m==2:
while is_area2(x,y):
A.append([x,y,2])
ink(x+1,y+1,2,-1)
if P[y][x]==0:
m=3
continue
else: m=1
if m==1:
while is_area1(x,y):
A.append([x,y,1])
ink(x,y+1,1,-1)
if P[y][x]==0:
m=3
continue
else: m=0
dx=[0,1,0]
dy=[1,1,2]
if m==0 and len(A)>0:
x,y,m=A.pop()
m-=1
ink(x+dx[m],y+dy[m],m+1,1)
i = y*10+x-1
else:
break
if drops <=12 and len(A)==drops:
for x,y,s in A: print x+dx[s-1],y+dy[s-1],s | File "/tmp/tmp47l27m2p/tmpl_l2k6bo.py", line 89
for x,y,s in A: print x+dx[s-1],y+dy[s-1],s
^^^^^^^^^^^^^^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s920245746 | p00091 | u797673668 | 1452940439 | Python | Python3 | py | Runtime Error | 40000 | 8176 | 1714 | from copy import deepcopy
n_drop, cloth = int(input()), [[int(i) for i in input().split()] for _ in range(10)]
n_stain = sum(sum(i) for i in cloth)
n = (n_stain - 5 * n_drop) // 4
drops_candidate = []
dl = 0
while 2 * dl <= n:
dm = n - 2 * dl
ds = n_drop - dm - dl
if ds >= 0:
drops_candidate.append([ds, dm, dl])
dl += 1
sdxy = ((0, 0), (-1, 0), (1, 0), (0, -1), (0, 1))
mdxy = sdxy + ((-1, -1), (-1, 1), (1, -1), (1, 1))
ldxy = mdxy + ((-2, 0), (2, 0), (0, -2), (0, 2))
dxys = (sdxy, mdxy, ldxy)
def remove(cloth, x, y, drop_size):
if drop_size == 2 and (not 1 < x < 8 or not 1 < y < 8):
return False
for dxy in dxys[drop_size]:
(dx, dy) = dxy
if cloth[y + dy][x + dx]:
cloth[y + dy][x + dx] -= 1
else:
return False
return True
def find(cloth, drops, history):
for d in range(3):
if not drops[d]:
continue
for j in range(1, 9):
for i in range(1, 9):
new_cloth = [r[:] for r in cloth]
result = remove(new_cloth, i, j, d)
if result:
new_drops, new_history = drops[:], history[:]
new_drops[d] -= 1
new_history.append((i, j, d + 1))
if sum(new_drops):
result = find(new_cloth, new_drops, new_history)
if result:
return result
else:
return new_history
return False
for drops in drops_candidate:
history = find(cloth, drops, [])
if history != False:
for h in history:
print(*h)
break | Traceback (most recent call last):
File "/tmp/tmpk370pp38/tmplob0ufo6.py", line 3, in <module>
n_drop, cloth = int(input()), [[int(i) for i in input().split()] for _ in range(10)]
^^^^^^^
EOFError: EOF when reading a line
| |
s757427990 | p00091 | u797673668 | 1452941471 | Python | Python3 | py | Runtime Error | 40000 | 7812 | 1670 | n_drop, cloth = int(input()), [[int(i) for i in input().split()] for _ in range(10)]
n_stain = sum(sum(i) for i in cloth)
n = (n_stain - 5 * n_drop) // 4
drops_candidate = []
dl = 0
while 2 * dl <= n:
dm = n - 2 * dl
ds = n_drop - dm - dl
if ds >= 0:
drops_candidate.append([ds, dm, dl])
dl += 1
sdxy = ((0, 0), (-1, 0), (1, 0), (0, -1), (0, 1))
mdxy = sdxy + ((-1, -1), (-1, 1), (1, -1), (1, 1))
ldxy = mdxy + ((-2, 0), (2, 0), (0, -2), (0, 2))
dxys = (sdxy, mdxy, ldxy)
def find(cloth, drops, history):
for d in range(2, -1, -1):
if not drops[d]:
continue
(start, stop) = (1, 9) if d < 2 else (2, 8)
for y in range(start, stop):
for x in range(start, stop):
for dxy in dxys[d]:
(dx, dy) = dxy
if not cloth[y + dy][x + dx]:
break
else:
new_cloth, new_drops, new_history = [r[:] for r in cloth], drops[:], history[:]
for dxy in dxys[d]:
(dx, dy) = dxy
new_cloth[y + dy][x + dx] -= 1
new_drops[d] -= 1
new_history.append((x, y, d + 1))
if sum(new_drops):
result = find(new_cloth, new_drops, new_history)
if result:
return result
else:
return new_history
return False
for drops in drops_candidate:
history = find(cloth, drops, [])
if history != False:
for h in history:
print(*h)
break | Traceback (most recent call last):
File "/tmp/tmprygw9buq/tmpuiveotsj.py", line 1, in <module>
n_drop, cloth = int(input()), [[int(i) for i in input().split()] for _ in range(10)]
^^^^^^^
EOFError: EOF when reading a line
| |
s857212870 | p00091 | u797673668 | 1452952120 | Python | Python3 | py | Runtime Error | 40000 | 7892 | 1680 | n_drop, cloth = int(input()), [[int(i) for i in input().split()] for _ in range(10)]
n_stain = sum(sum(i) for i in cloth)
n = (n_stain - 5 * n_drop) // 4
drops_candidate = []
dl = 0
while 2 * dl <= n:
dm = n - 2 * dl
ds = n_drop - dm - dl
if ds >= 0:
drops_candidate.append([ds, dm, dl])
dl += 1
dx = (0, -1, 1, 0, 0, -1, -1, 1, 1, -2, 2, 0, 0)
dy = (0, 0, 0, -1, 1, -1, 1, -1, 1, 0, 0, -2, 2)
dd = (5, 9, 13)
min_range = (0, 0, 1)
def find(cloth, drops, pointer):
global dy, dx
for d in range(3):
if not drops[d]:
continue
dn, ps, mir = dd[d], pointer if pointer else 11, 0 if d < 2 else 1
mar = 9 - mir
for p in range(ps, 89):
x, y = p % 10, p // 10
if not mir < x < mar or not mir < y < mar:
continue
for i in range(dn):
if not cloth[y + dy[i]][x + dx[i]]:
break
else:
for i in range(dn):
cloth[y + dy[i]][x + dx[i]] -= 1
drops[d] -= 1
if sum(drops):
result = find(cloth, drops, p)
if result:
result.append((x, y, d + 1))
return result
else:
for i in range(dn):
cloth[y + dy[i]][x + dx[i]] += 1
drops[d] += 1
else:
return [(x, y, d + 1)]
return False
for drops in drops_candidate:
history = find(cloth, drops, 0)
if history != False:
for h in history:
print(*h)
break | Traceback (most recent call last):
File "/tmp/tmpw9zqr2x5/tmpo7lkh96_.py", line 1, in <module>
n_drop, cloth = int(input()), [[int(i) for i in input().split()] for _ in range(10)]
^^^^^^^
EOFError: EOF when reading a line
| |
s645224968 | p00091 | u797673668 | 1452958642 | Python | Python3 | py | Runtime Error | 30 | 7820 | 1598 | n_drop, cloth = int(input()), [[int(i) for i in input().split()] for _ in range(10)]
n_stain = sum(sum(i) for i in cloth)
n = (n_stain - 5 * n_drop) // 4
drops_candidate = []
dl = 0
while 2 * dl <= n:
dm = n - 2 * dl
ds = n_drop - dm - dl
if ds >= 0:
drops_candidate.append([ds, dm, dl])
dl += 1
dx = (0, -1, 1, 0, 0, -1, -1, 1, 1, -2, 2, 0, 0)
dy = (0, 0, 0, -1, 1, -1, 1, -1, 1, 0, 0, -2, 2)
dd = (5, 9, 13)
def find(cloth, drops, pointer):
global dy, dx, dd
for p in range(pointer, 100):
if cloth[p // 10][p % 10]:
break
pointer += 1
for d in range(3):
if not drops[d]:
continue
dn = dd[d]
for i in range(dn):
x, y = pointer % 10 + dx[i], pointer // 10 + dy[i]
for j in range(dn):
if not cloth[y + dy[j]][x + dx[j]]:
break
else:
for j in range(dn):
cloth[y + dy[j]][x + dx[j]] -= 1
drops[d] -= 1
if sum(drops):
result = find(cloth, drops, p)
if result:
result.append((x, y, d + 1))
return result
for i in range(dn):
cloth[y + dy[i]][x + dx[i]] += 1
drops[d] += 1
else:
return [(x, y, d + 1)]
return False
for drops in drops_candidate:
history = find(cloth, drops, 0)
if history != False:
for h in history:
print(*h)
break | Traceback (most recent call last):
File "/tmp/tmp6ujw3vmk/tmpilvbqfq7.py", line 1, in <module>
n_drop, cloth = int(input()), [[int(i) for i in input().split()] for _ in range(10)]
^^^^^^^
EOFError: EOF when reading a line
| |
s973821927 | p00091 | u024715419 | 1526356487 | Python | Python3 | py | Runtime Error | 6960 | 5684 | 1346 | import itertools
dx = (0, 0, 0, 1,-1, 1, 1,-1,-1,-2, 2, 0, 0)
dy = (0, 1,-1, 0, 0, 1,-1, 1,-1, 0, 0,-2, 2)
dd = (5, 9, 13)
def drop(fab, used, size_list):
for xy in range(100):
y = xy%10
x = xy//10
size = size_list[used]
check = True
for i in range(size):
if fab[y + dy[i] + 2][x + dx[i] + 2] == 0:
check = False
if check:
for i in range(size):
fab[y + dy[i] + 2][x + dx[i] + 2] -= 1
if sum(map(sum, fab)):
result = drop(fab, used + 1, size_list)
if result:
result.append([x, y, dd.index(size) + 1])
return result
for i in range(size):
fab[y + dy[i] + 2][x + dx[i] + 2] += 1
else:
return [[x, y, dd.index(size) + 1]]
return False
fab = [[0 for i in range(14)] for j in range(14)]
n = int(input())
for i in range(10):
fab[i + 2][2:12] = list(map(int, input().split()))
s = sum(map(sum, fab))
d_all = list(itertools.combinations_with_replacement([5,9,13], n))
d_list = [l for l in d_all if sum(l) == s]
ans = [0 for i in range(n)]
for d in d_list:
d_tmp = sorted(d)[::-1]
ans = drop(fab, 0, d_tmp)
if ans:
for a in ans:
print(*a)
break
| Traceback (most recent call last):
File "/tmp/tmp1h_zwwt9/tmpyputv15c.py", line 32, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s556029709 | p00091 | u024715419 | 1526356748 | Python | Python3 | py | Runtime Error | 2920 | 5676 | 1361 | import itertools
dx = (0, 0, 0, 1,-1, 1, 1,-1,-1,-2, 2, 0, 0)
dy = (0, 1,-1, 0, 0, 1,-1, 1,-1, 0, 0,-2, 2)
dd = (5, 9, 13)
def drop(fab, used, size_list):
for xy in range(100):
y = xy%10
x = xy//10
size = size_list[used]
check = True
for i in range(size):
if fab[y + dy[i] + 2][x + dx[i] + 2] == 0:
check = False
if check:
for i in range(size):
fab[y + dy[i] + 2][x + dx[i] + 2] -= 1
if sum(map(sum, fab)):
result = drop(fab, used + 1, size_list)
if result:
result.append([x, y, dd.index(size) + 1])
return result
for i in range(size):
fab[y + dy[i] + 2][x + dx[i] + 2] += 1
else:
return [[x, y, dd.index(size) + 1]]
return False
fab = [[0 for i in range(14)] for j in range(14)]
n = int(input())
for i in range(10):
fab[i + 2][2:12] = list(map(int, input().split()))
s = sum(map(sum, fab))
d_all = list(itertools.combinations_with_replacement([5,9,13], n))
d_list = [l for l in d_all if sum(l) == s]
ans = [0 for i in range(n)]
for d in d_list:
# d_tmp = sorted(d)[::-1]
d_tmp = d
ans = drop(fab, 0, d_tmp)
if ans:
for a in ans:
print(*a)
break
| Traceback (most recent call last):
File "/tmp/tmpigo_v1me/tmp6aoikpb_.py", line 32, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s248544598 | p00091 | u024715419 | 1526356855 | Python | Python3 | py | Runtime Error | 6990 | 5688 | 1346 | import itertools
dx = (0, 0, 0, 1,-1, 1, 1,-1,-1,-2, 2, 0, 0)
dy = (0, 1,-1, 0, 0, 1,-1, 1,-1, 0, 0,-2, 2)
dd = (5, 9, 13)
def drop(fab, used, size_list):
for xy in range(100):
y = xy%10
x = xy//10
size = size_list[used]
check = True
for i in range(size):
if fab[y + dy[i] + 2][x + dx[i] + 2] == 0:
check = False
if check:
for i in range(size):
fab[y + dy[i] + 2][x + dx[i] + 2] -= 1
if sum(map(sum, fab)):
result = drop(fab, used + 1, size_list)
if result:
result.append([x, y, dd.index(size) + 1])
return result
for i in range(size):
fab[y + dy[i] + 2][x + dx[i] + 2] += 1
else:
return [[x, y, dd.index(size) + 1]]
return False
fab = [[0 for i in range(14)] for j in range(14)]
n = int(input())
for i in range(10):
fab[i + 2][2:12] = list(map(int, input().split()))
s = sum(map(sum, fab))
d_all = list(itertools.combinations_with_replacement([5,9,13], n))
d_list = [l for l in d_all if sum(l) == s]
ans = [0 for i in range(n)]
for d in d_list:
d_tmp = sorted(d)[::-1]
ans = drop(fab, 0, d_tmp)
if ans:
for a in ans:
print(*a)
break
| Traceback (most recent call last):
File "/tmp/tmpi8ba4g6g/tmpctlvjw4g.py", line 32, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s813126159 | p00091 | u024715419 | 1526357675 | Python | Python3 | py | Runtime Error | 11830 | 5692 | 1368 | import itertools
dx = (0, 0, 0, 1,-1, 1, 1,-1,-1,-2, 2, 0, 0)
dy = (0, 1,-1, 0, 0, 1,-1, 1,-1, 0, 0,-2, 2)
dd = (5, 9, 13)
def drop(fab, used, size_list):
for xy in range(100):
y = xy%10
x = xy//10
size = size_list[used]
check = True
for i in range(size):
if fab[y + dy[i] + 2][x + dx[i] + 2] == 0:
check = False
break
if check:
for i in range(size):
fab[y + dy[i] + 2][x + dx[i] + 2] -= 1
if sum(map(sum, fab)):
result = drop(fab, used + 1, size_list)
if result:
result.append([x, y, dd.index(size) + 1])
return result
for i in range(size):
fab[y + dy[i] + 2][x + dx[i] + 2] += 1
else:
return [[x, y, dd.index(size) + 1]]
return False
fab = [[0 for i in range(14)] for j in range(14)]
n = int(input())
for i in range(10):
fab[i + 2][2:12] = list(map(int, input().split()))
s = sum(map(sum, fab))
d_all = list(itertools.combinations_with_replacement([5,9,13], n))
d_list = [l for l in d_all if sum(l) == s]
ans = [0 for i in range(n)]
for d in d_list:
d_tmp = sorted(d)[::-1]
ans = drop(fab, 0, d_tmp)
if ans:
for a in ans:
print(*a)
break
| Traceback (most recent call last):
File "/tmp/tmp93ttyt95/tmp6waz0gdh.py", line 33, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s083858555 | p00091 | u024715419 | 1526358283 | Python | Python3 | py | Runtime Error | 10730 | 5692 | 1533 | import itertools
dx = (0, 0, 0, 1,-1, 1, 1,-1,-1,-2, 2, 0, 0)
dy = (0, 1,-1, 0, 0, 1,-1, 1,-1, 0, 0,-2, 2)
dd = (5, 9, 13)
def drop(fab, start, used, size_list):
for xy in range(start, 100):
y = xy%10
x = xy//10
size = size_list[used]
check = True
for i in range(size):
if fab[y + dy[i] + 2][x + dx[i] + 2] == 0:
check = False
break
if check:
for i in range(size):
fab[y + dy[i] + 2][x + dx[i] + 2] -= 1
if sum(map(sum, fab)):
if size == size_list[used + 1]:
result = drop(fab, start + 2, used + 1, size_list)
else:
result = drop(fab, 0, used + 1, size_list)
if result:
result.append([x, y, dd.index(size) + 1])
return result
for i in range(size):
fab[y + dy[i] + 2][x + dx[i] + 2] += 1
else:
return [[x, y, dd.index(size) + 1]]
return False
fab = [[0 for i in range(14)] for j in range(14)]
n = int(input())
for i in range(10):
fab[i + 2][2:12] = list(map(int, input().split()))
s = sum(map(sum, fab))
d_all = list(itertools.combinations_with_replacement([5,9,13], n))
d_list = [l for l in d_all if sum(l) == s]
ans = [0 for i in range(n)]
for d in d_list:
d_tmp = sorted(d)[::-1]
ans = drop(fab, 0, 0, d_tmp)
if ans:
for a in ans:
print(*a)
break
| Traceback (most recent call last):
File "/tmp/tmpyf3igt7e/tmp8v9bvsj6.py", line 36, in <module>
n = int(input())
^^^^^^^
EOFError: EOF when reading a line
| |
s490934136 | p00091 | u300645821 | 1377491684 | Python | Python | py | Runtime Error | 0 | 0 | 14 | import unknown | Traceback (most recent call last):
File "/tmp/tmpinq3m6am/tmpymhi645u.py", line 1, in <module>
import unknown
ModuleNotFoundError: No module named 'unknown'
| |
s787061099 | p00091 | u633068244 | 1396353216 | Python | Python | py | Runtime Error | 10 | 4532 | 1534 | import itertools
S,M,L = 5,9,13
ref = {5:1,9:2,13:3}
dx = [0, 0, 1, 0,-1, 1, 1,-1,-1, 2, 0,-2, 0]
dy = [0,-1, 0, 1, 0,-1, 1, 1,-1, 0, 2, 0,-2]
def minus(C,x,y,size):
for i in range(size):
try: C[y+dy[i]][x+dx[i]] -= 1
except: pass
def canMinus(C,x,y,size):
for i in range(size):
try:
if C[y+dy[i]][x+dx[i]] == 0:
return False
except: pass
return True
def canMinusList(C,size):
ls = []
for y in range(10):
for x in range(10):
if canMinus(C,x,y,size):
ls.append([x,y])
return ls
def copy(C):
C_copy = [C[i][:] for i in range(len(C))]
return C_copy
def tryFindAns(Cloth,drop,p,Rslt):
size,num = drop[p][0],drop[p][1]
canList = canMinusList(Cloth,size)
for comb in itertools.combinations(canList,num):
rslt = copy(Rslt)
C = copy(Cloth)
for x,y in comb:
if canMinus(C,x,y,size):
minus(C,x,y,size)
rslt.append([x,y,size])
else:
break
else:
if p+1 == len(drop):
return rslt
else:
return tryFindAns(C,drop,p+1,rslt)
def findAns(Cloth,drop):
for i in range(2,-1,-1):
if drop[i][1] == 0:
drop.pop(i)
p,rslt = 0,[]
return tryFindAns(Cloth,drop,p,rslt)
n = int(raw_input())
Cloth = [map(int, raw_input().split()) for i in range(10)]
sm = sum([sum(Cloth[i]) for i in range(10)])
dropList = []
for s in range(n):
m4 = 13*n-sm-8*s
if m4 < 0: break
if m4%4 == 0:
m = m4/4
if s+m <= n:
dropList.append([[13,n-s-m],[9,m],[5,s]])
for drop in dropList:
ans = findAns(Cloth,drop)
if ans is not None:
break
for a in ans:
print a[0],a[1],ref[a[2]] | File "/tmp/tmpufr1nx1s/tmpvc21s936.py", line 76
print a[0],a[1],ref[a[2]]
^^^^^^^^^^^^^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s296251977 | p00091 | u633068244 | 1396355540 | Python | Python | py | Runtime Error | 39870 | 4536 | 1588 | import itertools
S,M,L = 5,9,13
ref = {5:1,9:2,13:3}
dx = [0, 0, 1, 0,-1, 1, 1,-1,-1, 2, 0,-2, 0]
dy = [0,-1, 0, 1, 0,-1, 1, 1,-1, 0, 2, 0,-2]
def minus(C,x,y,size):
for i in range(size):
try: C[y+dy[i]][x+dx[i]] -= 1
except: pass
def canMinus(C,x,y,size):
for i in range(size):
try:
if C[y+dy[i]][x+dx[i]] == 0:
return False
except: pass
return True
def canMinusList(C,size):
ls = []
for y in range(10):
for x in range(10):
if canMinus(C,x,y,size):
ls.append([x,y])
return ls
def copy(C):
C_copy = [C[i][:] for i in range(len(C))]
return C_copy
def tryFindAns(Cloth,drop,p,Rslt):
size,num = drop[p][0],drop[p][1]
canList = canMinusList(Cloth,size)
for comb in itertools.combinations(canList,num):
rslt = copy(Rslt)
C = copy(Cloth)
for x,y in comb:
if canMinus(C,x,y,size):
minus(C,x,y,size)
rslt.append([x,y,size])
else:
break
else:
if p+1 == len(drop):
return rslt
else:
rslt = tryFindAns(C,drop,p+1,rslt)
if rslt is not None and len(rslt) == n: return rslt
def findAns(Cloth,drop):
for i in range(2,-1,-1):
if drop[i][1] == 0:
drop.pop(i)
p,rslt = 0,[]
return tryFindAns(Cloth,drop,p,rslt)
n = int(raw_input())
Cloth = [map(int, raw_input().split()) for i in range(10)]
sm = sum([sum(Cloth[i]) for i in range(10)])
dropList = []
for s in range(n):
m4 = 13*n-sm-8*s
if m4 < 0: break
if m4%4 == 0:
m = m4/4
if s+m <= n:
dropList.append([[13,n-s-m],[9,m],[5,s]])
for drop in dropList:
ans = findAns(Cloth,drop)
if ans is not None:
break
for a in ans:
print a[0],a[1],ref[a[2]] | File "/tmp/tmpnef4q4f2/tmppj8glxg6.py", line 77
print a[0],a[1],ref[a[2]]
^^^^^^^^^^^^^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s029135914 | p00091 | u633068244 | 1396359517 | Python | Python | py | Runtime Error | 20 | 4540 | 1738 | import itertools
ref = {5:1,9:2,13:3}
dx = [0, 0, 1, 0,-1, 1, 1,-1,-1, 2, 0,-2, 0]
dy = [0,-1, 0, 1, 0,-1, 1, 1,-1, 0, 2, 0,-2]
def isOn(x,y):
return 0<=x<10 and 0<=y<10
def minus(C,x,y,size):
for i in range(size):
C[y+dy[i]][x+dx[i]] -= 1
def plus(C,x,y,size):
for i in range(size):
C[y+dy[i]][x+dx[i]] += 1
def canMinus(C,x,y,size):
return all([isOn(x+dx[i],y+dy[i]) and C[y+dy[i]][x+dx[i]]>0 for i in range(size)])
def findAns(C,drops,k,sp):
if k == len(drops):
return []
for i in range(sp,100):
if C[i/10][i%10] > 0:
break
sp += 1
for drop in drops:
size = drop[0]
for i in range(size):
sx,sy = sp%10+dx[i],sp/10+dy[i]
if isOn(sx,sy) and C[sy][sx] > 0:
if canMinus(C,sx,sy,size):
minus(C,sx,sy,size)
drops[k][1] -= 1
pk=1 if drops[k][1] == 0 else 0
ans = findAns(C,drops,k+pk,sp)
if ans != False:
ans.append([sx,sy,size])
return ans
drops[k][1] += 1
plus(C,sx,sy,size)
return False
n = int(raw_input())
C = [map(int, raw_input().split()) for i in range(10)]
sm = sum([sum(C[i]) for i in range(10)])
dropList = []
for s in range(n):
m4 = 13*n-sm-8*s
if m4 < 0: break
if m4%4 == 0:
m = m4/4
if s+m <= n:
dropList.append([[13,n-s-m],[9,m],[5,s]])
for drops in dropList:
for i in range(2,-1,-1):
if drops[i][1] == 0:
drops.pop(i)
ans = findAns(C,drops,0,0)
if ans != False:
break
for a in ans:
print a[0],a[1],ref[a[2]] | File "/tmp/tmpof9wekwd/tmpgchhlsyn.py", line 63
print a[0],a[1],ref[a[2]]
^^^^^^^^^^^^^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s743985019 | p00091 | u633068244 | 1396359746 | Python | Python | py | Runtime Error | 0 | 0 | 1817 | import itertools
ref = {5:1,9:2,13:3}
dx = [0, 0, 1, 0,-1, 1, 1,-1,-1, 2, 0,-2, 0]
dy = [0,-1, 0, 1, 0,-1, 1, 1,-1, 0, 2, 0,-2]
def isOn(x,y):
return 0<=x<10 and 0<=y<10
def minus(C,x,y,size):
for i in range(size):
C[y+dy[i]][x+dx[i]] -= 1
def plus(C,x,y,size):
for i in range(size):
C[y+dy[i]][x+dx[i]] += 1
def canMinus(C,x,y,size):
return all([isOn(x+dx[i],y+dy[i]) and C[y+dy[i]][x+dx[i]]>0 for i in range(size)])
def findAns(C,drops,k,sp):
if k == len(drops):
return []
for i in range(sp,100):
if C[i/10][i%10] > 0:
break
sp += 1
for drop in drops:
size = drop[0]
if drop[1] != 0:
for i in range(size):
sx,sy = sp%10+dx[i],sp/10+dy[i]
if isOn(sx,sy) and C[sy][sx] > 0:
if canMinus(C,sx,sy,size):
minus(C,sx,sy,size)
drops[k][1] -= 1
pk=1 if drops[k][1] == 0 else 0
ans = findAns(C,drops,k+pk,sp)
if ans != False:
ans.append([sx,sy,size])
return ans
drops[k][1] += 1
plus(C,sx,sy,size)
return False
n = int(raw_input())
C = [map(int, raw_input().split()) for i in range(10)]
sm = sum([sum(C[i]) for i in range(10)])
dropList = []
for s in range(n):
m4 = 13*n-sm-8*s
if m4 < 0: break
if m4%4 == 0:
m = m4/4
if n-s-m >= 0:
dropList.append([[13,n-s-m],[9,m],[5,s]])
for drops in dropList:
for i in range(2,-1,-1):
if drops[i][1] == 0:
drops.pop(i)
ans = findAns(C,drops,0,0)
if ans != False:
break
for a in ans:
print a[0],a[1],ref[a[2]] | File "/tmp/tmpw58z2ugh/tmppjz0a6co.py", line 64
print a[0],a[1],ref[a[2]]
^^^^^^^^^^^^^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s718948555 | p00092 | u912237403 | 1413916266 | Python | Python | py | Runtime Error | 0 | 0 | 362 | import sys
while 1:
n=input()+1
if n==1:break
A=[''*n]+[' '+raw_input() for i in range(1,n)]
M=[[0]*n for i in range(n)]
for i in range(1,n):
for j in range(1,n):
if A[i][j]=='.':
M[i][j]=min(M[i-1][j-1],M[i-1][j],M[i][j-1])+1
print max(map(max,M))
a=min(M[i-1][j-1],M[i-1][j],a)+1
M[i][j]=a
print max(map(max,M)) | File "/tmp/tmp_8nbq7_t/tmpqlc917v_.py", line 12
print max(map(max,M))
^^^^^^^^^^^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s174271707 | p00092 | u912237403 | 1413920035 | Python | Python | py | Runtime Error | 0 | 0 | 300 | import sys
while 1:
n = input() + 1
if n==1: break
N = range(n)
M = [[0] * n for i in N]
y = M[0]
for i in N[1:]:
x = [0] * n
A = ' ' + raw_input()
for j in N[1:]:
if A[j] == '.': x[j] = min(y[j-1], y[j], x[j-1]) + 1
M[i] = x
y = x
print max(map(max, M)) | File "/tmp/tmpeaxjv234/tmp4jbtzrvv.py", line 12
if A[j] == '.': x[j] = min(y[j-1], y[j], x[j-1]) + 1
^
SyntaxError: invalid non-printable character U+3000
| |
s899438134 | p00092 | u540744789 | 1427875464 | Python | Python | py | Runtime Error | 0 | 0 | 857 | while True:
n = input()
if n==0:
break
data=[]
for i in range(n):
data.append(raw_input())
solve=0
for i in range(n):
if i+solve<n:
for j in range(n):
if j+solve<n:
while True:
flag=0
for a in range(solve+1):
for b in range(solve+1):
if data[i+a][j+b]=="*":
flag=1
break
if flag==1:
break
if flag==0:
solve+=1
else:
break
else:
break
else:
break
print solve | File "/tmp/tmpf25vmwni/tmpj_q9g2d7.py", line 30
print solve
^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
| |
s461754021 | p00092 | u540744789 | 1427880187 | Python | Python | py | Runtime Error | 0 | 0 | 1303 | while True:
n = input()
if n==0:
break
data=[]
for i in range(n):
data.append(raw_input())
d=[[1 for i in range(n)]for j in range(n)]
solve=0
for i in range(n):
if i+solve<n:
for j in range(n):
if j+solve<n:
if d[i][j]!=0:
while True:
flag=0
for a in reversed(range(solve+1)):
for b in reversed(range(solve+1)):
if data[i+a][j+b]=="*":
for v in range(a+1):
for w in range(b+1):
d[i+v][j+w]=0
flag=1
break
if flag==1:
break
if flag==0:
solve+=1
if i+solve>=n or j+solve>=n:
break
else:
break
else:
break
else:
break
print solve | File "/tmp/tmpat9ve2t9/tmpzyuo5h78.py", line 37
print solve
^^^^^^^^^^^
SyntaxError: Missing parentheses in call to 'print'. Did you mean print(...)?
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.