type
stringclasses 4
values | content_without_mask
stringlengths 610
1.37M
| content_masked
stringlengths 609
1.37M
| label
stringclasses 362
values | options
sequencelengths 5
5
| correct
stringclasses 5
values |
|---|---|---|---|---|---|
python | def f_gold ( arr , n ) :
if ( n == 1 ) :
return arr [ 0 ]
dec = [ 0 for i in range ( n + 1 ) ]
inc = [ 0 for i in range ( n + 1 ) ]
dec [ 0 ] = inc [ 0 ] = arr [ 0 ]
flag = 0
for i in range ( 1 , n ) :
for j in range ( i ) :
if ( arr [ j ] > arr [ i ] ) :
dec [ i ] = max ( dec [ i ] , inc [ j ] + arr [ i ] )
flag = 1
elif ( arr [ j ] < arr [ i ] and flag == 1 ) :
inc [ i ] = max ( inc [ i ] , dec [ j ] + arr [ i ] )
result = - 2147483648
for i in range ( n ) :
if ( result < inc [ i ] ) :
result = inc [ i ]
if ( result < dec [ i ] ) :
result = dec [ i ]
return result
2147483648
for i in range ( n ) :
if ( result < inc [ i ] ) :
result = inc [ i ]
if ( result < dec [ i ] ) :
result = dec [ i ]
return result
#TOFILL
if __name__ == '__main__':
param = [
([2, 5, 9, 15, 15, 20, 21, 26, 28, 32, 34, 38, 42, 42, 42, 46, 47, 48, 50, 54, 55, 60, 60, 61, 63, 63, 66, 74, 79, 80, 85, 91, 93],23,),
([-98],0,),
([0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1],6,),
([70, 5, 20, 22, 44, 94, 69, 89, 45, 92, 56, 58, 36, 91, 82, 95, 9, 60, 4, 34, 37, 95, 38, 47, 81, 68, 73, 15, 88, 8, 95, 28, 97, 12, 24, 5, 26, 82, 47, 88, 28, 33, 17, 28, 11, 71, 74],24,),
([-98, -96, -94, -94, -92, -86, -86, -84, -82, -68, -66, -66, -50, -48, -46, -36, -26, -8, -6, 8, 14, 16, 18, 22, 32, 48, 48, 50, 62, 70, 70, 74, 78, 78, 84, 86, 92, 94, 98],32,),
([0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1],5,),
([1, 2, 8, 8, 12, 14, 19, 24, 25, 32, 36, 45, 47, 53, 54, 56, 56, 58, 59, 60, 65, 68, 86, 86, 91, 98],13,),
([-94, 88, 94, 78, -34, 84, -32, 68, -72, 80],7,),
([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1],30,),
([76, 62, 62, 61, 63, 15, 61, 74, 50, 86, 60, 35, 91, 32, 93, 14, 52, 18, 14, 39],18,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
print("#Results: %i, %i" % (n_success, len(param))) | def f_gold ( arr , n ) : if ( n == 1 ) : return arr [ 0 ] dec = [ 0 for i in range ( n + 1 ) ] inc = [ 0 for i in range ( n + 1 ) ] dec [ 0 ] = inc [ 0 ] = arr [ 0 ] flag = 0 for i in range ( 1 , n ) : for j in range ( i ) : if ( arr [ j ] > arr [ i ] ) : dec [ i ] = max ( dec [ i ] , inc [ j ] + arr [ i ] ) flag = 1 elif ( arr [ j ] [MASK] arr [ i ] and flag == 1 ) : inc [ i ] = max ( inc [ i ] , dec [ j ] + arr [ i ] ) result = - 2147483648 for i in range ( n ) : if ( result < inc [ i ] ) : result = inc [ i ] if ( result < dec [ i ] ) : result = dec [ i ] return result 2147483648
for i in range ( n ) :
if ( result < inc [ i ] ) :
result = inc [ i ]
if ( result < dec [ i ] ) :
result = dec [ i ]
return result
#TOFILL
if __name__ == '__main__':
param = [
([2, 5, 9, 15, 15, 20, 21, 26, 28, 32, 34, 38, 42, 42, 42, 46, 47, 48, 50, 54, 55, 60, 60, 61, 63, 63, 66, 74, 79, 80, 85, 91, 93],23,),
([-98],0,),
([0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1],6,),
([70, 5, 20, 22, 44, 94, 69, 89, 45, 92, 56, 58, 36, 91, 82, 95, 9, 60, 4, 34, 37, 95, 38, 47, 81, 68, 73, 15, 88, 8, 95, 28, 97, 12, 24, 5, 26, 82, 47, 88, 28, 33, 17, 28, 11, 71, 74],24,),
([-98, -96, -94, -94, -92, -86, -86, -84, -82, -68, -66, -66, -50, -48, -46, -36, -26, -8, -6, 8, 14, 16, 18, 22, 32, 48, 48, 50, 62, 70, 70, 74, 78, 78, 84, 86, 92, 94, 98],32,),
([0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1],5,),
([1, 2, 8, 8, 12, 14, 19, 24, 25, 32, 36, 45, 47, 53, 54, 56, 56, 58, 59, 60, 65, 68, 86, 86, 91, 98],13,),
([-94, 88, 94, 78, -34, 84, -32, 68, -72, 80],7,),
([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1],30,),
([76, 62, 62, 61, 63, 15, 61, 74, 50, 86, 60, 35, 91, 32, 93, 14, 52, 18, 14, 39],18,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
print("#Results: %i, %i" % (n_success, len(param))) | < | [
"a) 1",
"b) <",
"c) int",
"d) >>",
"e) ("
] | b |
python | def f_gold(n):
k = n
imin = 1
ans = 0
while (imin <= n):
imax = n / k
ans += k * (imax - imin + 1)
imin = imax + 1
k = n / imin
return ans
def f_gold(n):
k = n
imin = 1
ans = 0
while (imin <= n):
imax = n / k
ans += k * (imax - imin + 1)
imin = imax + 1
k = n / imin
return ans
#TOFILL
if __name__ == '__main__':
param = [
(17,),
(72,),
(43,),
(55,),
(62,),
(22,),
(17,),
(68,),
(20,),
(29,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success += 1
print("#Results: %i, %i" % (n_success, len(param)))
| def f_gold(n): k = n imin = 1 ans = 0 while (imin <= n): imax = n / k ans += k * (imax - imin + 1) [MASK] = imax + 1 k = n / imin return ansdef f_gold(n):
k = n
imin = 1
ans = 0
while (imin <= n):
imax = n / k
ans += k * (imax - imin + 1)
imin = imax + 1
k = n / imin
return ans
#TOFILL
if __name__ == '__main__':
param = [
(17,),
(72,),
(43,),
(55,),
(62,),
(22,),
(17,),
(68,),
(20,),
(29,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success += 1
print("#Results: %i, %i" % (n_success, len(param)))
| imin | [
"a) n",
"b) abs",
"c) *",
"d) imin",
"e) sizeof"
] | d |
python | import math
def f_gold ( n ) :
count = 0
if ( n % 2 == 0 ) :
count = count + 1
while ( n % 2 == 0 ) :
n = int ( n / 2 )
i = 3
while ( i <= int ( math.sqrt ( n ) ) ) :
if ( n % i == 0 ) :
count = count + 1
while ( n % i == 0 ) :
n = int ( n / i )
i = i + 2
if ( n > 2 ) :
count = count + 1
return count
i == 0 ) :
count = count + 1
while ( n % i == 0 ) :
n = int ( n / i )
i = i + 2
if ( n > 2 ) :
count = count + 1
return count
#TOFILL
if __name__ == '__main__':
param = [
(99,),
(33,),
(50,),
(17,),
(18,),
(69,),
(23,),
(18,),
(94,),
(16,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
print("#Results: %i, %i" % (n_success, len(param))) | import math def f_gold ( n ) : count = 0 if [MASK] n % 2 == 0 ) : count = count + 1 while ( n % 2 == 0 ) : n = int ( n / 2 ) i = 3 while ( i <= int ( math.sqrt ( n ) ) ) : if ( n % i == 0 ) : count = count + 1 while ( n % i == 0 ) : n = int ( n / i ) i = i + 2 if ( n > 2 ) : count = count + 1 return count i == 0 ) :
count = count + 1
while ( n % i == 0 ) :
n = int ( n / i )
i = i + 2
if ( n > 2 ) :
count = count + 1
return count
#TOFILL
if __name__ == '__main__':
param = [
(99,),
(33,),
(50,),
(17,),
(18,),
(69,),
(23,),
(18,),
(94,),
(16,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
print("#Results: %i, %i" % (n_success, len(param))) | ( | [
"a) (",
"b) *(int*)b",
"c) n",
"d) i",
"e) }"
] | a |
python | def f_gold ( arr1 , arr2 , m , n ) :
i = 0
j = 0
if m < n :
return 0
arr1.sort ( )
arr2.sort ( )
while i < n and j < m :
if arr1 [ j ] < arr2 [ i ] :
j += 1
elif arr1 [ j ] == arr2 [ i ] :
j += 1
i += 1
elif arr1 [ j ] > arr2 [ i ] :
return 0
return False if i < n else True
j += 1
elif arr1 [ j ] == arr2 [ i ] :
j += 1
i += 1
elif arr1 [ j ] > arr2 [ i ] :
return 0
return False if i < n else True
#TOFILL
if __name__ == '__main__':
param = [
([7, 10, 10, 10, 13, 17, 23, 24, 25, 28, 30, 33, 37, 49, 49, 50, 57, 60, 60, 63, 63, 64, 65, 65, 72, 81, 84, 85, 85, 94, 96],
[10,13,17,63],29,4,),
([12, 30, -94, -92, -62, -18, -56, 44, -50, -92, 6, 2, 56, -90, 0, 0, 18, 86, -58, 58, -54, 62, -94, 94, 0, 8, 82, -68, -88, -18, 8, -80, -42, 18, 62, -8, 56, -76, -42, 56, 44, -2, -20, 62, -14, 74, -86, -76],
[12, -18, 44],46,3,),
([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1],
[0,0,0],34,3,),
([94, 26, 32, 20, 46, 55, 9, 51, 57, 80, 45, 38, 68, 12, 90, 10, 80, 65, 12, 52, 51, 86, 64, 57, 93, 19, 30, 92, 85, 82, 24, 26, 36, 56],
[80,58,32,2],17,4,),
([-98, -90, -86, -86, -84, -84, -82, -80, -78, -72, -70, -68, -66, -64, -52, -52, -50, -38, -28, -26, -24, -14, -8, 16, 26, 26, 28, 34, 36, 40, 42, 44, 44, 46, 50, 60, 68, 78, 80, 86, 90, 92, 98],
[-99,-90,-90,-86],23,4,),
([1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1],
[0,0,1,1],10,4,),
([6, 8, 11, 13, 14, 26, 26, 41, 48, 70, 82, 83, 84, 88, 96],
[1,9,12,16],10,4,),
([-88, 80, 62, 76, 48, 92, 18, -94, -62, 98, -46, -50, 70, 32, 68, -54, 26, 16, 94, 0, -84, 2, -16, 88, 26, -38, 18, 64, 90, 80, 76, 2, 14, -90, 50, 4, 76, 30],
[-76,-54,4,78],27,4,),
([0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1],
[0,1,0,1],10,4,),
([54, 44, 97, 92, 13, 54, 27, 8, 43, 70, 77, 84, 55, 64, 5, 59, 27, 19, 65, 68, 66, 26, 33, 38, 7],
[93,5,9,13],19,4,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
print("#Results: %i, %i" % (n_success, len(param))) | def f_gold ( arr1 , arr2 , m , n ) : i = 0 j = 0 if m < n : return 0 arr1.sort ( ) arr2.sort ( ) while i < n and j < m : if arr1 [ j ] < arr2 [ i ] : j += 1 elif arr1 [ j ] == [MASK] [ i ] : j += 1 i += 1 elif arr1 [ j ] > arr2 [ i ] : return 0 return False if i < n else True j += 1
elif arr1 [ j ] == arr2 [ i ] :
j += 1
i += 1
elif arr1 [ j ] > arr2 [ i ] :
return 0
return False if i < n else True
#TOFILL
if __name__ == '__main__':
param = [
([7, 10, 10, 10, 13, 17, 23, 24, 25, 28, 30, 33, 37, 49, 49, 50, 57, 60, 60, 63, 63, 64, 65, 65, 72, 81, 84, 85, 85, 94, 96],
[10,13,17,63],29,4,),
([12, 30, -94, -92, -62, -18, -56, 44, -50, -92, 6, 2, 56, -90, 0, 0, 18, 86, -58, 58, -54, 62, -94, 94, 0, 8, 82, -68, -88, -18, 8, -80, -42, 18, 62, -8, 56, -76, -42, 56, 44, -2, -20, 62, -14, 74, -86, -76],
[12, -18, 44],46,3,),
([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1],
[0,0,0],34,3,),
([94, 26, 32, 20, 46, 55, 9, 51, 57, 80, 45, 38, 68, 12, 90, 10, 80, 65, 12, 52, 51, 86, 64, 57, 93, 19, 30, 92, 85, 82, 24, 26, 36, 56],
[80,58,32,2],17,4,),
([-98, -90, -86, -86, -84, -84, -82, -80, -78, -72, -70, -68, -66, -64, -52, -52, -50, -38, -28, -26, -24, -14, -8, 16, 26, 26, 28, 34, 36, 40, 42, 44, 44, 46, 50, 60, 68, 78, 80, 86, 90, 92, 98],
[-99,-90,-90,-86],23,4,),
([1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1],
[0,0,1,1],10,4,),
([6, 8, 11, 13, 14, 26, 26, 41, 48, 70, 82, 83, 84, 88, 96],
[1,9,12,16],10,4,),
([-88, 80, 62, 76, 48, 92, 18, -94, -62, 98, -46, -50, 70, 32, 68, -54, 26, 16, 94, 0, -84, 2, -16, 88, 26, -38, 18, 64, 90, 80, 76, 2, 14, -90, 50, 4, 76, 30],
[-76,-54,4,78],27,4,),
([0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1],
[0,1,0,1],10,4,),
([54, 44, 97, 92, 13, 54, 27, 8, 43, 70, 77, 84, 55, 64, 5, 59, 27, 19, 65, 68, 66, 26, 33, 38, 7],
[93,5,9,13],19,4,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
print("#Results: %i, %i" % (n_success, len(param))) | arr2 | [
"a) arr2",
"b) <limits.h>",
"c) num",
"d) void",
"e) A"
] | a |
python | def f_gold ( l , w ) :
return ( 2 * ( l + w ) )
ghts reserved.
#
# This source code is licensed under the license found in the
# LICENSE file in the root directory of this source tree.
#
def f_gold ( l , w ) :
return ( 2 * ( l + w ) )
#TOFILL
if __name__ == '__main__':
param = [
(58,39,),
(37,49,),
(56,52,),
(22,43,),
(77,12,),
(34,31,),
(74,54,),
(37,52,),
(21,37,),
(75,30,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
print("#Results: %i, %i" % (n_success, len(param))) | def f_gold ( l , w ) : return ( [MASK] * ( l + w ) )ghts reserved.
#
# This source code is licensed under the license found in the
# LICENSE file in the root directory of this source tree.
#
def f_gold ( l , w ) :
return ( 2 * ( l + w ) )
#TOFILL
if __name__ == '__main__':
param = [
(58,39,),
(37,49,),
(56,52,),
(22,43,),
(77,12,),
(34,31,),
(74,54,),
(37,52,),
(21,37,),
(75,30,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
print("#Results: %i, %i" % (n_success, len(param))) | 2 | [
"a) 1",
"b) 2",
"c) )",
"d) <",
"e) :"
] | b |
python | def f_gold ( n ) :
return 1 if ( n == 1 or n == 0 ) else n * f_gold ( n - 1 )
code is licensed under the license found in the
# LICENSE file in the root directory of this source tree.
#
def f_gold ( n ) :
return 1 if ( n == 1 or n == 0 ) else n * f_gold ( n - 1 )
#TOFILL
if __name__ == '__main__':
param = [
(66,),
(93,),
(39,),
(93,),
(68,),
(20,),
(37,),
(52,),
(52,),
(19,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
print("#Results: %i, %i" % (n_success, len(param))) | def f_gold ( n ) : [MASK] 1 if ( n == 1 or n == 0 ) else n * f_gold ( n - 1 ) code is licensed under the license found in the
# LICENSE file in the root directory of this source tree.
#
def f_gold ( n ) :
return 1 if ( n == 1 or n == 0 ) else n * f_gold ( n - 1 )
#TOFILL
if __name__ == '__main__':
param = [
(66,),
(93,),
(39,),
(93,),
(68,),
(20,),
(37,),
(52,),
(52,),
(19,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
print("#Results: %i, %i" % (n_success, len(param))) | return | [
"a) )",
"b) return",
"c) n",
"d) =",
"e) str1"
] | b |
python | import math
def f_gold ( base , area ) :
return math.ceil ( ( 2 * area ) / base )
is licensed under the license found in the
# LICENSE file in the root directory of this source tree.
#
import math
def f_gold ( base , area ) :
return math.ceil ( ( 2 * area ) / base )
#TOFILL
if __name__ == '__main__':
param = [
(1657.0629620116251,1493.9165309072955,),
(9124.969801011524,1805.1693004732417,),
(939.4442550679516,4002.523220001232,),
(1696.1076035017763,1305.681153243279,),
(3624.090070396748,9193.838698730207,),
(304.33897626625406,2077.168327165032,),
(8242.270129715309,2452.3562706401203,),
(4410.9174799683105,985.4222263517964,),
(7951.742385610694,7364.610274987048,),
(1280.6368084273633,9479.625581022658,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if abs(1 - (0.0000001 + abs(f_gold(*parameters_set))) / (abs(f_filled(*parameters_set)) + 0.0000001)) < 0.001:
n_success+=1
print("#Results: %i, %i" % (n_success, len(param))) | import math def f_gold ( base , area ) : return [MASK] ( ( 2 * area ) / base ) is licensed under the license found in the
# LICENSE file in the root directory of this source tree.
#
import math
def f_gold ( base , area ) :
return math.ceil ( ( 2 * area ) / base )
#TOFILL
if __name__ == '__main__':
param = [
(1657.0629620116251,1493.9165309072955,),
(9124.969801011524,1805.1693004732417,),
(939.4442550679516,4002.523220001232,),
(1696.1076035017763,1305.681153243279,),
(3624.090070396748,9193.838698730207,),
(304.33897626625406,2077.168327165032,),
(8242.270129715309,2452.3562706401203,),
(4410.9174799683105,985.4222263517964,),
(7951.742385610694,7364.610274987048,),
(1280.6368084273633,9479.625581022658,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if abs(1 - (0.0000001 + abs(f_gold(*parameters_set))) / (abs(f_filled(*parameters_set)) + 0.0000001)) < 0.001:
n_success+=1
print("#Results: %i, %i" % (n_success, len(param))) | math.ceil | [
"a) <",
"b) )",
"c) ;",
"d) math.ceil",
"e) :"
] | d |
python | def f_gold ( a , n , l , r ) :
count = 0
for i in range ( l , r ) :
if ( a [ i ] == a [ i + 1 ] ) :
count += 1
return count
t directory of this source tree.
#
def f_gold ( a , n , l , r ) :
count = 0
for i in range ( l , r ) :
if ( a [ i ] == a [ i + 1 ] ) :
count += 1
return count
#TOFILL
if __name__ == '__main__':
param = [
([4, 13, 13, 16, 16, 19, 39, 41, 48, 52, 57, 62, 65, 67, 76, 84, 88, 91, 95, 96, 97, 98],18,12,17,),
([62, 76, 86, -8, 84, -6, 72, 84, 6, -50, -18, -94, 54, 90, -74, -64, -26, -14, -32, 62, 10, 4, 70, -28, 8, 18, 4, -62, -76, 84, -78, -4, 84, 98, 58, -68, 42, -6, 34, -38, 52, -84, 78],32,38,23,),
([0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1],10,6,6,),
([11, 75, 98, 29, 62, 53, 48, 91, 86, 66, 48, 94],8,6,6,),
([-94, -84, -70, -70, -40, -40, -36, -24, 10, 48, 62, 74],11,7,8,),
([1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0],36,40,37,),
([1, 2, 6, 7, 10, 11, 13, 19, 19, 25, 29, 30, 32, 34, 35, 45, 45, 46, 47, 48, 48, 53, 58, 61, 64, 65, 67, 75, 76, 81, 81, 84, 84, 85, 86, 94, 94, 96, 99],25,19,37,),
([-56, 42, -34, -12, -86, 82, -96, -66, 30, 16, -40, 72, 84, 94, -48, -30, 26, 50, 42, -44, -50, 22, -38, 8, 34, 94, 2, 16, -32, 18, -58, 12, -26, 28, -62],21,30,26,),
([0, 0, 0, 0, 1, 1, 1],4,5,5,),
([6, 29],1,1,1,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
print("#Results: %i, %i" % (n_success, len(param))) | def f_gold ( a , n , l , r ) : count = 0 for i in range ( [MASK] , r ) : if ( a [ i ] == a [ i + 1 ] ) : count += 1 return countt directory of this source tree.
#
def f_gold ( a , n , l , r ) :
count = 0
for i in range ( l , r ) :
if ( a [ i ] == a [ i + 1 ] ) :
count += 1
return count
#TOFILL
if __name__ == '__main__':
param = [
([4, 13, 13, 16, 16, 19, 39, 41, 48, 52, 57, 62, 65, 67, 76, 84, 88, 91, 95, 96, 97, 98],18,12,17,),
([62, 76, 86, -8, 84, -6, 72, 84, 6, -50, -18, -94, 54, 90, -74, -64, -26, -14, -32, 62, 10, 4, 70, -28, 8, 18, 4, -62, -76, 84, -78, -4, 84, 98, 58, -68, 42, -6, 34, -38, 52, -84, 78],32,38,23,),
([0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1],10,6,6,),
([11, 75, 98, 29, 62, 53, 48, 91, 86, 66, 48, 94],8,6,6,),
([-94, -84, -70, -70, -40, -40, -36, -24, 10, 48, 62, 74],11,7,8,),
([1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0],36,40,37,),
([1, 2, 6, 7, 10, 11, 13, 19, 19, 25, 29, 30, 32, 34, 35, 45, 45, 46, 47, 48, 48, 53, 58, 61, 64, 65, 67, 75, 76, 81, 81, 84, 84, 85, 86, 94, 94, 96, 99],25,19,37,),
([-56, 42, -34, -12, -86, 82, -96, -66, 30, 16, -40, 72, 84, 94, -48, -30, 26, 50, 42, -44, -50, 22, -38, 8, 34, 94, 2, 16, -32, 18, -58, 12, -26, 28, -62],21,30,26,),
([0, 0, 0, 0, 1, 1, 1],4,5,5,),
([6, 29],1,1,1,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
print("#Results: %i, %i" % (n_success, len(param))) | l | [
"a) ,",
"b) l",
"c) )",
"d) )",
"e) i"
] | b |
python | def f_gold ( arr , low , high , x ) :
if ( low > high ) :
return - 1
if ( x >= arr [ high ] ) :
return high
mid = int ( ( low + high ) / 2 )
if ( arr [ mid ] == x ) :
return mid
if ( mid > 0 and arr [ mid - 1 ] <= x and x < arr [ mid ] ) :
return mid - 1
if ( x < arr [ mid ] ) :
return f_gold ( arr , low , mid - 1 , x )
return f_gold ( arr , mid + 1 , high , x )
[ mid - 1 ] <= x and x < arr [ mid ] ) :
return mid - 1
if ( x < arr [ mid ] ) :
return f_gold ( arr , low , mid - 1 , x )
return f_gold ( arr , mid + 1 , high , x )
#TOFILL
if __name__ == '__main__':
param = [
([5, 11, 20, 42, 42, 55, 58, 98, 99],5,7,6,),
([50, -90, -38, -46, -10, -22, -66, 72, -52, 38, 90, 34, -12, -44, -6, 0, -20, -38, 86, 26, 64, -24, 40, 90, -26, -2, -28, 12, 22, -14],26,28,23,),
([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1],11,9,18,),
([69, 28, 68, 98, 24, 67, 86, 2, 18, 22, 44, 77, 52, 62, 24, 46],15,11,13,),
([-96, -94, -88, -84, -68, -60, -52, -52, -42, -34, -32, -16, -12, -6, -6, -4, -2, 0, 16, 18, 38, 58, 70, 72, 76, 78, 90, 92, 98],22,27,20,),
([0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0],24,15,26,),
([1, 6, 7, 9, 10, 11, 19, 19, 22, 22, 26, 34, 36, 37, 37, 38, 39, 40, 49, 54, 60, 62, 65, 67, 71, 76, 78, 79, 82, 82, 89, 95, 97],22,26,25,),
([76, -32, -98, -18, -80, 74, -22, -82, 40, -64, 58, -18, -64, 34, -44, -82, -46, 62, -80, -76, 32, 44, -32, 98, -26, 62, 16, 86, -52, -72, -90, -30, 6],28,31,24,),
([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1],28,29,30,),
([81, 69, 15, 52, 49, 54, 18, 92, 33, 21, 91, 21, 5, 25, 77, 92, 26, 58, 72, 55, 76, 18, 13, 59, 9, 12, 31, 24, 36, 33, 71, 87, 55, 19, 42, 25],35,19,33,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
print("#Results: %i, %i" % (n_success, len(param))) | def f_gold ( arr , low , high , x ) : if ( low > high ) : return - 1 if ( x >= arr [ high ] ) : return high mid = int ( ( low + high ) / 2 ) if ( arr [ mid ] [MASK] x ) : return mid if ( mid > 0 and arr [ mid - 1 ] <= x and x < arr [ mid ] ) : return mid - 1 if ( x < arr [ mid ] ) : return f_gold ( arr , low , mid - 1 , x ) return f_gold ( arr , mid + 1 , high , x ) [ mid - 1 ] <= x and x < arr [ mid ] ) :
return mid - 1
if ( x < arr [ mid ] ) :
return f_gold ( arr , low , mid - 1 , x )
return f_gold ( arr , mid + 1 , high , x )
#TOFILL
if __name__ == '__main__':
param = [
([5, 11, 20, 42, 42, 55, 58, 98, 99],5,7,6,),
([50, -90, -38, -46, -10, -22, -66, 72, -52, 38, 90, 34, -12, -44, -6, 0, -20, -38, 86, 26, 64, -24, 40, 90, -26, -2, -28, 12, 22, -14],26,28,23,),
([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1],11,9,18,),
([69, 28, 68, 98, 24, 67, 86, 2, 18, 22, 44, 77, 52, 62, 24, 46],15,11,13,),
([-96, -94, -88, -84, -68, -60, -52, -52, -42, -34, -32, -16, -12, -6, -6, -4, -2, 0, 16, 18, 38, 58, 70, 72, 76, 78, 90, 92, 98],22,27,20,),
([0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0],24,15,26,),
([1, 6, 7, 9, 10, 11, 19, 19, 22, 22, 26, 34, 36, 37, 37, 38, 39, 40, 49, 54, 60, 62, 65, 67, 71, 76, 78, 79, 82, 82, 89, 95, 97],22,26,25,),
([76, -32, -98, -18, -80, 74, -22, -82, 40, -64, 58, -18, -64, 34, -44, -82, -46, 62, -80, -76, 32, 44, -32, 98, -26, 62, 16, 86, -52, -72, -90, -30, 6],28,31,24,),
([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1],28,29,30,),
([81, 69, 15, 52, 49, 54, 18, 92, 33, 21, 91, 21, 5, 25, 77, 92, 26, 58, 72, 55, 76, 18, 13, 59, 9, 12, 31, 24, 36, 33, 71, 87, 55, 19, 42, 25],35,19,33,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
print("#Results: %i, %i" % (n_success, len(param))) | == | [
"a) public",
"b) <cstdlib>",
"c) int",
"d) ==",
"e) ="
] | d |
python | def f_gold ( n ) :
if ( n == 0 or n == 9 ) :
return True
if ( n < 9 ) :
return False
return f_gold ( ( int ) ( n >> 3 ) - ( int ) ( n & 7 ) )
this source tree.
#
def f_gold ( n ) :
if ( n == 0 or n == 9 ) :
return True
if ( n < 9 ) :
return False
return f_gold ( ( int ) ( n >> 3 ) - ( int ) ( n & 7 ) )
#TOFILL
if __name__ == '__main__':
param = [
(96,),
(85,),
(54,),
(14,),
(47,),
(11,),
(49,),
(99,),
(28,),
(82,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
print("#Results: %i, %i" % (n_success, len(param))) | def f_gold [MASK] n ) : if ( n == 0 or n == 9 ) : return True if ( n < 9 ) : return False return f_gold ( ( int ) ( n >> 3 ) - ( int ) ( n & 7 ) ) this source tree.
#
def f_gold ( n ) :
if ( n == 0 or n == 9 ) :
return True
if ( n < 9 ) :
return False
return f_gold ( ( int ) ( n >> 3 ) - ( int ) ( n & 7 ) )
#TOFILL
if __name__ == '__main__':
param = [
(96,),
(85,),
(54,),
(14,),
(47,),
(11,),
(49,),
(99,),
(28,),
(82,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
print("#Results: %i, %i" % (n_success, len(param))) | ( | [
"a) )",
"b) {",
"c) //",
"d) (",
"e) \"a\";"
] | d |
python | def f_gold ( x , y , z ) :
if ( not ( y / x ) ) :
return y if ( not ( y / z ) ) else z
return x if ( not ( x / z ) ) else z
file in the root directory of this source tree.
#
def f_gold ( x , y , z ) :
if ( not ( y / x ) ) :
return y if ( not ( y / z ) ) else z
return x if ( not ( x / z ) ) else z
#TOFILL
if __name__ == '__main__':
param = [
(48,63,56,),
(11,55,84,),
(50,89,96,),
(21,71,74,),
(94,39,42,),
(22,44,86,),
(3,41,68,),
(67,62,94,),
(59,2,83,),
(50,11,1,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
print("#Results: %i, %i" % (n_success, len(param))) | def f_gold ( x , y , z ) : if ( not ( y / x ) ) : return y if ( not ( y / z ) ) else z return x if [MASK] not ( x / z ) ) else z file in the root directory of this source tree.
#
def f_gold ( x , y , z ) :
if ( not ( y / x ) ) :
return y if ( not ( y / z ) ) else z
return x if ( not ( x / z ) ) else z
#TOFILL
if __name__ == '__main__':
param = [
(48,63,56,),
(11,55,84,),
(50,89,96,),
(21,71,74,),
(94,39,42,),
(22,44,86,),
(3,41,68,),
(67,62,94,),
(59,2,83,),
(50,11,1,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
print("#Results: %i, %i" % (n_success, len(param))) | ( | [
"a) <cstdlib>",
"b) return",
"c) {",
"d) (",
"e) while"
] | d |
python | import sys
def f_gold ( str1 ) :
n = len ( str1 ) ;
C = [ 0 ] * ( n + 1 ) ;
P = [ [ False for x in range ( n + 1 ) ] for y in range ( n + 1 ) ] ;
for i in range ( n ) :
P [ i ] [ i ] = True ;
for L in range ( 2 , n + 1 ) :
for i in range ( n - L + 1 ) :
j = i + L - 1 ;
if ( L == 2 ) :
P [ i ] [ j ] = ( str1 [ i ] == str1 [ j ] ) ;
else :
P [ i ] [ j ] = ( ( str1 [ i ] == str1 [ j ] ) and P [ i + 1 ] [ j - 1 ] ) ;
for i in range ( n ) :
if ( P [ 0 ] [ i ] == True ) :
C [ i ] = 0 ;
else :
C [ i ] = sys.maxsize ;
for j in range ( i ) :
if ( P [ j + 1 ] [ i ] == True and 1 + C [ j ] < C [ i ] ) :
C [ i ] = 1 + C [ j ] ;
return C [ n - 1 ] ;
maxsize ;
for j in range ( i ) :
if ( P [ j + 1 ] [ i ] == True and 1 + C [ j ] < C [ i ] ) :
C [ i ] = 1 + C [ j ] ;
return C [ n - 1 ] ;
#TOFILL
if __name__ == '__main__':
param = [
('YYGWgYrovdsh',),
('56109778',),
('101',),
('RxM',),
('187546405',),
('0110010',),
('wVODAmgvI',),
('56719',),
('10100011001100',),
('Wtpai',)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
print("#Results: %i, %i" % (n_success, len(param))) | import sys def f_gold ( str1 ) : n = len ( str1 ) ; C = [ 0 ] * ( n + 1 ) ; P = [ [ False for x in range ( n + 1 ) ] for y in range ( n + 1 ) ] ; for i in range ( n ) : P [ i ] [ i ] = True ; for L in range ( 2 , n + 1 ) : for i in range ( n - L + 1 ) : j = i + L - 1 ; if ( L == 2 ) : P [ i [MASK] [ j ] = ( str1 [ i ] == str1 [ j ] ) ; else : P [ i ] [ j ] = ( ( str1 [ i ] == str1 [ j ] ) and P [ i + 1 ] [ j - 1 ] ) ; for i in range ( n ) : if ( P [ 0 ] [ i ] == True ) : C [ i ] = 0 ; else : C [ i ] = sys.maxsize ; for j in range ( i ) : if ( P [ j + 1 ] [ i ] == True and 1 + C [ j ] < C [ i ] ) : C [ i ] = 1 + C [ j ] ; return C [ n - 1 ] ;maxsize ;
for j in range ( i ) :
if ( P [ j + 1 ] [ i ] == True and 1 + C [ j ] < C [ i ] ) :
C [ i ] = 1 + C [ j ] ;
return C [ n - 1 ] ;
#TOFILL
if __name__ == '__main__':
param = [
('YYGWgYrovdsh',),
('56109778',),
('101',),
('RxM',),
('187546405',),
('0110010',),
('wVODAmgvI',),
('56719',),
('10100011001100',),
('Wtpai',)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
print("#Results: %i, %i" % (n_success, len(param))) | ] | [
"a) return",
"b) ]",
"c) (",
"d) <fstream>",
"e) j"
] | b |
python | def f_gold ( h , m ) :
if ( h < 0 or m < 0 or h > 12 or m > 60 ) :
print ( 'Wrong input' )
if ( h == 12 ) :
h = 0
if ( m == 60 ) :
m = 0
hour_angle = 0.5 * ( h * 60 + m )
minute_angle = 6 * m
angle = abs ( hour_angle - minute_angle )
angle = min ( 360 - angle , angle )
return angle
== 60 ) :
m = 0
hour_angle = 0.5 * ( h * 60 + m )
minute_angle = 6 * m
angle = abs ( hour_angle - minute_angle )
angle = min ( 360 - angle , angle )
return angle
#TOFILL
if __name__ == '__main__':
param = [
(7322.337365895532,6996.326968156217,),
(-0.5025472034247969,-2910.070017192333,),
(8735.336068205026,1910.3752934680874,),
(-5478.862697905712,-9470.18148108585,),
(8264.126919165505,7058.937313484608,),
(-9671.311773842834,-3867.070379361206,),
(9995.328351000411,2145.339179488316,),
(-5274.574323066984,-3583.7503371694124,),
(1310.8711644223736,5214.059687285893,),
(-2829.678131972794,-9371.556600288217,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
print("#Results: %i, %i" % (n_success, len(param))) | def f_gold ( h , m ) : if ( h < 0 or m < 0 or [MASK] > 12 or m > 60 ) : print ( 'Wrong input' ) if ( h == 12 ) : h = 0 if ( m == 60 ) : m = 0 hour_angle = 0.5 * ( h * 60 + m ) minute_angle = 6 * m angle = abs ( hour_angle - minute_angle ) angle = min ( 360 - angle , angle ) return angle == 60 ) :
m = 0
hour_angle = 0.5 * ( h * 60 + m )
minute_angle = 6 * m
angle = abs ( hour_angle - minute_angle )
angle = min ( 360 - angle , angle )
return angle
#TOFILL
if __name__ == '__main__':
param = [
(7322.337365895532,6996.326968156217,),
(-0.5025472034247969,-2910.070017192333,),
(8735.336068205026,1910.3752934680874,),
(-5478.862697905712,-9470.18148108585,),
(8264.126919165505,7058.937313484608,),
(-9671.311773842834,-3867.070379361206,),
(9995.328351000411,2145.339179488316,),
(-5274.574323066984,-3583.7503371694124,),
(1310.8711644223736,5214.059687285893,),
(-2829.678131972794,-9371.556600288217,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
print("#Results: %i, %i" % (n_success, len(param))) | h | [
"a) 2",
"b) h",
"c) >>",
"d) (",
"e) ++"
] | b |
python | def f_gold ( l , b , h ) :
return ( ( l * b * h ) / 2 )
erved.
#
# This source code is licensed under the license found in the
# LICENSE file in the root directory of this source tree.
#
def f_gold ( l , b , h ) :
return ( ( l * b * h ) / 2 )
#TOFILL
if __name__ == '__main__':
param = [
(8448.900678262902,8135.461799983198,6577.239053611328,),
(-1849.728957491451,-4240.89241631363,-9953.518310747193,),
(412.667844022232,9798.083992381831,1449.9204200270522,),
(-5954.835911765373,-661.8872499003203,-8049.6051526695055,),
(8437.913444665008,8182.675681595904,9863.296545513396,),
(-7183.181663518317,-6846.746446198541,-971.2199894221352,),
(2340.7905920227954,5479.00956987109,7073.449591910562,),
(-7281.157547371143,-615.8705455524116,-3343.0245192607968,),
(471.3930826982504,1357.3753126091392,1907.815700915636,),
(-7550.426360065503,-2693.2262997056355,-9110.64755244532,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if abs(1 - (0.0000001 + abs(f_gold(*parameters_set))) / (abs(f_filled(*parameters_set)) + 0.0000001)) < 0.001:
n_success+=1
print("#Results: %i, %i" % (n_success, len(param))) | [MASK] f_gold ( l , b , h ) : return ( ( l * b * h ) / 2 )erved.
#
# This source code is licensed under the license found in the
# LICENSE file in the root directory of this source tree.
#
def f_gold ( l , b , h ) :
return ( ( l * b * h ) / 2 )
#TOFILL
if __name__ == '__main__':
param = [
(8448.900678262902,8135.461799983198,6577.239053611328,),
(-1849.728957491451,-4240.89241631363,-9953.518310747193,),
(412.667844022232,9798.083992381831,1449.9204200270522,),
(-5954.835911765373,-661.8872499003203,-8049.6051526695055,),
(8437.913444665008,8182.675681595904,9863.296545513396,),
(-7183.181663518317,-6846.746446198541,-971.2199894221352,),
(2340.7905920227954,5479.00956987109,7073.449591910562,),
(-7281.157547371143,-615.8705455524116,-3343.0245192607968,),
(471.3930826982504,1357.3753126091392,1907.815700915636,),
(-7550.426360065503,-2693.2262997056355,-9110.64755244532,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if abs(1 - (0.0000001 + abs(f_gold(*parameters_set))) / (abs(f_filled(*parameters_set)) + 0.0000001)) < 0.001:
n_success+=1
print("#Results: %i, %i" % (n_success, len(param))) | def | [
"a) )",
"b) (",
"c) #include",
"d) def",
"e) int"
] | d |
python | def f_gold ( arr , n ) :
for i in range ( n ) :
if arr [ i ] is i :
return i
return - 1
e found in the
# LICENSE file in the root directory of this source tree.
#
def f_gold ( arr , n ) :
for i in range ( n ) :
if arr [ i ] is i :
return i
return - 1
#TOFILL
if __name__ == '__main__':
param = [
([8, 16, 21, 26, 27, 29, 34, 35, 35, 37, 38, 40, 48, 52, 58, 59, 60, 61, 63, 63, 65, 66, 69, 75, 79, 83, 86, 88, 91, 91, 96],23,),
([22, -70, 34, -44, 84, 54, 14, -88],7,),
([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1],31,),
([59, 67, 70, 34, 18, 22, 52, 95, 11, 66, 60, 24, 7, 71, 52, 88, 32, 52, 85, 81, 32, 44, 25, 51, 47, 97, 81, 33, 88, 38, 36, 54, 80, 25, 70, 27, 75, 29, 94],37,),
([-96, -96, -94, -88, -88, -82, -72, -72, -70, -70, -66, -64, -64, -62, -58, -54, -46, -44, -30, -26, -22, -8, -6, -2, 0, 26, 30, 30, 34, 42, 42, 48, 64, 76, 90, 96],34,),
([0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1],15,),
([2, 2, 4, 7, 10, 15, 16, 16, 23, 24, 27, 39, 42, 58, 60, 64, 72, 74, 78, 78, 78, 80, 80, 84, 85, 86, 88, 88, 90, 92, 93, 94, 95, 96],22,),
([-68, -48, 36, 22, -80, -48, -74, -14, 44, -46, -76, 18, -16, -36, -68, 0, -30, -56, 42, 92, 82, 64, -18, -6, -78, -86, 26, 86, 36, -66, -50, 18, -26, 48, 8],20,),
([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1],23,),
([3, 76, 99, 1, 1, 29, 9, 12, 57, 12, 74, 22, 83, 77, 39, 84, 50, 60, 36, 90, 88, 62, 79, 58, 58, 40, 44, 99, 84, 63, 23, 21, 16, 98, 68, 8, 46],35,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
print("#Results: %i, %i" % (n_success, len(param))) | def f_gold ( arr , n ) : [MASK] i in range ( n ) : if arr [ i ] is i : return i return - 1e found in the
# LICENSE file in the root directory of this source tree.
#
def f_gold ( arr , n ) :
for i in range ( n ) :
if arr [ i ] is i :
return i
return - 1
#TOFILL
if __name__ == '__main__':
param = [
([8, 16, 21, 26, 27, 29, 34, 35, 35, 37, 38, 40, 48, 52, 58, 59, 60, 61, 63, 63, 65, 66, 69, 75, 79, 83, 86, 88, 91, 91, 96],23,),
([22, -70, 34, -44, 84, 54, 14, -88],7,),
([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1],31,),
([59, 67, 70, 34, 18, 22, 52, 95, 11, 66, 60, 24, 7, 71, 52, 88, 32, 52, 85, 81, 32, 44, 25, 51, 47, 97, 81, 33, 88, 38, 36, 54, 80, 25, 70, 27, 75, 29, 94],37,),
([-96, -96, -94, -88, -88, -82, -72, -72, -70, -70, -66, -64, -64, -62, -58, -54, -46, -44, -30, -26, -22, -8, -6, -2, 0, 26, 30, 30, 34, 42, 42, 48, 64, 76, 90, 96],34,),
([0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1],15,),
([2, 2, 4, 7, 10, 15, 16, 16, 23, 24, 27, 39, 42, 58, 60, 64, 72, 74, 78, 78, 78, 80, 80, 84, 85, 86, 88, 88, 90, 92, 93, 94, 95, 96],22,),
([-68, -48, 36, 22, -80, -48, -74, -14, 44, -46, -76, 18, -16, -36, -68, 0, -30, -56, 42, 92, 82, 64, -18, -6, -78, -86, 26, 86, 36, -66, -50, 18, -26, 48, 8],20,),
([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1],23,),
([3, 76, 99, 1, 1, 29, 9, 12, 57, 12, 74, 22, 83, 77, 39, 84, 50, 60, 36, 90, 88, 62, 79, 58, 58, 40, 44, 99, 84, 63, 23, 21, 16, 98, 68, 8, 46],35,)
]
n_success = 0
for i, parameters_set in enumerate(param):
if f_filled(*parameters_set) == f_gold(*parameters_set):
n_success+=1
print("#Results: %i, %i" % (n_success, len(param))) | for | [
"a) i",
"b) for",
"c) <iostream>",
"d) return",
"e) ];"
] | b |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.