buggy_code stringlengths 11 625k | fixed_code stringlengths 17 625k | bug_type stringlengths 2 4.45k | language int64 0 8 | token_count int64 5 200k | change_count int64 0 100 |
|---|---|---|---|---|---|
def recKF(p1,p2,n):
if n != 0:
a = 1/2
b = 3**(1/2)/2
s = Point( p1.x + (p2.x-p1.x)/3, p1.y + (p2.y-p1.y)/3 )
t = Point( p1.x + (p2.x-p1.x)*2/3, p1.y + (p2.y-p1.y)*2/3 )
v = Point( t.x-s.x, t.y-s.y )
rot_v = Point( v.x*a - v.y*b, b*v.x + a*v.y )
u = Point( rot... | def recKF(p1,p2,n):
if n != 0:
a = 1/2
b = 3**(1/2)/2
s = Point( p1.x + (p2.x-p1.x)/3, p1.y + (p2.y-p1.y)/3 )
t = Point( p1.x + (p2.x-p1.x)*2/3, p1.y + (p2.y-p1.y)*2/3 )
v = Point( t.x-s.x, t.y-s.y )
rot_v = Point( v.x*a - v.y*b, b*v.x + a*v.y )
u = Point( rot... | [["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 612], ["+", 0, 656, 0, 1, 0, 652, 3, 4, 0, 22]] | 5 | 319 | 2 |
# -*- coding: utf-8 -*-
"""
コッホ曲線
参考：https://www.mynote-jp.com/entry/2016/04/30/201249
https://atarimae.biz/archives/23930
・回転行列を使うと、向きの変わった座標が出せる。
・そのために行列の計算方法も確認。
→m行n列成分は、「左の行列のm行目」と「右の行列のn列目」の内積
"""
from math import sin, cos, radians
N = int(input())
def dfs(p1x, p1y, p2x, p2y, depth):
if depth == N:
... | # -*- coding: utf-8 -*-
"""
コッホ曲線
参考：https://www.mynote-jp.com/entry/2016/04/30/201249
https://atarimae.biz/archives/23930
・回転行列を使うと、向きの変わった座標が出せる。
・そのために行列の計算方法も確認。
→m行n列成分は、「左の行列のm行目」と「右の行列のn列目」の内積
"""
from math import sin, cos, radians
N = int(input())
def dfs(p1x, p1y, p2x, p2y, depth):
if depth == N:
... | [["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 612], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 21], ["+", 0, 656, 0, 1, 0, 652, 3, 4, 0, 21], ["+", 0, 656, 0, 1, 0, 652, 3, 4, 0, 612]] | 5 | 250 | 4 |
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
SIN60 = 0.86602540378
COS60 = 0.5
class KochCurve(object):
def __init__(self, n, p1=(0.0, 0.0), p2=(100.0, 0.0)):
self.depth = n
self.p1_init = p1
self.p2_init = p2
self.points = [p1]
def koch(self, n=None, p1=None, p2=None):
... | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
SIN60 = 0.86602540378
COS60 = 0.5
class KochCurve(object):
def __init__(self, n, p1=(0.0, 0.0), p2=(100.0, 0.0)):
self.depth = n
self.p1_init = p1
self.p2_init = p2
self.points = [p1]
def koch(self, n=None, p1=None, p2=None):
... | [["-", 0, 1, 0, 662, 12, 657, 31, 657, 17, 33], ["+", 0, 1, 0, 662, 12, 657, 31, 657, 17, 72]] | 5 | 414 | 2 |
import math
T = []
class Vect:
def __init__(self,x,y):
self.x = x
self.y = y
def hoge(p,q):
ax = q.x-p.x
ay = q.y-p.y
bx = ax/5 - ay*math.sqrt(3)/2
by = ax*math.sqrt(3)/2 + ay/2
nb = Vect(p.x+bx,p.y+by)
return nb
def koch(p,q,n):
if n == 0:
T.append(p)
els... | import math
T = []
class Vect:
def __init__(self,x,y):
self.x = x
self.y = y
def hoge(p,q):
ax = q.x-p.x
ay = q.y-p.y
bx = ax/2 - ay*math.sqrt(3)/2
by = ax*math.sqrt(3)/2 + ay/2
nb = Vect(p.x+bx,p.y+by)
return nb
def koch(p,q,n):
if n == 0:
T.append(p)
els... | [["-", 0, 1, 0, 662, 12, 657, 31, 657, 12, 612], ["+", 0, 1, 0, 662, 12, 657, 31, 657, 12, 612]] | 5 | 310 | 2 |
import math
class Point:
def __init__(self, num_x, num_y):
self.x = num_x
self.y = num_y
def kock(n, p1, p2):
if n == 0:
return
s = Point(0, 0)
t = Point(0, 0)
u = Point(0, 0)
s.x = (2 * p1.x + p2.x) / 3.0
s.y = (2 * p1.y + p2.y) / 3.0
t.x = (p1.x + p2.x * 2) ... | import math
class Point:
def __init__(self, num_x, num_y):
self.x = num_x
self.y = num_y
def kock(n, p1, p2):
if n == 0:
return
s = Point(0, 0)
t = Point(0, 0)
u = Point(0, 0)
s.x = (2 * p1.x + p2.x) / 3.0
s.y = (2 * p1.y + p2.y) / 3.0
t.x = (p1.x + p2.x * 2) ... | [["-", 0, 1, 0, 662, 12, 657, 31, 657, 17, 33], ["+", 0, 1, 0, 662, 12, 657, 31, 657, 17, 72]] | 5 | 383 | 2 |
from math import sin
from math import cos
from math import pi
class point():
def __init__(self,_x,_y):
self.x = _x
self.y = _y
def kock (n, p1, p2):
if n == 0:
return
s = point((2. * p1.x + 1. * p2.x) / 3., (2. * p1.y + 1. *p2.y) / 3.)
t = point((1. * p1.x + 2. * p2.x) / 3., (1. *... | from math import sin
from math import cos
from math import pi
class point():
def __init__(self,_x,_y):
self.x = _x
self.y = _y
def kock (n, p1, p2):
if n == 0:
return
s = point((2. * p1.x + 1. * p2.x) / 3., (2. * p1.y + 1. *p2.y) / 3.)
t = point((1. * p1.x + 2. * p2.x) / 3., (1. *... | [["-", 12, 652, 3, 4, 0, 657, 31, 657, 17, 33], ["+", 12, 652, 3, 4, 0, 657, 31, 657, 17, 72]] | 5 | 388 | 2 |
import math
n = int(input())
p1_x = float(0)
p1_y = float(0)
p2_x = float(100)
p2_y = float(0)
def KC(i, n, x1, y1, x2, y2):
v = [0]*5
w = [0]*5
if i < n:
v[0] = x1
w[0] = y1
v[1] = (2*x1+x2)/3.0
w[1] = (2*y1+y2)/3.0
v[2] = (x1+2*x2)/3.0
w[2] = (y1+2*y2)/3... | import math
n = int(input())
p1_x = float(0)
p1_y = float(0)
p2_x = float(100)
p2_y = float(0)
def KC(i, n, x1, y1, x2, y2):
v = [0] * 5
w = [0] * 5
if i < n:
v[0] = x1
w[0] = y1
v[1] = (2 * x1 + x2) / 3.0
w[1] = (2 * y1 + y2) / 3.0
v[2] = (x1 + 2 * x2) / 3.0
... | [["-", 64, 196, 0, 1, 0, 662, 31, 206, 206, 612], ["+", 64, 196, 0, 1, 0, 662, 31, 206, 206, 612]] | 5 | 433 | 4 |
import math
n=eval(input())
m=math.radians(60)
def kock(n, p1x, p1y, p2x, p2y):
if(n == 0):
return
sx=(2*p1x+1*p2x)/3
sy=(2*p1y+1*p2y)/3
tx=(1*p1x+2*p2x)/3
ty=(1*p1y+2*p2y)/3
ux=(tx-sx)*math.cos(m)-(ty-sy)*math.sin(m)+sx
uy=(tx-sx)*math.sin(m)-(ty-sy)*math.cos(m)+sy
... | import math
n=eval(input())
m=math.radians(60)
def kock(n, p1x, p1y, p2x, p2y):
if(n == 0):
return
sx=(2*p1x+1*p2x)/3
sy=(2*p1y+1*p2y)/3
tx=(1*p1x+2*p2x)/3
ty=(1*p1y+2*p2y)/3
ux=(tx-sx)*math.cos(m)-(ty-sy)*math.sin(m)+sx
uy=(tx-sx)*math.sin(m)+(ty-sy)*math.cos(m)+sy
k... | [["-", 0, 1, 0, 662, 12, 657, 31, 657, 17, 33], ["+", 0, 1, 0, 662, 12, 657, 31, 657, 17, 72], ["-", 36, 36, 0, 656, 0, 1, 0, 662, 12, 531], ["+", 36, 36, 0, 656, 0, 1, 0, 662, 12, 531]] | 5 | 290 | 10 |
import math
def koch(n, x1, y1, x2, y2):
if n == 0:
return
angle = math.radians(60)
sx = (2*x1 + x2)/3
sy = (2*y1 + y2)/3
tx = (2*x2 + x1)/3
ty = (2*y2 + y1)/3
ux = (tx - sx)*math.cos(angle) - (ty - sy)*math.sin(angle) + sx
uy = (tx - sx)*math.sin(angle) + (ty - sy)*math.c... | import math
def koch(n, x1, y1, x2, y2):
if n == 0:
return
angle = math.radians(60)
sx = (2*x1 + x2)/3
sy = (2*y1 + y2)/3
tx = (2*x2 + x1)/3
ty = (2*y2 + y1)/3
ux = (tx - sx)*math.cos(angle) - (ty - sy)*math.sin(angle) + sx
uy = (tx - sx)*math.sin(angle) + (ty - sy)*mat... | [["-", 36, 36, 0, 656, 0, 1, 0, 652, 63, 22], ["+", 36, 36, 0, 656, 0, 1, 0, 652, 63, 22]] | 5 | 250 | 2 |
import math
n = eval(input())
def koch(n, p1_x, p2_x, p1_y, p2_y):
if n == 0:
return
s_x = (2*p1_x + p2_x) / 3
s_y = (2*p1_y + p2_y) / 3
t_x = (p1_x + 2*p2_x) / 3
t_y = (p1_y + 2*p2_y) / 3
u_x = (t_x - s_x)/2 - (t_y - s_y) * sqrt(3)/2 + s_x
u_y = (t_x - s_x) * sqrt(3)/2 + (t_y - s_y)/2 + s_y
koc... | import math
n = int(input())
def koch(n, p1_x, p2_x, p1_y, p2_y):
if n == 0:
return
s_x = (2*p1_x + p2_x) / 3
s_y = (2*p1_y + p2_y) / 3
t_x = (p1_x + 2*p2_x) / 3
t_y = (p1_y + 2*p2_y) / 3
u_x = (t_x - s_x)/2 - (t_y - s_y) * math.sqrt(3)/2 + s_x
u_y = (t_x - s_x) * math.sqrt(3)/2 + (t_y - s_y)/2 ... | [["-", 0, 656, 0, 1, 0, 662, 12, 652, 63, 22], ["+", 0, 656, 0, 1, 0, 662, 12, 652, 63, 22], ["+", 12, 657, 31, 657, 12, 652, 63, 319, 500, 22], ["+", 12, 657, 31, 657, 12, 652, 63, 319, 0, 131], ["+", 31, 657, 31, 657, 12, 652, 63, 319, 500, 22], ["+", 31, 657, 31, 657, 12, 652, 63, 319, 0, 131]] | 5 | 232 | 6 |
import math
class KochCurve:
def koch(self, d, p1, p2):
if d == 0:
return
th = math.pi * 60.0 / 180
sx = (2.0 * p1[0] + 1.0 * p2[0]) / 3
sy = (2.0 * p1[1] + 1.0 * p1[1]) / 3
s = (sx, sy)
tx = (1.0 * p1[0] + 2.0 * p2[0]) / 3
ty = (1.0 * p1[1] + 2.... | import math
class KochCurve:
def koch(self, d, p1, p2):
if d == 0:
return
th = math.pi * 60.0 / 180.0
sx = (2.0 * p1[0] + 1.0 * p2[0]) / 3
sy = (2.0 * p1[1] + 1.0 * p2[1]) / 3
s = (sx, sy)
tx = (1.0 * p1[0] + 2.0 * p2[0]) / 3
ty = (1.0 * p1[1] + ... | [["-", 8, 196, 0, 1, 0, 662, 12, 657, 12, 612], ["+", 8, 196, 0, 1, 0, 662, 12, 657, 12, 531], ["-", 31, 23, 0, 657, 12, 657, 12, 206, 51, 22], ["+", 31, 23, 0, 657, 12, 657, 12, 206, 51, 22]] | 5 | 360 | 24 |
import math
def kochCurve(p1, p2, n):
if n == 0:
print("%5f %5f" % (p2[0], p2[1]))
return
s = ((p2[0] - p1[0]) / 3.0 + p1[0], (p2[1] - p1[1]) / 3.0 + p2[1])
t = ((p2[0] - p1[0]) * 2.0 / 3 + p1[0], (p2[1] - p1[1]) * 2.0 / 3 + p1[1])
u = (math.cos(math.pi/3)*(t[0]-s[0])-math.sin(math.pi/... | import math
def kochCurve(p1, p2, n):
if n == 0:
print("%5f %5f" % (p2[0], p2[1]))
return
s = ((p2[0] - p1[0]) / 3.0 + p1[0], (p2[1] - p1[1]) / 3.0 + p1[1])
t = ((p2[0] - p1[0]) * 2.0 / 3 + p1[0], (p2[1] - p1[1]) * 2.0 / 3 + p1[1])
u = (math.cos(math.pi/3)*(t[0]-s[0])-math.sin(math.pi/... | [["-", 0, 662, 12, 660, 0, 657, 12, 206, 51, 22], ["+", 0, 662, 12, 660, 0, 657, 12, 206, 51, 22]] | 5 | 325 | 2 |
# -*- coding: utf-8 -*-
import math
class KochCurve(object):
x = 0.0
y = 0.0
# ?§£???
def koch(self, n, a, b):
if n == 0:
return
s = KochCurve()
t = KochCurve()
u = KochCurve()
th = math.pi * 60.0 / 180.0
s.x = (2.0 * a.x + 1.0 * b.x) / 3.0
s.y = (2.0 * a.y + 1.0 * b.y) / 3.0
t.x = (1.0 * a.... | # -*- coding: utf-8 -*-
import math
class KochCurve(object):
x = 0.0
y = 0.0
# ?§£???
def koch(self, n, a, b):
if n == 0:
return
s = KochCurve()
t = KochCurve()
u = KochCurve()
th = math.pi * 60.0 / 180.0
s.x = (2.0 * a.x + 1.0 * b.x) / 3.0
s.y = (2.0 * a.y + 1.0 * b.y) / 3.0
t.x = (1.0 * a.... | [["-", 0, 1, 0, 662, 12, 657, 31, 657, 17, 33], ["+", 0, 1, 0, 662, 12, 657, 31, 657, 17, 72]] | 5 | 424 | 2 |
import math
def koch(m, p1, p2):
if m == 0:
return
s = [(2 * p1[0] + p2[0]) / 3, (2 * p1[1] + p2[1]) / 3]
t = [(p1[0] + 2 * p2[0]) / 3, (p1[1] + 2 * p2[1]) / 3]
u = [(t[0] - s[0]) * math.cos(math.pi / 3) - (t[1] - s[1]) * math.sin(math.pi / 3) + s[0],
(t[0] - s[0]) * math.sin(math.pi... | import math
def koch(m, p1, p2):
if m == 0:
return
s = [(2 * p1[0] + p2[0]) / 3, (2 * p1[1] + p2[1]) / 3]
t = [(p1[0] + 2 * p2[0]) / 3, (p1[1] + 2 * p2[1]) / 3]
u = [(t[0] - s[0]) * math.cos(math.pi / 3) - (t[1] - s[1]) * math.sin(math.pi / 3) + s[0],
(t[0] - s[0]) * math.sin(math.pi... | [["-", 0, 662, 12, 634, 0, 657, 31, 657, 17, 33], ["+", 0, 662, 12, 634, 0, 657, 31, 657, 17, 72]] | 5 | 305 | 2 |
import math
n = int(input())
def three(p1x, p1y, p2x, p2y):
dx = (p2x - p1x)
dy = (p2y - p1y)
sx = dx / 3 + p1x
sy = dy / 3 + p1y
tx = p2x - (dx / 3)
ty = p2y - (dy / 3)
mtx = tx - sx
mty = ty - sy
rad = math.radians(60)
mux = mtx * math.cos(rad) - (mty * math.sin(rad))
mu... | import math
n = int(input())
def three(p1x, p1y, p2x, p2y):
dx = (p2x - p1x)
dy = (p2y - p1y)
sx = dx / 3 + p1x
sy = dy / 3 + p1y
tx = p2x - (dx / 3)
ty = p2y - (dy / 3)
mtx = tx - sx
mty = ty - sy
rad = math.radians(60)
mux = mtx * math.cos(rad) - (mty * math.sin(rad))
mu... | [["-", 0, 652, 3, 4, 0, 652, 3, 4, 0, 531], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 531]] | 5 | 292 | 2 |
from math import sin, cos, pi
def koch(px, py, qx, qy, n):
if n == 0:
return True
sx = (2 * px + qx) / 3
sy = (2 * py + qy) / 3
tx = (px + 2 * qx) / 3
ty = (py + 2 * qy) / 3
ux = sx + (tx - sx) * cos(pi / 3) - (ty - sy) * sin(pi / 3)
uy = sy + (tx - sx) * sin(pi / 3) - (ty - sy) * co... | from math import sin, cos, pi
def koch(px, py, qx, qy, n):
if n == 0:
return True
sx = (2 * px + qx) / 3
sy = (2 * py + qy) / 3
tx = (px + 2 * qx) / 3
ty = (py + 2 * qy) / 3
ux = sx + (tx - sx) * cos(pi / 3) - (ty - sy) * sin(pi / 3)
uy = sy + (tx - sx) * sin(pi / 3) + (ty - sy) * co... | [["-", 8, 196, 0, 1, 0, 662, 12, 657, 17, 33], ["+", 8, 196, 0, 1, 0, 662, 12, 657, 17, 72]] | 5 | 272 | 2 |
from math import radians, cos, sin
def calc_koch(depth, p1, p2):
if depth == 0:
return
s = ((2 * p1[0] + 1 * p2[0]) / 3.0, (2 * p1[1] + 1 * p2[1]) / 3.0)
t = ((1 * p1[0] + 2 * p2[0]) / 3.0, (1 * p1[1] + 2 * p2[1]) / 3.0)
ux = (t[0]-s[0]) * cos(radians(60)) - (t[1] - s[1]) * sin(radians(60)) +... | from math import radians, cos, sin
def calc_koch(depth, p1, p2):
if depth == 0:
return
s = ((2 * p1[0] + 1 * p2[0]) / 3.0, (2 * p1[1] + 1 * p2[1]) / 3.0)
t = ((1 * p1[0] + 2 * p2[0]) / 3.0, (1 * p1[1] + 2 * p2[1]) / 3.0)
ux = (t[0] - s[0]) * cos(radians(60)) - (t[1] - s[1]) * sin(radians(60))... | [["-", 0, 1, 0, 662, 12, 657, 31, 657, 17, 33], ["+", 0, 1, 0, 662, 12, 657, 31, 657, 17, 72]] | 5 | 342 | 2 |
import math as mt
def kock(n, p1, p2):
if n == 0:
return
s =[(2 * p1[0] + p2[0]) / 3 , (2 * p1[1] + p2[1]) / 3]
t = [(p1[0] + 2 * p2[0]) / 3, (p1[1] + 2 * p2[1]) / 3]
u = [(t[0]-s[0])*mt.cos(mt.radians(60))
-(t[1]-s[1])*mt.sin(mt.radians(60)) + s[0],
(t[0]-s[0])*mt.sin(mt.radia... | import math as mt
def kock(n, p1, p2):
if n == 0:
return
s =[(2 * p1[0] + p2[0]) / 3 , (2 * p1[1] + p2[1]) / 3]
t = [(p1[0] + 2 * p2[0]) / 3, (p1[1] + 2 * p2[1]) / 3]
u = [(t[0]-s[0])*mt.cos(mt.radians(60))
-(t[1]-s[1])*mt.sin(mt.radians(60)) + s[0],
(t[0]-s[0])*mt.sin(mt.radia... | [["-", 3, 4, 0, 652, 3, 4, 0, 206, 206, 612], ["+", 3, 4, 0, 652, 3, 4, 0, 206, 206, 612]] | 5 | 371 | 12 |
import math
def kock(n,p1x,p1y,p2x,p2y):
if n==0:
pass
else:
sx=(2*p1x+p2x)/3
sy=(2*p1y+p2y)/3
tx=(p1x+2*p2x)/3
ty=(p1y+2*p2y)/3
ux=(tx-sx)*math.cos(math.pi*1/3)-(ty-sy)*math.sin(math.pi*1/3)+sx
uy=(tx-sx)*math.sin(math.pi*1/3)+(ty-sy)*math.cos(math.pi... |
import math
def kock(n,p1x,p1y,p2x,p2y):
if n==0:
pass
else:
sx=(2*p1x+p2x)/3
sy=(2*p1y+p2y)/3
tx=(p1x+2*p2x)/3
ty=(p1y+2*p2y)/3
ux=(tx-sx)*math.cos(math.pi*1/3)-(ty-sy)*math.sin(math.pi*1/3)+sx
uy=(tx-sx)*math.sin(math.pi*1/3)+(ty-sy)*math.cos(math.pi... | [["-", 75, 76, 8, 196, 0, 1, 0, 652, 63, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 21], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 25]] | 5 | 272 | 6 |
import math
angle = math.pi / 3 # 60度
def koch(p1, p2, n):
if n == 0:
return
s = ((p1[0] * 2 + p2[0]) / 3, (p1[1] * 2 + p2[1]) / 3)
t = ((p1[0] + p2[0] * 2) / 3, (p1[1] + p2[1] * 2) / 3)
u = ((t[0] - s[0]) * math.cos(angle) - (t[1] - s[1]) * math.sin(angle) + s[0], \
(t[0] - s[0]) * mat... | import math
angle = math.pi / 3 # 60度
def koch(p1, p2, n):
if n == 0:
return
s = ((p1[0] * 2 + p2[0]) / 3, (p1[1] * 2 + p2[1]) / 3)
t = ((p1[0] + p2[0] * 2) / 3, (p1[1] + p2[1] * 2) / 3)
u = ((t[0] - s[0]) * math.cos(angle) - (t[1] - s[1]) * math.sin(angle) + s[0], \
(t[0] - s[0]) * ma... | [["-", 0, 662, 12, 660, 0, 657, 31, 657, 17, 33], ["+", 0, 662, 12, 660, 0, 657, 31, 657, 17, 72]] | 5 | 333 | 2 |
import math
from matplotlib import pyplot
class Dot:
x=0.0
y=0.0
def __init__(self,x,y):
self.x=x
self.y=y
def __lt__(self,other):
return self.x < other.x
def print(self):
x=self.x
y=self.y
print("{:.8f} {:.8f}".format(x,y))
def kock(n,a,b,dots)... | import math
class Dot:
x=0.0
y=0.0
def __init__(self,x,y):
self.x=x
self.y=y
def __lt__(self,other):
return self.x < other.x
def print(self):
x=self.x
y=self.y
print("{:.8f} {:.8f}".format(x,y))
def kock(n,a,b,dots):
if n == 0:
retur... | [["-", 36, 36, 36, 36, 0, 656, 0, 686, 0, 314], ["-", 36, 36, 0, 656, 0, 686, 687, 673, 0, 22], ["-", 36, 36, 36, 36, 0, 656, 0, 686, 0, 487], ["-", 36, 36, 0, 656, 0, 686, 141, 673, 0, 22]] | 5 | 404 | 4 |
import math
def pr8(a):
print("{:.10}".format(a[0]),end=" ")
print("{:.10}".format(a[1]))
def koch(n,p1,p2):
if n==0:
return
s=[0 for i in range(2)]
t=[0 for i in range(2)]
u=[0 for i in range(2)]
s[0]=(2*p1[0]+1*p2[0])/3
s[1]=(2*p1[1]+1*p2[1])/3
t[0]=(1*p1[0]+2*p2[0])/3
t[1]=(1*p1[1]+2*p2[1])/3
rad=... | import math
def pr8(a):
print("{:.10}".format(a[0]),end=" ")
print("{:.10}".format(a[1]))
def koch(n,p1,p2):
if n==0:
return
s=[0 for i in range(2)]
t=[0 for i in range(2)]
u=[0 for i in range(2)]
s[0]=(2*p1[0]+1*p2[0])/3
s[1]=(2*p1[1]+1*p2[1])/3
t[0]=(1*p1[0]+2*p2[0])/3
t[1]=(1*p1[1]+2*p2[1])/3
rad=... | [["-", 0, 1, 0, 652, 3, 4, 0, 661, 0, 22], ["+", 0, 1, 0, 652, 3, 4, 0, 661, 0, 22]] | 5 | 382 | 4 |
import math
def f(n, p1, p2):
if n == 0: return
s = []
t = []
u = []
s.append((2*p1[0] + p2[0])/3)
s.append((2*p1[1] + p2[1])/3)
t.append((p1[0] + 2*p2[0])/3)
t.append((p1[1] + 2*p2[1])/3)
u.append((t[0]-s[0])*math.cos(math.radians(60))
- (t[1]-s[1])*math.sin(math.radian... | import math
def f(n, p1, p2):
if n == 0: return
s = []
t = []
u = []
s.append((2*p1[0] + p2[0])/3)
s.append((2*p1[1] + p2[1])/3)
t.append((p1[0] + 2*p2[0])/3)
t.append((p1[1] + 2*p2[1])/3)
u.append((t[0]-s[0])*math.cos(math.radians(60))
- (t[1]-s[1])*math.sin(math.radian... | [["-", 0, 652, 3, 4, 0, 657, 31, 657, 17, 33], ["+", 0, 652, 3, 4, 0, 657, 31, 657, 17, 72]] | 5 | 354 | 2 |
import math, cmath
def koch(p1, p2, n):
if n == 0:
return [p1, p2]
rad60 = math.pi/3
v1 = (p2 - p1)/3
v2 = cmath.rect(abs(v1), cmath.phase(v1)+rad60)
q1 = p1 + v1
q2 = q1 + v2
q3 = q1 + v1
if n == 1:
return [p1,q1,q2,q3,p2]
else:
x1 = koch(p1,q1,n-1)[-1]... | import math, cmath
def koch(p1, p2, n):
if n == 0:
return [p1, p2]
rad60 = math.pi/3
v1 = (p2 - p1)/3
v2 = cmath.rect(abs(v1), cmath.phase(v1)+rad60)
q1 = p1 + v1
q2 = q1 + v2
q3 = q1 + v1
if n == 1:
return [p1,q1,q2,q3,p2]
else:
x1 = koch(p1,q1,n-1)[:-1... | [["+", 0, 1, 0, 662, 12, 206, 206, 663, 0, 102]] | 5 | 212 | 3 |
#include <stdio.h>
#include <stdlib.h>
int n = 0;
void countingSort(int A[], int B[], int k) {
int C[k + 1];
for (int i = 0; i <= k; i++) {
C[i] = 0;
}
for (int j = 0; j < n; j++) {
C[A[j]]++;
}
for (int i = 1; i <= k; i++) {
C[i] = C[i] + C[i - 1];
}
for (int j = n - 1; j >= 0; j--) {
... | #include <stdio.h>
#include <stdlib.h>
int n = 0;
void countingSort(int A[], int B[], int k) {
int C[k + 1];
for (int i = 0; i <= k; i++) {
C[i] = 0;
}
for (int j = 0; j < n; j++) {
C[A[j]]++;
}
for (int i = 1; i <= k; i++) {
C[i] = C[i] + C[i - 1];
}
for (int j = n - 1; j >= 0; j--) {
... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13]] | 0 | 275 | 2 |
#include <stdio.h>
#define N 10000
void CountingSort(int k);
int A[2000001], B[2000001], C[N];
int main() {
int i, k;
scanf("%d", &k);
for (i = 1; i < k + 1; i++)
scanf("%d", &A[i]);
CountingSort(k);
for (i = 1; i < k; i++)
printf("%d ", B[i]);
printf("%d\n", B[i]);
return 0;
}
void Countin... | #include <stdio.h>
#define N 10000
void CountingSort(int k);
int A[2000001], B[2000001], C[N];
int main() {
int i, k;
scanf("%d", &k);
for (i = 1; i < k + 1; i++)
scanf("%d", &A[i]);
CountingSort(k);
for (i = 1; i < k; i++)
printf("%d ", B[i]);
printf("%d\n", B[i]);
return 0;
}
void Countin... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 0 | 250 | 4 |
#include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10000
int main() {
unsigned short *A, *B;
int C[VMAX + 1];
int n, i, j, k;
// input
scanf("%d", &n);
A = malloc(sizeof(short) * n + 1);
B = malloc(sizeof(short) * n + 1);
for (i = 1; i < n; i++)
scanf("%d", &A[i]);
// co... | #include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10000
int main() {
unsigned short *A, *B;
int C[VMAX + 1];
int n, i, j, k;
// input
scanf("%d", &n);
A = malloc(sizeof(short) * n + 1);
B = malloc(sizeof(short) * n + 1);
for (i = 1; i < n + 1; i++)
scanf("%d", &A[i]);
/... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 281 | 2 |
#include <stdio.h>
void Sort(int *, int *, int);
int main() {
int i;
int n;
scanf("%d", &n);
int A[n], B[n];
for (i = 0; i < n; i++) {
scanf(" %d", &A[i]);
}
Sort(A, B, n);
for (i = 1; i < n; i++) {
printf("%d ", B[i]);
}
printf("%d\n", B[i]);
return 0;
}
void Sort(int *A, int *B,... | #include <stdio.h>
void Sort(int *, int *, int);
int main() {
int i;
int n;
scanf("%d", &n);
int A[n], B[n];
for (i = 0; i < n; i++) {
scanf(" %d", &A[i]);
}
Sort(A, B, n);
for (i = 1; i < n; i++) {
printf("%d ", B[i]);
}
printf("%d\n", B[i]);
return 0;
}
void Sort(int *A, int *B,... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["-", 0, 1, 0, 11, 31, 69, 71, 69, 28, 22], ["-", 0, 1, 0, 11, 31, 69, 71, 69, 0, 70], ["-", 0, 1, 0, 11, 31, 69, 71, 69, 0, 73]] | 0 | 321 | 7 |
#include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10000
int main() {
unsigned short *A, *B;
int C[VMAX + 1];
int n, i, j;
scanf("%d", &n);
A = malloc(sizeof(short) * n + 1);
B = malloc(sizeof(short) * n + 1);
for (i = 0; i < n; i++) {
scanf("%d", &A[i + 1]);
}
for (i = 0;... | #include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10000
int main() {
unsigned short *A, *B;
int C[VMAX + 1];
int n, i, j;
scanf("%d", &n);
A = malloc(sizeof(short) * n + 1);
B = malloc(sizeof(short) * n + 1);
for (i = 0; i < n; i++) {
scanf("%d", &A[i + 1]);
}
for (i = 0;... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 0 | 270 | 2 |
#include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10000
int main() {
unsigned short *A, *B;
int C[VMAX + 1];
int n, i, j, p;
scanf("%d", &n);
A = malloc(sizeof(short) * n + 1);
B = malloc(sizeof(short) * n + 1);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i... |
#include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10000
int main() {
unsigned short *A, *B;
int C[VMAX + 1];
int n, i, j, p;
scanf("%d", &n);
A = malloc(sizeof(short) * n + 1);
B = malloc(sizeof(short) * n + 1);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
for (i = 0; ... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 0 | 283 | 4 |
#include <stdio.h>
#include <stdlib.h>
#define c 10001
void CountingSort(int *, int *, int);
int N;
int main() {
int i, k = 0;
int *A, *B;
scanf("%d", &N);
A = (int *)malloc((N + 1) * sizeof(int));
B = (int *)malloc((N + 1) * sizeof(int));
for (i = 1; i <= N; i++) {
scanf("%d", &A[i]);
if (k < A... | #include <stdio.h>
#include <stdlib.h>
#define c 10001
void CountingSort(int *, int *, int);
int N;
int main() {
int i, k = 0;
int *A, *B;
scanf("%d", &N);
A = (int *)malloc((N + 1) * sizeof(int));
B = (int *)malloc((N + 1) * sizeof(int));
for (i = 1; i <= N; i++) {
scanf("%d", &A[i]);
if (k < A... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 345 | 2 |
#include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10000
int main() {
unsigned short *A, *B;
int C[VMAX + 1];
int i, n, j;
scanf("%d", &n);
A = malloc(sizeof(short) * n + 1);
B = malloc(sizeof(short) * n + 1);
for (i = 1; i < n; i++)
scanf("%d", &A[i]);
for (i = 0; i < VMAX... | #include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10000
int main() {
unsigned short *A, *B;
int C[VMAX + 1];
int i, n, j;
scanf("%d", &n);
A = malloc(sizeof(short) * n + 1);
B = malloc(sizeof(short) * n + 1);
for (i = 1; i <= n; i++)
scanf("%d", &A[i]);
for (i = 0; i < VMA... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 260 | 2 |
#include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10000
int main() {
unsigned short *A, *B;
int C[VMAX + 1];
int n, i, j;
scanf("%d", &n);
A = malloc(sizeof(short) * n + 1);
B = malloc(sizeof(short) * n + 1);
for (i = 1; i < n; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i... | #include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10000
int main() {
unsigned short *A, *B;
int C[VMAX + 1];
int n, i, j;
scanf("%d", &n);
A = malloc(sizeof(short) * n + 1);
B = malloc(sizeof(short) * n + 1);
for (i = 1; i < n + 1; i++) {
scanf("%d", &A[i]);
}
for (i = ... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 279 | 6 |
#include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10000
int n, A[MAX], B[MAX], k;
void CountingSort();
int main() {
int i, j;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i + 1]);
if (A[i] < A[i + 1])
k = A[i + 1];
}
CountingSort();
for (i = 1; i < n + ... | #include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10000
int n, A[MAX], B[MAX], k;
void CountingSort();
int main() {
int i, j;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i + 1]);
if (A[i] < A[i + 1])
k = A[i + 1];
}
CountingSort();
for (i = 1; i < n + ... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 297 | 4 |
#include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10000
void countingsort(short *, short *, int);
int main() {
unsigned short *A, *B;
int C[VMAX + 1];
int n, i, j;
scanf("%d", &n);
A = malloc(sizeof(short) * n + 1);
B = malloc(sizeof(short) * n + 1);
for (i = 0; i < n; i++)
sca... | #include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10000
void countingsort(short *, short *, int);
int main() {
unsigned short *A, *B;
int C[VMAX + 1];
int n, i, j;
scanf("%d", &n);
A = malloc(sizeof(short) * n + 1);
B = malloc(sizeof(short) * n + 1);
for (i = 0; i < n; i++)
sca... | [["-", 8, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 8, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 322 | 4 |
#include <stdio.h>
#include <stdlib.h>
#define N 10000
int main() {
int n, i, j, k = 0;
unsigned short *A, *B;
int C[N + 1];
scanf("%d", &n);
A = malloc(sizeof(short) * n + 1);
B = malloc(sizeof(short) * n + 1);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
for (i = 1; i <= n; i++) {
if... | #include <stdio.h>
#include <stdlib.h>
#define N 10000
int main() {
int n, i, j, k = 0;
unsigned short *A, *B;
int C[N + 1];
scanf("%d", &n);
A = malloc(sizeof(short) * n + 1);
B = malloc(sizeof(short) * n + 1);
for (i = 1; i <= n; i++) {
scanf("%d", &A[i]);
}
for (i = 1; i <= n; i++) {
i... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, ... | 0 | 327 | 8 |
#include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10000
int main() {
unsigned short *A, *B;
int C[VMAX + 1];
int n, i, j;
int max = 0;
scanf("%d", &n);
A = malloc(sizeof(short) * n + 1);
B = malloc(sizeof(short) * n + 1);
for (i = 1; i <= n; i++) {
scanf("%d", &A[i]);
}
... | #include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10000
int main() {
unsigned short *A, *B;
int C[VMAX + 1];
int n, i, j;
int max = 0;
scanf("%d", &n);
A = malloc(sizeof(short) * n + 1);
B = malloc(sizeof(short) * n + 1);
for (i = 1; i <= n; i++) {
scanf("%d", &A[i]);
}
... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 271 | 2 |
#include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10000
int main() {
unsigned short *A, *B;
int C[VMAX + 1];
int n, i, j;
scanf("%d", &n);
A = malloc(sizeof(short) * n + 1);
B = malloc(sizeof(short) * n + 1);
/* your code */
for (i = 1; i <= n; i++)
scanf("%d", &A[i]);
f... | #include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10000
int main() {
unsigned short *A, *B;
int C[VMAX + 1];
int n, i, j;
scanf("%d", &n);
A = malloc(sizeof(short) * n + 1);
B = malloc(sizeof(short) * n + 1);
/* your code */
for (i = 1; i <= n; i++)
scanf("%d", &A[i]);
f... | [["-", 8, 9, 0, 7, 10, 11, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 10, 11, 12, 16, 12, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 20], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 47]] | 0 | 265 | 4 |
#include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10000
int n, i, j;
void CountingSort(short A[], short B[], int k) {
int C[VMAX + 1];
for (i = 0; i <= k; i++)
C[i] = 0;
for (j = 0; j < n; j++)
C[A[j]]++;
for (i = 1; i <= k; i++)
C[i] = C[i] + C[i - 1];
for (j = n - 1; ... | #include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10000
int n, i, j;
void CountingSort(short A[], short B[], int k) {
int C[VMAX + 1];
for (i = 0; i <= k; i++)
C[i] = 0;
for (j = 0; j < n; j++)
C[A[j]]++;
for (i = 1; i <= k; i++)
C[i] = C[i] + C[i - 1];
for (j = n - 1; ... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22]] | 0 | 297 | 2 |
#include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10000
void CountingSort(int *, int *, int);
int main() {
unsigned short *A, *B;
int C[VMAX + 1];
int n, i, j;
scanf("%d", &n);
A = malloc(sizeof(short) * n + 1);
B = malloc(sizeof(short) * n + 1);
for (i = 1; i < n + 1; i++) {
... | #include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10000
void CountingSort(int *, int *, int);
int main() {
unsigned short *A, *B;
int C[VMAX + 1];
int n, i, j;
scanf("%d", &n);
A = malloc(sizeof(short) * n + 1);
B = malloc(sizeof(short) * n + 1);
for (i = 1; i < n + 1; i++) {
... | [["-", 8, 9, 0, 57, 15, 23, 0, 11, 17, 32], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 60]] | 0 | 299 | 2 |
#include <stdio.h>
#include <stdlib.h>
#define k 10001
void CountingSort(int *, int *, int);
int main() {
int i, n, *A, *B;
scanf("%d", &n);
A = (int *)malloc(n * sizeof(int));
B = (int *)malloc(n * sizeof(int));
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
CountingSort(A, B, n);
for (i = 0; i < ... | #include <stdio.h>
#include <stdlib.h>
#define k 10001
void CountingSort(int *, int *, int);
int main() {
int i, n, *A, *B;
scanf("%d", &n);
A = (int *)malloc(n * sizeof(int));
B = (int *)malloc(n * sizeof(int));
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
CountingSort(A, B, n);
for (i = 0; i < ... | [["+", 0, 1, 0, 11, 31, 69, 71, 16, 17, 33], ["+", 0, 1, 0, 11, 31, 69, 71, 16, 12, 13]] | 0 | 333 | 2 |
#include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10000
int b[MAX], c[MAX];
void countingsort(int a[], int b[], int k, int n) {
int i, j;
for (i = 0; i <= k; i++) {
c[i] - 0;
}
for (j - 1; j <= n; j++) {
c[a[j]]++;
}
for (i = 1; i <= k; i++) {
c[i] = c[i] + c[i - 1];
}
... | #include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10000
int b[MAX], c[MAX];
void countingsort(int a[], int b[], int k, int n) {
int i, j;
for (i = 0; i <= k; i++) {
c[i] = 0;
}
for (j = 1; j <= n; j++) {
c[a[j]]++;
}
for (i = 1; i <= k; i++) {
c[i] = c[i] + c[i - 1];
}
... | [["-", 0, 7, 8, 9, 0, 1, 0, 16, 17, 33], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["-", 0, 14, 8, 9, 0, 7, 10, 16, 17, 33], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 17, 32]] | 0 | 305 | 6 |
#include <stdio.h>
void CountingSort(int *, int *, int);
int C[10000];
int main() {
int i, n;
scanf("%d", &n);
int A[n], B[n];
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
CountingSort(A, B, n);
for (i = 1; i < n; i++) {
printf("%d ", B[i]);
}
printf("%d\n", B[i]);
return 0;
}
... | #include <stdio.h>
void CountingSort(int *, int *, int);
int C[10000];
int main() {
int i, n;
scanf("%d", &n);
int A[n], B[n];
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
CountingSort(A, B, n);
for (i = 1; i < n; i++) {
printf("%d ", B[i]);
}
printf("%d\n", B[i]);
return 0;
}
... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 0 | 273 | 6 |
#include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10000
int main() {
unsigned short *A, *B;
int C[VMAX + 1];
int n, i, j;
scanf("%d", &n);
A = malloc(sizeof(short) * n + 1);
B = malloc(sizeof(short) * n + 1);
/* your code */
for (i = 0; i <= n; i++)
C[i] = 0;
/* C[i] に i... | #include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10000
int main() {
unsigned short *A, *B;
int C[VMAX + 1];
int n, i, j;
scanf("%d", &n);
A = malloc(sizeof(short) * n + 1);
B = malloc(sizeof(short) * n + 1);
/* your code */
for (i = 0; i <= VMAX; i++)
C[i] = 0;
/* C[i] ... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 0 | 248 | 4 |
#include <stdio.h>
int main() {
int i, j, n;
int C[100000];
scanf("%d", &n);
int A[n + 1], B[n + 1];
for (i = 0; i < n; i++) {
scanf("%d", &A[i + 1]);
}
for (i = 0; i <= 10000; i++) {
C[i] = 0;
}
for (i = 0; i < n; i++) {
C[A[i + 1]]++;
}
for (i = 1; i <= 10000; i++) {
C[i] =... | #include <stdio.h>
int main() {
int i, j, n;
int C[100000];
scanf("%d", &n);
int A[n + 1], B[n + 1];
for (i = 0; i < n; i++) {
scanf("%d", &A[i + 1]);
}
for (i = 0; i <= 10000; i++) {
C[i] = 0;
}
for (i = 0; i < n; i++) {
C[A[i + 1]]++;
}
for (i = 1; i <= 10000; i++) {
C[i] =... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 0, 14, 8, 9, 0, 7, 26, 27, 17, 68], ["+", 0, 14, 8, 9, 0, 7, ... | 0 | 246 | 8 |
#include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10000
int n;
void CountingSort(int *, int *, int);
int main() {
unsigned int *A, *B;
int i, k = 0;
scanf("%d", &n);
A = malloc(sizeof(short) * n + 1);
B = malloc(sizeof(short) * n + 1);
for (i = 0; i < n; i++) {
scanf("%d", &A[... | #include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10000
int n;
void CountingSort(int *, int *, int);
int main() {
unsigned int *A, *B;
int i, k = 0;
scanf("%d", &n);
A = malloc(sizeof(int) * n + 1);
B = malloc(sizeof(int) * n + 1);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);... | [["-", 31, 16, 31, 105, 39, 77, 39, 86, 0, 133], ["+", 0, 16, 31, 16, 31, 105, 39, 77, 39, 40]] | 0 | 337 | 4 |
#include <stdio.h>
#include <string.h>
#define MAX 2000001
#define SCORE 10001
int n, nums;
int counter[SCORE + 1], maxi;
int list[MAX + 1], sortedList[MAX + 1];
void CountingSort() {
memset(counter, 0, sizeof counter);
int i;
for (i = 0; i < n; ++i)
++counter[nums];
for (i = 1; i <= maxi; ++i)
count... | #include <stdio.h>
#include <string.h>
#define MAX 2000001
#define SCORE 10001
int n, nums;
int counter[SCORE + 1], maxi;
int list[MAX + 1], sortedList[MAX + 1];
void CountingSort() {
memset(counter, 0, sizeof counter);
int i;
for (i = 0; i < n; ++i)
++counter[list[i]];
for (i = 1; i <= maxi; ++i)
co... | [["-", 0, 7, 8, 1, 0, 27, 28, 69, 71, 22], ["+", 8, 1, 0, 27, 28, 69, 71, 69, 28, 22], ["+", 8, 1, 0, 27, 28, 69, 71, 69, 0, 70], ["+", 8, 1, 0, 27, 28, 69, 71, 69, 71, 22], ["+", 8, 1, 0, 27, 28, 69, 71, 69, 0, 73]] | 0 | 261 | 5 |
#include <stdio.h>
void func(int *, int *, int);
int n, b[2000001], c[2000001];
int main() {
int k = 0, i, j;
int a[2000001];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i + 1]);
if (k < a[i])
k = a[i];
}
func(a, b, n);
return 0;
}
void func(int *a, int *b, int k) {
int... | #include <stdio.h>
void func(int *, int *, int);
int n, b[2000001], c[2000001];
int main() {
int k = 0, i, j;
int a[2000001];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i + 1]);
if (k < a[i])
k = a[i];
}
func(a, b, k);
return 0;
}
void func(int *a, int *b, int k) {
int... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22]] | 0 | 302 | 2 |
#include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10000
int main() {
unsigned short *A, *B, k = 0;
int C[VMAX + 1];
int n, i, j;
scanf("%d", &n);
A = malloc(sizeof(short) * n + 1);
B = malloc(sizeof(short) * n + 1);
/* your code */
for (i = 0; i <= VMAX; i++)
C[i] = 0;
... | #include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10000
int main() {
unsigned short *A, *B, k = 0;
int C[VMAX + 1];
int n, i, j;
scanf("%d", &n);
A = malloc(sizeof(short) * n + 1);
B = malloc(sizeof(short) * n + 1);
/* your code */
for (i = 0; i <= VMAX; i++)
C[i] = 0;
... | [["-", 0, 27, 28, 69, 71, 69, 71, 16, 17, 72], ["-", 0, 27, 28, 69, 71, 69, 71, 16, 12, 13]] | 0 | 277 | 2 |
#include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10000
int C[VMAX + 1], n;
void CountingSort(short *, short *, int);
int main() {
unsigned short *A, *B;
int i, j, k = 0;
scanf("%d", &n);
A = malloc(sizeof(short) * n + 1);
B = malloc(sizeof(short) * n + 1);
/* your code */
for ... | #include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10000
int C[VMAX + 1], n;
void CountingSort(short *, short *, int);
int main() {
unsigned short *A, *B;
int i, j, k = 0;
scanf("%d", &n);
A = malloc(sizeof(short) * n + 1);
B = malloc(sizeof(short) * n + 1);
/* your code */
for ... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 3, 4, 0, 66, 28, 69, 71, 16, 17, 72], ["-", 3, 4, 0, 66, 28, 69, 71, 16, 12, 13], ["-", 0, 57, 15, 23, 0, 16, 31, 69, 71, 22], ["+", 0, 57, 15, 2... | 0 | 347 | 10 |
#include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10000
int main() {
unsigned short *A, *B;
int C[VMAX + 1];
int n, i, j;
scanf("%d", &n);
A = malloc(sizeof(short) * n + 1);
B = malloc(sizeof(short) * n + 1);
/* your code */
for (i = 0; i <= VMAX; i++) {
C[i] = 0;
}
... | #include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10000
int main() {
unsigned short *A, *B, us = 0;
int C[VMAX + 1];
int n, i, j;
scanf("%d", &n);
A = malloc(sizeof(short) * n + 1);
B = malloc(sizeof(short) * n + 1);
/* your code */
for (i = 0; i <= VMAX; i++) {
C[i] = 0;... | [["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 49, 22], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5,... | 0 | 260 | 13 |
#include <stdio.h>
#include <stdlib.h>
#define k 10001
void CountingSort(int *, int *, int);
main() {
int n, i;
int *A, *B;
scanf("%d", &n);
A = (int *)malloc(sizeof(int) * n);
if (A == NULL)
exit(1);
B = (int *)malloc(sizeof(int) * n);
if (B == NULL)
exit(2);
for (i = 0; i < n; i++) {
scan... | #include <stdio.h>
#include <stdlib.h>
#define k 10001
void CountingSort(int *, int *, int);
main() {
int n, i;
int *A, *B;
scanf("%d", &n);
A = (int *)malloc(sizeof(int) * n);
if (A == NULL)
exit(1);
B = (int *)malloc(sizeof(int) * n);
if (B == NULL)
exit(2);
for (i = 0; i < n; i++) {
scan... | [["+", 0, 27, 28, 69, 71, 69, 71, 16, 17, 33], ["+", 0, 27, 28, 69, 71, 69, 71, 16, 12, 13]] | 0 | 353 | 2 |
// counting sort
#include <stdio.h>
#include <stdlib.h>
int main() {
int *A, *B, C[10001], N;
int i, j;
scanf("%d", &N);
A = malloc(sizeof(int) * N + 1);
B = malloc(sizeof(int) * N + 1);
for (i = 1; i <= N; i++) {
scanf("%d", &A[i]);
}
//////////////////////////////
for (i = 0; i < N; i++) {
... | // counting sort
#include <stdio.h>
#include <stdlib.h>
#define MAX 10000
int main() {
int *A, *B, C[10001], N;
int i, j;
scanf("%d", &N);
A = malloc(sizeof(int) * N + 1);
B = malloc(sizeof(int) * N + 1);
for (i = 1; i <= N; i++) {
scanf("%d", &A[i]);
}
//////////////////////////////
for (i =... | [["+", 36, 36, 36, 36, 0, 30, 0, 58, 0, 148], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 141, 22], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 0 | 266 | 7 |
#include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10001
int main() {
int i, j, n = 0;
unsigned short *A, *B;
int C[VMAX];
scanf("%d", &n);
A = malloc(sizeof(short) * n + 1);
B = malloc(sizeof(short) * n + 1);
for (i = 0; i <= VMAX - 1; i++)
C[i] = 0;
for (i = 1; i <= n; i+... | #include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10001
int main() {
int i, j, n = 0;
unsigned short *A, *B;
int C[VMAX];
scanf("%d", &n);
A = malloc(sizeof(short) * n + 1);
B = malloc(sizeof(short) * n + 1);
for (i = 0; i <= VMAX - 1; i++)
C[i] = 0;
for (i = 1; i <= n; i+... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18]] | 0 | 266 | 2 |
#include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define MAX1 10000
int main() {
unsigned int *A, *B;
int C[MAX1 + 1], n, m, i, j;
scanf("%d", &n);
A = malloc(sizeof(short) * n + 1);
B = malloc(sizeof(short) * n + 1);
for (i = 0; i <= MAX1; i++) {
C[i] = 0;
}
for (i = 0; i < n; i++)... | #include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define MAX1 10000
int main() {
unsigned short *A, *B;
int C[MAX1 + 1], n, m, i, j;
scanf("%d", &n);
A = malloc(sizeof(short) * n + 1);
B = malloc(sizeof(short) * n + 1);
for (i = 0; i <= MAX1; i++) {
C[i] = 0;
}
for (i = 0; i < n; i+... | [["-", 0, 14, 8, 9, 0, 43, 39, 86, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 133]] | 0 | 267 | 2 |
#include <stdio.h>
#include <stdlib.h>
#define V 10000
int main() {
int i, j, n, *A, *B, C[V + 1];
scanf("%d", &n);
A = (int *)malloc(sizeof(int) * n + 1);
B = (int *)malloc(sizeof(int) * n + 1);
for (i = 0; i <= V; i++) {
C[i] = 0;
}
for (i = 0; i <= n; i++) {
scanf("%d", &A[i + 1]);
C[A[... | #include <stdio.h>
#include <stdlib.h>
#define V 10000
int main() {
int i, j, n, *A, *B, C[V + 1];
scanf("%d", &n);
A = (int *)malloc(sizeof(int) * n + 1);
B = (int *)malloc(sizeof(int) * n + 1);
for (i = 0; i <= V; i++) {
C[i] = 0;
}
for (i = 0; i < n; i++) {
scanf("%d", &A[i + 1]);
C[A[i... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18]] | 0 | 274 | 2 |
#include <stdio.h>
#define N 2000000
#define MAX 10000
int A[N], B[N];
int main() {
int C[MAX + 1];
int n, i, j;
/*配列cの初期化*/
for (i = 0; i <= MAX; i++)
C[i] = 0;
/*データの読取*/
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i + 1]);
C[A[i + 1]]++;
}
/* C[i] に i 以下の数の出現数を記録する*/... | #include <stdio.h>
#define N 2000002
#define MAX 10000
int A[N], B[N];
int main() {
int C[MAX + 1];
int n, i, j;
/*配列cの初期化*/
for (i = 0; i <= MAX; i++)
C[i] = 0;
/*データの読取*/
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i + 1]);
C[A[i + 1]]++;
}
/* C[i] に i 以下の数の出現数を記録する*/... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 0 | 228 | 4 |
#include <stdio.h>
#include <stdlib.h>
#define n 2000001
#define s 10000
int main() {
long int *A, *B, C[s], a, i, j;
scanf("%ld", &a);
A = malloc(sizeof(int) * a + 1);
B = malloc(sizeof(int) * a + 1);
for (i = 0; i < s; i++) {
C[i] = 0;
}
for (i = 0; i < a; i++)
scanf("%ld", &A[i]);
for ... | #include <stdio.h>
#include <stdlib.h>
#define n 2000001
#define s 10000
int main() {
int *A, *B, C[s], a, i, j;
scanf("%d", &a);
A = malloc(sizeof(int) * a + 1);
B = malloc(sizeof(int) * a + 1);
for (i = 0; i < s; i++) {
C[i] = 0;
}
for (i = 0; i < a; i++)
scanf("%d", &A[i]);
for (i = 0;... | [["-", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 8, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 8, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 287 | 7 |
#include <stdio.h>
#define N 2000001
// #define N 20000
#define K 20001
/*
How to test
% diff <(./a.out < b1in.txt) <(cat b1out.txt)
for( i=0 ; i < n ; i++){
fprintf(stderr, "%d: C2[%d] = %c%c \n" ,__LINE__ ,i ,C2[i].suit ,C2[i].value
);
}
*/
void csort(int *a_p, int *b_p, const int n) {
int i, j;
int ... | #include <stdio.h>
#define N 2000001
#define K 20001
/*
How to test
% diff <(./a.out < b1in.txt) <(cat b1out.txt)
for( i=0 ; i < n ; i++){
fprintf(stderr, "%d: C2[%d] = %c%c \n" ,__LINE__ ,i ,C2[i].suit ,C2[i].value
);
}
*/
void csort(short *a_p, short *b_p, const int n) {
int i, j;
int c[K] = {0};
... | [["-", 0, 14, 49, 53, 54, 55, 0, 56, 39, 40], ["+", 49, 53, 54, 55, 0, 56, 39, 86, 0, 133], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 133]] | 0 | 274 | 8 |
#include <stdio.h>
int main(void) {
int n, i, A[2000000], C[10000], B[2000000];
for (i = 0; i < 10000; i++)
C[i] = 0;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
for (i = 0; i < n; i++)
C[A[i]]++;
for (i = 1; i < 10000; i++)
C[i] += C[i - 1];
for (i = n - 1; i >= 0; i--) ... | #include <stdio.h>
int main(void) {
static int i, n, A[2000000], C[10000], B[2000000];
for (i = 0; i < 10000; i++)
C[i] = 0;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
for (i = 0; i < n; i++)
C[A[i]]++;
for (i = 1; i < 10000; i++)
C[i] += C[i - 1];
for (i = n - 1; i >= 0... | [["+", 0, 14, 8, 9, 0, 43, 0, 114, 0, 115], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22]] | 0 | 223 | 5 |
#include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VM 10000
int main() {
int *A, *B;
int C[VM + 1];
int n, i, j;
scanf("%d", &n);
A = malloc(sizeof(short) * n + 1);
B = malloc(sizeof(short) * n + 1);
for (i = 0; i <= VM; i++)
C[i] = 0;
for (i = 0; i < n; i++) {
scanf("%d", &... | #include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VM 10000
int main() {
short *A, *B;
int C[VM + 1];
int n, i, j;
scanf("%d", &n);
A = malloc(sizeof(short) * n + 1);
B = malloc(sizeof(short) * n + 1);
for (i = 0; i <= VM; i++)
C[i] = 0;
for (i = 0; i < n; i++) {
scanf("%hu"... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 133], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 257 | 4 |
#include <stdio.h>
void countingSort(int);
int A[2000000], B[2000000], C[10000], n = 0;
int main() {
int i, j, t;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
if (t < A[i])
t = A[i];
}
countingSort(t);
for (i = 1; i <= n - 1; i++) {
printf("%d ", B[i]);
}
pri... | #include <stdio.h>
void countingSort(int);
int A[2000001], B[20000001], C[10001], n = 0;
int main() {
int i, j, t;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
if (t < A[i])
t = A[i];
}
countingSort(t);
for (i = 1; i <= n - 1; i++) {
printf("%d ", B[i]);
}
pr... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 0 | 302 | 10 |
#include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10000
int A[MAX], B[MAX];
int main() {
int n, i, j;
int C[VMAX + 1];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i + 1]);
if (A[i] < 0 || A[i] > VMAX) {
exit(1);
}
}
for (i = 0; i < VMAX + 1; i++) {
... | #include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10000
int A[MAX], B[MAX];
int main() {
int n, i, j;
int C[VMAX + 1];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i + 1]);
if (A[i] < 0 || A[i] > VMAX) {
exit(1);
}
}
for (i = 0; i < VMAX + 1; i++) {
... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 31, 22], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 31, 22], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 31, 22], ["-", 0, 14, 8, 9, 0, 7, 26, 27, 28, 22], ["+", 0, 14, 8, 9, 0, 7, 26, 27, 28, 22], ["-", 0, 1, 0, 27, 28, 69, 71, 69, 71, 22], ["+", 0, 27, 28, 69, 71... | 0 | 274 | 10 |
#include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10000
int A[MAX], B[MAX];
int main() {
int n, i, j;
int C[VMAX + 1];
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d", &A[i]);
if (A[i] < 0 || A[i] > VMAX) {
exit(1);
}
}
for (i = 0; i < VMAX + 1; i++) {
... | #include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10000
int A[MAX], B[MAX];
int main() {
int n, i, j;
int C[VMAX + 1];
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d", &A[i]);
if (A[i] < 0 || A[i] > VMAX) {
exit(1);
}
}
for (i = 0; i < VMAX + 1; i++) {
... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 31, 22], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 31, 22], ["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 31, 22], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 7, ... | 0 | 272 | 12 |
#include <stdio.h>
#include <stdlib.h>
#define MAX_A 2000001
#define MAX_C 10000
int n;
int *A;
int *B;
int C[MAX_C];
void CountingSort() {
int i;
for (i = 0; i < MAX_C; i++) {
C[i] = 0;
}
for (i = 1; i <= n; i++) {
C[A[i]]++;
}
for (i = 1; i <= n; i++) {
C[i] += C[i - 1];
}
for (i = n; i... | #include <stdio.h>
#include <stdlib.h>
#define MAX_A 2000001
#define MAX_C 10000
int n;
int *A;
int *B;
int C[MAX_C];
void CountingSort() {
int i;
for (i = 0; i < MAX_C; i++) {
C[i] = 0;
}
for (i = 1; i <= n; i++) {
C[A[i]]++;
}
for (i = 1; i < MAX_C; i++) {
C[i] += C[i - 1];
}
for (i = n... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 0 | 283 | 4 |
#include <stdio.h>
int A[2000000], B[2000000];
int main() {
int C[10001], i, j, n;
scanf("%d", &n);
for (i = 0; i < 10001; i++)
C[i] = 0;
for (i = 1; i < n + 1; i++) {
scanf("%d", &A[i]);
C[A[i + 1]]++;
}
/*CをC'にする*/
for (i = 1; i < 10001; i++)
C[i] = C[i] + C[i - 1];
for (j = 1; j <... | #include <stdio.h>
int A[2000000], B[2000000];
int main() {
int C[10001], i, j, n;
scanf("%d", &n);
for (i = 0; i < 10001; i++)
C[i] = 0;
for (i = 1; i < n + 1; i++) {
scanf("%d", &A[i]);
C[A[i]]++;
}
/*CをC'にする*/
for (i = 1; i < 10001; i++)
C[i] = C[i] + C[i - 1];
for (j = 1; j <= n;... | [["-", 0, 27, 28, 69, 71, 69, 71, 16, 17, 72], ["-", 0, 27, 28, 69, 71, 69, 71, 16, 12, 13]] | 0 | 216 | 2 |
#include <stdio.h>
#define N 2000001
#define K 10000
int n, A[N], B[N];
void CountingSort(int[], int[], int);
int main() {
int i, k = 0;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d", &A[i]);
}
CountingSort(A, B, K);
for (i = 1; i < n; i++)
printf("%d", B[i]);
printf("%d\n", B[n]);... | #include <stdio.h>
#define N 2000001
#define K 10000
int n, A[N], B[N];
void CountingSort(int[], int[], int);
int main() {
int i, k = 0;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d", &A[i]);
}
CountingSort(A, B, K);
for (i = 1; i < n; i++)
printf("%d ", B[i]);
printf("%d\n", B[n])... | [["-", 8, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 8, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 22], ["+", 8, 9, 0, 43, 49, 80, 81, 16, 31, 22], ["+", 8, 9, 0, 43, 49, 80, 81, 16, 17, 72], ["+", 8, 9, 0, 43, 49, 80, 81, 16, 12, 13]] | 0 | 282 | 6 |
#include <stdio.h>
#define k 20000001
int A[k], B[k], C[k];
int main() {
int i, n;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i + 1]);
C[i] = 0;
}
for (i = 1; i <= n; i++) {
C[A[i]] = C[A[i]] + 1;
}
for (i = 1; i < n; i++) {
C[i] = C[i] + C[i - 1];
}
for (i = n; i > 0... | #include <stdio.h>
#define k 20000001
int A[k], B[k], C[k];
int main() {
int i, n;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i + 1]);
C[i] = 0;
}
for (i = 1; i <= n; i++) {
C[A[i]] = C[A[i]] + 1;
}
for (i = 1; i < k; i++) {
C[i] = C[i] + C[i - 1];
}
for (i = n; i > 0;... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 0 | 238 | 2 |
#include <stdio.h>
#include <stdlib.h>
#define N 2000001
#define Max 10001
int n;
void count(short *, short *, int);
int main() {
unsigned short *A, *B;
int i, k = Max;
scanf("%d", &n);
A = malloc(sizeof(short) * n + 1);
B = malloc(sizeof(short) * n + 1);
for (i = 0; i < n; i++) {
scanf("%hd", &A[i]);... | #include <stdio.h>
#include <stdlib.h>
#define N 2000001
#define Max 10000
int n;
void count(short *, short *, int);
int main() {
unsigned short *A, *B;
int i, k = Max;
scanf("%d", &n);
A = malloc(sizeof(short) * n + 1);
B = malloc(sizeof(short) * n + 1);
for (i = 0; i < n; i++) {
scanf("%hd", &A[i + ... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 3, 4, 0, 66, 28, 69, 71, 16, 17, 72], ["+", 3, 4, 0, 66, 28, 69, 71, 16, 12, 13]] | 0 | 318 | 4 |
#include <stdio.h>
void CountingSort(int *, int *, int);
int n;
int main() {
int *A;
int *B;
int i;
scanf("%d", &n);
A = malloc(sizeof(short) * n + 1);
B = malloc(sizeof(short) * n + 1);
for (i = 1; i <= n; i++)
scanf("%d", &A[i]);
CountingSort(A, B, 10000);
for (i = 1; i < n; i++)
pri... | #include <stdio.h>
void CountingSort(int *, int *, int);
int n;
int main() {
int *A;
int *B;
int i;
scanf("%d", &n);
A = malloc(sizeof(int) * n + 1);
B = malloc(sizeof(int) * n + 1);
for (i = 1; i <= n; i++)
scanf("%d", &A[i]);
CountingSort(A, B, 10000);
for (i = 1; i < n; i++)
printf(... | [["-", 31, 16, 31, 105, 39, 77, 39, 86, 0, 133], ["+", 0, 16, 31, 16, 31, 105, 39, 77, 39, 40]] | 0 | 284 | 4 |
#include <stdio.h>
#define MAXN 2000000
void CountingSort(int *, int *, int);
int n;
int A[MAXN];
int B[MAXN];
int C[10000];
int main() {
int i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
CountingSort(A, B, n);
for (i = 1; i <= n; i++) {
if (i > 1)
printf(" ");
... | #include <stdio.h>
#define MAXN 2000001
void CountingSort(int *, int *, int);
int n;
int A[MAXN];
int B[MAXN];
int C[MAXN];
int main() {
int i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
CountingSort(A, B, 10000);
for (i = 1; i <= n; i++) {
if (i > 1)
printf(" ");
... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0,... | 0 | 280 | 8 |
#include <stdio.h>
#define N 10000
int main() {
int i, n;
unsigned short a[2000001], b[2000001];
int c[N + 1];
scanf("%d", &n);
for (i = 0; i <= 10000; i++)
c[i] = 0;
for (i = 0; i < n; i++) {
scanf("%d", &a[i + 1]);
b[i + 1] = 0;
c[a[i]]++;
}
for (i = 1; i <= N; i++) {
c[i] = c[... | #include <stdio.h>
#define N 10000
int main() {
int i, n;
unsigned short a[2000001], b[2000001];
int c[N + 1];
scanf("%d", &n);
for (i = 0; i <= 10000; i++)
c[i] = 0;
for (i = 0; i < n; i++) {
scanf("%d", &a[i + 1]);
b[i + 1] = 0;
c[a[i + 1]]++;
}
for (i = 1; i <= N; i++) {
c[i] ... | [["+", 0, 27, 28, 69, 71, 69, 71, 16, 17, 72], ["+", 0, 27, 28, 69, 71, 69, 71, 16, 12, 13]] | 0 | 236 | 2 |
#include <stdio.h>
#define K 10000
void countingSort(int a[], int b[], int k, int n) {
int c[k + 1];
int i;
for (i = 0; i <= k; i++)
c[i] = 0;
for (i = 1; i <= n; i++)
c[a[i]]++;
for (i = 1; i <= k; i++)
c[i] = c[i] + c[i - 1];
for (i = n; i >= 1; i--) {
b[c[a[i]]] = a[i];
c[a[i]]--;... | #include <stdio.h>
#define K 10000
void countingSort(int a[], int b[], int k, int n) {
int c[k + 1];
int i;
for (i = 0; i <= k; i++)
c[i] = 0;
for (i = 1; i <= n; i++)
c[a[i]]++;
for (i = 1; i <= k; i++)
c[i] = c[i] + c[i - 1];
for (i = n; i >= 1; i--) {
b[c[a[i]]] = a[i];
c[a[i]]--;... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 292 | 4 |
#include <stdio.h>
#include <stdlib.h>
#define VMAX 100000
#define MAX 200000001
int main() {
unsigned short *A, *B;
int C[VMAX + 1] = {0};
int n, i, j;
scanf("%d", &n);
A = malloc(sizeof(short) * n + 1);
B = malloc(sizeof(short) * n + 1);
for (i = 0; i <= VMAX; i++)
C[i] = 0;
for (i = 1; i <= n;... | #include <stdio.h>
#include <stdlib.h>
#define VMAX 100000
#define MAX 200000001
int main() {
unsigned short *A, *B;
int C[VMAX + 1] = {0};
int n, i, j;
scanf("%d", &n);
A = malloc(sizeof(short) * n + 1);
B = malloc(sizeof(short) * n + 1);
for (i = 0; i <= VMAX; i++)
C[i] = 0;
for (i = 1; i <= n;... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 31, 22], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 31, 22], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 31, 22], ["-", 0, 14, 8, 9, 0, 7, 26, 27, 28, 22], ["+", 0, 14, 8, 9, 0, 7, 26, 27, 28, 22], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 2... | 0 | 256 | 8 |
#include <stdio.h>
#define X 10000
void countingSort(int A[], int B[], int n) {
int i;
int C[X + 1];
for (i = 0; i <= X; i++) {
C[i] = 0;
}
for (i = 0; i < n; i++) {
C[A[i]]++;
}
for (i = 1; i <= X; i++) {
C[i] += C[i - 1];
}
for (i = n - 1; i >= 0; i--) {
B[C[A[i]]] = A[i];
C... | #include <stdio.h>
#define X 10000
void countingSort(int A[], int B[], int n) {
int i;
int C[X + 1];
for (i = 0; i <= X; i++) {
C[i] = 0;
}
for (i = 0; i < n; i++) {
C[A[i]]++;
}
for (i = 1; i <= X; i++) {
C[i] += C[i - 1];
}
for (i = n - 1; i >= 0; i--) {
B[C[A[i]] - 1] = A[i];
... | [["+", 0, 1, 0, 11, 31, 69, 71, 16, 17, 33], ["+", 0, 1, 0, 11, 31, 69, 71, 16, 12, 13]] | 0 | 270 | 2 |
#include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10000
int main() {
unsigned short *A, *B;
int C[VMAX + 1];
int n, i, j;
scanf("%d", &n);
A = malloc(sizeof(short) * n + 1);
B = malloc(sizeof(short) * n + 1);
for (i = 1; i <= n; i++) {
scanf("%hd", &A[i]);
}
for (i = 0; ... | #include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10000
int main() {
unsigned short *A, *B;
int C[VMAX + 1];
int n, i, j;
scanf("%d", &n);
A = malloc(sizeof(short) * n + 1);
B = malloc(sizeof(short) * n + 1);
for (i = 1; i <= n; i++) {
scanf("%hd", &A[i]);
}
for (i = 0; ... | [["-", 0, 57, 15, 23, 0, 16, 12, 69, 28, 22], ["-", 0, 57, 15, 23, 0, 16, 12, 69, 0, 70], ["-", 0, 57, 15, 23, 0, 16, 12, 69, 71, 22], ["-", 0, 57, 15, 23, 0, 16, 12, 69, 0, 73], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 12, 22]] | 0 | 308 | 5 |
#include <stdio.h>
#include <stdlib.h>
#define MAX 2000000
#define VMAX 10000
int C[VMAX], B[MAX];
void CountingSort(int A[], int n) {
int i, j;
for (i = 1; i <= VMAX; i++) {
C[i] = 0;
}
for (j = 1; j <= n; j++) {
C[A[j]]++;
}
for (i = 1; i <= VMAX; i++) {
C[i] = C[i] + C[i - 1];
}
for (... | #include <stdio.h>
#include <stdlib.h>
#define MAX 2000001
#define VMAX 10001
int C[VMAX], B[MAX];
void CountingSort(int A[], int n) {
int i, j;
for (i = 1; i <= VMAX; i++) {
C[i] = 0;
}
for (j = 1; j <= n; j++) {
C[A[j]]++;
}
for (i = 1; i <= VMAX; i++) {
C[i] = C[i] + C[i - 1];
}
for (... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 2, 3, 4, 0, 69, 71, 16, 17, 33], ["-", 0, 2, 3, 4, 0, 69, 71, 16, 12, 13]] | 0 | 274 | 10 |
#include <stdio.h>
#define ABSIZE 2000000
#define CSIZE 10000
int A[ABSIZE], B[ABSIZE], C[CSIZE];
void Counting_Sort(int n) {
int i, j;
for (i = 0; i < CSIZE; i++) {
C[i] = 0;
}
for (j = 0; j < n; j++) {
C[A[j]] = C[A[j]] + 1;
}
/* C[i]??????i???????????属????即???????????????????*/
for (i = 1; i... | #include <stdio.h>
#define ABSIZE 2000000
#define CSIZE 10000
int A[ABSIZE], B[ABSIZE], C[CSIZE];
void Counting_Sort(int n) {
int i, j;
for (i = 0; i < CSIZE; i++) {
C[i] = 0;
}
for (j = 0; j < n; j++) {
C[A[j]] = C[A[j]] + 1;
}
/* C[i]??????i???????????属????即???????????????????*/
for (i = 1; i ... | [["+", 0, 1, 0, 11, 31, 69, 71, 16, 17, 33], ["+", 0, 1, 0, 11, 31, 69, 71, 16, 12, 13]] | 0 | 278 | 2 |
#include <stdio.h>
#define N 2000000
int arr[N];
int n;
void count(int A[], int k) {
int ca[k], i, j;
i = k;
for (; i > 0; i--)
ca[i] = 0;
for (j = 1; j <= n; j++)
ca[A[j]]++;
for (i = 1; i < k; i++)
ca[i] += ca[i - 1];
for (j = n; j >= 1; j--) {
arr[ca[A[j]]] = A[j];
ca[A[j]]--;
}
... | #include <stdio.h>
#define N 2000000
int arr[N];
int n;
void count(int A[], int k) {
int ca[k], i, j;
i = k;
for (; i >= 0; i--)
ca[i] = 0;
for (j = 1; j <= n; j++)
ca[A[j]]++;
for (i = 1; i < k; i++)
ca[i] += ca[i - 1];
for (j = n; j >= 1; j--) {
arr[ca[A[j]]] = A[j];
ca[A[j]]--;
}... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 47], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 20]] | 0 | 300 | 2 |
#include <stdio.h>
#define N 10000
void CountingSort(int);
int n, A[N], B[N];
int main(void) {
int i, k = 0;
scanf("%d", &n);
for (i = 1; i < n; i++) {
scanf("%d", &A[i]);
if (A[i] > k)
k = A[i];
}
CountingSort(k);
for (i = 1; i <= n; i++) {
printf("%d", B[i]);
if (i < n)
print... | #include <stdio.h>
#define N 2000001
void CountingSort(int);
int n, A[N], B[N];
int main(void) {
int i, k = 0;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d", &A[i]);
if (A[i] > k)
k = A[i];
}
CountingSort(k);
for (i = 1; i <= n; i++) {
printf("%d", B[i]);
if (i < n)
pr... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 277 | 4 |
n = int(input())
A = list(map(int, input().split()))
q = int(input())
m = list(map(int, input().split()))
def solve(i, m):
if m == 0:
return 1
if i > n or m > sum(A):
return 0
res = solve(i + 1, m) or solve(i + 1, m - A[i])
return res
for j in range(0, q):
if solve(0, m[j... | n = int(input())
A = list(map(int, input().split()))
q = int(input())
m = list(map(int, input().split()))
def solve(i, m):
if m == 0:
return 1
if i >= n or m > sum(A):
return 0
res = solve(i + 1, m) or solve(i + 1, m - A[i])
return res
for j in range(0, q):
if solve(0, m... | [["-", 8, 196, 0, 57, 15, 679, 31, 666, 667, 47], ["+", 8, 196, 0, 57, 15, 679, 31, 666, 667, 20]] | 5 | 140 | 2 |
n = eval(input())
A = list(map(int, input().split()))
q = eval(input())
m = list(map(int, input().split()))
def solve(i, m):
if m == 0:
return True
if i >= n and m > sum(A):
return False
res = solve(i + 1, m) or solve(i + 1, m - A[i])
return res
for j in range(0, q-1):
if solve(0, m[j]):
print("yes")
else... | n = eval(input())
A = list(map(int, input().split()))
q = eval(input())
m = list(map(int, input().split()))
def solve(i, m):
if m == 0:
return True
if i >= n or m > sum(A):
return False
res = solve(i+1, m) or solve(i+1, m-A[i])
return res
for j in range(0, q):
if solve(0, m[j]):
print('yes')
else:
print... | [["-", 0, 14, 8, 196, 0, 57, 15, 679, 17, 355], ["+", 0, 14, 8, 196, 0, 57, 15, 679, 17, 354], ["-", 0, 7, 12, 652, 3, 4, 0, 657, 17, 33], ["-", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612], ["-", 0, 1, 0, 652, 3, 4, 0, 557, 0, 654], ["+", 0, 1, 0, 652, 3, 4, 0, 557, 0, 654], ["-", 0, 1, 0, 652, 3, 4, 0, 557, 0, 655], ["+", 0... | 5 | 142 | 12 |
n = int(input())
A = list(map(int, input().strip().split(' ')))
q = int(input())
M = list(map(int, input().strip().split(' ')))
def ans(i, m):
if m == 0:
return 1
if i >= n or m > sum(A):
return 0
res = ans(i + 1, m) or ans(i + 1, m - A[i])
return res
for j in range(0, q):
... | n = int(input())
A = list(map(int, input().strip().split(' ')))
q = int(input())
M = list(map(int, input().strip().split(' ')))
def ans(i, m):
if m == 0:
return 1
if i >= n or m > sum(A):
return 0
res = ans(i + 1, m) or ans(i + 1, m - A[i])
return res
for j in range(0, q):
... | [["-", 0, 57, 15, 652, 3, 4, 0, 206, 51, 22], ["+", 0, 57, 15, 652, 3, 4, 0, 206, 51, 22]] | 5 | 154 | 2 |
def solve(i, j):
if i == 0:
return True
if j < n and A[0] <= i <= sum(A[j:]):
x = solve(i-A[j], j+1)
if x:
return x
y = solve(i, j+1)
if y:
return y
n = eval(input())
A = list(map(int, input().split()))
p = eval(input())
m = list(map(int, input().split()))... | def solve(i, j):
if i == 0:
return True
if j < n and A[0] <= i <= sum(A[j:]):
x = solve(i-A[j], j+1)
if x:
return x
y = solve(i, j+1)
if y:
return y
n = eval(input())
A = sorted(map(int, input().split()))
p = eval(input())
m = list(map(int, input().split()... | [["-", 0, 656, 0, 1, 0, 662, 12, 652, 63, 22], ["+", 0, 656, 0, 1, 0, 662, 12, 652, 63, 22]] | 5 | 148 | 2 |
n = eval(input())
A = list(map(int, input().split()))
q = eval(input())
M = list(map(int, input().split()))
min = min(A)
sum = sum(A)
def solve(i,m):
if sum < m or min < m:
return False
if m == 0:
return True
if i >= n:
return False
res = solve(i+1,m) or solve(i+1, m - A[i])
return res
for m i... | n = eval(input())
A = list(map(int, input().split()))
q = eval(input())
M = list(map(int, input().split()))
min = min(A)
sum = sum(A)
def solve(i,m):
if sum < m:
return False
if m == 0:
return True
if i >= n:
return False
res = solve(i+1,m) or solve(i+1, m - A[i])
return res
for m in M:
if... | [["-", 0, 14, 8, 196, 0, 57, 15, 679, 17, 354], ["-", 8, 196, 0, 57, 15, 679, 12, 666, 0, 22], ["-", 8, 196, 0, 57, 15, 679, 12, 666, 667, 18]] | 5 | 148 | 4 |
n = eval(input())
A = list(map(int, input().split()))
q = eval(input())
M = list(map(int, input().split()))
def solve(i, m):
if m == 0:
return True
if n <= i or sum(A) < m:
return False
res = (solve(i+1, m) or solve(i+1, m-A[i]))
return res
for m in range (M):
if solve(0, m):
... | n = eval(input())
A = list(map(int, input().split()))
q = eval(input())
M = list(map(int, input().split()))
def solve(i, m):
if m == 0:
return True
if n <= i or sum(A) < m:
return False
x = (solve(i+1, m) or solve(i+1, m-A[i]))
return x
for m in M:
if solve(0, m):
print("... | [["-", 0, 14, 8, 196, 0, 1, 0, 662, 31, 22], ["+", 0, 14, 8, 196, 0, 1, 0, 662, 31, 22], ["-", 0, 656, 0, 14, 8, 196, 0, 37, 0, 22], ["+", 0, 656, 0, 14, 8, 196, 0, 37, 0, 22], ["-", 36, 36, 0, 656, 0, 7, 12, 652, 63, 22], ["-", 0, 656, 0, 7, 12, 652, 3, 4, 0, 24], ["-", 0, 656, 0, 7, 12, 652, 3, 4, 0, 25]] | 5 | 137 | 7 |
n_n = int(eval(input()))
n = list(map(int, input().split()))
n_m= int(eval(input()))
m = list(map(int, input().split()))
def solve(i, m):
if m == 0:
return True
if i >= n_n or m > sum(n):
return False
res = solve(i + 1, m) or solve(i + 1,m - n[i])
return res
for k in range(m_m):
... | num_n = int(eval(input()))
n = list(map(int, input().split()))
num_m = int(eval(input()))
m = list(map(int, input().split()))
def solve(i, m):
if m == 0:
return True
if i >= num_n or m > sum(n):
return False
res = solve(i + 1, m) or solve(i + 1,m - n[i])
return res
for k in range(nu... | [["-", 36, 36, 0, 656, 0, 1, 0, 662, 31, 22], ["+", 36, 36, 0, 656, 0, 1, 0, 662, 31, 22], ["-", 8, 196, 0, 57, 15, 679, 31, 666, 0, 22], ["+", 8, 196, 0, 57, 15, 679, 31, 666, 0, 22], ["-", 0, 656, 0, 7, 12, 652, 3, 4, 0, 22], ["+", 0, 656, 0, 7, 12, 652, 3, 4, 0, 22]] | 5 | 144 | 8 |
import time
def sum_A(A, n):
dic = {}
#A_ = A
#n_ = n
def solve(i, m):
if (i, m) in dic:
return dic[(i, m)]
if m == 0:
dic[(i, m)] = True
elif i >= n:
dic[(i, m)] = False
elif solve(i+1, m):
dic[(i, m)] = True
... | import time
def sum_A(A, n):
dic = {}
#A_ = A
#n_ = n
def solve(i, m):
if (i, m) in dic:
return dic[(i, m)]
if m == 0:
dic[(i, m)] = True
elif i >= n:
dic[(i, m)] = False
elif solve(i+1, m):
dic[(i, m)] = True
... | [["-", 0, 57, 64, 196, 0, 1, 0, 652, 63, 22], ["-", 64, 196, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 0, 1, 0, 652, 3, 4, 0, 657, 31, 22], ["-", 0, 1, 0, 652, 3, 4, 0, 657, 17, 33], ["-", 0, 1, 0, 652, 3, 4, 0, 657, 12, 22], ["-", 64, 196, 0, 1, 0, 652, 3, 4, 0, 25]] | 5 | 248 | 26 |
n = int(input())
A = list(map(int, input().split()))
q = int(input())
m = list(map(int, input().split()))
N = int(2**n)
d = []
for i in range(N):
b = "{:0{}b}".format(i, n)
d.append(sum(A[j] for j in range(n) if b[j] == '1'))
#print(b)
for i in range(q):
if m[i] in d:
print("Yes")
else:
... | n = int(input())
A = list(map(int, input().split()))
q = int(input())
m = list(map(int, input().split()))
N = int(2**n)
d = []
for i in range(N):
b = "{:0{}b}".format(i, n)
d.append(sum(A[j] for j in range(n) if b[j] == '1'))
#print(b)
for i in range(q):
if m[i] in d:
print("yes")
else:
... | [["-", 0, 1, 0, 652, 3, 4, 0, 557, 0, 6], ["+", 0, 1, 0, 652, 3, 4, 0, 557, 0, 6]] | 5 | 141 | 4 |
import bisect
n = int(input())
A = tuple(map(int,input().split()))
q = int(input())
Q = tuple(map(int, input().split()))
dp = [0]*(2**n)
for i in range(n):
for j in range(1<<i):
dp[j+(1<<i)] = dp[j] + A[i]
for n in Q:
i = bisect.bisect(dp, n)
print("yes" if i>0 and n==dp[i-1] else "no") | import bisect
n = int(input())
A = tuple(map(int,input().split()))
q = int(input())
Q = tuple(map(int, input().split()))
dp = [0]*(2**n)
for i in range(n):
for j in range(1<<i):
dp[j+(1<<i)] = dp[j] + A[i]
dp.sort()
for n in Q:
i = bisect.bisect(dp, n)
print("yes" if i>0 and n==dp[i-1] else "no") | [["+", 0, 656, 0, 1, 0, 652, 63, 319, 500, 22], ["+", 0, 656, 0, 1, 0, 652, 63, 319, 0, 131], ["+", 0, 656, 0, 1, 0, 652, 63, 319, 319, 22], ["+", 0, 656, 0, 1, 0, 652, 3, 4, 0, 24], ["+", 0, 656, 0, 1, 0, 652, 3, 4, 0, 25]] | 5 | 139 | 5 |
n = int(input())
A = list(map(int, input().split()))
q = int(input())
m = list(map(int, input().split()))
sum_list = []
for i in range(n**2):
b = '{0:0{1}b}'.format(i, n)
temp = []
for j in range(n):
if b[j] == '1':
temp.append(A[j])
sum_list.append(sum(temp))
for k in m:
prin... | n = int(input())
A = list(map(int, input().split()))
q = int(input())
m = list(map(int, input().split()))
sum_list = []
for i in range(2**n):
b = '{0:0{1}b}'.format(i, n)
temp = []
for j in range(n):
if b[j] == '1':
temp.append(A[j])
sum_list.append(sum(temp))
for k in m:
prin... | [["-", 0, 7, 12, 652, 3, 4, 0, 657, 31, 22], ["-", 0, 7, 12, 652, 3, 4, 0, 657, 17, 578], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 17, 578], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 12, 22]] | 5 | 135 | 4 |
n = int(input())
A = list(map(int, input().split()))
q = int(input())
mi = map(int, input().split())
t = {}
def solve(i, m):
if (m == 0):
return True
if (i >= n):
return False
if (i,m) in t:
return t[(i,m)]
res = solve(i + 1, m) or solve(i + 1, m - A[i])
t[(i,m)] = res
r... | n = int(input())
A = list(map(int, input().split()))
q = int(input())
mi = map(int, input().split())
t = {}
def solve(i, m):
if (m == 0):
return True
if (i >= n):
return False
if (i,m) in t:
return t[(i,m)]
res = solve(i + 1, m) or solve(i + 1, m - A[i])
t[(i,m)] = res
r... | [["-", 36, 36, 36, 36, 0, 656, 0, 7, 31, 22], ["+", 36, 36, 36, 36, 0, 656, 0, 7, 31, 22], ["-", 36, 36, 0, 656, 0, 7, 12, 652, 63, 22], ["-", 0, 656, 0, 7, 12, 652, 3, 4, 0, 24], ["-", 0, 656, 0, 7, 12, 652, 3, 4, 0, 22], ["-", 0, 656, 0, 7, 12, 652, 3, 4, 0, 25], ["+", 36, 36, 36, 36, 0, 656, 0, 7, 12, 22], ["-", 8, ... | 5 | 161 | 9 |
n = int(input())
A = list(map(int, input().split()))
q = int(input())
m = list(map(int, input().split()))
def solve(i, m):
if m == 0:
return True
if i >= n :
return False
res = solve(i + 1, m) or solve(i + 1, m - a[i])
return res
for tmp_m in m:
if sum(a) < tmp_m:
print('no')
elif solve(0, tmp... | n = int(input())
A = list(map(int, input().split()))
q = int(input())
m = list(map(int, input().split()))
def solve(i, m):
if m == 0:
return True
if i >= n :
return False
res = solve(i + 1, m) or solve(i + 1, m - A[i])
return res
for tmp_m in m:
if sum(A) < tmp_m:
print('no')
elif solve(0, tmp... | [["-", 12, 652, 3, 4, 0, 657, 12, 206, 51, 22], ["+", 12, 652, 3, 4, 0, 657, 12, 206, 51, 22], ["-", 0, 57, 15, 666, 0, 652, 3, 4, 0, 22], ["+", 0, 57, 15, 666, 0, 652, 3, 4, 0, 22]] | 5 | 139 | 4 |
A_count = int(input());
A = [int(n) for n in input().split()];
M_count = int(input());
M = [int(n) for n in input().split()];
memo = [[None for i in range(2000)] for j in range(A_count)];
def solve(start, target):
if memo[start][target] is not None:
return memo[start][target];
if target == 0:
... | A_count = int(input());
A = [int(n) for n in input().split()];
M_count = int(input());
M = [int(n) for n in input().split()];
memo = [[None for i in range(2000)] for j in range(A_count + 1)];
def solve(start, target):
if memo[start][target] is not None:
return memo[start][target];
if target == 0:
... | [["+", 0, 659, 12, 652, 3, 4, 0, 657, 17, 72], ["+", 0, 659, 12, 652, 3, 4, 0, 657, 12, 612]] | 5 | 210 | 2 |
n=int(input())
A=list(map(int,input().split()))
r=set()
def f(s,k):
if k>=0:
global r
r|=set(s)
f(s+A[k-1],k-1)
f(s,k-1)
f(0,n)
input()
for e in map(int,input().split()):print(['no','yes'][e in r])
| n=int(input())
A=list(map(int,input().split()))
r=set()
def f(s,k):
if k>=0:
global r
r.add(s)
f(s+A[k-1],k-1)
f(s,k-1)
f(0,n)
input()
for e in map(int,input().split()):print(['no','yes'][e in r])
| [["-", 0, 57, 64, 196, 0, 1, 0, 677, 17, 160], ["-", 64, 196, 0, 1, 0, 677, 12, 652, 63, 22], ["+", 64, 196, 0, 1, 0, 652, 63, 319, 0, 131], ["+", 64, 196, 0, 1, 0, 652, 63, 319, 319, 22]] | 5 | 116 | 4 |
# -*- coding: utf-8 -*-
"""
Created on Wed May 2 21:28:06 2018
ALDS1_5a
@author: maezawa
"""
import itertools as itr
n = int(input())
a = list(map(int, input().split()))
q = int(input())
m = list(map(int, input().split()))
sum_array = []
for r in range(1,n+1):
for comb in itr.combinations(a, r):
aum_arra... | # -*- coding: utf-8 -*-
"""
Created on Wed May 2 21:28:06 2018
ALDS1_5a
@author: maezawa
"""
import itertools as itr
n = int(input())
a = list(map(int, input().split()))
q = int(input())
m = list(map(int, input().split()))
sum_array = []
for r in range(1,n+1):
for comb in itr.combinations(a, r):
sum_arra... | [["-", 8, 196, 0, 1, 0, 206, 51, 319, 500, 22], ["+", 8, 196, 0, 1, 0, 652, 63, 319, 500, 22], ["-", 0, 7, 8, 196, 0, 1, 0, 206, 0, 70], ["+", 8, 196, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 0, 7, 8, 196, 0, 1, 0, 206, 0, 73], ["+", 8, 196, 0, 1, 0, 652, 3, 4, 0, 25], ["-", 0, 57, 64, 196, 0, 1, 0, 666, 667, 60], ["+", 0, 57... | 5 | 127 | 12 |
n=int (input())
A=list(map(int,input().split()))
q=int (input())
m=list(map(int,input().split()))
box=[]
for i in range(2**n):
b = '{0:0{1}b}'.format(i,n)
tmp=[]
for j in rangee(n):
if b[j]=='1':
if b[j]=='1':
tmp.append(A[j])
sum_list.append(box(tmp))
for k in m:
if k in box:
print("yes")
else:
p... | n=int (input())
A=list(map(int,input().split()))
q=int (input())
m=list(map(int,input().split()))
box=[]
for i in range(2**n):
b = '{0:0{1}b}'.format(i,n)
tmp=[]
for j in range(n):
if b[j]=='1':
if b[j]=='1':
tmp.append(A[j])
box.append(sum(tmp))
for k in m:
if k in box:
print("yes")
else:
print("... | [["-", 0, 7, 8, 196, 0, 7, 12, 652, 63, 22], ["+", 0, 7, 8, 196, 0, 7, 12, 652, 63, 22], ["-", 8, 196, 0, 1, 0, 652, 63, 319, 500, 22], ["+", 8, 196, 0, 1, 0, 652, 63, 319, 500, 22], ["-", 0, 1, 0, 652, 3, 4, 0, 652, 63, 22], ["+", 0, 1, 0, 652, 3, 4, 0, 652, 63, 22]] | 5 | 150 | 6 |
n = int(input())
a = list(map(int, input().strip().split()))
q = int(input())
M = list(map(int, input().strip().split()))
d = []
for x in range(1 << n):
b = '{:0{}b}'.format(x, n)
print(b)
d.append(sum(a[i] for i in range(n) if b[i] == '1'))
for m in M:
print('yes' if m in d else 'no') | n = int(input())
a = list(map(int, input().strip().split()))
q = int(input())
M = list(map(int, input().strip().split()))
d = []
for x in range(1 << n):
b = '{:0{}b}'.format(x, n)
d.append(sum(a[i] for i in range(n) if b[i] == '1'))
for m in M:
print('yes' if m in d else 'no') | [["-", 0, 7, 8, 196, 0, 1, 0, 652, 63, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 25]] | 5 | 135 | 4 |
#include <cstdio>
#include <iostream>
using namespace std;
#define maxn 2000005
int a[maxn], b[maxn], c[maxn];
void countingSort(int k) {
for (int i = 1; i <= k; ++i)
c[a[i]]++;
for (int i = 1; i <= k; ++i)
c[i] = c[i - 1] + c[i];
for (int i = k; i >= 1; --i) {
b[c[a[i]]] = a[i];
c[a[i]]--;
}
}
... | #include <cstdio>
#include <iostream>
using namespace std;
#define maxn 2000005
#define ma 10005
int a[maxn], b[maxn], c[maxn];
void countingSort(int k) {
for (int i = 1; i <= k; ++i)
c[a[i]]++;
for (int i = 1; i <= ma; ++i)
c[i] = c[i - 1] + c[i];
for (int i = k; i >= 1; --i) {
b[c[a[i]]] = a[i];
... | [["+", 36, 36, 36, 36, 0, 30, 0, 58, 0, 148], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 141, 22], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 232 | 5 |
/*
* CountingSort
*/
#include <iostream>
#include <vector>
using namespace std;
void input(vector<int> &A) {
int n = 0;
cin >> n;
A.resize(n);
for (int i = 0; i < n; i++) {
cin >> A[i];
}
}
void output(vector<int> &out) {
int size = out.size();
// size = n;
for (int i = 0; i < size; i++) {
... | /*
* CountingSort
*/
#include <iostream>
#include <vector>
using namespace std;
void input(vector<int> &A) {
int n = 0;
cin >> n;
A.resize(n);
for (int i = 0; i < n; i++) {
cin >> A[i];
}
}
void output(vector<int> &out) {
int size = out.size();
for (int i = 0; i < size; i++) {
cout << out[i];... | [["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 33], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 12, 13], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, ... | 1 | 320 | 8 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.