submission_id
int32 10
42.5k
| func_code
stringlengths 22
782
| assignment_id
stringlengths 4
23
| func_name
stringlengths 4
23
| description
stringlengths 26
128
| test
stringlengths 45
1.22k
| correct
bool 2
classes | user
stringlengths 36
36
| academic_year
int32 2.02k
2.02k
|
|---|---|---|---|---|---|---|---|---|
8,639 |
def circle_area(r):
circle_area = r * r * 3.14
return circle_area
|
circle_area
|
circle_area
|
Return the area of a circle.
|
assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18
| true |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
15,119 |
def swap(a, i, j):
temp = a[i]
a[i] = a[j]
a[j] = temp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
while i < len(a):
find_position_of_smallest(a, i).swap(a)
swap(a, i, j).sort(a)
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
29ee2b4b-4fb7-46c9-986d-b715bcee0fbe
| 2,016 |
13,842 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
j = i + 1
while j < len(a):
if a[j] < a[p]:
p = j
j = j + 1
return p
def sort(a):
i = 0
j = i + 1
while i < len(a):
find_position_of_smallest(a, i)
swap(a, i, j)
j = j + 1
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
639d0a36-d89c-469e-a1ae-4cadc99d8827
| 2,016 |
4,860 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
j = i + 1
while j < len(a):
if a[j] < a[p]:
p = j
j = j + 1
return p
def sort(a):
i = 0
j = i + 1
while i < len(a):
find_position_of_smallest(a, i)
swap(a, i, j)
i = i + 1
j = j + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
0ea9000e-74e5-4eea-8653-1bfeeae4aab1
| 2,016 |
14,204 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
tmp = i
while i < len(a):
if a[i] < a[tmp]:
tmp = i
i = i + 1
return tmp
def sort(a):
j = 0
while j < len(a):
p = find_position_of_smallest(a, j)
swap(a, j, p)
j = j + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
18ee9049-5f05-43b2-ac53-518e3b23c3c3
| 2,016 |
5,604 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
tmp = i
while i < len(a):
if a[i] < a[tmp]:
tmp = i
i = i + 1
return tmp
def sort(a):
j = 0
while j < len(a):
p = find_position_of_smallest(a, j)
swap(a, j, p)
j = j + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
18ee9049-5f05-43b2-ac53-518e3b23c3c3
| 2,016 |
38,668 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
tmp = i
while i < len(a):
if a[i] < a[tmp]:
tmp = i
i = i + 1
return tmp
def sort(a):
j = 0
while j < len(a):
p = find_position_of_smallest(a, j)
swap(a, j, p)
j = j + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
18ee9049-5f05-43b2-ac53-518e3b23c3c3
| 2,016 |
25,164 |
def sort(a):
while i < len(a):
find_position_of_smallest.sort(a)
swap.sort(a)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b
| 2,016 |
12,291 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
j = i + 1
while j < len(a):
if a[j] < a[p]:
p = j
j = j + 1
return p
def sort(a):
i = 0
j = i + 1
while j < len(a):
find_position_of_smallest(a, i)
swap(a, i, j)
i = i + 1
j = j + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
0ea9000e-74e5-4eea-8653-1bfeeae4aab1
| 2,016 |
36,990 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
i = i + 1
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
i = 0
while i < len(a):
p = find_position_of_smallest(a, i)
swap(a, i, p)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
d8aa4bbd-4524-4751-9dce-5cd1ea64d8cb
| 2,016 |
19,251 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
i = i + 1
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
i = 0
while i < len(a):
p = find_position_of_smallest(a, i)
swap(a, i, p)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
d8aa4bbd-4524-4751-9dce-5cd1ea64d8cb
| 2,016 |
38,617 |
def sort(a):
i = 0
while i < len(a):
find_position_of_smallest.sort(a)
swap.sort(a)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b
| 2,016 |
7,360 |
def swap(a, i, j):
temp = a[i]
a[i] = a[j]
a[j] = temp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
while i < len(a):
if find_position_of_smallest(a, i).swap(a):
swap(a, i, j).sort(a)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
29ee2b4b-4fb7-46c9-986d-b715bcee0fbe
| 2,016 |
23,995 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
j = i + 1
while j < len(a):
if a[j] < a[p]:
p = j
j = j + 1
return p
def sort(a):
i = 0
while i < len(a):
p = find_position_of_smallest(a, i)
swap(a, i, j)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
0ea9000e-74e5-4eea-8653-1bfeeae4aab1
| 2,016 |
24,082 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
j = i + 1
while j < len(a):
if a[j] < a[p]:
p = j
j = j + 1
return p
def sort(a):
i = 0
while i < len(a):
p = find_position_of_smallest(a, i)
swap(a, i, p)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
639d0a36-d89c-469e-a1ae-4cadc99d8827
| 2,016 |
4,371 |
def circle_area(r):
circle_area = r * r * 3.14
return circle_area
|
circle_area
|
circle_area
|
Return the area of a circle.
|
assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18
| true |
d6b9871a-67ab-4c5d-894e-eb5d53fae3d1
| 2,016 |
1,967 |
def square_perimeter(n):
square_perimeter = 4 * n
return square_perimeter
|
square_perimeter
|
square_perimeter
|
Returns the perimeter of a square.
|
assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736
| true |
d6b9871a-67ab-4c5d-894e-eb5d53fae3d1
| 2,016 |
40,274 |
def circle_circumference(r):
circle_circumference = 2 * 3.14 * r
return circle_circumference
|
circle_circumference
|
circle_circumference
|
Return the circumference of a circle.
|
assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32
| true |
d6b9871a-67ab-4c5d-894e-eb5d53fae3d1
| 2,016 |
32,088 |
def circle_circumference(r):
circle_circumference = 2 * 3.14 * r
return circle_circumference
|
circle_circumference
|
circle_circumference
|
Return the circumference of a circle.
|
assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32
| true |
d6b9871a-67ab-4c5d-894e-eb5d53fae3d1
| 2,016 |
38,931 |
def circle_area(r):
circle_area = r * r * 3.14
return circle_area
|
circle_area
|
circle_area
|
Return the area of a circle.
|
assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18
| true |
d6b9871a-67ab-4c5d-894e-eb5d53fae3d1
| 2,016 |
7,528 |
def square_area(n):
square_area = n * n
return square_area
|
square_area
|
square_area
|
Return the area of a square.
|
assert square_area(0)==0 and square_area(21138)==446815044
| true |
d6b9871a-67ab-4c5d-894e-eb5d53fae3d1
| 2,016 |
7,632 |
def square_perimeter(n):
square_perimeter = 4 * n
return square_perimeter
|
square_perimeter
|
square_perimeter
|
Returns the perimeter of a square.
|
assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736
| true |
d6b9871a-67ab-4c5d-894e-eb5d53fae3d1
| 2,016 |
12,813 |
def rectangle_perimeter(r, n):
rectangle_perimeter = 2 * (r + n)
return rectangle_perimeter
|
rectangle_perimeter
|
rectangle_perimeter
|
Return the perimeter of a rectangle with the given coordinates.
|
assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798
| true |
d6b9871a-67ab-4c5d-894e-eb5d53fae3d1
| 2,016 |
8,040 |
def square_area(n):
square_area = n * n
return square_area
|
square_area
|
square_area
|
Return the area of a square.
|
assert square_area(0)==0 and square_area(21138)==446815044
| true |
d6b9871a-67ab-4c5d-894e-eb5d53fae3d1
| 2,016 |
40,756 |
def rectangle_perimeter(r, n):
rectangle_perimeter = 2 * (r + n)
return rectangle_perimeter
|
rectangle_perimeter
|
rectangle_perimeter
|
Return the perimeter of a rectangle with the given coordinates.
|
assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798
| true |
d6b9871a-67ab-4c5d-894e-eb5d53fae3d1
| 2,016 |
34,894 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
j = i + 1
while j < len(a):
if a[j] < a[p]:
p = j
j = j + 1
return p
def sort(a):
i = 0
while i < len(a):
p = find_position_of_smallest(a, i)
swap(a, p, i)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
639d0a36-d89c-469e-a1ae-4cadc99d8827
| 2,016 |
28,673 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
j = i + 1
while j < len(a):
if a[j] < a[p]:
p = j
j = j + 1
return p
def sort(a):
i = 0
while i < len(a):
p = find_position_of_smallest(a, i)
swap(a, p, i)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
0ea9000e-74e5-4eea-8653-1bfeeae4aab1
| 2,016 |
42,194 |
def circle_area(r):
circle_area = r * r * 3.14
return circle_area
|
circle_area
|
circle_area
|
Return the area of a circle.
|
assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18
| true |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
31,030 |
def circle_circumference(r):
circle_circumference = 2 * 3.14 * r
return circle_circumference
|
circle_circumference
|
circle_circumference
|
Return the circumference of a circle.
|
assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32
| true |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
27,734 |
def rectangle_perimeter(r, n):
rectancle_perimeter = 2 * (r + n)
return rectangle_perimeter
|
rectangle_perimeter
|
rectangle_perimeter
|
Return the perimeter of a rectangle with the given coordinates.
|
assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798
| false |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
25,486 |
def square_area(n):
square_area = n * n
return square_area
|
square_area
|
square_area
|
Return the area of a square.
|
assert square_area(0)==0 and square_area(21138)==446815044
| true |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
15,885 |
def square_perimeter(n):
square_perimeter = n * 4
return square_perimeter
|
square_perimeter
|
square_perimeter
|
Returns the perimeter of a square.
|
assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736
| true |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
16,772 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
j = i + 1
while j < len(a):
if a[j] < a[p]:
p = j
j = j + 1
return p
def sort(a):
i = 0
while i < len(a):
p = find_position_of_smallest(a, i)
swap(a, p, i)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
0ea9000e-74e5-4eea-8653-1bfeeae4aab1
| 2,016 |
18,044 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
j = i + 1
while j < len(a):
if a[j] < a[p]:
p = j
j = j + 1
return p
def sort(a):
i = 0
while i < len(a):
p = find_position_of_smallest(a, i)
swap(a, p, i)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
0ea9000e-74e5-4eea-8653-1bfeeae4aab1
| 2,016 |
18,646 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
j = i + 1
while j < len(a):
if a[j] < a[p]:
p = j
j = j + 1
return p
def sort(a):
i = 0
while i < len(a):
p = find_position_of_smallest(a, i)
swap(a, p, i)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
639d0a36-d89c-469e-a1ae-4cadc99d8827
| 2,016 |
35,063 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
j = i + 1
while j < len(a):
if a[j] < a[p]:
p = j
j = j + 1
return p
def sort(a):
i = 0
while i < len(a):
p = find_position_of_smallest(a, i)
swap(a, p, i)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
639d0a36-d89c-469e-a1ae-4cadc99d8827
| 2,016 |
7,718 |
def square_perimeter(n):
result = n + n + n + n
return result
|
square_perimeter
|
square_perimeter
|
Returns the perimeter of a square.
|
assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736
| true |
5c105474-42d8-4a95-a311-034a93c693c8
| 2,016 |
38,750 |
def circle_area(n):
result = 3.14 * (n * n)
return result
|
circle_area
|
circle_area
|
Return the area of a circle.
|
assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18
| true |
5c105474-42d8-4a95-a311-034a93c693c8
| 2,016 |
29,501 |
def square_area(n):
result = n * n
return result
|
square_area
|
square_area
|
Return the area of a square.
|
assert square_area(0)==0 and square_area(21138)==446815044
| true |
5c105474-42d8-4a95-a311-034a93c693c8
| 2,016 |
2,834 |
def rectangle_perimeter(n, m):
result = n + n + m + m
return result
|
rectangle_perimeter
|
rectangle_perimeter
|
Return the perimeter of a rectangle with the given coordinates.
|
assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798
| true |
5c105474-42d8-4a95-a311-034a93c693c8
| 2,016 |
15,095 |
def rectangle_perimeter(n, m):
result = n + n + m + m
return result
|
rectangle_perimeter
|
rectangle_perimeter
|
Return the perimeter of a rectangle with the given coordinates.
|
assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798
| true |
5c105474-42d8-4a95-a311-034a93c693c8
| 2,016 |
26,579 |
def circle_area(n):
result = 3.14 * (n * n)
return result
|
circle_area
|
circle_area
|
Return the area of a circle.
|
assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18
| true |
5c105474-42d8-4a95-a311-034a93c693c8
| 2,016 |
14,919 |
def circle_circumference(n):
result = 2 * 3.14 * n
return result
|
circle_circumference
|
circle_circumference
|
Return the circumference of a circle.
|
assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32
| true |
5c105474-42d8-4a95-a311-034a93c693c8
| 2,016 |
40,803 |
def circle_circumference(n):
result = 2 * 3.14 * n
return result
|
circle_circumference
|
circle_circumference
|
Return the circumference of a circle.
|
assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32
| true |
5c105474-42d8-4a95-a311-034a93c693c8
| 2,016 |
4,520 |
def square_perimeter(n):
result = n + n + n + n
return result
|
square_perimeter
|
square_perimeter
|
Returns the perimeter of a square.
|
assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736
| true |
5c105474-42d8-4a95-a311-034a93c693c8
| 2,016 |
27,412 |
def square_area(n):
result = n * n
return result
|
square_area
|
square_area
|
Return the area of a square.
|
assert square_area(0)==0 and square_area(21138)==446815044
| true |
5c105474-42d8-4a95-a311-034a93c693c8
| 2,016 |
20,439 |
def circle_circumference(r):
circle_circumference = 2 * 3.14 * r
return circle_circumference
|
circle_circumference
|
circle_circumference
|
Return the circumference of a circle.
|
assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32
| true |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
31,042 |
def circle_area(r):
circle_area = r * r * 3.14
return circle_area
|
circle_area
|
circle_area
|
Return the area of a circle.
|
assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18
| true |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
16,813 |
def rectangle_perimeter(r, n):
rectangle_perimeter = 2 * (r + n)
return rectangle_perimeter
|
rectangle_perimeter
|
rectangle_perimeter
|
Return the perimeter of a rectangle with the given coordinates.
|
assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798
| true |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
29,135 |
def square_perimeter(n):
square_perimeter = n * 4
return square_perimeter
|
square_perimeter
|
square_perimeter
|
Returns the perimeter of a square.
|
assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736
| true |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
16,960 |
def square_perimeter(n):
square_perimeter = n * 4
return square_perimeter
|
square_perimeter
|
square_perimeter
|
Returns the perimeter of a square.
|
assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736
| true |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
33,961 |
def circle_area(r):
circle_area = r * r * 3.14
return circle_area
|
circle_area
|
circle_area
|
Return the area of a circle.
|
assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18
| true |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
17,938 |
def square_area(n):
square_area = n * n
return square_area
|
square_area
|
square_area
|
Return the area of a square.
|
assert square_area(0)==0 and square_area(21138)==446815044
| true |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
33,863 |
def circle_circumference(r):
circle_circumference = 2 * 3.14 * r
return circle_circumference
|
circle_circumference
|
circle_circumference
|
Return the circumference of a circle.
|
assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32
| true |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
31,864 |
def rectangle_perimeter(r, n):
rectangle_perimeter = 2 * (r + n)
return rectangle_perimeter
|
rectangle_perimeter
|
rectangle_perimeter
|
Return the perimeter of a rectangle with the given coordinates.
|
assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798
| true |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
41,227 |
def square_area(n):
square_area = n * n
return square_area
|
square_area
|
square_area
|
Return the area of a square.
|
assert square_area(0)==0 and square_area(21138)==446815044
| true |
99d129a4-97af-42ac-a543-23b9157331f8
| 2,016 |
6,108 |
def sort(a):
b = a
b = 0
j = 1
while j < len(a):
if a[j] < a[b]:
p = j
j = j + 1
return b
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
065cc64f-1be3-42fb-9f2e-8280c11aa573
| 2,016 |
12,063 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
j = i + 1
while j < len(a):
if a[j] < a[p]:
p = j
j = j + 1
return p
def sort(a):
i = 0
while i < len(a):
p = find_position_of_smallest(a, i)
swap(a, p, i)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
b588e248-0a0b-40c1-ad90-f9fc1d050dd0
| 2,016 |
23,348 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
j = i + 1
while j < len(a):
if a[j] < a[p]:
p = j
j = j + 1
return p
def sort(a):
i = 0
while i < len(a):
p = find_position_of_smallest(a, i)
swap(a, p, i)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
b588e248-0a0b-40c1-ad90-f9fc1d050dd0
| 2,016 |
16,961 |
def sort(a):
b = 0
j = 1
while j < len(a):
if a[j] < a[b]:
p = j
j = j + 1
return b
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
065cc64f-1be3-42fb-9f2e-8280c11aa573
| 2,016 |
37,967 |
def sort(a):
b = 0
j = 1
while j < len(a):
if a[j] < a[b]:
p = j
j = j + 1
return b
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
065cc64f-1be3-42fb-9f2e-8280c11aa573
| 2,016 |
27,201 |
def sort(a):
b = 0
j = 1
while j < len(a):
if a[j] < a[b]:
p = j
j = j + 1
return b
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
065cc64f-1be3-42fb-9f2e-8280c11aa573
| 2,016 |
36,982 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
j = 0
while j < len(a):
p = find_position_of_smallest(a, i)
swap(a, i, j)
j = j + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
03324848-d1b1-4b00-9ab7-93d76a61a9c0
| 2,016 |
28,632 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
j = 0
while j < len(a):
p = find_position_of_smallest(a, j)
swap(a, j, p)
j = j + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
03324848-d1b1-4b00-9ab7-93d76a61a9c0
| 2,016 |
16,752 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
j = 0
while j < len(a):
p = find_position_of_smallest(a, j)
swap(a, j, p)
j = j + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
03324848-d1b1-4b00-9ab7-93d76a61a9c0
| 2,016 |
29,783 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
j = 0
while j < len(a):
p = find_position_of_smallest(a, j)
swap(a, j, p)
j = j + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
03324848-d1b1-4b00-9ab7-93d76a61a9c0
| 2,016 |
32,764 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
j = 0
while j < len(a):
p = find_position_of_smallest(a, j)
swap(a, j, p)
j = j + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
03324848-d1b1-4b00-9ab7-93d76a61a9c0
| 2,016 |
5,917 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
j = 0
while j < len(a):
p = find_position_of_smallest(a, j)
swap(a, j, p)
j = j + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
03324848-d1b1-4b00-9ab7-93d76a61a9c0
| 2,016 |
20,643 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
j = i + 1
while j < len(a):
if a[j] < a[p]:
p = j
j = j + 1
return p
def sort(a):
i = 0
while i < len(a):
p = find_position_of_smallest(a, i)
swap(a, p, i)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
b8415cb6-c612-4985-9211-908831b3834e
| 2,016 |
27,803 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
j = i + 1
while j < len(a):
if a[j] < a[p]:
p = j
j = j + 1
return p
def sort(a):
i = 0
while i < len(a):
p = find_position_of_smallest(a, i)
swap(a, p, i)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
b8415cb6-c612-4985-9211-908831b3834e
| 2,016 |
41,152 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
j = i + 1
while j < len(a):
if a[j] < a[p]:
p = j
j = j + 1
return p
def sort(a):
i = 0
while i < len(a):
p = find_position_of_smallest(a, i)
swap(a, p, i)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
b8415cb6-c612-4985-9211-908831b3834e
| 2,016 |
12,879 |
def swap(a, i, j):
temp = a[i]
a[i] = a[j]
a[j] = temp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
j = 0
while i < len(a):
find_position_of_smallest(a, i)
swap(a, i, j)
j = j + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
29ee2b4b-4fb7-46c9-986d-b715bcee0fbe
| 2,016 |
14,248 |
def swap(a, i, j):
temp = a[i]
a[i] = a[j]
a[j] = temp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
j = 0
while j < len(a):
find_position_of_smallest(a, i)
swap(a, i, j)
j = j + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
29ee2b4b-4fb7-46c9-986d-b715bcee0fbe
| 2,016 |
28,136 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
l = 0
while l < len(a):
p = find_position_of_smallest(a, l)
swap(a, l, p)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b
| 2,016 |
5,007 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
l = 0
while l < len(a):
p = find_position_of_smallest(a, l)
swap(a, l, p)
l = l + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b
| 2,016 |
35,685 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
l = 0
while l < len(a):
p = find_position_of_smallest(a, l)
swap(a, l, p)
l = l + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
4b4cb32f-e677-40c7-8bdb-79ba1dd2a70b
| 2,016 |
28,732 |
def swap(a, i, j):
temp = a[i]
a[i] = a[j]
a[j] = temp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
l = 0
while l < len(a):
p = find_position_of_smallest(a, l)
swap(a, p, l)
l = l + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| false |
29ee2b4b-4fb7-46c9-986d-b715bcee0fbe
| 2,016 |
11,508 |
def swap(a, i, j):
temp = a[i]
a[i] = a[j]
a[j] = temp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
l = 0
while l < len(a):
p = find_position_of_smallest(a, l)
swap(a, p, l)
l = l + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
29ee2b4b-4fb7-46c9-986d-b715bcee0fbe
| 2,016 |
24,613 |
def swap(a, i, j):
temp = a[i]
a[i] = a[j]
a[j] = temp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
l = 0
while l < len(a):
p = find_position_of_smallest(a, l)
swap(a, p, l)
l = l + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
29ee2b4b-4fb7-46c9-986d-b715bcee0fbe
| 2,016 |
23,242 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
i = 0
while i < len(a):
p = find_position_of_smallest(a, i)
swap(a, i, p)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
e5dedf13-336d-484f-81bc-d7898f0f002e
| 2,016 |
20,766 |
def swap(a, i, j):
tmp = a[i]
a[i] = a[j]
a[j] = tmp
def find_position_of_smallest(a, i):
p = i
while i < len(a):
if a[i] < a[p]:
p = i
i = i + 1
return p
def sort(a):
i = 0
while i < len(a):
p = find_position_of_smallest(a, i)
swap(a, i, p)
i = i + 1
|
sort
|
sort
|
Sort a list by repeatedly moving the minimimum of the remaining sublist to the front.
|
assert sort([0])==None and sort([0])==None and sort([])==None and sort([])==None and sort([' '])==None and sort([' '])==None and sort([70, 339305549])==None and sort([70, 339305549])==None
| true |
e5dedf13-336d-484f-81bc-d7898f0f002e
| 2,016 |
1,427 |
def perimeter(n):
per = n * 4
return per
def rectangle_perimeter(n, m):
rec = n * 2 + m * 2
return rec
|
rectangle_perimeter
|
rectangle_perimeter
|
Return the perimeter of a rectangle with the given coordinates.
|
assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798
| true |
ce889881-69dd-4396-aceb-e6f7dddc2c14
| 2,016 |
2,025 |
def circle_area(n):
circ = 3.14 * (n * n)
return circ
|
circle_area
|
circle_area
|
Return the area of a circle.
|
assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18
| true |
ce889881-69dd-4396-aceb-e6f7dddc2c14
| 2,016 |
25,103 |
def circle_area(n):
circ = 3.14 * (n * n)
return circ
|
circle_area
|
circle_area
|
Return the area of a circle.
|
assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18
| true |
ce889881-69dd-4396-aceb-e6f7dddc2c14
| 2,016 |
39,873 |
def perimeter(n):
per = n * 4
return per
def rectangle_perimeter(n, m):
rec = n * 2 + m * 2
return rec
|
rectangle_perimeter
|
rectangle_perimeter
|
Return the perimeter of a rectangle with the given coordinates.
|
assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798
| true |
ce889881-69dd-4396-aceb-e6f7dddc2c14
| 2,016 |
15,937 |
def circle_circumference(n):
circle = 2 * 3.14 * n
return circle
|
circle_circumference
|
circle_circumference
|
Return the circumference of a circle.
|
assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32
| true |
ce889881-69dd-4396-aceb-e6f7dddc2c14
| 2,016 |
25,282 |
def circle_circumference(n):
circle = 2 * 3.14 * n
return circle
|
circle_circumference
|
circle_circumference
|
Return the circumference of a circle.
|
assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32
| true |
ce889881-69dd-4396-aceb-e6f7dddc2c14
| 2,016 |
37,333 |
def square_area(n):
sq = n * n
return sq
|
square_area
|
square_area
|
Return the area of a square.
|
assert square_area(0)==0 and square_area(21138)==446815044
| true |
ce889881-69dd-4396-aceb-e6f7dddc2c14
| 2,016 |
20,998 |
def square_area(n):
sq = n * n
return sq
|
square_area
|
square_area
|
Return the area of a square.
|
assert square_area(0)==0 and square_area(21138)==446815044
| true |
ce889881-69dd-4396-aceb-e6f7dddc2c14
| 2,016 |
2,808 |
def square_area(n):
sq = n * n
return sq
|
square_area
|
square_area
|
Return the area of a square.
|
assert square_area(0)==0 and square_area(21138)==446815044
| true |
ce889881-69dd-4396-aceb-e6f7dddc2c14
| 2,016 |
11,193 |
def square_area(n):
sq = n * n
return sq
|
square_area
|
square_area
|
Return the area of a square.
|
assert square_area(0)==0 and square_area(21138)==446815044
| true |
ce889881-69dd-4396-aceb-e6f7dddc2c14
| 2,016 |
20,451 |
def square_area(n):
sq = n * n
return sq
|
square_area
|
square_area
|
Return the area of a square.
|
assert square_area(0)==0 and square_area(21138)==446815044
| true |
ce889881-69dd-4396-aceb-e6f7dddc2c14
| 2,016 |
11,622 |
def circle_circumference(n):
circle = 2 * 3.14 * n
return circle
|
circle_circumference
|
circle_circumference
|
Return the circumference of a circle.
|
assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32
| true |
ce889881-69dd-4396-aceb-e6f7dddc2c14
| 2,016 |
42,158 |
def circle_area(n):
circ = 3.14 * (n * n)
return circ
|
circle_area
|
circle_area
|
Return the area of a circle.
|
assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18
| true |
ce889881-69dd-4396-aceb-e6f7dddc2c14
| 2,016 |
40,235 |
def perimeter(n):
per = n + n + n + n
return per
def rectangle_perimeter(n, m):
rec = n + m + n + m
return rec
|
rectangle_perimeter
|
rectangle_perimeter
|
Return the perimeter of a rectangle with the given coordinates.
|
assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798
| true |
ce889881-69dd-4396-aceb-e6f7dddc2c14
| 2,016 |
4,418 |
def perimeter(n):
result1 = n + n + n + n
return result1
def rectangle_perimeter(n, m):
result4 = n + m + n + m
return result4
|
rectangle_perimeter
|
rectangle_perimeter
|
Return the perimeter of a rectangle with the given coordinates.
|
assert rectangle_perimeter(0,0)==0 and rectangle_perimeter(7968917888512863576,-18677)==15937835777025689798
| true |
ce889881-69dd-4396-aceb-e6f7dddc2c14
| 2,016 |
7,878 |
def circle_circumference(n):
result3 = 2 * 3.14 * n
return result3
|
circle_circumference
|
circle_circumference
|
Return the circumference of a circle.
|
assert circle_circumference(0)==0.0 and circle_circumference(25619)==160887.32
| true |
ce889881-69dd-4396-aceb-e6f7dddc2c14
| 2,016 |
27,232 |
def circle_area(n):
result2 = 3.14 * (n * n)
return result2
|
circle_area
|
circle_area
|
Return the area of a circle.
|
assert circle_area(0)==0.0 and circle_area(-1160877629)==4.231579770269758e+18
| true |
ce889881-69dd-4396-aceb-e6f7dddc2c14
| 2,016 |
27,697 |
def square_perimeter(n):
result1 = n + n + n + n
return result1
|
square_perimeter
|
square_perimeter
|
Returns the perimeter of a square.
|
assert square_perimeter(0)==0 and square_perimeter(-12684)==-50736
| true |
ce889881-69dd-4396-aceb-e6f7dddc2c14
| 2,016 |
13,422 |
def square_area(n):
result = n * n
return sq
|
square_area
|
square_area
|
Return the area of a square.
|
assert square_area(0)==0 and square_area(21138)==446815044
| false |
ce889881-69dd-4396-aceb-e6f7dddc2c14
| 2,016 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.