greatest_prod ):\r\n greatest_prod = temp_prod\r\n \r\n print \"The greatest product is %d\" % greatest_prod\r\n return","def probl4():\n\n largest_palindrome = 0\n for i in xrange(101, 1000):\n for j in xrange(101, 1000):\n output = i * j\n if str(output) == str(output)[::-1] and \\\n output > largest_palindrome:\n largest_palindrome = output\n return largest_palindrome","def fn(lo, hi, k):\n if lo == hi: return 0 \n while lo+1 < hi and boxes[lo] == boxes[lo+1]: lo, k = lo+1, k+1\n ans = (k+1)*(k+1) + fn(lo+1, hi, 0)\n for mid in range(lo+2, hi): \n if boxes[lo] == boxes[mid]: \n ans = max(ans, fn(lo+1, mid, 0) + fn(mid, hi, k+1))\n return ans","def rabin_miller(n, target=128):\n ###############\n ## Start your code here\n return True\n ## End of your code\n ###############","def is_acceptable_multiplier(m):\n return 1 < m < (2 ** 61 - 1)","def solution():\n i = 1\n\n while True:\n if (\n sorted(str(i))\n == sorted(str(2 * i))\n == sorted(str(3 * i))\n == sorted(str(4 * i))\n == sorted(str(5 * i))\n == sorted(str(6 * i))\n ):\n return i\n\n i += 1","def bit_smarter(limit):\n c_lengths = {}\n\n for s in range(1, limit+1):\n c_lengths[s] = s_collatz_length(s, c_lengths)\n\n return max(c_lengths, key=lambda x: c_lengths[x])","def test_swap_k_max(self):\r\n self.num2 = [1, 2, 3, 4, 5, 6]\r\n a1.swap_k(self.num2, len(self.num2)//2)\r\n self.assertEqual(self.num2, [4, 5, 6, 1, 2, 3])","def problem(num=1000000):\r\n chains = []\r\n i = 1\r\n while i < num:\r\n number = i\r\n chain = 1\r\n while number != 1:\r\n if number % 2 == 0:\r\n number /= 2\r\n else:\r\n number = 3 * number + 1\r\n chain += 1\r\n chains.append(chain)\r\n i += 1\r\n\r\n return chains.index(max(chains)) + 1","def problem9_fast(n):\n n2 = n // 2\n ulimit = ceil(sqrt(n2)) - 1\n for u in range(2, ulimit):\n if n2 % u == 0:\n nu = n2 // u\n while nu % 2 == 0:\n nu //= 2\n if u % 2 == 1:\n k = u + 2\n else:\n k = u + 1\n while k < 2 * u and k <= nu:\n if nu % k == 0 and pe_utils.gcd(k, u) == 1:\n d = n2 // (k * u)\n v = k - u\n a = (u ** 2 - v ** 2) * d\n b = 2 * u * v * d\n c = (u ** 2 + v ** 2) * d\n return a * b * c\n k += 2\n return None","def maximum_value(arr: [int], k: int) -> [int]:\n m = []\n res = []\n for i in range(len(arr)):\n if len(m) == k:\n res.append(max(m))\n if len(m) == k:\n m[i%k] = arr[i]\n else:\n m.append(arr[i])\n res.append(max(m))\n return res","def main(n=20):\n return functools.reduce(lcm, range(1, 20))","def test_hackerrank_sample1(self):\n result = find_digits(12)\n self.assertEquals(result, 2)","def constrain(value):\n size = 2**m\n return (value%size)","def chosse(n,k):\n import math \n if (n>=k and k>=0):\n return math.factorial(n) / (math.factorial(k) * math.factorial(n-k))\n else:\n return \"No se puede calcular el numero factorial indicado\"","def assertB(n, k):\n assert 0 <= k <= n\n return (factorial(n)//factorial(k))//factorial(n-k)","def maxSumOfThreeSubarrays(self, nums: List[int], k: int) -> List[int]:\n\n n = len(nums)\n if n < 3 * k or k == 0:\n return 0\n\n prefix_sum = [0]\n for num in nums:\n prefix_sum.append(prefix_sum[-1] + num)\n\n left = [0] * n\n left_i = [0] * n\n right = [0] * (n + 1) # add one to right (for case of k == 1)\n right_i = [0] * (n + 1)\n\n for i in range(k - 1, n):\n window = prefix_sum[i + 1] - prefix_sum[i + 1 - k]\n if window > left[i - 1]: # > cause we prefex left start\n left[i] = window\n left_i[i] = i - (k - 1)\n else:\n left[i] = left[i - 1]\n left_i[i] = left_i[i - 1]\n\n for i in reversed(range(n - k + 1)):\n window = prefix_sum[i + k] - prefix_sum[i]\n if window >= right[i + 1]: # >= cause we prefex left start\n right[i] = window\n right_i[i] = i\n else:\n right[i] = right[i + 1]\n right_i[i] = right_i[i + 1]\n\n max_sum = 0\n a, b, c = 0, 0, 0\n for i in range(k, n - 2 * k + 1):\n curr_sum = prefix_sum[i + k] - prefix_sum[i] + left[i - 1] + right[i + k]\n if curr_sum > max_sum:\n max_sum = curr_sum\n a, b, c = left_i[i - 1], i, right_i[i + k]\n\n return [a, b, c]","def solve(limit):\n upper_limit = ceil(sqrt(limit - 2**4 - 2**3))\n p_list = PrimeList(upper_limit)\n\n num_set = set()\n for x in p_list:\n val = limit - 2**4 - x**3\n if val < 0: continue\n lim = ceil(sqrt(val))\n for y in takewhile(lambda i: i<lim, p_list):\n val = limit - min(x,y)**4 - max(x,y)**3\n if val < 0: continue\n lim = ceil(sqrt(val))\n for z in takewhile(lambda i: i<lim, p_list):\n\n for a,b,c in permutations([x,y,z]):\n ans = a**2 + b**3 + c**4\n if ans > limit: continue\n num_set.add(ans)\n if a ==b and b == c: break\n\n return len(num_set)","def crackSafe(self, n: int, k: int) -> str:","def test_hackerrank_sample2(self):\n result = find_digits(1012)\n self.assertEquals(result, 3)"],"string":"[\n \"def main() -> int:\\n\\n a = None\\n for n, g in enumerate(gen_primes(100000, 1000000)):\\n repeat, indices = check_if_has_3_repeated_digits(str(g))\\n if repeat:\\n a = check_for_family_of_primes(repeat, indices, list(str(g)))\\n if len(a) > 7 and min(a) > 100000:\\n EULER_LOGGER.debug(f\\\"{a}\\\")\\n a = min([int(i) for i in a])\\n break\\n\\n return a\",\n \"def get_k(self, n, m):\\n k = m/n * log(2)\\n return int(k)\",\n \"def _get_m(self, ks: List[int]) -> int:\\n\\n base = 1\\n for c in ks:\\n base = base * c // gcd(base, c)\\n return base\",\n \"def solve(max_k=12000, min_k=2):\\r\\n float_inf = float('inf')\\r\\n min_ps_numbers = [float_inf] * (max_k - min_k + 1)\\r\\n\\r\\n for i in count(1):\\r\\n # I would like a better way of looking for the max than just checking to see that all values are\\r\\n # not inf, however this is only a minor portion of the runtime.\\r\\n if float_inf not in min_ps_numbers:\\r\\n break\\r\\n\\r\\n composite_factoring = factorint(i, multiple=True)\\r\\n for prod_len in range(2, len(composite_factoring) + 1):\\r\\n for multiplicative_partition in kbins(composite_factoring, prod_len, 0):\\r\\n multiplicative_partition = [prod(x) for x in multiplicative_partition]\\r\\n multiplicative_partition_sum = sum(multiplicative_partition)\\r\\n one_count = i - multiplicative_partition_sum\\r\\n k = one_count + len(multiplicative_partition)\\r\\n array_k = k - min_k\\r\\n if array_k < len(min_ps_numbers) and min_ps_numbers[array_k] > i:\\r\\n min_ps_numbers[array_k] = i\\r\\n\\r\\n return sum(set(min_ps_numbers))\",\n \"def dual_size(k_max: int):\\n n = 2 * k_max + 1\\n return n\",\n \"def findKthNumber(self, m: int, n: int, k: int) -> int:\\n l, r = 1, m * n\\n while l < r:\\n mid = l + ((r - l) >> 1)\\n\\n # Check if there are k or more values that are less than mid.\\n # For each row, its elements look like 1*i, 2*i, ... n*i, so the\\n # largest number that is less than x will be x // i. But if x is\\n # too large for the current row, the total count for this row\\n # will be n instead.\\n if sum(min(mid // r, n) for r in range(1, m + 1)) >= k:\\n # mid is our candidate.\\n r = mid\\n else:\\n l = mid + 1\\n\\n return l\",\n \"def solve_bruteforce(self):\\n max_value = -1\\n for z in range(0, self.k):\\n max_value = -1\\n max_index = -1\\n for i, v in enumerate(self.numbers):\\n if v > max_value:\\n max_index = i\\n max_value = v\\n del self.numbers[max_index]\\n\\n return max_value\",\n \"def m(self):\\n\\t\\tn = 0\\n\\t\\ti = self.k0\\n\\t\\twhile 1:\\n\\t\\t\\tif i > self.j:\\n\\t\\t\\t\\treturn n\\n\\t\\t\\tif not self.cons(i):\\n\\t\\t\\t\\tbreak\\n\\t\\t\\ti = i + 1\\n\\t\\ti = i + 1\\n\\t\\twhile 1:\\n\\t\\t\\twhile 1:\\n\\t\\t\\t\\tif i > self.j:\\n\\t\\t\\t\\t\\treturn n\\n\\t\\t\\t\\tif self.cons(i):\\n\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\ti = i + 1\\n\\t\\t\\ti = i + 1\\n\\t\\t\\tn = n + 1\\n\\t\\t\\twhile 1:\\n\\t\\t\\t\\tif i > self.j:\\n\\t\\t\\t\\t\\treturn n\\n\\t\\t\\t\\tif not self.cons(i):\\n\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\ti = i + 1\\n\\t\\t\\ti = i + 1\",\n \"def largestSubarray(self, nums: List[int], k: int) -> List[int]:\\n\\n if k == 1:\\n return [max(nums)]\\n\\n hash_map = {}\\n for i, n in enumerate(nums):\\n hash_map[n] = i\\n\\n candidates = nums[: len(nums) - k + 1]\\n print(candidates)\\n mx = max(candidates)\\n mx_idx = hash_map[mx]\\n op = nums[mx_idx : mx_idx + k]\\n return op\",\n \"def getrandbits(k: int) -> int:\\n ...\",\n \"def kaprekar_routine(num, opt=0):\\n temp = list(str(num))\\n while len(temp) < 4:\\n temp.append('0')\\n\\n if opt == 1:\\n return ''.join(sorted(temp, reverse=True))\\n elif opt == 2:\\n cnt = 0\\n if len(set(temp)) > 1:\\n while temp != ['6', '1', '7', '4']:\\n x = int(''.join(sorted(temp, reverse=True))) # max num\\n n = int(''.join(sorted(temp))) # min num\\n temp = list(str(x - n))\\n while len(temp) < 4:\\n temp.append('0')\\n cnt += 1\\n return cnt\\n else: # opt 0\\n return max(temp)\",\n \"def workersNeeded(k, m):\\n # formula: k/m\\n from math import ceil\\n return ceil(float(k)/float(m))\",\n \"def ideal_fanin(k, m):\\n fanin = 0\\n needed = k\\n for select in range(3, m + 1, 2):\\n combinations = list(itertools.combinations(range(m), select))\\n if len(combinations) <= needed:\\n fanin += int(math.ceil(float(len(combinations) * select) / m))\\n needed -= len(combinations)\\n else:\\n fanin += int(math.ceil(float(needed * select) / m))\\n needed = 0\\n if not needed:\\n break\\n return fanin\",\n \"def count_kmers_possible(read, k):\\n num_kmers = {}\\n num_kmers1 = len(read) - k + 1\\n num_kmers2 = 4**k\\n#num_kmers.append(min(num_kmers1,num_kmers2))\\n num_kmers = min(num_kmers1,num_kmers2)\\n num_kmers3 = max(num_kmers,0)\\n return(num_kmers3)\",\n \"def test_computes_max_nth_digit_by_multiples_of_ten(self):\\n\\t\\tself.assertEqual(1, products_of_multiplied_nth_digits(20, 10))\",\n \"def main():\\n limit = 1000\\n max_primes = 0\\n max_b, max_c = 0, 0\\n is_prime = sieve_of_eratosthenes_bool(limit * 100)\\n primes = sieve_of_eratosthenes(limit)\\n for c in primes:\\n for b in range(-c, limit, 2):\\n for n in count(1):\\n res = n * n + b * n + c\\n if res < 1 or not is_prime[res]:\\n if max_primes < n:\\n max_primes = n\\n max_b, max_c = b, c\\n print(max_primes, max_b, max_c, end='\\\\n')\\n break\\n print(max_b, max_c, max_b * max_c)\",\n \"def test_computes_max_nth_digit_by_multiples_of_two(self):\\t\\t\\n\\t\\tself.assertEqual(64, products_of_multiplied_nth_digits(20, 2))\",\n \"def solution(max_base: int = 5) -> int:\\n freqs = defaultdict(list)\\n num = 0\\n\\n while True:\\n digits = get_digits(num)\\n freqs[digits].append(num)\\n\\n if len(freqs[digits]) == max_base:\\n base = freqs[digits][0] ** 3\\n return base\\n\\n num += 1\",\n \"def problem():\\n\\n print 'problem #27'\\n\\n l = 0\\n m_a = 0\\n m_b = 0\\n for a in xrange(-1000, 1000):\\n for b in xrange(-1000, 1000):\\n p = len(check(a, b))\\n if p > l:\\n l = p\\n m_a = a\\n m_b = b\\n\\n print 'the product of coefficients is %s' % (m_a * m_b)\",\n \"def findKthLargest(self, nums: List[int], k: int) -> int:\\n return sorted(nums)[-k]\",\n \"def C(n,k):\\n if 0 <= k <= n:\\n ntok = 1\\n ktok = 1\\n for t in xrange(1, min(k, n - k) + 1):\\n ntok *= n\\n ktok *= t\\n n -= 1\\n return ntok // ktok\\n else:\\n return 0\",\n \"def problem_52():\\n\\n for number in xrange(1, 123456789):\\n sorted_num = ''.join(sorted(str(number)))\\n if len([value for value in xrange(2, 7)\\n if ''.join(sorted(str((value * number)))) == sorted_num]) == 5:\\n return number\",\n \"def find_largest_product(k_digits, num, num_len):\\n factor_queue = deque()\\n exp_val = num_len - 1\\n for dummy_val in range(k_digits):\\n factor_queue.append(int(str(num // 10 ** exp_val)[-1]))\\n exp_val -= 1\\n max_product = list_product(factor_queue)\\n while exp_val:\\n factor_queue.popleft()\\n factor_queue.append(int(str(num // 10 ** exp_val)[-1]))\\n exp_val -= 1\\n test_prod = list_product(factor_queue)\\n if test_prod > max_product:\\n max_product = test_prod\\n return max_product\",\n \"def get_kth_ugly_number(k):\\n count = 0; i = 0\\n while count < k:\\n i += 1\\n if is_ugly(i):\\n count += 1\\n return i\",\n \"def maxResult(self, nums: List[int], k: int) -> int:\\n # Solution 1 - 964 ms\\n # Solution 2 - 864 ms\\n n = len(nums)\\n if n == 0:\\n return 0\\n if n == 1:\\n return nums[0]\\n\\n dp = [0] * n\\n dp[0] = nums[0]\\n max_sum = dp[0]\\n max_sum_pointer = 0\\n for i in range(1, n):\\n if max_sum_pointer >= i - k:\\n if max_sum < dp[i - 1] and i > 0:\\n max_sum = dp[i - 1]\\n max_sum_pointer = i - 1\\n else:\\n if i - k > 0:\\n max_sum = dp[i - k]\\n max_sum_pointer = i - k\\n for p in range(i - k, i):\\n if max_sum <= dp[p]:\\n max_sum = dp[p]\\n max_sum_pointer = p\\n\\n dp[i] = max_sum + nums[i]\\n\\n dp[-1] = max_sum + nums[-1]\\n return dp[-1]\",\n \"def sixn(m):\\n if m <= 2:\\n return ()\\n if m > 2:\\n yield 2\\n if m > 3:\\n yield 3\\n for n in count(1):\\n x = 6 * n - 1\\n y = x + 2\\n if x < m:\\n yield x\\n else:\\n break\\n if y < m:\\n yield y\\n else:\\n break\",\n \"def findMaxProduct(n):\\n large = 0\\n for i in range(len(s)):\\n p = 1\\n number = s[i:i+n]\\n for iteration in range(len(number)):\\n h = number[iteration]\\n p = p * int(h)\\n if p > large:\\n large = p\\n\\n \\n return large\",\n \"def problem():\\n size = 1001\\n return sum(n**2 * 4 - 6 * n + 6 for n in range(3, size+1, 2)) + 1\",\n \"def problem26(limit):\\n result = 0\\n result_d = 0\\n\\n for d in range(2, limit):\\n d_cycle = calc_rec_cycle(d)\\n if d_cycle > result:\\n result = d_cycle\\n result_d = d\\n\\n return result_d\",\n \"def detectMiss(n, k):\\n k -= 1\\n nlog = math.ceil(math.log(n,2))\\n nloglessone = nlog - 1\\n lower_base = 2**nloglessone - 1\\n lowerbaseBack = lower_base\\n diff_list = [2**i for i in range(nloglessone-1, 0, -1)]\\n diff_lit_back = diff_list[1:-1]\\n if lower_base == k and 2**nlog -1 == n:\\n return(k)\\n matchres = False\\n while(lower_base <= k and len(diff_list)>0 ):\\n if lower_base == k:\\n matchres = True\\n break\\n else:\\n addVal = diff_list[0]\\n lower_base += addVal\\n diff_list.remove(addVal)\\n if matchres:\\n k -= 1\\n if k%2==0:\\n return(k)\\n else:\\n while(len(diff_lit_back)>0 and lowerbaseBack<k):\\n newAddVal = diff_lit_back[0]\\n lowerbaseBack = lowerbaseBack+newAddVal\\n postitionIndx = lowerbaseBack + newAddVal\\n if lowerbaseBack == k and postitionIndx <= n:\\n return(k)\\n elif lowerbaseBack == k and postitionIndx > n:\\n return(k-1)\\n else:\\n pass\\n diff_lit_back.remove(newAddVal)\\n\\n return(k)\",\n \"def main():\\n greatest = 0\\n for i in range(1000, 100, -1):\\n for j in range(i, 100, -1):\\n palindrome = str(j*i)\\n if ((palindrome == palindrome[::-1]) and (j*i) > greatest):\\n greatest = j*i\\n\\t\\t\\t\\n return greatest\",\n \"def get_max_combination(total_cuts):\\n max_pieces = 0\\n for i in range(total_cuts):\\n result = i * (total_cuts - i)\\n if result > max_pieces:\\n max_pieces = result\\n print(max_pieces)\",\n \"def rabin_miller_is_prime(n, k=100):\\n\\n def basic_is_prime(_n):\\n \\\"\\\"\\\"Basic check to see if input is a prime.\\n Returns False if input number is a composite with at least one term being one of the primes below 10.000.\\n Returns True if the number is a prime (can only be known if it is in the list of primes OR if the number is\\n larger than the largest prime in the list and smaller than the square of the last number in the list)\\n Returns None if test is inconclusive (if the number has no factors in the list, and is larger than the square\\n of the last number in the list).\\n\\n This code was made by Sahand Saba.\\n\\n\\n :param _n: number to be tested\\n :return test result: True, False or None\\n \\\"\\\"\\\"\\n if _n < 2:\\n return False\\n for p in [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101,\\n 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199,\\n 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317,\\n 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443,\\n 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577,\\n 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701,\\n 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839,\\n 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983,\\n 991, 997, 1009, 1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069, 1087, 1091, 1093,\\n 1097, 1103, 1109, 1117, 1123, 1129, 1151, 1153, 1163, 1171, 1181, 1187, 1193, 1201, 1213, 1217, 1223,\\n 1229, 1231, 1237, 1249, 1259, 1277, 1279, 1283, 1289, 1291, 1297, 1301, 1303, 1307, 1319, 1321, 1327,\\n 1361, 1367, 1373, 1381, 1399, 1409, 1423, 1427, 1429, 1433, 1439, 1447, 1451, 1453, 1459, 1471, 1481,\\n 1483, 1487, 1489, 1493, 1499, 1511, 1523, 1531, 1543, 1549, 1553, 1559, 1567, 1571, 1579, 1583, 1597,\\n 1601, 1607, 1609, 1613, 1619, 1621, 1627, 1637, 1657, 1663, 1667, 1669, 1693, 1697, 1699, 1709, 1721,\\n 1723, 1733, 1741, 1747, 1753, 1759, 1777, 1783, 1787, 1789, 1801, 1811, 1823, 1831, 1847, 1861, 1867,\\n 1871, 1873, 1877, 1879, 1889, 1901, 1907, 1913, 1931, 1933, 1949, 1951, 1973, 1979, 1987, 1993, 1997,\\n 1999, 2003, 2011, 2017, 2027, 2029, 2039, 2053, 2063, 2069, 2081, 2083, 2087, 2089, 2099, 2111, 2113,\\n 2129, 2131, 2137, 2141, 2143, 2153, 2161, 2179, 2203, 2207, 2213, 2221, 2237, 2239, 2243, 2251, 2267,\\n 2269, 2273, 2281, 2287, 2293, 2297, 2309, 2311, 2333, 2339, 2341, 2347, 2351, 2357, 2371, 2377, 2381,\\n 2383, 2389, 2393, 2399, 2411, 2417, 2423, 2437, 2441, 2447, 2459, 2467, 2473, 2477, 2503, 2521, 2531,\\n 2539, 2543, 2549, 2551, 2557, 2579, 2591, 2593, 2609, 2617, 2621, 2633, 2647, 2657, 2659, 2663, 2671,\\n 2677, 2683, 2687, 2689, 2693, 2699, 2707, 2711, 2713, 2719, 2729, 2731, 2741, 2749, 2753, 2767, 2777,\\n 2789, 2791, 2797, 2801, 2803, 2819, 2833, 2837, 2843, 2851, 2857, 2861, 2879, 2887, 2897, 2903, 2909,\\n 2917, 2927, 2939, 2953, 2957, 2963, 2969, 2971, 2999, 3001, 3011, 3019, 3023, 3037, 3041, 3049, 3061,\\n 3067, 3079, 3083, 3089, 3109, 3119, 3121, 3137, 3163, 3167, 3169, 3181, 3187, 3191, 3203, 3209, 3217,\\n 3221, 3229, 3251, 3253, 3257, 3259, 3271, 3299, 3301, 3307, 3313, 3319, 3323, 3329, 3331, 3343, 3347,\\n 3359, 3361, 3371, 3373, 3389, 3391, 3407, 3413, 3433, 3449, 3457, 3461, 3463, 3467, 3469, 3491, 3499,\\n 3511, 3517, 3527, 3529, 3533, 3539, 3541, 3547, 3557, 3559, 3571, 3581, 3583, 3593, 3607, 3613, 3617,\\n 3623, 3631, 3637, 3643, 3659, 3671, 3673, 3677, 3691, 3697, 3701, 3709, 3719, 3727, 3733, 3739, 3761,\\n 3767, 3769, 3779, 3793, 3797, 3803, 3821, 3823, 3833, 3847, 3851, 3853, 3863, 3877, 3881, 3889, 3907,\\n 3911, 3917, 3919, 3923, 3929, 3931, 3943, 3947, 3967, 3989, 4001, 4003, 4007, 4013, 4019, 4021, 4027,\\n 4049, 4051, 4057, 4073, 4079, 4091, 4093, 4099, 4111, 4127, 4129, 4133, 4139, 4153, 4157, 4159, 4177,\\n 4201, 4211, 4217, 4219, 4229, 4231, 4241, 4243, 4253, 4259, 4261, 4271, 4273, 4283, 4289, 4297, 4327,\\n 4337, 4339, 4349, 4357, 4363, 4373, 4391, 4397, 4409, 4421, 4423, 4441, 4447, 4451, 4457, 4463, 4481,\\n 4483, 4493, 4507, 4513, 4517, 4519, 4523, 4547, 4549, 4561, 4567, 4583, 4591, 4597, 4603, 4621, 4637,\\n 4639, 4643, 4649, 4651, 4657, 4663, 4673, 4679, 4691, 4703, 4721, 4723, 4729, 4733, 4751, 4759, 4783,\\n 4787, 4789, 4793, 4799, 4801, 4813, 4817, 4831, 4861, 4871, 4877, 4889, 4903, 4909, 4919, 4931, 4933,\\n 4937, 4943, 4951, 4957, 4967, 4969, 4973, 4987, 4993, 4999, 5003, 5009, 5011, 5021, 5023, 5039, 5051,\\n 5059, 5077, 5081, 5087, 5099, 5101, 5107, 5113, 5119, 5147, 5153, 5167, 5171, 5179, 5189, 5197, 5209,\\n 5227, 5231, 5233, 5237, 5261, 5273, 5279, 5281, 5297, 5303, 5309, 5323, 5333, 5347, 5351, 5381, 5387,\\n 5393, 5399, 5407, 5413, 5417, 5419, 5431, 5437, 5441, 5443, 5449, 5471, 5477, 5479, 5483, 5501, 5503,\\n 5507, 5519, 5521, 5527, 5531, 5557, 5563, 5569, 5573, 5581, 5591, 5623, 5639, 5641, 5647, 5651, 5653,\\n 5657, 5659, 5669, 5683, 5689, 5693, 5701, 5711, 5717, 5737, 5741, 5743, 5749, 5779, 5783, 5791, 5801,\\n 5807, 5813, 5821, 5827, 5839, 5843, 5849, 5851, 5857, 5861, 5867, 5869, 5879, 5881, 5897, 5903, 5923,\\n 5927, 5939, 5953, 5981, 5987, 6007, 6011, 6029, 6037, 6043, 6047, 6053, 6067, 6073, 6079, 6089, 6091,\\n 6101, 6113, 6121, 6131, 6133, 6143, 6151, 6163, 6173, 6197, 6199, 6203, 6211, 6217, 6221, 6229, 6247,\\n 6257, 6263, 6269, 6271, 6277, 6287, 6299, 6301, 6311, 6317, 6323, 6329, 6337, 6343, 6353, 6359, 6361,\\n 6367, 6373, 6379, 6389, 6397, 6421, 6427, 6449, 6451, 6469, 6473, 6481, 6491, 6521, 6529, 6547, 6551,\\n 6553, 6563, 6569, 6571, 6577, 6581, 6599, 6607, 6619, 6637, 6653, 6659, 6661, 6673, 6679, 6689, 6691,\\n 6701, 6703, 6709, 6719, 6733, 6737, 6761, 6763, 6779, 6781, 6791, 6793, 6803, 6823, 6827, 6829, 6833,\\n 6841, 6857, 6863, 6869, 6871, 6883, 6899, 6907, 6911, 6917, 6947, 6949, 6959, 6961, 6967, 6971, 6977,\\n 6983, 6991, 6997, 7001, 7013, 7019, 7027, 7039, 7043, 7057, 7069, 7079, 7103, 7109, 7121, 7127, 7129,\\n 7151, 7159, 7177, 7187, 7193, 7207, 7211, 7213, 7219, 7229, 7237, 7243, 7247, 7253, 7283, 7297, 7307,\\n 7309, 7321, 7331, 7333, 7349, 7351, 7369, 7393, 7411, 7417, 7433, 7451, 7457, 7459, 7477, 7481, 7487,\\n 7489, 7499, 7507, 7517, 7523, 7529, 7537, 7541, 7547, 7549, 7559, 7561, 7573, 7577, 7583, 7589, 7591,\\n 7603, 7607, 7621, 7639, 7643, 7649, 7669, 7673, 7681, 7687, 7691, 7699, 7703, 7717, 7723, 7727, 7741,\\n 7753, 7757, 7759, 7789, 7793, 7817, 7823, 7829, 7841, 7853, 7867, 7873, 7877, 7879, 7883, 7901, 7907,\\n 7919, 7927, 7933, 7937, 7949, 7951, 7963, 7993, 8009, 8011, 8017, 8039, 8053, 8059, 8069, 8081, 8087,\\n 8089, 8093, 8101, 8111, 8117, 8123, 8147, 8161, 8167, 8171, 8179, 8191, 8209, 8219, 8221, 8231, 8233,\\n 8237, 8243, 8263, 8269, 8273, 8287, 8291, 8293, 8297, 8311, 8317, 8329, 8353, 8363, 8369, 8377, 8387,\\n 8389, 8419, 8423, 8429, 8431, 8443, 8447, 8461, 8467, 8501, 8513, 8521, 8527, 8537, 8539, 8543, 8563,\\n 8573, 8581, 8597, 8599, 8609, 8623, 8627, 8629, 8641, 8647, 8663, 8669, 8677, 8681, 8689, 8693, 8699,\\n 8707, 8713, 8719, 8731, 8737, 8741, 8747, 8753, 8761, 8779, 8783, 8803, 8807, 8819, 8821, 8831, 8837,\\n 8839, 8849, 8861, 8863, 8867, 8887, 8893, 8923, 8929, 8933, 8941, 8951, 8963, 8969, 8971, 8999, 9001,\\n 9007, 9011, 9013, 9029, 9041, 9043, 9049, 9059, 9067, 9091, 9103, 9109, 9127, 9133, 9137, 9151, 9157,\\n 9161, 9173, 9181, 9187, 9199, 9203, 9209, 9221, 9227, 9239, 9241, 9257, 9277, 9281, 9283, 9293, 9311,\\n 9319, 9323, 9337, 9341, 9343, 9349, 9371, 9377, 9391, 9397, 9403, 9413, 9419, 9421, 9431, 9433, 9437,\\n 9439, 9461, 9463, 9467, 9473, 9479, 9491, 9497, 9511, 9521, 9533, 9539, 9547, 9551, 9587, 9601, 9613,\\n 9619, 9623, 9629, 9631, 9643, 9649, 9661, 9677, 9679, 9689, 9697, 9719, 9721, 9733, 9739, 9743, 9749,\\n 9767, 9769, 9781, 9787, 9791, 9803, 9811, 9817, 9829, 9833, 9839, 9851, 9857, 9859, 9871, 9883, 9887,\\n 9901, 9907, 9923, 9929, 9931, 9941, 9949, 9967, 9973]:\\n if _n % p == 0:\\n return _n == p\\n if _n < 1E8: # Limit 1E8, because we have all primes below 1E4\\n return True\\n else:\\n return None\\n\\n b = basic_is_prime(n)\\n if b is not None:\\n # Basic test gave answer\\n return b\\n\\n m = n - 1\\n s = 0\\n while m % 2 == 0:\\n s += 1\\n m //= 2\\n liars = set()\\n\\n def get_new_x():\\n return random.randint(2, n - 1)\\n\\n while len(liars) < k:\\n x = get_new_x()\\n while x in liars:\\n x = get_new_x()\\n xi = pow(x, m, n)\\n witness = True\\n if xi == 1 or xi == n - 1:\\n witness = False\\n else:\\n for __ in range(s - 1):\\n xi = (xi ** 2) % n\\n if xi == 1:\\n return False\\n elif xi == n - 1:\\n witness = False\\n break\\n xi = (xi ** 2) % n\\n if xi != 1:\\n return False\\n if witness:\\n return False\\n else:\\n liars.add(x)\\n return True\",\n \"def solution(n: int = 998001) -> int:\\n\\n answer = 0\\n for i in range(999, 99, -1): # 3 digit numbers range from 999 down to 100\\n for j in range(999, 99, -1):\\n product_string = str(i * j)\\n if product_string == product_string[::-1] and i * j < n:\\n answer = max(answer, i * j)\\n return answer\",\n \"def problem_48():\\n\\n return int(str(sum(x**x for x in range(1, 1001)))[-10:])\",\n \"def greatest_pallindrome(n, m):\\n if m < n:\\n raise ValueError\\n\\n pk = ProductKeeper()\\n\\n # these nested loops compare distinct pairs of products\\n for i in range(n + 1, m + 1):\\n for j in range(n, i):\\n pk.check(i, j)\\n\\n return pk.get_gp()\",\n \"def find_max_in_array(arr, k):\\r\\n print(\\\" Amazon interview question\\\")\\r\\n arr[:] = sorted(arr)\\r\\n return ((arr[len(arr)-k]))\",\n \"def main():\\r\\n \\r\\n TOP_VAL = 1000000\\r\\n for i in xrange(1, TOP_VAL):\\r\\n _ = collatz_length(i) # Seed each collatz length.\\r\\n \\r\\n # Find the key with largest value in the collatz length dictionary.\\r\\n value, collatz_len = max(collatz_len_dict.iteritems(),\\r\\n key=lambda x:x[1])\\r\\n \\r\\n print 'Value %d has max collatz length: %d' % (value, collatz_len)\",\n \"def solution(): \\n x = {int(str(n*1)+str(n*2)) for n in range(0,9999) if (len(str(n*1)+str(n*2))==9 and pandigital.is_pandigital({n*1, n*2}))}\\n\\n return max(x)\",\n \"def eight():\\r\\n \\r\\n number = \\\"73167176531330624919225119674426574742355349194934\\\\\\r\\n96983520312774506326239578318016984801869478851843\\\\\\r\\n85861560789112949495459501737958331952853208805511\\\\\\r\\n12540698747158523863050715693290963295227443043557\\\\\\r\\n66896648950445244523161731856403098711121722383113\\\\\\r\\n62229893423380308135336276614282806444486645238749\\\\\\r\\n30358907296290491560440772390713810515859307960866\\\\\\r\\n70172427121883998797908792274921901699720888093776\\\\\\r\\n65727333001053367881220235421809751254540594752243\\\\\\r\\n52584907711670556013604839586446706324415722155397\\\\\\r\\n53697817977846174064955149290862569321978468622482\\\\\\r\\n83972241375657056057490261407972968652414535100474\\\\\\r\\n82166370484403199890008895243450658541227588666881\\\\\\r\\n16427171479924442928230863465674813919123162824586\\\\\\r\\n17866458359124566529476545682848912883142607690042\\\\\\r\\n24219022671055626321111109370544217506941658960408\\\\\\r\\n07198403850962455444362981230987879927244284909188\\\\\\r\\n84580156166097919133875499200524063689912560717606\\\\\\r\\n05886116467109405077541002256983155200055935729725\\\\\\r\\n71636269561882670428252483600823257530420752963450\\\"\\r\\n\\r\\n greatest = 0\\r\\n \\r\\n i = 0\\r\\n while i < len(number) - 12:\\r\\n product = 1\\r\\n for j in range(13):\\r\\n product *= int(number[i + j])\\r\\n #j += 1\\r\\n if product > greatest:\\r\\n greatest = product\\r\\n i += 1\\r\\n \\r\\n return greatest\",\n \"def four():\\r\\n \\r\\n i = 999\\r\\n j = i\\r\\n largest = 0\\r\\n \\r\\n while i > 0:\\r\\n while j > 0:\\r\\n number = str(i * j)\\r\\n forward = str(number)\\r\\n reverse = \\\"\\\"\\r\\n for char in number:\\r\\n reverse = char + reverse\\r\\n if forward == reverse:\\r\\n if largest < i * j:\\r\\n largest = i * j\\r\\n break\\r\\n else:\\r\\n j = j - 1\\r\\n i = i - 1\\r\\n j = i\\r\\n return largest\",\n \"def solution(resources, args):\\n largest_prime_factor = 1\\n number = args.number\\n prime_generator = primes.get_prime_generator()\\n\\n while number > 1:\\n prime = next(prime_generator)\\n if number % prime == 0:\\n number /= prime\\n largest_prime_factor = prime\\n\\n if largest_prime_factor == 1:\\n largest_prime_factor = args.number\\n\\n return largest_prime_factor\",\n \"def test_max_mid(self):\\n self.assertEqual(max_integer([5, 3, 8, 4, 1]), 8)\",\n \"def marbles(n: int, k: int) -> int:\\n # return (n-1) Choose (k - 1)\\n # which is the number of possibilities with the given constraints.\\n return n_choose_k(n - 1, k - 1)\",\n \"def choose(n, k):\\n if 0 <= k <= n:\\n ntok = 1\\n ktok = 1\\n for t in xrange(1, min(k, n - k) + 1):\\n ntok *= n\\n ktok *= t\\n n -= 1\\n return ntok // ktok\\n else:\\n return 0\",\n \"def choose(n, k):\\n if 0 <= k <= n:\\n ntok = 1\\n ktok = 1\\n for t in xrange(1, min(k, n - k) + 1):\\n ntok *= n\\n ktok *= t\\n n -= 1\\n return ntok // ktok\\n else:\\n return 0\",\n \"def problem41():\\n for i in range(len(PANDIGITAL), 1, -1):\\n cur_max = 0\\n for p in itertools.permutations(PANDIGITAL[:i]):\\n n = int(\\\"\\\".join(p))\\n if pelib.is_prime(n) and n > cur_max:\\n cur_max = n\\n\\n if cur_max > 0:\\n return cur_max\",\n \"def answer():\\n for k in range(2,3000):\\n for j in range(k-1,0,-1):\\n pj, pk = P(j), P(k)\\n #print( j, k, pj, pk )\\n if isPent(pk-pj):\\n #print( j, k, pj, pk, pk+pj, isPent(pk+pj), pk-pj )\\n if isPent(pk+pj) and isPent(pk-pj):\\n return pk-pj\",\n \"def choose(n, k):\\n # http://stackoverflow.com/a/3025547/313967\\n if 0 <= k <= n:\\n ntok = 1\\n ktok = 1\\n for t in xrange(1, min(k, n - k) + 1):\\n ntok *= n\\n ktok *= t\\n n -= 1\\n return ntok // ktok\\n else:\\n return 0\",\n \"def problem2(m, p):\\n total = 0\\n for k in range(m, m ** p):\\n if is_prime(k):\\n total = total + sum_of_digits(k)\\n return total\",\n \"def solution(n: int = 2000000) -> int:\\n\\n return sum(takewhile(lambda x: x < n, prime_generator()))\",\n \"def countm(m):\\n nfound=0\\n\\n for i in range(1,m+1):\\n for jpk in range(2,(2*i)+1):\\n d1=i*i+(jpk)*(jpk) \\n if(checkpsq(d1)): \\n if(jpk<=i):\\n factor=jpk/2 \\n else:\\n factor=((2*i-jpk)+2)/2 \\n nfound=nfound+factor\\n\\n return nfound\",\n \"def test_extract_max(self):\\n for i in xrange(0,100):\\n self.rebuild_all()\\n real_max = self.real_heap.extract_max()\\n #print \\\"real max is :\\\",real_max\\n #print \\\"the copy max is :\\\",max(self.copy_heap)\\n assert real_max == max(self.copy_heap)\\n assert self.is_heap_valid(self.real_heap) == True\\n \\n if i%10==0:\\n print \\\"Extraction of %d/%d is completed\\\"%(i,100)\",\n \"def nchoosek(n, k):\\n if n < k:\\n return 0\\n return partition(n, [k, n - k])\",\n \"def largest_factor(n):\\n \\\"*** YOUR CODE HERE ***\\\"\\n if(n > 1):\\n target = n * n - 1\\n for i in range(n - 1, 1, -1):\\n if(target % i == 0):\\n return i\",\n \"def n_choose_k(n: int, k: int) -> int:\\n # Edge case, no possible way to choose.\\n if k > n or k < 0 or n < 0: return 0\\n # We choose the min of k or n - k\\n # since nCk == nC(n - k).\\n k = min(k, n - k)\\n # The numerator represents the product\\n # n * (n - 1) * (n - 2) * ... * (n - k - 1)\\n numerator = reduce(mul, range(n, n - k, -1), 1)\\n # The denominator represents the product\\n # 1 * 2 * ... * k\\n denominator = reduce(mul, range(1, k + 1), 1)\\n # return the result as an integer.\\n return numerator // denominator\",\n \"def fn(n, k):\\n if k == 1: return n \\n if n == 0: return 0 \\n ans = inf \\n for x in range(1, n+1): \\n ans = min(ans, 1 + max(fn(x-1, k-1), fn(n-x, k)))\\n return ans\",\n \"def choose(n, k):\\n ans, k = 1, min(k, n-k)\\n for i in range(k):\\n ans *= n-i\\n ans //= i+1\\n return ans\",\n \"def choose(n, k):\\r\\n if 0 <= k <= n:\\r\\n ntok = 1\\r\\n ktok = 1\\r\\n for t in range(1, min(k, n - k) + 1):\\r\\n ntok *= n\\r\\n ktok *= t\\r\\n n -= 1\\r\\n return ntok // ktok\\r\\n else:\\r\\n return 0\",\n \"def f_exact(n, k):\\n def fact(m):\\n return math.factorial(m)\\n\\n partition = part(n, k)\\n\\n total = 0\\n for p in partition:\\n product = 1\\n nodes_left = n\\n counts = dict([(x, len(list(y))) for x, y in itertools.groupby(p)])\\n for num in p:\\n product *= fact(num - 1) * comb(nodes_left, num)\\n nodes_left -= num\\n for num in counts:\\n product /= fact(counts[num])\\n\\n total += product\\n return int(total)\",\n \"def get_max_num_onsets():\\r\\n \\\"\\\"\\\" based on the numbers above, should equal to 932945... \\\"\\\"\\\"\\r\\n c1 = len(gen_onset_c1())\\r\\n c2 = len(gen_onset_c2())\\r\\n c3 = len(gen_onset_c3_c4())\\r\\n c4 = len(gen_onset_c3_c4())\\r\\n temp = c1\\r\\n temp = temp + ( c1 * c2 )\\r\\n temp = temp + ( c1 * c3 )\\r\\n temp = temp + ( c1 * c2 * c3 )\\r\\n temp = temp + ( c1 * c3 * c4 )\\r\\n temp = temp + ( c1 * c2 * c3 * c4 )\\r\\n return temp\",\n \"def fn(mask, k):\\n if mask == 0: return 0 # no more numbers \\n ans = 0\\n for i in range(n): \\n if mask & 1 << i:\\n for j in range(i+1, n): \\n if mask & 1 << j: \\n mask0 = mask & ~(1<<i) & ~(1<<j) # unset ith & jth bit\\n ans = max(ans, k*gcd(nums[i], nums[j]) + fn(mask0, k+1))\\n return ans\",\n \"def getKBitPrimes(k = 2 ** 10, n = 2 ** 20):\\n\\n lim = min(k + 1, n + 1) # we don't want to generate any primes larger than n\\n\\n numList = [True] * lim # initialise boolean list\\n primes = [] # initialise list of primes\\n\\n for i in range(2, lim): # loop through list from index 2\\n if numList[i]: # if it is True\\n primes.append(i) # must be prime\\n\\n for j in range(i*i, lim, i): # loop through multiples\\n numList[j] = False # setting them to false\\n\\n return primes # return ptimes\",\n \"def main():\\n largest = 0\\n for i in range(100, 999):\\n for j in range(100, 999):\\n if i * j > largest and is_palindrome(i * j):\\n largest = i * j\\n\\n print \\\"The largest palindrome product of two 3-digits nums is %d \\\" % largest\",\n \"def largest_factor(n):\\n \\\"*** YOUR CODE HERE ***\\\"\\n t = 1\\n for i in range(2,n-1):\\n if n % i == 0:\\n t = i\\n return t\",\n \"def rand_prime(k=10): \\n i = random.randint(2**(k-2),2**(k-1))\\n i,l=2*i+1,0\\n while True:\\n j = 3\\n l +=1\\n while i%j!=0:\\n j += 1\\n if i == j:\\n return i\\n #return i,len(bin(i)[2:]),l\\n i += 2\",\n \"def brute(limit):\\n c_lengths = {s: collatz_length(s) for s in range(1, limit+1)}\\n return max(c_lengths, key=lambda x: c_lengths[x])\",\n \"def eval_search_base26(m):\\n result = [base26(k) % m for k in s_data]\\n if (min(result) >= 0) and unique(result):\\n data = [-1] * (1+max(result))\\n for idx in range(len(s_data)):\\n data[result[idx]] = s_num[idx]\\n return data\\n return None\",\n \"def _kth_largest(self, k: int, start : int, end : int):\\n # 1. select a random pivot\\n pivotIndex = self.get_pivot_index(start, end)\\n # print('Before partition start, end, pivotIndex ', start, end, pivotIndex)\\n pivotIndex = self.partition(pivotIndex, start, end)\\n # print(f'After partition , data = {data}, pivotIndex = {pivotIndex}')\\n\\n if end-pivotIndex >=k:\\n return self._kth_largest(k, pivotIndex+1, end)\\n \\n elif end-pivotIndex+1 == k:\\n return pivotIndex, self.data[pivotIndex]\\n else:\\n return self._kth_largest(k-1-(end-pivotIndex), start , pivotIndex-1)\",\n \"def kth_largest(arr: list, k: int):\\n # Do not search if k is larger than total number of elements\\n if k > len(arr):\\n raise IndexError\\n # Count all numbers\\n nums = Counter(arr)\\n # Go from the largest to smaller ones\\n for key in sorted(nums, reverse=True):\\n if nums[key] >= k:\\n return key\\n else:\\n k -= nums[key]\",\n \"def k() -> int:\\n return 5\",\n \"def problem():\\n for a in range(1, 380):\\n for b in range(a):\\n if a + b + (a**2 + b**2)**0.5 == 1000:\\n return int(a * b * (a**2 + b**2)**0.5)\",\n \"def get_big_joker_value(deck: List[int]) -> int:\\n return max(deck)\",\n \"def solution(limit=28123):\\n sum_divs = [1] * (limit + 1)\\n\\n for i in range(2, int(limit**0.5) + 1):\\n sum_divs[i * i] += i\\n for k in range(i + 1, limit // i + 1):\\n sum_divs[k * i] += k + i\\n\\n abundants = set()\\n res = 0\\n\\n for n in range(1, limit + 1):\\n if sum_divs[n] > n:\\n abundants.add(n)\\n\\n if not any((n - a in abundants) for a in abundants):\\n res += n\\n\\n return res\",\n \"def main():\\n LIMIT = 600\\n GOAL = 1000\\n for i in range(1, LIMIT + 1):\\n for j in range(1, LIMIT + 1):\\n for k in range(1, LIMIT + 1):\\n if i + j + k == GOAL:\\n if i**2 == j**2 + k**2:\\n print \\\"GOAL:\\\", (i, j, k)\",\n \"def beautifulSubsets(self, nums: List[int], k: int) -> int:\\n\\n \\\"\\\"\\\"\\n queue = deque([([], -1)])\\n res = 0\\n\\n while queue:\\n cur, idx = queue.popleft()\\n res += 1\\n\\n for i in range(idx + 1, len(nums)):\\n if nums[i] - k in cur or nums[i] + k in cur:\\n continue\\n\\n queue.append((cur + [nums[i]], i))\\n\\n return res - 1\\n \\\"\\\"\\\"\\n\\n \\\"\\\"\\\"\\n # dp0 is the ways that without A[i]\\n # dp1 is the ways that with A[i]\\n\\n count = [Counter() for i in range(k)]\\n for n in nums:\\n count[n % k][n] += 1\\n\\n res = 1\\n for i in range(k):\\n prev, dp0, dp1 = 0, 1, 0\\n for n in sorted(count[i]):\\n v = pow(2, count[i][n])\\n if prev + k == n:\\n dp0, dp1 = dp0 + dp1, dp0 * (v - 1)\\n else:\\n dp0, dp1 = dp0 + dp1, (dp0 + dp1) * (v - 1)\\n\\n prev = n\\n\\n res *= dp0 + dp1\\n\\n return res - 1\\n \\\"\\\"\\\"\\n\\n # Count the frequency of A, and then consider all the arithmetic sequence with difference k.\\n # Each arithmetic sequence can be solve as a hourse robber problem.\\n # We solve the hourse robber by dp.\\n # dp(a) return the result for sequence no bigger than a.\\n\\n # dp(a)[0] is the ways that without a\\n # dp(a)[1] is the ways that with a\\n\\n # dp(a)[0] = dp(a - k)[0] + dp(a - k)[1]\\n # dp(a)[1] = dp(a - k)[0] * (2 ^ count(a) - 1\\n\\n count = Counter(nums)\\n\\n def dp(n):\\n dp0, dp1 = dp(n - k) if n - k in count else (1, 0)\\n return dp0 + dp1, dp0 * (pow(2, count[n]) - 1)\\n\\n return functools.reduce(operator.mul, (sum(dp(n)) for n in count if not count[n + k])) - 1\",\n \"def solution(N, K):\\n\\n # not really sure what to return if N=1, it should be invalid?\\n rounds = N - 1\\n next_num = N\\n while K > 0 and next_num >= 4:\\n next_num = next_num - next_num % 2\\n next_num = next_num // 2\\n rounds -= (next_num - 1)\\n K -= 1\\n return rounds\",\n \"def fuction_call(chest):\\n\\n for i in chest:\\n max_i = maximum(chest,i)\\n if max_i >= 2:\\n print(\\\"The maximum size of a set Matyoshka Dolls with outermost doll\\\",i,\\\"is\\\",max_i)\",\n \"def choose(n: int, k: int) -> int:\\n return permute(n, k) // factorial(k)\",\n \"def euler39():\\n\\tcount = [0] * 1001\\n\\n\\tfor a in range(1, 333):\\n\\t\\tfor b in range(a+1, 500):\\n\\t\\t\\tc = (a**2 + b**2) ** 0.5\\n\\t\\t\\tp = a + b + int(c)\\n\\t\\t\\t\\n\\t\\t\\tif int(c) != c: continue\\n\\t\\t\\tif p > 1000: break\\n\\t\\t\\t\\n\\t\\t\\tcount[p] += 1\\n\\t\\t\\t\\n\\treturn count.index(max(count))\",\n \"def countbrute(m):\\n nfound=0\\n\\n for i in range(1,m+1):\\n for j in range(1,i+1):\\n for k in range(1,j+1):\\n d1=i*i+(j+k)*(j+k) \\n if(checkpsq(d1)):\\n nfound=nfound+1\\n\\n return nfound\",\n \"def prjEuler():\\r\\n #Constants\\r\\n NUMSTRING = ( \\\"73167176531330624919225119674426574742355349194934\\\"\\r\\n \\\"96983520312774506326239578318016984801869478851843\\\"\\r\\n \\\"85861560789112949495459501737958331952853208805511\\\"\\r\\n \\\"12540698747158523863050715693290963295227443043557\\\"\\r\\n \\\"66896648950445244523161731856403098711121722383113\\\"\\r\\n \\\"62229893423380308135336276614282806444486645238749\\\"\\r\\n \\\"30358907296290491560440772390713810515859307960866\\\"\\r\\n \\\"70172427121883998797908792274921901699720888093776\\\"\\r\\n \\\"65727333001053367881220235421809751254540594752243\\\"\\r\\n \\\"52584907711670556013604839586446706324415722155397\\\"\\r\\n \\\"53697817977846174064955149290862569321978468622482\\\"\\r\\n \\\"83972241375657056057490261407972968652414535100474\\\"\\r\\n \\\"82166370484403199890008895243450658541227588666881\\\"\\r\\n \\\"16427171479924442928230863465674813919123162824586\\\"\\r\\n \\\"17866458359124566529476545682848912883142607690042\\\"\\r\\n \\\"24219022671055626321111109370544217506941658960408\\\"\\r\\n \\\"07198403850962455444362981230987879927244284909188\\\"\\r\\n \\\"84580156166097919133875499200524063689912560717606\\\"\\r\\n \\\"05886116467109405077541002256983155200055935729725\\\"\\r\\n \\\"71636269561882670428252483600823257530420752963450\\\" )\\r\\n \\r\\n #defined items\\r\\n greatest_prod = 1\\r\\n euler_queue = fiveQueue()\\r\\n \\r\\n #code\\r\\n for numIter in NUMSTRING:\\r\\n if( euler_queue.push( numIter ) ):\\r\\n temp_prod = euler_queue.product()\\r\\n if( temp_prod > greatest_prod ):\\r\\n greatest_prod = temp_prod\\r\\n \\r\\n print \\\"The greatest product is %d\\\" % greatest_prod\\r\\n return\",\n \"def probl4():\\n\\n largest_palindrome = 0\\n for i in xrange(101, 1000):\\n for j in xrange(101, 1000):\\n output = i * j\\n if str(output) == str(output)[::-1] and \\\\\\n output > largest_palindrome:\\n largest_palindrome = output\\n return largest_palindrome\",\n \"def fn(lo, hi, k):\\n if lo == hi: return 0 \\n while lo+1 < hi and boxes[lo] == boxes[lo+1]: lo, k = lo+1, k+1\\n ans = (k+1)*(k+1) + fn(lo+1, hi, 0)\\n for mid in range(lo+2, hi): \\n if boxes[lo] == boxes[mid]: \\n ans = max(ans, fn(lo+1, mid, 0) + fn(mid, hi, k+1))\\n return ans\",\n \"def rabin_miller(n, target=128):\\n ###############\\n ## Start your code here\\n return True\\n ## End of your code\\n ###############\",\n \"def is_acceptable_multiplier(m):\\n return 1 < m < (2 ** 61 - 1)\",\n \"def solution():\\n i = 1\\n\\n while True:\\n if (\\n sorted(str(i))\\n == sorted(str(2 * i))\\n == sorted(str(3 * i))\\n == sorted(str(4 * i))\\n == sorted(str(5 * i))\\n == sorted(str(6 * i))\\n ):\\n return i\\n\\n i += 1\",\n \"def bit_smarter(limit):\\n c_lengths = {}\\n\\n for s in range(1, limit+1):\\n c_lengths[s] = s_collatz_length(s, c_lengths)\\n\\n return max(c_lengths, key=lambda x: c_lengths[x])\",\n \"def test_swap_k_max(self):\\r\\n self.num2 = [1, 2, 3, 4, 5, 6]\\r\\n a1.swap_k(self.num2, len(self.num2)//2)\\r\\n self.assertEqual(self.num2, [4, 5, 6, 1, 2, 3])\",\n \"def problem(num=1000000):\\r\\n chains = []\\r\\n i = 1\\r\\n while i < num:\\r\\n number = i\\r\\n chain = 1\\r\\n while number != 1:\\r\\n if number % 2 == 0:\\r\\n number /= 2\\r\\n else:\\r\\n number = 3 * number + 1\\r\\n chain += 1\\r\\n chains.append(chain)\\r\\n i += 1\\r\\n\\r\\n return chains.index(max(chains)) + 1\",\n \"def problem9_fast(n):\\n n2 = n // 2\\n ulimit = ceil(sqrt(n2)) - 1\\n for u in range(2, ulimit):\\n if n2 % u == 0:\\n nu = n2 // u\\n while nu % 2 == 0:\\n nu //= 2\\n if u % 2 == 1:\\n k = u + 2\\n else:\\n k = u + 1\\n while k < 2 * u and k <= nu:\\n if nu % k == 0 and pe_utils.gcd(k, u) == 1:\\n d = n2 // (k * u)\\n v = k - u\\n a = (u ** 2 - v ** 2) * d\\n b = 2 * u * v * d\\n c = (u ** 2 + v ** 2) * d\\n return a * b * c\\n k += 2\\n return None\",\n \"def maximum_value(arr: [int], k: int) -> [int]:\\n m = []\\n res = []\\n for i in range(len(arr)):\\n if len(m) == k:\\n res.append(max(m))\\n if len(m) == k:\\n m[i%k] = arr[i]\\n else:\\n m.append(arr[i])\\n res.append(max(m))\\n return res\",\n \"def main(n=20):\\n return functools.reduce(lcm, range(1, 20))\",\n \"def test_hackerrank_sample1(self):\\n result = find_digits(12)\\n self.assertEquals(result, 2)\",\n \"def constrain(value):\\n size = 2**m\\n return (value%size)\",\n \"def chosse(n,k):\\n import math \\n if (n>=k and k>=0):\\n return math.factorial(n) / (math.factorial(k) * math.factorial(n-k))\\n else:\\n return \\\"No se puede calcular el numero factorial indicado\\\"\",\n \"def assertB(n, k):\\n assert 0 <= k <= n\\n return (factorial(n)//factorial(k))//factorial(n-k)\",\n \"def maxSumOfThreeSubarrays(self, nums: List[int], k: int) -> List[int]:\\n\\n n = len(nums)\\n if n < 3 * k or k == 0:\\n return 0\\n\\n prefix_sum = [0]\\n for num in nums:\\n prefix_sum.append(prefix_sum[-1] + num)\\n\\n left = [0] * n\\n left_i = [0] * n\\n right = [0] * (n + 1) # add one to right (for case of k == 1)\\n right_i = [0] * (n + 1)\\n\\n for i in range(k - 1, n):\\n window = prefix_sum[i + 1] - prefix_sum[i + 1 - k]\\n if window > left[i - 1]: # > cause we prefex left start\\n left[i] = window\\n left_i[i] = i - (k - 1)\\n else:\\n left[i] = left[i - 1]\\n left_i[i] = left_i[i - 1]\\n\\n for i in reversed(range(n - k + 1)):\\n window = prefix_sum[i + k] - prefix_sum[i]\\n if window >= right[i + 1]: # >= cause we prefex left start\\n right[i] = window\\n right_i[i] = i\\n else:\\n right[i] = right[i + 1]\\n right_i[i] = right_i[i + 1]\\n\\n max_sum = 0\\n a, b, c = 0, 0, 0\\n for i in range(k, n - 2 * k + 1):\\n curr_sum = prefix_sum[i + k] - prefix_sum[i] + left[i - 1] + right[i + k]\\n if curr_sum > max_sum:\\n max_sum = curr_sum\\n a, b, c = left_i[i - 1], i, right_i[i + k]\\n\\n return [a, b, c]\",\n \"def solve(limit):\\n upper_limit = ceil(sqrt(limit - 2**4 - 2**3))\\n p_list = PrimeList(upper_limit)\\n\\n num_set = set()\\n for x in p_list:\\n val = limit - 2**4 - x**3\\n if val < 0: continue\\n lim = ceil(sqrt(val))\\n for y in takewhile(lambda i: i<lim, p_list):\\n val = limit - min(x,y)**4 - max(x,y)**3\\n if val < 0: continue\\n lim = ceil(sqrt(val))\\n for z in takewhile(lambda i: i<lim, p_list):\\n\\n for a,b,c in permutations([x,y,z]):\\n ans = a**2 + b**3 + c**4\\n if ans > limit: continue\\n num_set.add(ans)\\n if a ==b and b == c: break\\n\\n return len(num_set)\",\n \"def crackSafe(self, n: int, k: int) -> str:\",\n \"def test_hackerrank_sample2(self):\\n result = find_digits(1012)\\n self.assertEquals(result, 3)\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6825895","0.67128354","0.6694615","0.6600402","0.659205","0.65894896","0.65685385","0.64729345","0.6467728","0.64583665","0.6435412","0.6422708","0.6354484","0.6291198","0.624428","0.62414813","0.62265134","0.62159485","0.618845","0.61884433","0.6183926","0.6182416","0.6171871","0.61016303","0.6096682","0.60951906","0.6089711","0.6084036","0.60740435","0.6053716","0.6046571","0.6041862","0.6024616","0.6012024","0.60066485","0.59992385","0.59871167","0.59746844","0.5972255","0.5960928","0.59545374","0.5937112","0.592752","0.5917984","0.59169644","0.59169644","0.5902428","0.58849865","0.5875591","0.58755296","0.5875514","0.587423","0.58736","0.5867338","0.58670187","0.586549","0.58638686","0.58584964","0.58570004","0.5855655","0.58544326","0.5853908","0.58506197","0.5848465","0.58439565","0.5834384","0.58341503","0.58328134","0.58246666","0.5817145","0.5816406","0.58159614","0.5811003","0.58002186","0.57989174","0.57959586","0.57937276","0.5782692","0.5778702","0.57778156","0.577657","0.57753265","0.5761095","0.5744396","0.574183","0.57372963","0.57363904","0.5734133","0.57231736","0.57216096","0.57209504","0.57195085","0.5716124","0.5711159","0.5708904","0.5705744","0.570271","0.56998587","0.5694296","0.5692792","0.5684254"],"string":"[\n \"0.6825895\",\n \"0.67128354\",\n \"0.6694615\",\n \"0.6600402\",\n \"0.659205\",\n \"0.65894896\",\n \"0.65685385\",\n \"0.64729345\",\n \"0.6467728\",\n \"0.64583665\",\n \"0.6435412\",\n \"0.6422708\",\n \"0.6354484\",\n \"0.6291198\",\n \"0.624428\",\n \"0.62414813\",\n \"0.62265134\",\n \"0.62159485\",\n \"0.618845\",\n \"0.61884433\",\n \"0.6183926\",\n \"0.6182416\",\n \"0.6171871\",\n \"0.61016303\",\n \"0.6096682\",\n \"0.60951906\",\n \"0.6089711\",\n \"0.6084036\",\n \"0.60740435\",\n \"0.6053716\",\n \"0.6046571\",\n \"0.6041862\",\n \"0.6024616\",\n \"0.6012024\",\n \"0.60066485\",\n \"0.59992385\",\n \"0.59871167\",\n \"0.59746844\",\n \"0.5972255\",\n \"0.5960928\",\n \"0.59545374\",\n \"0.5937112\",\n \"0.592752\",\n \"0.5917984\",\n \"0.59169644\",\n \"0.59169644\",\n \"0.5902428\",\n \"0.58849865\",\n \"0.5875591\",\n \"0.58755296\",\n \"0.5875514\",\n \"0.587423\",\n \"0.58736\",\n \"0.5867338\",\n \"0.58670187\",\n \"0.586549\",\n \"0.58638686\",\n \"0.58584964\",\n \"0.58570004\",\n \"0.5855655\",\n \"0.58544326\",\n \"0.5853908\",\n \"0.58506197\",\n \"0.5848465\",\n \"0.58439565\",\n \"0.5834384\",\n \"0.58341503\",\n \"0.58328134\",\n \"0.58246666\",\n \"0.5817145\",\n \"0.5816406\",\n \"0.58159614\",\n \"0.5811003\",\n \"0.58002186\",\n \"0.57989174\",\n \"0.57959586\",\n \"0.57937276\",\n \"0.5782692\",\n \"0.5778702\",\n \"0.57778156\",\n \"0.577657\",\n \"0.57753265\",\n \"0.5761095\",\n \"0.5744396\",\n \"0.574183\",\n \"0.57372963\",\n \"0.57363904\",\n \"0.5734133\",\n \"0.57231736\",\n \"0.57216096\",\n \"0.57209504\",\n \"0.57195085\",\n \"0.5716124\",\n \"0.5711159\",\n \"0.5708904\",\n \"0.5705744\",\n \"0.570271\",\n \"0.56998587\",\n \"0.5694296\",\n \"0.5692792\",\n \"0.5684254\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":11387,"cells":{"query":{"kind":"string","value":"Testing task 243a class main logic (must return True if there are two numbers (x, y) that x ^2 + y ^2 = n)"},"document":{"kind":"string","value":"def test_task243a_main_logic(number, expected_value):\r\n assert algo.Task243a.main_logic(number) == expected_value"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["def sat(nums: List[int]):\n a, b, c, n = nums\n return (a ** n + b ** n == c ** n) and min(a, b, c) > 0 and n > 2","def test():\n Z = func.evaluate_circuit(F, e_x, e_y, e_xor)\n if Z == d[0]:\n return 0\n elif Z == d[1]:\n return 1","def pythagorean_triples(n):\n pass","def solution(n,p):\n \n a=pow(n, (p - 1) // 2, p)\n if(a==1):\n return True\n else :\n return False","def problem9_naive(n):\n for a in range(4, n, 4):\n for b in range(3, n - a):\n c = n - a - b\n if a ** 2 + b ** 2 == c ** 2:\n return a * b * c\n return None","def main():\n # Since a < b < c, we have a + b + c = 1000 > a + a + a, making a < 334.\n for a in range(1, 334):\n # Then b + c = 1000 - a > b + b, making b < 500 - a/2.\n for b in range(a + 1, 501 - a // 2):\n c = 1000 - a - b\n\n # check for Pythagorean triplet\n if a * a + b * b == c * c:\n return a * b * c","def McNuggets(n):\n # Your Code Here\n for c in xrange( n/20+2):\n for b in xrange( (n-20*c)/9+2):\n for a in xrange ((n-20*c-9*b)/6 +2):\n if (6*a + 9*b + 20*c) == n :\n return True\n return False","def check_fermat(a, b, c, n):\n if n > 2 and ((a**n + b**n) == c**n):\n print('Holy smokes, Fermat was wrong!')\n else:\n print('No, that doesn’t work.')","def McNuggets(n):\n # Your Code Here\n\n for a in range(0, n/6+1):\n for b in range(0, n/9+1):\n for c in range(0, n/20+1):\n if 6*a+9*b+20*c == n:\n return True\n return False","def McNuggets(n):\n # Your Code Here\n\n high = n//6+1\n\n if n != 0:\n for i in range(high):\n for j in range(high):\n for k in range(high):\n if 6*k + 9*j + 20*i == n:\n return True\n\n return False\n\n else:\n return False","def is_power_of_two(n):\n if n <= 0:\n return False\n else:\n return n & (n - 1) == 0","def solve_ok(number: int) -> int:\n return no_ones(number) % 2","def McNuggets(n):\n a=0\n b=0\n c=0\n result=0\n while result <= n:\n result = 6*a + 9*b + 20*c\n if result > n:\n return False\n elif result == n:\n return True\n else:\n a+=1\n ...","def is_power_of_two(n):\n if n < 0:\n return False\n else:\n return n & (n - 1) == 0","def sat(n: int):\n return pow(2, n, n) == 3","def is_perfect_square():","def test_v2_correct(self):\r\n\r\n for index, expected_result in enumerate(self.prime_booleans):\r\n\r\n n = index + 1\r\n self.assertEqual(prime_numbers_v2(n), expected_result)","def test_numbers(number):\n assert number ** 2 == number ** 2","def __xor__(p1, p2):\n return not isparallel(p1, p2) and (abs(p1 * p2) < 10*_eps )","def esprimo(n):\n toret = False\n if x == 2:\n toret = True\n elif x % 2 == 0:\n toret = False\n else:\n for i in range(3, x, 2):\n if x % i == 0:\n break\n else:\n toret = True\n # Se ejecuta cuando no se rompe el bucle\n\n return toret","def fn(vals):\n total = odd = 0 \n for i, x in enumerate(vals): \n if vals[0] == x: \n total += 1\n if i&1: odd += 1\n elif vals[0] ^ x != (1 << n) - 1: return inf\n ans = inf \n if len(vals) <= 2*total <= len(vals)+1: ans = min(ans, odd)\n if len(vals)-1 <= 2*total <= len(vals): ans = min(ans, total - odd)\n return ans","def try_formula(a, b):\n n = 0\n while True:\n x = (n**2) + (a*n) + b\n if not is_prime(x):\n break\n n += 1\n return n","def isPentagonal(n):\n test = (sqrt(1+24*n)+1)/6\n return test == (int) (test)","def McNuggets(n):\n \n '''if n == 0:\n return True\n for i in (6, 9, 20):\n if n >= i and McNuggets(n - i):\n return True\n return False\n '''\n \n for a in range(0,n):\n for b in range(0,n):\n for c in range(0,n):\n if 6*a+9*b+20*c == n:\n return True\n return False","def main(): \n for a in range(0,1000):\n for b in range(a,1000):\n for c in range(b,1000):\n if (c*c == (a*a + b*b)) and (a+b+c == 1000):\n print a, b ,c","def brute_force_solution():\n def is_pythagorean_triplet(a, b, c):\n return c**2 == a**2 + b**2\n\n return next(\n a * b * (TRIPLET_SUM - a - b)\n for a in range(1, TRIPLET_SUM)\n for b in range(a + 1, TRIPLET_SUM - a)\n if is_pythagorean_triplet(a, b, TRIPLET_SUM - a - b)\n )","def problem():\n for a in range(1, 380):\n for b in range(a):\n if a + b + (a**2 + b**2)**0.5 == 1000:\n return int(a * b * (a**2 + b**2)**0.5)","def test_domino_with_correct_n_numbers():\n assert compute(7) == 12, \"Not ok\"","def es_primo(n):\n \n for i in range(2, n):\n if n % i == 0:\n return False\n return True","def power_of_2(c):\n return n & (n - 1) == 0","def sat(nums: List[int], n=12345):\n return len(nums) <= 4 and sum(i ** 2 for i in nums) == n","def McNuggets(n):\n a = 0\n b = 0\n c = 0\n\n while 6*a + 9*b + 20*c < n:\n while 6*a + 9*b + 20*c < n:\n while 6*a + 9*b + 20*c < n:\n c += 1\n if 6*a + 9*b + 20*c == n:\n print a, b, c\n return True\n c = 0\n b += 1\n if 6*a + 9*b + 20*c == n:\n print a, b, c\n return True\n b = 0\n a += 1\n\n\n return False","def test_domino_with_2_numbers():\n assert compute(2) == 1, \"Not ok\"","def test_handcrafted_examples(self):\n for i in range(1000):\n self.assertEqual(perfectd(0), True)\n self.assertEqual(prime(0), False)\n self.assertEqual(prime(2), True)\n self.assertEqual(prime(7), True)\n self.assertEqual(prime(15), False)\n self.assertEqual(perfectd(6), True)\n self.assertEqual(perfectd(15), False)","def solution2(n):\n ones = 0\n while n > 0:\n if n & 1:\n ones += 1\n n = n >> 1\n\n return 0 if ones % 2 == 0 else 1","def test_task226_main_logic(number1, number2, expected_value):\r\n assert algo.Task226.main_logic(number1, number2) == expected_value","def testfunction(expr,n):\n \n if expr == g_plus: init, expr = R1d.SpinUp, g_plus\n elif expr == g_minus: init, expr = R1d.SpinDown, g_minus\n else: return \"error\"\n \n a = McLaurin(expr, n) \n \n bool_list = []\n for n in range(5):\n for i in range(-n,n+1):\n bool_list.append(Coef(a,n,i) == R1d.a(n,i, init))\n if bool_list[-1] == False:\n print(\"Step: \", n, \" pos: \", i)\n return all(bool_list)","def tests_truth():\n circ_m = ccxtest(4)\n print(circ_m)\n circ_m = crootnxtest(4)\n print(circ_m)\n circ_m = oracletest(4)\n print(circ_m)\n circ_m = ccx_otest(4)\n print(circ_m)","def McNuggets(n):\n a=0\n b=0\n c=0\n while 6*a + 9*b + 20*c < n:\n for a in range((n//6)+1):\n for b in range((n//9)+1):\n for c in range ((n//20)+1):\n if 6*a + 9*b + 20*c == n:\n return print(True)\n if 6*a + 9*b + 20*c != n:\n return print(False)","def find_pythagorean_triple_product(num):\n\n m = 2\n n = 1\n\n while True:\n a = m ** 2 - n ** 2\n b = 2 * m * n\n c = m ** 2 + n ** 2\n\n if a ** 2 + b ** 2 == c ** 2 and a + b + c == num:\n return a * b * c\n else:\n m += 1\n if m >= num:\n m = 1\n n += 1","def is_composite(n, s, d):\n a = random.randint(2, n)\n if pow(a, d, n) == 1:\n return False\n for r in range(s):\n ind = (2 ** r) * d\n if pow(a, ind, n) == n - 1:\n return False\n return True","def pythTripletFinder(sum1):\n a = 0\n b = 0\n sum1 = int(sum1)\n for x in range(1,sum1):\n\tfor y in range(1,sum1):\n\t if (x*x + y*y) == (sum1 - x -y)**2 :\n\t\treturn x,y,sum1-x-y\n return 0,0,0","def pythagorean_triples(n):\n triples = []\n for i in range(1,n+1):\n for j in range(1, n+1):\n for k in range(1, n+1):\n if i**2 + j**2 == k**2 and i <= j <= k:\n triples.append((i,j,k))\n return triples","def main():\n LIMIT = 600\n GOAL = 1000\n for i in range(1, LIMIT + 1):\n for j in range(1, LIMIT + 1):\n for k in range(1, LIMIT + 1):\n if i + j + k == GOAL:\n if i**2 == j**2 + k**2:\n print \"GOAL:\", (i, j, k)","def my_func(x, y):\n result = 0\n pow_res = 1\n while y:\n pow_res= pow_res*x\n y +=1\n\n result = 1 / pow_res\n\n\n return result","def isprime(n):\n if n!=int(n):\n return False\n n=int(n)\n #Miller-Rabin test for prime\n if n==0 or n==1 or n==4 or n==6 or n==8 or n==9:\n return False\n\n if n==2 or n==3 or n==5 or n==7:\n return True\n s = 0\n d = n-1\n while d%2==0:\n d>>=1\n s+=1\n assert(2**s * d == n-1)\n\n def trial_composite(a):\n if pow(a, d, n) == 1:\n return False\n for i in range(s):\n if pow(a, 2**i * d, n) == n-1:\n return False\n return True\n\n for i in range(8):#number of trials\n a = random.randrange(2, n)\n if trial_composite(a):\n return False\n\n return True","def solve(n: int) -> None:\n count_triangles = 3 * n * n\n for x in range(1, n+1):\n for y in range(1, x+1):\n xy_gcd = gcd(x, y)\n move_x, move_y = x // xy_gcd, y // xy_gcd\n i = 1\n while y + i * move_x <= n and x - i * move_y >= 0:\n count_triangles += 1 + int(x != y)\n i += 1\n i = 1\n while y - i * move_x >= 0 and x + i * move_y <= n:\n count_triangles += 1 + int(x != y)\n i += 1\n print(count_triangles)","def problem():\n\n print 'problem #27'\n\n l = 0\n m_a = 0\n m_b = 0\n for a in xrange(-1000, 1000):\n for b in xrange(-1000, 1000):\n p = len(check(a, b))\n if p > l:\n l = p\n m_a = a\n m_b = b\n\n print 'the product of coefficients is %s' % (m_a * m_b)","def test_v1_correct(self):\r\n\r\n for index, expected_result in enumerate(self.prime_booleans):\r\n\r\n n = index + 1\r\n self.assertEqual(prime_numbers_v1(n), expected_result)","def test_pythagorean_triples(self):\n\n s = space(0)\n for a, b, c in (\n (3, 4, 5),\n (8, 15, 17),\n (33, 56, 65)\n ):\n self.assertTrue(isclose(\n s.hypot(a, b),\n c\n ))\n self.assertTrue(isclose(\n s.leg(a, c),\n b\n ))","def meets_criteria2(num):\n output = True\n if not exactly_two_same_digits(num):\n output = False\n if not digits_increase(num):\n output = False\n return output","def snt(n):\r\n f = True\r\n for j in range(2, n):\r\n if n % j == 0:\r\n f = False\r\n break\r\n return f","def is_po2(n) -> bool:\n return not (n & (n - 1))","def witness(a, n):\n t, u = witHelp(n - 1)\n x0 = xi = modExp(a, u, n)\n for i in range(1, t + 1):\n xi = (x0 ** 2) % n\n if xi == 1 and x0 != 1 and x0 != n - 1:\n return True\n x0 = xi\n if xi != 1:\n return True\n return False","def test_v3_correct(self):\r\n\r\n for index, expected_result in enumerate(self.prime_booleans):\r\n n = index + 1\r\n self.assertEqual(prime_numbers_v3(n), expected_result)","def is_pythagorean_triplet(a,b,c):\n\treturn a**2 + b**2 == c**2","def test_domino_with_3_numbers():\n assert compute(3) == 2, \"Not ok\"","def estPair(nbre):\n if(nbre % 2 == 0):\n return True\n else:\n return False","def pythagorean_triples(n):\n l = []\n # loop over all a < b < c <= n\n for c in range(1, n + 1):\n for b in range(1, c):\n for a in range(1, b):\n if a*a + b*b == c*c:\n l.append((a, b, c))\n return l","def solve(n=100):\n # Build the board.\n single_vals = list(range(1, 21)) + [25]\n double_vals = [2*x for x in single_vals]\n triple_vals = [3*x for x in range(1, 21)]\n total_vals = single_vals + double_vals + triple_vals + [0]\n\n return sum(1 for other_throws, double_throw\n in product(combinations_with_replacement(total_vals, 2), double_vals, repeat=1)\n if sum(other_throws) + double_throw < n)","def answer(self) -> bool:","def triplets():\n for a in xrange(1, 1000):\n for b in xrange(a, 1000):\n c = 1000 - (a + b)\n if a**2 + b**2 == c**2:\n return a, b, c","def is_prime(n, number_of_tests=5):\n passes = 0\n prime = True #assume prime\n for i in xrange(number_of_tests):\n passes += 1\n random_int = random.randint(2, n-1)\n test = pow(random_int, n-1, n)\n if test != 1:\n prime = False\n break\n if prime:\n return 0\n else:\n return passes","def test_count_bits(n, result):\n from count_bits import count_bits\n assert count_bits(n) == result","def is_square(apositiveint):\n x = apositiveint // 2\n seen = set([x])\n while x * x != apositiveint:\n x = (x + (apositiveint // x)) // 2\n if x in seen: return False\n seen.add(x)\n return True","def test_isLucky():\n\n # Test a big range of numbers.\n for x in range(-1000, 1000):\n\n # The value of 'x' is lucky number seven.\n if x == 7:\n assert isLucky(x)\n # We're not lucky.\n else:\n assert not isLucky(x)","def isPowerOfTwo(self, n: int) -> bool:\n if n <= 0:\n return False\n return bin(n).count('1') == 1","def test_getSum_twoNumbers(self):\r\n self.assertEqual(17, Arith().add(8, 9))","def do_tests(n, s, d, t):\n for i in range(t):\n if is_composite(n, s, d):\n return False\n return True","def is_pentagonal(n):\r\n if ((1+(24*n+1)**0.5) / 6)%1 == 0:\r\n return True\r\n return False","def is_power_of_two(n: Union[int, float]):\n\n if n > 1:\n if n != int(n):\n return False\n n = int(n)\n return (n != 0) and (n & (n - 1) == 0)\n elif n == 1:\n return True\n elif n > 0:\n return is_power_of_two(1/n)\n else:\n return False","def test_hackerrank_sample1(self):\n result = find_digits(12)\n self.assertEquals(result, 2)","def fn(i, s0, s1, c0, c1):\n if s0 > n or s1 > n: return 0 # impossible \n if i == len(balls): return int(c0 == c1)\n ans = 0 \n for x in range(balls[i]+1): \n ans += fn(i+1, s0+x, s1+balls[i]-x, c0+(x > 0), c1+(x < balls[i])) * comb(balls[i], x)\n return ans","def Checker(a,b,n,x):\n if n==0:\n if abs(a[0]-b[0])>=x: #if the changes in eta from one time step to another is more than .05mm\n return True #return true to continue the loop\n else:\n return False #stop the loop (this only happens if all of the points had a change of less than .05mm)\n elif abs(a[n]-b[n])>=x: #this checks each of the points in the channel \n return True #if any have too big a change the loop continues\n else: #if that point in the channel has small enough change\n Checker(a,b,n-1) #check the next point in the channel","def is_valid(square: tuple, n: int):\n square_i, square_j = square\n if (square_i < n and square_i >= 0 and square_j < n and square_j >= 0):\n return True\n return False","def _eq(a, b):\n return (a - b) % 2 == 0","def test_correct_value(self):\n self.assertTrue(py_function(6) == 36)\n self.assertFalse(py_function(5) == 9)\n for i in range(0, 10):\n self.assertTrue(py_function(i) == i**2 if i != 0 else 100)","def is_pentagonal(n):\n if (1+(24*n+1)**0.5) % 6 == 0:\n return True\n return False","def test_binops(self):","def test_hackerrank_sample2(self):\n result = find_digits(1012)\n self.assertEquals(result, 3)","def fn(mask, k):\n if not mask: return 0 \n ans = inf \n for i in range(n): \n if mask & (1<<i): \n ans = min(ans, (nums1[i]^nums2[k]) + fn(mask^(1<<i), k+1))\n return ans","def fn(i, j, mask):\n if j == n: return 1 \n if i == m: return fn(0, j+1, mask)\n ans = 0 \n for x in 1<<2*i, 1<<2*i+1, 0b11<<2*i: \n mask0 = mask ^ x\n if mask0 & 0b11<<2*i and (i == 0 or (mask0 >> 2*i) & 0b11 != (mask0 >> 2*i-2) & 0b11): \n ans += fn(i+1, j, mask0)\n return ans % 1_000_000_007","def trial_div(n: int) -> bool:\n if n == 1:\n return False\n i = 2\n while i**2 <= n:\n if n % i == 0:\n return False\n i += 1\n return True","def user_function(x, y):\r\n return x ** 2 + 2 * y ** 2","def task3_is_power(num):\n power = 3\n while num > power:\n num /= power\n return num == power","def test_XOR():\n\tk, outputs = 2, [0,1,1,0]\n\n\ttrue_pi0s = set(['00','11'])\n\ttrue_pi1s = set(['01','10'])\n\n\ttdt0, tdt1 = make_transition_density_tables(k=k, outputs=outputs)\n\tpi0s, pi1s = find_implicants_qm(tdt0) , find_implicants_qm(tdt1)\n\n\tassert (pi0s == true_pi0s) , ('Prime Implicants for 0 does not match. %s != %s' % (pi0s,true_pi0s))\n\tassert (pi1s == true_pi1s) , ('Prime Implicants for 1 does not match. %s != %s' % (pi1s,true_pi1s))\n\t# Two Symbols\n\ttrue_ts0s = [('11',[],[[0,1]]),('00',[],[[0,1]])]\n\ttrue_ts1s = [('10',[[0,1]],[])]\n\n\tts0s,ts1s = find_two_symbols_v2(k=k, prime_implicants=pi0s) , find_two_symbols_v2(k=k, prime_implicants=pi1s)\n\n\tassert (ts0s == true_ts0s) , ('Two Symbol for 0 does not match. %s != %s' % (ts0s,true_ts0s))\n\tassert (ts1s == true_ts1s) , ('Two Symbol for 1 does not match. %s != %s' % (ts1s,true_ts1s))","def primenumber(x):\n if x >= 2:\n for y in range(2,x):\n if not (x % y):\n return False\n else:\n return False\n return True","def verify(self, y):\n left = self.sgroup.exponentiate(self.a, y)\n right = (self.x * self.sgroup.exponentiate(self.b, self.c)) % self.sgroup.p\n is_ok = (left == right)\n return is_ok","def fn(i):\n if i == 2*n-1 or ans[i] and fn(i+1): return True \n for x in reversed(range(1, n+1)): \n if x not in ans: \n ii = x if x > 1 else 0 \n if i+ii < 2*n-1 and ans[i] == ans[i+ii] == 0: \n ans[i] = ans[i+ii] = x\n if fn(i+1): return True \n ans[i] = ans[i+ii] = 0","def test_domino_with_15_numbers():\n assert compute(15) == 56, \"Not ok\"","def test_domino_with_9_numbers():\n assert compute(9) == 20, \"Not ok\"","def sat(n: int, nums=[77410, 23223, 54187], lower_bound=2):\n return all(i % n == 0 for i in nums) and n >= lower_bound","def test_prime(n):\n if SIEVE[n]:\n return True\n else:\n return False","def test_twoSum(self):\n self.assertEqual(twoSum([2, 7, 11, 15], 9), [0, 1])","def perfectd(n: int) -> bool:\n if sum(divisors(n)) - n == n:\n return True\n else:\n return False","def test_results():\n x = 0.5\n np.testing.assert_almost_equal(nbf.sum_x_n_calc(\n x, z_n, k_n_1), npf.sum_x_n_calc(x, z_n, k_n_1))","def nine():\r\n \r\n a = 3\r\n b = 4\r\n c = pythagorean(a, b)\r\n \r\n while a + b + c < 1001:\r\n while a + b + c < 1001:\r\n if a + b + c == 1000:\r\n return a * b * c\r\n b += 1\r\n c = pythagorean(a, b)\r\n a += 1\r\n b = a + 1\r\n c = pythagorean(a, b)","def Ballie_PSW_test(n, max_trivial_trials=100):\n for i in range(max_trivial_trials):\n if primes[i] == n:\n return True\n if n % primes[i] == 0:\n return False\n if primes[i] ** 2 >= n:\n return True\n if not fermat_strong_test(n, 2):\n return False\n if not lucas_selfridge_test(n):\n return False\n return True","def test_basic(self):\n# self.assertEqual(solution(\"\"\"noop\n# addx 3\n# addx -5\"\"\"), -1)\n self.assertEqual(solution(\"\"\"addx 15\naddx -11\naddx 6\naddx -3\naddx 5\naddx -1\naddx -8\naddx 13\naddx 4\nnoop\naddx -1\naddx 5\naddx -1\naddx 5\naddx -1\naddx 5\naddx -1\naddx 5\naddx -1\naddx -35\naddx 1\naddx 24\naddx -19\naddx 1\naddx 16\naddx -11\nnoop\nnoop\naddx 21\naddx -15\nnoop\nnoop\naddx -3\naddx 9\naddx 1\naddx -3\naddx 8\naddx 1\naddx 5\nnoop\nnoop\nnoop\nnoop\nnoop\naddx -36\nnoop\naddx 1\naddx 7\nnoop\nnoop\nnoop\naddx 2\naddx 6\nnoop\nnoop\nnoop\nnoop\nnoop\naddx 1\nnoop\nnoop\naddx 7\naddx 1\nnoop\naddx -13\naddx 13\naddx 7\nnoop\naddx 1\naddx -33\nnoop\nnoop\nnoop\naddx 2\nnoop\nnoop\nnoop\naddx 8\nnoop\naddx -1\naddx 2\naddx 1\nnoop\naddx 17\naddx -9\naddx 1\naddx 1\naddx -3\naddx 11\nnoop\nnoop\naddx 1\nnoop\naddx 1\nnoop\nnoop\naddx -13\naddx -19\naddx 1\naddx 3\naddx 26\naddx -30\naddx 12\naddx -1\naddx 3\naddx 1\nnoop\nnoop\nnoop\naddx -9\naddx 18\naddx 1\naddx 2\nnoop\nnoop\naddx 9\nnoop\nnoop\nnoop\naddx -1\naddx 2\naddx -37\naddx 1\naddx 3\nnoop\naddx 15\naddx -21\naddx 22\naddx -6\naddx 1\nnoop\naddx 2\naddx 1\nnoop\naddx -10\nnoop\nnoop\naddx 20\naddx 1\naddx 2\naddx 2\naddx -6\naddx -11\nnoop\nnoop\nnoop\"\"\"), -1)","def sol(n):\n p = 1\n res = 0\n \n while n:\n p*=5\n if n&1:\n res+=p\n n=n>>1\n return res%1000000007","def tes_mod(self):\r\n x, y = ints('xy')\r\n fn = gof.DualLinker().accept(FunctionGraph([x,y], [x%y])).make_function()\r\n for a,b in ((0,1), (1,1), (0,-1), (1,-1), (-1,-1),\r\n (1,2), (-1,2), (1,-2), (-1,-2),\r\n (5,3), (-5,3), (5,-3), (-5,-3)\r\n ):\r\n self.assertTrue(fn(a,b) == a%b, (a,))"],"string":"[\n \"def sat(nums: List[int]):\\n a, b, c, n = nums\\n return (a ** n + b ** n == c ** n) and min(a, b, c) > 0 and n > 2\",\n \"def test():\\n Z = func.evaluate_circuit(F, e_x, e_y, e_xor)\\n if Z == d[0]:\\n return 0\\n elif Z == d[1]:\\n return 1\",\n \"def pythagorean_triples(n):\\n pass\",\n \"def solution(n,p):\\n \\n a=pow(n, (p - 1) // 2, p)\\n if(a==1):\\n return True\\n else :\\n return False\",\n \"def problem9_naive(n):\\n for a in range(4, n, 4):\\n for b in range(3, n - a):\\n c = n - a - b\\n if a ** 2 + b ** 2 == c ** 2:\\n return a * b * c\\n return None\",\n \"def main():\\n # Since a < b < c, we have a + b + c = 1000 > a + a + a, making a < 334.\\n for a in range(1, 334):\\n # Then b + c = 1000 - a > b + b, making b < 500 - a/2.\\n for b in range(a + 1, 501 - a // 2):\\n c = 1000 - a - b\\n\\n # check for Pythagorean triplet\\n if a * a + b * b == c * c:\\n return a * b * c\",\n \"def McNuggets(n):\\n # Your Code Here\\n for c in xrange( n/20+2):\\n for b in xrange( (n-20*c)/9+2):\\n for a in xrange ((n-20*c-9*b)/6 +2):\\n if (6*a + 9*b + 20*c) == n :\\n return True\\n return False\",\n \"def check_fermat(a, b, c, n):\\n if n > 2 and ((a**n + b**n) == c**n):\\n print('Holy smokes, Fermat was wrong!')\\n else:\\n print('No, that doesn’t work.')\",\n \"def McNuggets(n):\\n # Your Code Here\\n\\n for a in range(0, n/6+1):\\n for b in range(0, n/9+1):\\n for c in range(0, n/20+1):\\n if 6*a+9*b+20*c == n:\\n return True\\n return False\",\n \"def McNuggets(n):\\n # Your Code Here\\n\\n high = n//6+1\\n\\n if n != 0:\\n for i in range(high):\\n for j in range(high):\\n for k in range(high):\\n if 6*k + 9*j + 20*i == n:\\n return True\\n\\n return False\\n\\n else:\\n return False\",\n \"def is_power_of_two(n):\\n if n <= 0:\\n return False\\n else:\\n return n & (n - 1) == 0\",\n \"def solve_ok(number: int) -> int:\\n return no_ones(number) % 2\",\n \"def McNuggets(n):\\n a=0\\n b=0\\n c=0\\n result=0\\n while result <= n:\\n result = 6*a + 9*b + 20*c\\n if result > n:\\n return False\\n elif result == n:\\n return True\\n else:\\n a+=1\\n ...\",\n \"def is_power_of_two(n):\\n if n < 0:\\n return False\\n else:\\n return n & (n - 1) == 0\",\n \"def sat(n: int):\\n return pow(2, n, n) == 3\",\n \"def is_perfect_square():\",\n \"def test_v2_correct(self):\\r\\n\\r\\n for index, expected_result in enumerate(self.prime_booleans):\\r\\n\\r\\n n = index + 1\\r\\n self.assertEqual(prime_numbers_v2(n), expected_result)\",\n \"def test_numbers(number):\\n assert number ** 2 == number ** 2\",\n \"def __xor__(p1, p2):\\n return not isparallel(p1, p2) and (abs(p1 * p2) < 10*_eps )\",\n \"def esprimo(n):\\n toret = False\\n if x == 2:\\n toret = True\\n elif x % 2 == 0:\\n toret = False\\n else:\\n for i in range(3, x, 2):\\n if x % i == 0:\\n break\\n else:\\n toret = True\\n # Se ejecuta cuando no se rompe el bucle\\n\\n return toret\",\n \"def fn(vals):\\n total = odd = 0 \\n for i, x in enumerate(vals): \\n if vals[0] == x: \\n total += 1\\n if i&1: odd += 1\\n elif vals[0] ^ x != (1 << n) - 1: return inf\\n ans = inf \\n if len(vals) <= 2*total <= len(vals)+1: ans = min(ans, odd)\\n if len(vals)-1 <= 2*total <= len(vals): ans = min(ans, total - odd)\\n return ans\",\n \"def try_formula(a, b):\\n n = 0\\n while True:\\n x = (n**2) + (a*n) + b\\n if not is_prime(x):\\n break\\n n += 1\\n return n\",\n \"def isPentagonal(n):\\n test = (sqrt(1+24*n)+1)/6\\n return test == (int) (test)\",\n \"def McNuggets(n):\\n \\n '''if n == 0:\\n return True\\n for i in (6, 9, 20):\\n if n >= i and McNuggets(n - i):\\n return True\\n return False\\n '''\\n \\n for a in range(0,n):\\n for b in range(0,n):\\n for c in range(0,n):\\n if 6*a+9*b+20*c == n:\\n return True\\n return False\",\n \"def main(): \\n for a in range(0,1000):\\n for b in range(a,1000):\\n for c in range(b,1000):\\n if (c*c == (a*a + b*b)) and (a+b+c == 1000):\\n print a, b ,c\",\n \"def brute_force_solution():\\n def is_pythagorean_triplet(a, b, c):\\n return c**2 == a**2 + b**2\\n\\n return next(\\n a * b * (TRIPLET_SUM - a - b)\\n for a in range(1, TRIPLET_SUM)\\n for b in range(a + 1, TRIPLET_SUM - a)\\n if is_pythagorean_triplet(a, b, TRIPLET_SUM - a - b)\\n )\",\n \"def problem():\\n for a in range(1, 380):\\n for b in range(a):\\n if a + b + (a**2 + b**2)**0.5 == 1000:\\n return int(a * b * (a**2 + b**2)**0.5)\",\n \"def test_domino_with_correct_n_numbers():\\n assert compute(7) == 12, \\\"Not ok\\\"\",\n \"def es_primo(n):\\n \\n for i in range(2, n):\\n if n % i == 0:\\n return False\\n return True\",\n \"def power_of_2(c):\\n return n & (n - 1) == 0\",\n \"def sat(nums: List[int], n=12345):\\n return len(nums) <= 4 and sum(i ** 2 for i in nums) == n\",\n \"def McNuggets(n):\\n a = 0\\n b = 0\\n c = 0\\n\\n while 6*a + 9*b + 20*c < n:\\n while 6*a + 9*b + 20*c < n:\\n while 6*a + 9*b + 20*c < n:\\n c += 1\\n if 6*a + 9*b + 20*c == n:\\n print a, b, c\\n return True\\n c = 0\\n b += 1\\n if 6*a + 9*b + 20*c == n:\\n print a, b, c\\n return True\\n b = 0\\n a += 1\\n\\n\\n return False\",\n \"def test_domino_with_2_numbers():\\n assert compute(2) == 1, \\\"Not ok\\\"\",\n \"def test_handcrafted_examples(self):\\n for i in range(1000):\\n self.assertEqual(perfectd(0), True)\\n self.assertEqual(prime(0), False)\\n self.assertEqual(prime(2), True)\\n self.assertEqual(prime(7), True)\\n self.assertEqual(prime(15), False)\\n self.assertEqual(perfectd(6), True)\\n self.assertEqual(perfectd(15), False)\",\n \"def solution2(n):\\n ones = 0\\n while n > 0:\\n if n & 1:\\n ones += 1\\n n = n >> 1\\n\\n return 0 if ones % 2 == 0 else 1\",\n \"def test_task226_main_logic(number1, number2, expected_value):\\r\\n assert algo.Task226.main_logic(number1, number2) == expected_value\",\n \"def testfunction(expr,n):\\n \\n if expr == g_plus: init, expr = R1d.SpinUp, g_plus\\n elif expr == g_minus: init, expr = R1d.SpinDown, g_minus\\n else: return \\\"error\\\"\\n \\n a = McLaurin(expr, n) \\n \\n bool_list = []\\n for n in range(5):\\n for i in range(-n,n+1):\\n bool_list.append(Coef(a,n,i) == R1d.a(n,i, init))\\n if bool_list[-1] == False:\\n print(\\\"Step: \\\", n, \\\" pos: \\\", i)\\n return all(bool_list)\",\n \"def tests_truth():\\n circ_m = ccxtest(4)\\n print(circ_m)\\n circ_m = crootnxtest(4)\\n print(circ_m)\\n circ_m = oracletest(4)\\n print(circ_m)\\n circ_m = ccx_otest(4)\\n print(circ_m)\",\n \"def McNuggets(n):\\n a=0\\n b=0\\n c=0\\n while 6*a + 9*b + 20*c < n:\\n for a in range((n//6)+1):\\n for b in range((n//9)+1):\\n for c in range ((n//20)+1):\\n if 6*a + 9*b + 20*c == n:\\n return print(True)\\n if 6*a + 9*b + 20*c != n:\\n return print(False)\",\n \"def find_pythagorean_triple_product(num):\\n\\n m = 2\\n n = 1\\n\\n while True:\\n a = m ** 2 - n ** 2\\n b = 2 * m * n\\n c = m ** 2 + n ** 2\\n\\n if a ** 2 + b ** 2 == c ** 2 and a + b + c == num:\\n return a * b * c\\n else:\\n m += 1\\n if m >= num:\\n m = 1\\n n += 1\",\n \"def is_composite(n, s, d):\\n a = random.randint(2, n)\\n if pow(a, d, n) == 1:\\n return False\\n for r in range(s):\\n ind = (2 ** r) * d\\n if pow(a, ind, n) == n - 1:\\n return False\\n return True\",\n \"def pythTripletFinder(sum1):\\n a = 0\\n b = 0\\n sum1 = int(sum1)\\n for x in range(1,sum1):\\n\\tfor y in range(1,sum1):\\n\\t if (x*x + y*y) == (sum1 - x -y)**2 :\\n\\t\\treturn x,y,sum1-x-y\\n return 0,0,0\",\n \"def pythagorean_triples(n):\\n triples = []\\n for i in range(1,n+1):\\n for j in range(1, n+1):\\n for k in range(1, n+1):\\n if i**2 + j**2 == k**2 and i <= j <= k:\\n triples.append((i,j,k))\\n return triples\",\n \"def main():\\n LIMIT = 600\\n GOAL = 1000\\n for i in range(1, LIMIT + 1):\\n for j in range(1, LIMIT + 1):\\n for k in range(1, LIMIT + 1):\\n if i + j + k == GOAL:\\n if i**2 == j**2 + k**2:\\n print \\\"GOAL:\\\", (i, j, k)\",\n \"def my_func(x, y):\\n result = 0\\n pow_res = 1\\n while y:\\n pow_res= pow_res*x\\n y +=1\\n\\n result = 1 / pow_res\\n\\n\\n return result\",\n \"def isprime(n):\\n if n!=int(n):\\n return False\\n n=int(n)\\n #Miller-Rabin test for prime\\n if n==0 or n==1 or n==4 or n==6 or n==8 or n==9:\\n return False\\n\\n if n==2 or n==3 or n==5 or n==7:\\n return True\\n s = 0\\n d = n-1\\n while d%2==0:\\n d>>=1\\n s+=1\\n assert(2**s * d == n-1)\\n\\n def trial_composite(a):\\n if pow(a, d, n) == 1:\\n return False\\n for i in range(s):\\n if pow(a, 2**i * d, n) == n-1:\\n return False\\n return True\\n\\n for i in range(8):#number of trials\\n a = random.randrange(2, n)\\n if trial_composite(a):\\n return False\\n\\n return True\",\n \"def solve(n: int) -> None:\\n count_triangles = 3 * n * n\\n for x in range(1, n+1):\\n for y in range(1, x+1):\\n xy_gcd = gcd(x, y)\\n move_x, move_y = x // xy_gcd, y // xy_gcd\\n i = 1\\n while y + i * move_x <= n and x - i * move_y >= 0:\\n count_triangles += 1 + int(x != y)\\n i += 1\\n i = 1\\n while y - i * move_x >= 0 and x + i * move_y <= n:\\n count_triangles += 1 + int(x != y)\\n i += 1\\n print(count_triangles)\",\n \"def problem():\\n\\n print 'problem #27'\\n\\n l = 0\\n m_a = 0\\n m_b = 0\\n for a in xrange(-1000, 1000):\\n for b in xrange(-1000, 1000):\\n p = len(check(a, b))\\n if p > l:\\n l = p\\n m_a = a\\n m_b = b\\n\\n print 'the product of coefficients is %s' % (m_a * m_b)\",\n \"def test_v1_correct(self):\\r\\n\\r\\n for index, expected_result in enumerate(self.prime_booleans):\\r\\n\\r\\n n = index + 1\\r\\n self.assertEqual(prime_numbers_v1(n), expected_result)\",\n \"def test_pythagorean_triples(self):\\n\\n s = space(0)\\n for a, b, c in (\\n (3, 4, 5),\\n (8, 15, 17),\\n (33, 56, 65)\\n ):\\n self.assertTrue(isclose(\\n s.hypot(a, b),\\n c\\n ))\\n self.assertTrue(isclose(\\n s.leg(a, c),\\n b\\n ))\",\n \"def meets_criteria2(num):\\n output = True\\n if not exactly_two_same_digits(num):\\n output = False\\n if not digits_increase(num):\\n output = False\\n return output\",\n \"def snt(n):\\r\\n f = True\\r\\n for j in range(2, n):\\r\\n if n % j == 0:\\r\\n f = False\\r\\n break\\r\\n return f\",\n \"def is_po2(n) -> bool:\\n return not (n & (n - 1))\",\n \"def witness(a, n):\\n t, u = witHelp(n - 1)\\n x0 = xi = modExp(a, u, n)\\n for i in range(1, t + 1):\\n xi = (x0 ** 2) % n\\n if xi == 1 and x0 != 1 and x0 != n - 1:\\n return True\\n x0 = xi\\n if xi != 1:\\n return True\\n return False\",\n \"def test_v3_correct(self):\\r\\n\\r\\n for index, expected_result in enumerate(self.prime_booleans):\\r\\n n = index + 1\\r\\n self.assertEqual(prime_numbers_v3(n), expected_result)\",\n \"def is_pythagorean_triplet(a,b,c):\\n\\treturn a**2 + b**2 == c**2\",\n \"def test_domino_with_3_numbers():\\n assert compute(3) == 2, \\\"Not ok\\\"\",\n \"def estPair(nbre):\\n if(nbre % 2 == 0):\\n return True\\n else:\\n return False\",\n \"def pythagorean_triples(n):\\n l = []\\n # loop over all a < b < c <= n\\n for c in range(1, n + 1):\\n for b in range(1, c):\\n for a in range(1, b):\\n if a*a + b*b == c*c:\\n l.append((a, b, c))\\n return l\",\n \"def solve(n=100):\\n # Build the board.\\n single_vals = list(range(1, 21)) + [25]\\n double_vals = [2*x for x in single_vals]\\n triple_vals = [3*x for x in range(1, 21)]\\n total_vals = single_vals + double_vals + triple_vals + [0]\\n\\n return sum(1 for other_throws, double_throw\\n in product(combinations_with_replacement(total_vals, 2), double_vals, repeat=1)\\n if sum(other_throws) + double_throw < n)\",\n \"def answer(self) -> bool:\",\n \"def triplets():\\n for a in xrange(1, 1000):\\n for b in xrange(a, 1000):\\n c = 1000 - (a + b)\\n if a**2 + b**2 == c**2:\\n return a, b, c\",\n \"def is_prime(n, number_of_tests=5):\\n passes = 0\\n prime = True #assume prime\\n for i in xrange(number_of_tests):\\n passes += 1\\n random_int = random.randint(2, n-1)\\n test = pow(random_int, n-1, n)\\n if test != 1:\\n prime = False\\n break\\n if prime:\\n return 0\\n else:\\n return passes\",\n \"def test_count_bits(n, result):\\n from count_bits import count_bits\\n assert count_bits(n) == result\",\n \"def is_square(apositiveint):\\n x = apositiveint // 2\\n seen = set([x])\\n while x * x != apositiveint:\\n x = (x + (apositiveint // x)) // 2\\n if x in seen: return False\\n seen.add(x)\\n return True\",\n \"def test_isLucky():\\n\\n # Test a big range of numbers.\\n for x in range(-1000, 1000):\\n\\n # The value of 'x' is lucky number seven.\\n if x == 7:\\n assert isLucky(x)\\n # We're not lucky.\\n else:\\n assert not isLucky(x)\",\n \"def isPowerOfTwo(self, n: int) -> bool:\\n if n <= 0:\\n return False\\n return bin(n).count('1') == 1\",\n \"def test_getSum_twoNumbers(self):\\r\\n self.assertEqual(17, Arith().add(8, 9))\",\n \"def do_tests(n, s, d, t):\\n for i in range(t):\\n if is_composite(n, s, d):\\n return False\\n return True\",\n \"def is_pentagonal(n):\\r\\n if ((1+(24*n+1)**0.5) / 6)%1 == 0:\\r\\n return True\\r\\n return False\",\n \"def is_power_of_two(n: Union[int, float]):\\n\\n if n > 1:\\n if n != int(n):\\n return False\\n n = int(n)\\n return (n != 0) and (n & (n - 1) == 0)\\n elif n == 1:\\n return True\\n elif n > 0:\\n return is_power_of_two(1/n)\\n else:\\n return False\",\n \"def test_hackerrank_sample1(self):\\n result = find_digits(12)\\n self.assertEquals(result, 2)\",\n \"def fn(i, s0, s1, c0, c1):\\n if s0 > n or s1 > n: return 0 # impossible \\n if i == len(balls): return int(c0 == c1)\\n ans = 0 \\n for x in range(balls[i]+1): \\n ans += fn(i+1, s0+x, s1+balls[i]-x, c0+(x > 0), c1+(x < balls[i])) * comb(balls[i], x)\\n return ans\",\n \"def Checker(a,b,n,x):\\n if n==0:\\n if abs(a[0]-b[0])>=x: #if the changes in eta from one time step to another is more than .05mm\\n return True #return true to continue the loop\\n else:\\n return False #stop the loop (this only happens if all of the points had a change of less than .05mm)\\n elif abs(a[n]-b[n])>=x: #this checks each of the points in the channel \\n return True #if any have too big a change the loop continues\\n else: #if that point in the channel has small enough change\\n Checker(a,b,n-1) #check the next point in the channel\",\n \"def is_valid(square: tuple, n: int):\\n square_i, square_j = square\\n if (square_i < n and square_i >= 0 and square_j < n and square_j >= 0):\\n return True\\n return False\",\n \"def _eq(a, b):\\n return (a - b) % 2 == 0\",\n \"def test_correct_value(self):\\n self.assertTrue(py_function(6) == 36)\\n self.assertFalse(py_function(5) == 9)\\n for i in range(0, 10):\\n self.assertTrue(py_function(i) == i**2 if i != 0 else 100)\",\n \"def is_pentagonal(n):\\n if (1+(24*n+1)**0.5) % 6 == 0:\\n return True\\n return False\",\n \"def test_binops(self):\",\n \"def test_hackerrank_sample2(self):\\n result = find_digits(1012)\\n self.assertEquals(result, 3)\",\n \"def fn(mask, k):\\n if not mask: return 0 \\n ans = inf \\n for i in range(n): \\n if mask & (1<<i): \\n ans = min(ans, (nums1[i]^nums2[k]) + fn(mask^(1<<i), k+1))\\n return ans\",\n \"def fn(i, j, mask):\\n if j == n: return 1 \\n if i == m: return fn(0, j+1, mask)\\n ans = 0 \\n for x in 1<<2*i, 1<<2*i+1, 0b11<<2*i: \\n mask0 = mask ^ x\\n if mask0 & 0b11<<2*i and (i == 0 or (mask0 >> 2*i) & 0b11 != (mask0 >> 2*i-2) & 0b11): \\n ans += fn(i+1, j, mask0)\\n return ans % 1_000_000_007\",\n \"def trial_div(n: int) -> bool:\\n if n == 1:\\n return False\\n i = 2\\n while i**2 <= n:\\n if n % i == 0:\\n return False\\n i += 1\\n return True\",\n \"def user_function(x, y):\\r\\n return x ** 2 + 2 * y ** 2\",\n \"def task3_is_power(num):\\n power = 3\\n while num > power:\\n num /= power\\n return num == power\",\n \"def test_XOR():\\n\\tk, outputs = 2, [0,1,1,0]\\n\\n\\ttrue_pi0s = set(['00','11'])\\n\\ttrue_pi1s = set(['01','10'])\\n\\n\\ttdt0, tdt1 = make_transition_density_tables(k=k, outputs=outputs)\\n\\tpi0s, pi1s = find_implicants_qm(tdt0) , find_implicants_qm(tdt1)\\n\\n\\tassert (pi0s == true_pi0s) , ('Prime Implicants for 0 does not match. %s != %s' % (pi0s,true_pi0s))\\n\\tassert (pi1s == true_pi1s) , ('Prime Implicants for 1 does not match. %s != %s' % (pi1s,true_pi1s))\\n\\t# Two Symbols\\n\\ttrue_ts0s = [('11',[],[[0,1]]),('00',[],[[0,1]])]\\n\\ttrue_ts1s = [('10',[[0,1]],[])]\\n\\n\\tts0s,ts1s = find_two_symbols_v2(k=k, prime_implicants=pi0s) , find_two_symbols_v2(k=k, prime_implicants=pi1s)\\n\\n\\tassert (ts0s == true_ts0s) , ('Two Symbol for 0 does not match. %s != %s' % (ts0s,true_ts0s))\\n\\tassert (ts1s == true_ts1s) , ('Two Symbol for 1 does not match. %s != %s' % (ts1s,true_ts1s))\",\n \"def primenumber(x):\\n if x >= 2:\\n for y in range(2,x):\\n if not (x % y):\\n return False\\n else:\\n return False\\n return True\",\n \"def verify(self, y):\\n left = self.sgroup.exponentiate(self.a, y)\\n right = (self.x * self.sgroup.exponentiate(self.b, self.c)) % self.sgroup.p\\n is_ok = (left == right)\\n return is_ok\",\n \"def fn(i):\\n if i == 2*n-1 or ans[i] and fn(i+1): return True \\n for x in reversed(range(1, n+1)): \\n if x not in ans: \\n ii = x if x > 1 else 0 \\n if i+ii < 2*n-1 and ans[i] == ans[i+ii] == 0: \\n ans[i] = ans[i+ii] = x\\n if fn(i+1): return True \\n ans[i] = ans[i+ii] = 0\",\n \"def test_domino_with_15_numbers():\\n assert compute(15) == 56, \\\"Not ok\\\"\",\n \"def test_domino_with_9_numbers():\\n assert compute(9) == 20, \\\"Not ok\\\"\",\n \"def sat(n: int, nums=[77410, 23223, 54187], lower_bound=2):\\n return all(i % n == 0 for i in nums) and n >= lower_bound\",\n \"def test_prime(n):\\n if SIEVE[n]:\\n return True\\n else:\\n return False\",\n \"def test_twoSum(self):\\n self.assertEqual(twoSum([2, 7, 11, 15], 9), [0, 1])\",\n \"def perfectd(n: int) -> bool:\\n if sum(divisors(n)) - n == n:\\n return True\\n else:\\n return False\",\n \"def test_results():\\n x = 0.5\\n np.testing.assert_almost_equal(nbf.sum_x_n_calc(\\n x, z_n, k_n_1), npf.sum_x_n_calc(x, z_n, k_n_1))\",\n \"def nine():\\r\\n \\r\\n a = 3\\r\\n b = 4\\r\\n c = pythagorean(a, b)\\r\\n \\r\\n while a + b + c < 1001:\\r\\n while a + b + c < 1001:\\r\\n if a + b + c == 1000:\\r\\n return a * b * c\\r\\n b += 1\\r\\n c = pythagorean(a, b)\\r\\n a += 1\\r\\n b = a + 1\\r\\n c = pythagorean(a, b)\",\n \"def Ballie_PSW_test(n, max_trivial_trials=100):\\n for i in range(max_trivial_trials):\\n if primes[i] == n:\\n return True\\n if n % primes[i] == 0:\\n return False\\n if primes[i] ** 2 >= n:\\n return True\\n if not fermat_strong_test(n, 2):\\n return False\\n if not lucas_selfridge_test(n):\\n return False\\n return True\",\n \"def test_basic(self):\\n# self.assertEqual(solution(\\\"\\\"\\\"noop\\n# addx 3\\n# addx -5\\\"\\\"\\\"), -1)\\n self.assertEqual(solution(\\\"\\\"\\\"addx 15\\naddx -11\\naddx 6\\naddx -3\\naddx 5\\naddx -1\\naddx -8\\naddx 13\\naddx 4\\nnoop\\naddx -1\\naddx 5\\naddx -1\\naddx 5\\naddx -1\\naddx 5\\naddx -1\\naddx 5\\naddx -1\\naddx -35\\naddx 1\\naddx 24\\naddx -19\\naddx 1\\naddx 16\\naddx -11\\nnoop\\nnoop\\naddx 21\\naddx -15\\nnoop\\nnoop\\naddx -3\\naddx 9\\naddx 1\\naddx -3\\naddx 8\\naddx 1\\naddx 5\\nnoop\\nnoop\\nnoop\\nnoop\\nnoop\\naddx -36\\nnoop\\naddx 1\\naddx 7\\nnoop\\nnoop\\nnoop\\naddx 2\\naddx 6\\nnoop\\nnoop\\nnoop\\nnoop\\nnoop\\naddx 1\\nnoop\\nnoop\\naddx 7\\naddx 1\\nnoop\\naddx -13\\naddx 13\\naddx 7\\nnoop\\naddx 1\\naddx -33\\nnoop\\nnoop\\nnoop\\naddx 2\\nnoop\\nnoop\\nnoop\\naddx 8\\nnoop\\naddx -1\\naddx 2\\naddx 1\\nnoop\\naddx 17\\naddx -9\\naddx 1\\naddx 1\\naddx -3\\naddx 11\\nnoop\\nnoop\\naddx 1\\nnoop\\naddx 1\\nnoop\\nnoop\\naddx -13\\naddx -19\\naddx 1\\naddx 3\\naddx 26\\naddx -30\\naddx 12\\naddx -1\\naddx 3\\naddx 1\\nnoop\\nnoop\\nnoop\\naddx -9\\naddx 18\\naddx 1\\naddx 2\\nnoop\\nnoop\\naddx 9\\nnoop\\nnoop\\nnoop\\naddx -1\\naddx 2\\naddx -37\\naddx 1\\naddx 3\\nnoop\\naddx 15\\naddx -21\\naddx 22\\naddx -6\\naddx 1\\nnoop\\naddx 2\\naddx 1\\nnoop\\naddx -10\\nnoop\\nnoop\\naddx 20\\naddx 1\\naddx 2\\naddx 2\\naddx -6\\naddx -11\\nnoop\\nnoop\\nnoop\\\"\\\"\\\"), -1)\",\n \"def sol(n):\\n p = 1\\n res = 0\\n \\n while n:\\n p*=5\\n if n&1:\\n res+=p\\n n=n>>1\\n return res%1000000007\",\n \"def tes_mod(self):\\r\\n x, y = ints('xy')\\r\\n fn = gof.DualLinker().accept(FunctionGraph([x,y], [x%y])).make_function()\\r\\n for a,b in ((0,1), (1,1), (0,-1), (1,-1), (-1,-1),\\r\\n (1,2), (-1,2), (1,-2), (-1,-2),\\r\\n (5,3), (-5,3), (5,-3), (-5,-3)\\r\\n ):\\r\\n self.assertTrue(fn(a,b) == a%b, (a,))\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6706456","0.66754526","0.6513662","0.6498251","0.6456267","0.6443523","0.64273536","0.64265066","0.639999","0.6359324","0.6353393","0.63304996","0.6319994","0.6313225","0.6308553","0.63083005","0.62622416","0.6259431","0.6248913","0.62471896","0.62465155","0.6246119","0.62434304","0.62417305","0.62124676","0.6192004","0.61899054","0.61790293","0.61710244","0.6164767","0.6155907","0.6104392","0.6102128","0.60967124","0.6086383","0.6085372","0.60736024","0.6068457","0.6061228","0.6055949","0.6041148","0.6029366","0.6028438","0.60038","0.59905565","0.59790033","0.5943482","0.5934422","0.59275955","0.5919723","0.5917803","0.59156466","0.5911514","0.5904544","0.590048","0.58983946","0.5893227","0.58893937","0.5885434","0.58839965","0.58721757","0.5870134","0.5868244","0.5866447","0.5862671","0.5858339","0.58571386","0.5852395","0.5843071","0.58374065","0.58343977","0.5831074","0.5828498","0.5813765","0.58092296","0.58073336","0.5804061","0.57873833","0.57830477","0.5776805","0.577661","0.5773295","0.5772411","0.57715297","0.5770566","0.5767765","0.5761422","0.5759053","0.5755535","0.57541054","0.57525784","0.5752543","0.5750062","0.5749785","0.5748269","0.57387286","0.57358384","0.5735207","0.57275593","0.57236457","0.57175153"],"string":"[\n \"0.6706456\",\n \"0.66754526\",\n \"0.6513662\",\n \"0.6498251\",\n \"0.6456267\",\n \"0.6443523\",\n \"0.64273536\",\n \"0.64265066\",\n \"0.639999\",\n \"0.6359324\",\n \"0.6353393\",\n \"0.63304996\",\n \"0.6319994\",\n \"0.6313225\",\n \"0.6308553\",\n \"0.63083005\",\n \"0.62622416\",\n \"0.6259431\",\n \"0.6248913\",\n \"0.62471896\",\n \"0.62465155\",\n \"0.6246119\",\n \"0.62434304\",\n \"0.62417305\",\n \"0.62124676\",\n \"0.6192004\",\n \"0.61899054\",\n \"0.61790293\",\n \"0.61710244\",\n \"0.6164767\",\n \"0.6155907\",\n \"0.6104392\",\n \"0.6102128\",\n \"0.60967124\",\n \"0.6086383\",\n \"0.6085372\",\n \"0.60736024\",\n \"0.6068457\",\n \"0.6061228\",\n \"0.6055949\",\n \"0.6041148\",\n \"0.6029366\",\n \"0.6028438\",\n \"0.60038\",\n \"0.59905565\",\n \"0.59790033\",\n \"0.5943482\",\n \"0.5934422\",\n \"0.59275955\",\n \"0.5919723\",\n \"0.5917803\",\n \"0.59156466\",\n \"0.5911514\",\n \"0.5904544\",\n \"0.590048\",\n \"0.58983946\",\n \"0.5893227\",\n \"0.58893937\",\n \"0.5885434\",\n \"0.58839965\",\n \"0.58721757\",\n \"0.5870134\",\n \"0.5868244\",\n \"0.5866447\",\n \"0.5862671\",\n \"0.5858339\",\n \"0.58571386\",\n \"0.5852395\",\n \"0.5843071\",\n \"0.58374065\",\n \"0.58343977\",\n \"0.5831074\",\n \"0.5828498\",\n \"0.5813765\",\n \"0.58092296\",\n \"0.58073336\",\n \"0.5804061\",\n \"0.57873833\",\n \"0.57830477\",\n \"0.5776805\",\n \"0.577661\",\n \"0.5773295\",\n \"0.5772411\",\n \"0.57715297\",\n \"0.5770566\",\n \"0.5767765\",\n \"0.5761422\",\n \"0.5759053\",\n \"0.5755535\",\n \"0.57541054\",\n \"0.57525784\",\n \"0.5752543\",\n \"0.5750062\",\n \"0.5749785\",\n \"0.5748269\",\n \"0.57387286\",\n \"0.57358384\",\n \"0.5735207\",\n \"0.57275593\",\n \"0.57236457\",\n \"0.57175153\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":11388,"cells":{"query":{"kind":"string","value":"Testing task 243a class main logic (must return True if there are two numbers (x, y) that x ^2 + y ^2 = n)"},"document":{"kind":"string","value":"def test_task243b_main_logic(number, expected_value):\r\n assert algo.Task243b.main_logic(number) == expected_value"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["def sat(nums: List[int]):\n a, b, c, n = nums\n return (a ** n + b ** n == c ** n) and min(a, b, c) > 0 and n > 2","def test():\n Z = func.evaluate_circuit(F, e_x, e_y, e_xor)\n if Z == d[0]:\n return 0\n elif Z == d[1]:\n return 1","def pythagorean_triples(n):\n pass","def solution(n,p):\n \n a=pow(n, (p - 1) // 2, p)\n if(a==1):\n return True\n else :\n return False","def problem9_naive(n):\n for a in range(4, n, 4):\n for b in range(3, n - a):\n c = n - a - b\n if a ** 2 + b ** 2 == c ** 2:\n return a * b * c\n return None","def main():\n # Since a < b < c, we have a + b + c = 1000 > a + a + a, making a < 334.\n for a in range(1, 334):\n # Then b + c = 1000 - a > b + b, making b < 500 - a/2.\n for b in range(a + 1, 501 - a // 2):\n c = 1000 - a - b\n\n # check for Pythagorean triplet\n if a * a + b * b == c * c:\n return a * b * c","def McNuggets(n):\n # Your Code Here\n for c in xrange( n/20+2):\n for b in xrange( (n-20*c)/9+2):\n for a in xrange ((n-20*c-9*b)/6 +2):\n if (6*a + 9*b + 20*c) == n :\n return True\n return False","def check_fermat(a, b, c, n):\n if n > 2 and ((a**n + b**n) == c**n):\n print('Holy smokes, Fermat was wrong!')\n else:\n print('No, that doesn’t work.')","def McNuggets(n):\n # Your Code Here\n\n for a in range(0, n/6+1):\n for b in range(0, n/9+1):\n for c in range(0, n/20+1):\n if 6*a+9*b+20*c == n:\n return True\n return False","def McNuggets(n):\n # Your Code Here\n\n high = n//6+1\n\n if n != 0:\n for i in range(high):\n for j in range(high):\n for k in range(high):\n if 6*k + 9*j + 20*i == n:\n return True\n\n return False\n\n else:\n return False","def is_power_of_two(n):\n if n <= 0:\n return False\n else:\n return n & (n - 1) == 0","def solve_ok(number: int) -> int:\n return no_ones(number) % 2","def McNuggets(n):\n a=0\n b=0\n c=0\n result=0\n while result <= n:\n result = 6*a + 9*b + 20*c\n if result > n:\n return False\n elif result == n:\n return True\n else:\n a+=1\n ...","def is_power_of_two(n):\n if n < 0:\n return False\n else:\n return n & (n - 1) == 0","def sat(n: int):\n return pow(2, n, n) == 3","def is_perfect_square():","def test_v2_correct(self):\r\n\r\n for index, expected_result in enumerate(self.prime_booleans):\r\n\r\n n = index + 1\r\n self.assertEqual(prime_numbers_v2(n), expected_result)","def test_numbers(number):\n assert number ** 2 == number ** 2","def esprimo(n):\n toret = False\n if x == 2:\n toret = True\n elif x % 2 == 0:\n toret = False\n else:\n for i in range(3, x, 2):\n if x % i == 0:\n break\n else:\n toret = True\n # Se ejecuta cuando no se rompe el bucle\n\n return toret","def __xor__(p1, p2):\n return not isparallel(p1, p2) and (abs(p1 * p2) < 10*_eps )","def try_formula(a, b):\n n = 0\n while True:\n x = (n**2) + (a*n) + b\n if not is_prime(x):\n break\n n += 1\n return n","def isPentagonal(n):\n test = (sqrt(1+24*n)+1)/6\n return test == (int) (test)","def fn(vals):\n total = odd = 0 \n for i, x in enumerate(vals): \n if vals[0] == x: \n total += 1\n if i&1: odd += 1\n elif vals[0] ^ x != (1 << n) - 1: return inf\n ans = inf \n if len(vals) <= 2*total <= len(vals)+1: ans = min(ans, odd)\n if len(vals)-1 <= 2*total <= len(vals): ans = min(ans, total - odd)\n return ans","def McNuggets(n):\n \n '''if n == 0:\n return True\n for i in (6, 9, 20):\n if n >= i and McNuggets(n - i):\n return True\n return False\n '''\n \n for a in range(0,n):\n for b in range(0,n):\n for c in range(0,n):\n if 6*a+9*b+20*c == n:\n return True\n return False","def main(): \n for a in range(0,1000):\n for b in range(a,1000):\n for c in range(b,1000):\n if (c*c == (a*a + b*b)) and (a+b+c == 1000):\n print a, b ,c","def brute_force_solution():\n def is_pythagorean_triplet(a, b, c):\n return c**2 == a**2 + b**2\n\n return next(\n a * b * (TRIPLET_SUM - a - b)\n for a in range(1, TRIPLET_SUM)\n for b in range(a + 1, TRIPLET_SUM - a)\n if is_pythagorean_triplet(a, b, TRIPLET_SUM - a - b)\n )","def problem():\n for a in range(1, 380):\n for b in range(a):\n if a + b + (a**2 + b**2)**0.5 == 1000:\n return int(a * b * (a**2 + b**2)**0.5)","def test_domino_with_correct_n_numbers():\n assert compute(7) == 12, \"Not ok\"","def es_primo(n):\n \n for i in range(2, n):\n if n % i == 0:\n return False\n return True","def power_of_2(c):\n return n & (n - 1) == 0","def sat(nums: List[int], n=12345):\n return len(nums) <= 4 and sum(i ** 2 for i in nums) == n","def McNuggets(n):\n a = 0\n b = 0\n c = 0\n\n while 6*a + 9*b + 20*c < n:\n while 6*a + 9*b + 20*c < n:\n while 6*a + 9*b + 20*c < n:\n c += 1\n if 6*a + 9*b + 20*c == n:\n print a, b, c\n return True\n c = 0\n b += 1\n if 6*a + 9*b + 20*c == n:\n print a, b, c\n return True\n b = 0\n a += 1\n\n\n return False","def test_domino_with_2_numbers():\n assert compute(2) == 1, \"Not ok\"","def test_handcrafted_examples(self):\n for i in range(1000):\n self.assertEqual(perfectd(0), True)\n self.assertEqual(prime(0), False)\n self.assertEqual(prime(2), True)\n self.assertEqual(prime(7), True)\n self.assertEqual(prime(15), False)\n self.assertEqual(perfectd(6), True)\n self.assertEqual(perfectd(15), False)","def solution2(n):\n ones = 0\n while n > 0:\n if n & 1:\n ones += 1\n n = n >> 1\n\n return 0 if ones % 2 == 0 else 1","def test_task226_main_logic(number1, number2, expected_value):\r\n assert algo.Task226.main_logic(number1, number2) == expected_value","def testfunction(expr,n):\n \n if expr == g_plus: init, expr = R1d.SpinUp, g_plus\n elif expr == g_minus: init, expr = R1d.SpinDown, g_minus\n else: return \"error\"\n \n a = McLaurin(expr, n) \n \n bool_list = []\n for n in range(5):\n for i in range(-n,n+1):\n bool_list.append(Coef(a,n,i) == R1d.a(n,i, init))\n if bool_list[-1] == False:\n print(\"Step: \", n, \" pos: \", i)\n return all(bool_list)","def tests_truth():\n circ_m = ccxtest(4)\n print(circ_m)\n circ_m = crootnxtest(4)\n print(circ_m)\n circ_m = oracletest(4)\n print(circ_m)\n circ_m = ccx_otest(4)\n print(circ_m)","def McNuggets(n):\n a=0\n b=0\n c=0\n while 6*a + 9*b + 20*c < n:\n for a in range((n//6)+1):\n for b in range((n//9)+1):\n for c in range ((n//20)+1):\n if 6*a + 9*b + 20*c == n:\n return print(True)\n if 6*a + 9*b + 20*c != n:\n return print(False)","def find_pythagorean_triple_product(num):\n\n m = 2\n n = 1\n\n while True:\n a = m ** 2 - n ** 2\n b = 2 * m * n\n c = m ** 2 + n ** 2\n\n if a ** 2 + b ** 2 == c ** 2 and a + b + c == num:\n return a * b * c\n else:\n m += 1\n if m >= num:\n m = 1\n n += 1","def is_composite(n, s, d):\n a = random.randint(2, n)\n if pow(a, d, n) == 1:\n return False\n for r in range(s):\n ind = (2 ** r) * d\n if pow(a, ind, n) == n - 1:\n return False\n return True","def pythagorean_triples(n):\n triples = []\n for i in range(1,n+1):\n for j in range(1, n+1):\n for k in range(1, n+1):\n if i**2 + j**2 == k**2 and i <= j <= k:\n triples.append((i,j,k))\n return triples","def pythTripletFinder(sum1):\n a = 0\n b = 0\n sum1 = int(sum1)\n for x in range(1,sum1):\n\tfor y in range(1,sum1):\n\t if (x*x + y*y) == (sum1 - x -y)**2 :\n\t\treturn x,y,sum1-x-y\n return 0,0,0","def main():\n LIMIT = 600\n GOAL = 1000\n for i in range(1, LIMIT + 1):\n for j in range(1, LIMIT + 1):\n for k in range(1, LIMIT + 1):\n if i + j + k == GOAL:\n if i**2 == j**2 + k**2:\n print \"GOAL:\", (i, j, k)","def my_func(x, y):\n result = 0\n pow_res = 1\n while y:\n pow_res= pow_res*x\n y +=1\n\n result = 1 / pow_res\n\n\n return result","def isprime(n):\n if n!=int(n):\n return False\n n=int(n)\n #Miller-Rabin test for prime\n if n==0 or n==1 or n==4 or n==6 or n==8 or n==9:\n return False\n\n if n==2 or n==3 or n==5 or n==7:\n return True\n s = 0\n d = n-1\n while d%2==0:\n d>>=1\n s+=1\n assert(2**s * d == n-1)\n\n def trial_composite(a):\n if pow(a, d, n) == 1:\n return False\n for i in range(s):\n if pow(a, 2**i * d, n) == n-1:\n return False\n return True\n\n for i in range(8):#number of trials\n a = random.randrange(2, n)\n if trial_composite(a):\n return False\n\n return True","def solve(n: int) -> None:\n count_triangles = 3 * n * n\n for x in range(1, n+1):\n for y in range(1, x+1):\n xy_gcd = gcd(x, y)\n move_x, move_y = x // xy_gcd, y // xy_gcd\n i = 1\n while y + i * move_x <= n and x - i * move_y >= 0:\n count_triangles += 1 + int(x != y)\n i += 1\n i = 1\n while y - i * move_x >= 0 and x + i * move_y <= n:\n count_triangles += 1 + int(x != y)\n i += 1\n print(count_triangles)","def problem():\n\n print 'problem #27'\n\n l = 0\n m_a = 0\n m_b = 0\n for a in xrange(-1000, 1000):\n for b in xrange(-1000, 1000):\n p = len(check(a, b))\n if p > l:\n l = p\n m_a = a\n m_b = b\n\n print 'the product of coefficients is %s' % (m_a * m_b)","def test_v1_correct(self):\r\n\r\n for index, expected_result in enumerate(self.prime_booleans):\r\n\r\n n = index + 1\r\n self.assertEqual(prime_numbers_v1(n), expected_result)","def test_pythagorean_triples(self):\n\n s = space(0)\n for a, b, c in (\n (3, 4, 5),\n (8, 15, 17),\n (33, 56, 65)\n ):\n self.assertTrue(isclose(\n s.hypot(a, b),\n c\n ))\n self.assertTrue(isclose(\n s.leg(a, c),\n b\n ))","def snt(n):\r\n f = True\r\n for j in range(2, n):\r\n if n % j == 0:\r\n f = False\r\n break\r\n return f","def meets_criteria2(num):\n output = True\n if not exactly_two_same_digits(num):\n output = False\n if not digits_increase(num):\n output = False\n return output","def is_po2(n) -> bool:\n return not (n & (n - 1))","def witness(a, n):\n t, u = witHelp(n - 1)\n x0 = xi = modExp(a, u, n)\n for i in range(1, t + 1):\n xi = (x0 ** 2) % n\n if xi == 1 and x0 != 1 and x0 != n - 1:\n return True\n x0 = xi\n if xi != 1:\n return True\n return False","def test_v3_correct(self):\r\n\r\n for index, expected_result in enumerate(self.prime_booleans):\r\n n = index + 1\r\n self.assertEqual(prime_numbers_v3(n), expected_result)","def is_pythagorean_triplet(a,b,c):\n\treturn a**2 + b**2 == c**2","def test_domino_with_3_numbers():\n assert compute(3) == 2, \"Not ok\"","def estPair(nbre):\n if(nbre % 2 == 0):\n return True\n else:\n return False","def pythagorean_triples(n):\n l = []\n # loop over all a < b < c <= n\n for c in range(1, n + 1):\n for b in range(1, c):\n for a in range(1, b):\n if a*a + b*b == c*c:\n l.append((a, b, c))\n return l","def solve(n=100):\n # Build the board.\n single_vals = list(range(1, 21)) + [25]\n double_vals = [2*x for x in single_vals]\n triple_vals = [3*x for x in range(1, 21)]\n total_vals = single_vals + double_vals + triple_vals + [0]\n\n return sum(1 for other_throws, double_throw\n in product(combinations_with_replacement(total_vals, 2), double_vals, repeat=1)\n if sum(other_throws) + double_throw < n)","def answer(self) -> bool:","def triplets():\n for a in xrange(1, 1000):\n for b in xrange(a, 1000):\n c = 1000 - (a + b)\n if a**2 + b**2 == c**2:\n return a, b, c","def is_prime(n, number_of_tests=5):\n passes = 0\n prime = True #assume prime\n for i in xrange(number_of_tests):\n passes += 1\n random_int = random.randint(2, n-1)\n test = pow(random_int, n-1, n)\n if test != 1:\n prime = False\n break\n if prime:\n return 0\n else:\n return passes","def test_count_bits(n, result):\n from count_bits import count_bits\n assert count_bits(n) == result","def is_square(apositiveint):\n x = apositiveint // 2\n seen = set([x])\n while x * x != apositiveint:\n x = (x + (apositiveint // x)) // 2\n if x in seen: return False\n seen.add(x)\n return True","def test_isLucky():\n\n # Test a big range of numbers.\n for x in range(-1000, 1000):\n\n # The value of 'x' is lucky number seven.\n if x == 7:\n assert isLucky(x)\n # We're not lucky.\n else:\n assert not isLucky(x)","def isPowerOfTwo(self, n: int) -> bool:\n if n <= 0:\n return False\n return bin(n).count('1') == 1","def test_getSum_twoNumbers(self):\r\n self.assertEqual(17, Arith().add(8, 9))","def do_tests(n, s, d, t):\n for i in range(t):\n if is_composite(n, s, d):\n return False\n return True","def is_pentagonal(n):\r\n if ((1+(24*n+1)**0.5) / 6)%1 == 0:\r\n return True\r\n return False","def is_power_of_two(n: Union[int, float]):\n\n if n > 1:\n if n != int(n):\n return False\n n = int(n)\n return (n != 0) and (n & (n - 1) == 0)\n elif n == 1:\n return True\n elif n > 0:\n return is_power_of_two(1/n)\n else:\n return False","def test_hackerrank_sample1(self):\n result = find_digits(12)\n self.assertEquals(result, 2)","def fn(i, s0, s1, c0, c1):\n if s0 > n or s1 > n: return 0 # impossible \n if i == len(balls): return int(c0 == c1)\n ans = 0 \n for x in range(balls[i]+1): \n ans += fn(i+1, s0+x, s1+balls[i]-x, c0+(x > 0), c1+(x < balls[i])) * comb(balls[i], x)\n return ans","def Checker(a,b,n,x):\n if n==0:\n if abs(a[0]-b[0])>=x: #if the changes in eta from one time step to another is more than .05mm\n return True #return true to continue the loop\n else:\n return False #stop the loop (this only happens if all of the points had a change of less than .05mm)\n elif abs(a[n]-b[n])>=x: #this checks each of the points in the channel \n return True #if any have too big a change the loop continues\n else: #if that point in the channel has small enough change\n Checker(a,b,n-1) #check the next point in the channel","def is_valid(square: tuple, n: int):\n square_i, square_j = square\n if (square_i < n and square_i >= 0 and square_j < n and square_j >= 0):\n return True\n return False","def _eq(a, b):\n return (a - b) % 2 == 0","def test_correct_value(self):\n self.assertTrue(py_function(6) == 36)\n self.assertFalse(py_function(5) == 9)\n for i in range(0, 10):\n self.assertTrue(py_function(i) == i**2 if i != 0 else 100)","def is_pentagonal(n):\n if (1+(24*n+1)**0.5) % 6 == 0:\n return True\n return False","def test_binops(self):","def fn(mask, k):\n if not mask: return 0 \n ans = inf \n for i in range(n): \n if mask & (1<<i): \n ans = min(ans, (nums1[i]^nums2[k]) + fn(mask^(1<<i), k+1))\n return ans","def test_hackerrank_sample2(self):\n result = find_digits(1012)\n self.assertEquals(result, 3)","def fn(i, j, mask):\n if j == n: return 1 \n if i == m: return fn(0, j+1, mask)\n ans = 0 \n for x in 1<<2*i, 1<<2*i+1, 0b11<<2*i: \n mask0 = mask ^ x\n if mask0 & 0b11<<2*i and (i == 0 or (mask0 >> 2*i) & 0b11 != (mask0 >> 2*i-2) & 0b11): \n ans += fn(i+1, j, mask0)\n return ans % 1_000_000_007","def trial_div(n: int) -> bool:\n if n == 1:\n return False\n i = 2\n while i**2 <= n:\n if n % i == 0:\n return False\n i += 1\n return True","def task3_is_power(num):\n power = 3\n while num > power:\n num /= power\n return num == power","def user_function(x, y):\r\n return x ** 2 + 2 * y ** 2","def test_XOR():\n\tk, outputs = 2, [0,1,1,0]\n\n\ttrue_pi0s = set(['00','11'])\n\ttrue_pi1s = set(['01','10'])\n\n\ttdt0, tdt1 = make_transition_density_tables(k=k, outputs=outputs)\n\tpi0s, pi1s = find_implicants_qm(tdt0) , find_implicants_qm(tdt1)\n\n\tassert (pi0s == true_pi0s) , ('Prime Implicants for 0 does not match. %s != %s' % (pi0s,true_pi0s))\n\tassert (pi1s == true_pi1s) , ('Prime Implicants for 1 does not match. %s != %s' % (pi1s,true_pi1s))\n\t# Two Symbols\n\ttrue_ts0s = [('11',[],[[0,1]]),('00',[],[[0,1]])]\n\ttrue_ts1s = [('10',[[0,1]],[])]\n\n\tts0s,ts1s = find_two_symbols_v2(k=k, prime_implicants=pi0s) , find_two_symbols_v2(k=k, prime_implicants=pi1s)\n\n\tassert (ts0s == true_ts0s) , ('Two Symbol for 0 does not match. %s != %s' % (ts0s,true_ts0s))\n\tassert (ts1s == true_ts1s) , ('Two Symbol for 1 does not match. %s != %s' % (ts1s,true_ts1s))","def primenumber(x):\n if x >= 2:\n for y in range(2,x):\n if not (x % y):\n return False\n else:\n return False\n return True","def verify(self, y):\n left = self.sgroup.exponentiate(self.a, y)\n right = (self.x * self.sgroup.exponentiate(self.b, self.c)) % self.sgroup.p\n is_ok = (left == right)\n return is_ok","def fn(i):\n if i == 2*n-1 or ans[i] and fn(i+1): return True \n for x in reversed(range(1, n+1)): \n if x not in ans: \n ii = x if x > 1 else 0 \n if i+ii < 2*n-1 and ans[i] == ans[i+ii] == 0: \n ans[i] = ans[i+ii] = x\n if fn(i+1): return True \n ans[i] = ans[i+ii] = 0","def test_domino_with_15_numbers():\n assert compute(15) == 56, \"Not ok\"","def sat(n: int, nums=[77410, 23223, 54187], lower_bound=2):\n return all(i % n == 0 for i in nums) and n >= lower_bound","def test_domino_with_9_numbers():\n assert compute(9) == 20, \"Not ok\"","def test_prime(n):\n if SIEVE[n]:\n return True\n else:\n return False","def perfectd(n: int) -> bool:\n if sum(divisors(n)) - n == n:\n return True\n else:\n return False","def test_twoSum(self):\n self.assertEqual(twoSum([2, 7, 11, 15], 9), [0, 1])","def test_results():\n x = 0.5\n np.testing.assert_almost_equal(nbf.sum_x_n_calc(\n x, z_n, k_n_1), npf.sum_x_n_calc(x, z_n, k_n_1))","def Ballie_PSW_test(n, max_trivial_trials=100):\n for i in range(max_trivial_trials):\n if primes[i] == n:\n return True\n if n % primes[i] == 0:\n return False\n if primes[i] ** 2 >= n:\n return True\n if not fermat_strong_test(n, 2):\n return False\n if not lucas_selfridge_test(n):\n return False\n return True","def nine():\r\n \r\n a = 3\r\n b = 4\r\n c = pythagorean(a, b)\r\n \r\n while a + b + c < 1001:\r\n while a + b + c < 1001:\r\n if a + b + c == 1000:\r\n return a * b * c\r\n b += 1\r\n c = pythagorean(a, b)\r\n a += 1\r\n b = a + 1\r\n c = pythagorean(a, b)","def test_basic(self):\n# self.assertEqual(solution(\"\"\"noop\n# addx 3\n# addx -5\"\"\"), -1)\n self.assertEqual(solution(\"\"\"addx 15\naddx -11\naddx 6\naddx -3\naddx 5\naddx -1\naddx -8\naddx 13\naddx 4\nnoop\naddx -1\naddx 5\naddx -1\naddx 5\naddx -1\naddx 5\naddx -1\naddx 5\naddx -1\naddx -35\naddx 1\naddx 24\naddx -19\naddx 1\naddx 16\naddx -11\nnoop\nnoop\naddx 21\naddx -15\nnoop\nnoop\naddx -3\naddx 9\naddx 1\naddx -3\naddx 8\naddx 1\naddx 5\nnoop\nnoop\nnoop\nnoop\nnoop\naddx -36\nnoop\naddx 1\naddx 7\nnoop\nnoop\nnoop\naddx 2\naddx 6\nnoop\nnoop\nnoop\nnoop\nnoop\naddx 1\nnoop\nnoop\naddx 7\naddx 1\nnoop\naddx -13\naddx 13\naddx 7\nnoop\naddx 1\naddx -33\nnoop\nnoop\nnoop\naddx 2\nnoop\nnoop\nnoop\naddx 8\nnoop\naddx -1\naddx 2\naddx 1\nnoop\naddx 17\naddx -9\naddx 1\naddx 1\naddx -3\naddx 11\nnoop\nnoop\naddx 1\nnoop\naddx 1\nnoop\nnoop\naddx -13\naddx -19\naddx 1\naddx 3\naddx 26\naddx -30\naddx 12\naddx -1\naddx 3\naddx 1\nnoop\nnoop\nnoop\naddx -9\naddx 18\naddx 1\naddx 2\nnoop\nnoop\naddx 9\nnoop\nnoop\nnoop\naddx -1\naddx 2\naddx -37\naddx 1\naddx 3\nnoop\naddx 15\naddx -21\naddx 22\naddx -6\naddx 1\nnoop\naddx 2\naddx 1\nnoop\naddx -10\nnoop\nnoop\naddx 20\naddx 1\naddx 2\naddx 2\naddx -6\naddx -11\nnoop\nnoop\nnoop\"\"\"), -1)","def sol(n):\n p = 1\n res = 0\n \n while n:\n p*=5\n if n&1:\n res+=p\n n=n>>1\n return res%1000000007","def tes_mod(self):\r\n x, y = ints('xy')\r\n fn = gof.DualLinker().accept(FunctionGraph([x,y], [x%y])).make_function()\r\n for a,b in ((0,1), (1,1), (0,-1), (1,-1), (-1,-1),\r\n (1,2), (-1,2), (1,-2), (-1,-2),\r\n (5,3), (-5,3), (5,-3), (-5,-3)\r\n ):\r\n self.assertTrue(fn(a,b) == a%b, (a,))"],"string":"[\n \"def sat(nums: List[int]):\\n a, b, c, n = nums\\n return (a ** n + b ** n == c ** n) and min(a, b, c) > 0 and n > 2\",\n \"def test():\\n Z = func.evaluate_circuit(F, e_x, e_y, e_xor)\\n if Z == d[0]:\\n return 0\\n elif Z == d[1]:\\n return 1\",\n \"def pythagorean_triples(n):\\n pass\",\n \"def solution(n,p):\\n \\n a=pow(n, (p - 1) // 2, p)\\n if(a==1):\\n return True\\n else :\\n return False\",\n \"def problem9_naive(n):\\n for a in range(4, n, 4):\\n for b in range(3, n - a):\\n c = n - a - b\\n if a ** 2 + b ** 2 == c ** 2:\\n return a * b * c\\n return None\",\n \"def main():\\n # Since a < b < c, we have a + b + c = 1000 > a + a + a, making a < 334.\\n for a in range(1, 334):\\n # Then b + c = 1000 - a > b + b, making b < 500 - a/2.\\n for b in range(a + 1, 501 - a // 2):\\n c = 1000 - a - b\\n\\n # check for Pythagorean triplet\\n if a * a + b * b == c * c:\\n return a * b * c\",\n \"def McNuggets(n):\\n # Your Code Here\\n for c in xrange( n/20+2):\\n for b in xrange( (n-20*c)/9+2):\\n for a in xrange ((n-20*c-9*b)/6 +2):\\n if (6*a + 9*b + 20*c) == n :\\n return True\\n return False\",\n \"def check_fermat(a, b, c, n):\\n if n > 2 and ((a**n + b**n) == c**n):\\n print('Holy smokes, Fermat was wrong!')\\n else:\\n print('No, that doesn’t work.')\",\n \"def McNuggets(n):\\n # Your Code Here\\n\\n for a in range(0, n/6+1):\\n for b in range(0, n/9+1):\\n for c in range(0, n/20+1):\\n if 6*a+9*b+20*c == n:\\n return True\\n return False\",\n \"def McNuggets(n):\\n # Your Code Here\\n\\n high = n//6+1\\n\\n if n != 0:\\n for i in range(high):\\n for j in range(high):\\n for k in range(high):\\n if 6*k + 9*j + 20*i == n:\\n return True\\n\\n return False\\n\\n else:\\n return False\",\n \"def is_power_of_two(n):\\n if n <= 0:\\n return False\\n else:\\n return n & (n - 1) == 0\",\n \"def solve_ok(number: int) -> int:\\n return no_ones(number) % 2\",\n \"def McNuggets(n):\\n a=0\\n b=0\\n c=0\\n result=0\\n while result <= n:\\n result = 6*a + 9*b + 20*c\\n if result > n:\\n return False\\n elif result == n:\\n return True\\n else:\\n a+=1\\n ...\",\n \"def is_power_of_two(n):\\n if n < 0:\\n return False\\n else:\\n return n & (n - 1) == 0\",\n \"def sat(n: int):\\n return pow(2, n, n) == 3\",\n \"def is_perfect_square():\",\n \"def test_v2_correct(self):\\r\\n\\r\\n for index, expected_result in enumerate(self.prime_booleans):\\r\\n\\r\\n n = index + 1\\r\\n self.assertEqual(prime_numbers_v2(n), expected_result)\",\n \"def test_numbers(number):\\n assert number ** 2 == number ** 2\",\n \"def esprimo(n):\\n toret = False\\n if x == 2:\\n toret = True\\n elif x % 2 == 0:\\n toret = False\\n else:\\n for i in range(3, x, 2):\\n if x % i == 0:\\n break\\n else:\\n toret = True\\n # Se ejecuta cuando no se rompe el bucle\\n\\n return toret\",\n \"def __xor__(p1, p2):\\n return not isparallel(p1, p2) and (abs(p1 * p2) < 10*_eps )\",\n \"def try_formula(a, b):\\n n = 0\\n while True:\\n x = (n**2) + (a*n) + b\\n if not is_prime(x):\\n break\\n n += 1\\n return n\",\n \"def isPentagonal(n):\\n test = (sqrt(1+24*n)+1)/6\\n return test == (int) (test)\",\n \"def fn(vals):\\n total = odd = 0 \\n for i, x in enumerate(vals): \\n if vals[0] == x: \\n total += 1\\n if i&1: odd += 1\\n elif vals[0] ^ x != (1 << n) - 1: return inf\\n ans = inf \\n if len(vals) <= 2*total <= len(vals)+1: ans = min(ans, odd)\\n if len(vals)-1 <= 2*total <= len(vals): ans = min(ans, total - odd)\\n return ans\",\n \"def McNuggets(n):\\n \\n '''if n == 0:\\n return True\\n for i in (6, 9, 20):\\n if n >= i and McNuggets(n - i):\\n return True\\n return False\\n '''\\n \\n for a in range(0,n):\\n for b in range(0,n):\\n for c in range(0,n):\\n if 6*a+9*b+20*c == n:\\n return True\\n return False\",\n \"def main(): \\n for a in range(0,1000):\\n for b in range(a,1000):\\n for c in range(b,1000):\\n if (c*c == (a*a + b*b)) and (a+b+c == 1000):\\n print a, b ,c\",\n \"def brute_force_solution():\\n def is_pythagorean_triplet(a, b, c):\\n return c**2 == a**2 + b**2\\n\\n return next(\\n a * b * (TRIPLET_SUM - a - b)\\n for a in range(1, TRIPLET_SUM)\\n for b in range(a + 1, TRIPLET_SUM - a)\\n if is_pythagorean_triplet(a, b, TRIPLET_SUM - a - b)\\n )\",\n \"def problem():\\n for a in range(1, 380):\\n for b in range(a):\\n if a + b + (a**2 + b**2)**0.5 == 1000:\\n return int(a * b * (a**2 + b**2)**0.5)\",\n \"def test_domino_with_correct_n_numbers():\\n assert compute(7) == 12, \\\"Not ok\\\"\",\n \"def es_primo(n):\\n \\n for i in range(2, n):\\n if n % i == 0:\\n return False\\n return True\",\n \"def power_of_2(c):\\n return n & (n - 1) == 0\",\n \"def sat(nums: List[int], n=12345):\\n return len(nums) <= 4 and sum(i ** 2 for i in nums) == n\",\n \"def McNuggets(n):\\n a = 0\\n b = 0\\n c = 0\\n\\n while 6*a + 9*b + 20*c < n:\\n while 6*a + 9*b + 20*c < n:\\n while 6*a + 9*b + 20*c < n:\\n c += 1\\n if 6*a + 9*b + 20*c == n:\\n print a, b, c\\n return True\\n c = 0\\n b += 1\\n if 6*a + 9*b + 20*c == n:\\n print a, b, c\\n return True\\n b = 0\\n a += 1\\n\\n\\n return False\",\n \"def test_domino_with_2_numbers():\\n assert compute(2) == 1, \\\"Not ok\\\"\",\n \"def test_handcrafted_examples(self):\\n for i in range(1000):\\n self.assertEqual(perfectd(0), True)\\n self.assertEqual(prime(0), False)\\n self.assertEqual(prime(2), True)\\n self.assertEqual(prime(7), True)\\n self.assertEqual(prime(15), False)\\n self.assertEqual(perfectd(6), True)\\n self.assertEqual(perfectd(15), False)\",\n \"def solution2(n):\\n ones = 0\\n while n > 0:\\n if n & 1:\\n ones += 1\\n n = n >> 1\\n\\n return 0 if ones % 2 == 0 else 1\",\n \"def test_task226_main_logic(number1, number2, expected_value):\\r\\n assert algo.Task226.main_logic(number1, number2) == expected_value\",\n \"def testfunction(expr,n):\\n \\n if expr == g_plus: init, expr = R1d.SpinUp, g_plus\\n elif expr == g_minus: init, expr = R1d.SpinDown, g_minus\\n else: return \\\"error\\\"\\n \\n a = McLaurin(expr, n) \\n \\n bool_list = []\\n for n in range(5):\\n for i in range(-n,n+1):\\n bool_list.append(Coef(a,n,i) == R1d.a(n,i, init))\\n if bool_list[-1] == False:\\n print(\\\"Step: \\\", n, \\\" pos: \\\", i)\\n return all(bool_list)\",\n \"def tests_truth():\\n circ_m = ccxtest(4)\\n print(circ_m)\\n circ_m = crootnxtest(4)\\n print(circ_m)\\n circ_m = oracletest(4)\\n print(circ_m)\\n circ_m = ccx_otest(4)\\n print(circ_m)\",\n \"def McNuggets(n):\\n a=0\\n b=0\\n c=0\\n while 6*a + 9*b + 20*c < n:\\n for a in range((n//6)+1):\\n for b in range((n//9)+1):\\n for c in range ((n//20)+1):\\n if 6*a + 9*b + 20*c == n:\\n return print(True)\\n if 6*a + 9*b + 20*c != n:\\n return print(False)\",\n \"def find_pythagorean_triple_product(num):\\n\\n m = 2\\n n = 1\\n\\n while True:\\n a = m ** 2 - n ** 2\\n b = 2 * m * n\\n c = m ** 2 + n ** 2\\n\\n if a ** 2 + b ** 2 == c ** 2 and a + b + c == num:\\n return a * b * c\\n else:\\n m += 1\\n if m >= num:\\n m = 1\\n n += 1\",\n \"def is_composite(n, s, d):\\n a = random.randint(2, n)\\n if pow(a, d, n) == 1:\\n return False\\n for r in range(s):\\n ind = (2 ** r) * d\\n if pow(a, ind, n) == n - 1:\\n return False\\n return True\",\n \"def pythagorean_triples(n):\\n triples = []\\n for i in range(1,n+1):\\n for j in range(1, n+1):\\n for k in range(1, n+1):\\n if i**2 + j**2 == k**2 and i <= j <= k:\\n triples.append((i,j,k))\\n return triples\",\n \"def pythTripletFinder(sum1):\\n a = 0\\n b = 0\\n sum1 = int(sum1)\\n for x in range(1,sum1):\\n\\tfor y in range(1,sum1):\\n\\t if (x*x + y*y) == (sum1 - x -y)**2 :\\n\\t\\treturn x,y,sum1-x-y\\n return 0,0,0\",\n \"def main():\\n LIMIT = 600\\n GOAL = 1000\\n for i in range(1, LIMIT + 1):\\n for j in range(1, LIMIT + 1):\\n for k in range(1, LIMIT + 1):\\n if i + j + k == GOAL:\\n if i**2 == j**2 + k**2:\\n print \\\"GOAL:\\\", (i, j, k)\",\n \"def my_func(x, y):\\n result = 0\\n pow_res = 1\\n while y:\\n pow_res= pow_res*x\\n y +=1\\n\\n result = 1 / pow_res\\n\\n\\n return result\",\n \"def isprime(n):\\n if n!=int(n):\\n return False\\n n=int(n)\\n #Miller-Rabin test for prime\\n if n==0 or n==1 or n==4 or n==6 or n==8 or n==9:\\n return False\\n\\n if n==2 or n==3 or n==5 or n==7:\\n return True\\n s = 0\\n d = n-1\\n while d%2==0:\\n d>>=1\\n s+=1\\n assert(2**s * d == n-1)\\n\\n def trial_composite(a):\\n if pow(a, d, n) == 1:\\n return False\\n for i in range(s):\\n if pow(a, 2**i * d, n) == n-1:\\n return False\\n return True\\n\\n for i in range(8):#number of trials\\n a = random.randrange(2, n)\\n if trial_composite(a):\\n return False\\n\\n return True\",\n \"def solve(n: int) -> None:\\n count_triangles = 3 * n * n\\n for x in range(1, n+1):\\n for y in range(1, x+1):\\n xy_gcd = gcd(x, y)\\n move_x, move_y = x // xy_gcd, y // xy_gcd\\n i = 1\\n while y + i * move_x <= n and x - i * move_y >= 0:\\n count_triangles += 1 + int(x != y)\\n i += 1\\n i = 1\\n while y - i * move_x >= 0 and x + i * move_y <= n:\\n count_triangles += 1 + int(x != y)\\n i += 1\\n print(count_triangles)\",\n \"def problem():\\n\\n print 'problem #27'\\n\\n l = 0\\n m_a = 0\\n m_b = 0\\n for a in xrange(-1000, 1000):\\n for b in xrange(-1000, 1000):\\n p = len(check(a, b))\\n if p > l:\\n l = p\\n m_a = a\\n m_b = b\\n\\n print 'the product of coefficients is %s' % (m_a * m_b)\",\n \"def test_v1_correct(self):\\r\\n\\r\\n for index, expected_result in enumerate(self.prime_booleans):\\r\\n\\r\\n n = index + 1\\r\\n self.assertEqual(prime_numbers_v1(n), expected_result)\",\n \"def test_pythagorean_triples(self):\\n\\n s = space(0)\\n for a, b, c in (\\n (3, 4, 5),\\n (8, 15, 17),\\n (33, 56, 65)\\n ):\\n self.assertTrue(isclose(\\n s.hypot(a, b),\\n c\\n ))\\n self.assertTrue(isclose(\\n s.leg(a, c),\\n b\\n ))\",\n \"def snt(n):\\r\\n f = True\\r\\n for j in range(2, n):\\r\\n if n % j == 0:\\r\\n f = False\\r\\n break\\r\\n return f\",\n \"def meets_criteria2(num):\\n output = True\\n if not exactly_two_same_digits(num):\\n output = False\\n if not digits_increase(num):\\n output = False\\n return output\",\n \"def is_po2(n) -> bool:\\n return not (n & (n - 1))\",\n \"def witness(a, n):\\n t, u = witHelp(n - 1)\\n x0 = xi = modExp(a, u, n)\\n for i in range(1, t + 1):\\n xi = (x0 ** 2) % n\\n if xi == 1 and x0 != 1 and x0 != n - 1:\\n return True\\n x0 = xi\\n if xi != 1:\\n return True\\n return False\",\n \"def test_v3_correct(self):\\r\\n\\r\\n for index, expected_result in enumerate(self.prime_booleans):\\r\\n n = index + 1\\r\\n self.assertEqual(prime_numbers_v3(n), expected_result)\",\n \"def is_pythagorean_triplet(a,b,c):\\n\\treturn a**2 + b**2 == c**2\",\n \"def test_domino_with_3_numbers():\\n assert compute(3) == 2, \\\"Not ok\\\"\",\n \"def estPair(nbre):\\n if(nbre % 2 == 0):\\n return True\\n else:\\n return False\",\n \"def pythagorean_triples(n):\\n l = []\\n # loop over all a < b < c <= n\\n for c in range(1, n + 1):\\n for b in range(1, c):\\n for a in range(1, b):\\n if a*a + b*b == c*c:\\n l.append((a, b, c))\\n return l\",\n \"def solve(n=100):\\n # Build the board.\\n single_vals = list(range(1, 21)) + [25]\\n double_vals = [2*x for x in single_vals]\\n triple_vals = [3*x for x in range(1, 21)]\\n total_vals = single_vals + double_vals + triple_vals + [0]\\n\\n return sum(1 for other_throws, double_throw\\n in product(combinations_with_replacement(total_vals, 2), double_vals, repeat=1)\\n if sum(other_throws) + double_throw < n)\",\n \"def answer(self) -> bool:\",\n \"def triplets():\\n for a in xrange(1, 1000):\\n for b in xrange(a, 1000):\\n c = 1000 - (a + b)\\n if a**2 + b**2 == c**2:\\n return a, b, c\",\n \"def is_prime(n, number_of_tests=5):\\n passes = 0\\n prime = True #assume prime\\n for i in xrange(number_of_tests):\\n passes += 1\\n random_int = random.randint(2, n-1)\\n test = pow(random_int, n-1, n)\\n if test != 1:\\n prime = False\\n break\\n if prime:\\n return 0\\n else:\\n return passes\",\n \"def test_count_bits(n, result):\\n from count_bits import count_bits\\n assert count_bits(n) == result\",\n \"def is_square(apositiveint):\\n x = apositiveint // 2\\n seen = set([x])\\n while x * x != apositiveint:\\n x = (x + (apositiveint // x)) // 2\\n if x in seen: return False\\n seen.add(x)\\n return True\",\n \"def test_isLucky():\\n\\n # Test a big range of numbers.\\n for x in range(-1000, 1000):\\n\\n # The value of 'x' is lucky number seven.\\n if x == 7:\\n assert isLucky(x)\\n # We're not lucky.\\n else:\\n assert not isLucky(x)\",\n \"def isPowerOfTwo(self, n: int) -> bool:\\n if n <= 0:\\n return False\\n return bin(n).count('1') == 1\",\n \"def test_getSum_twoNumbers(self):\\r\\n self.assertEqual(17, Arith().add(8, 9))\",\n \"def do_tests(n, s, d, t):\\n for i in range(t):\\n if is_composite(n, s, d):\\n return False\\n return True\",\n \"def is_pentagonal(n):\\r\\n if ((1+(24*n+1)**0.5) / 6)%1 == 0:\\r\\n return True\\r\\n return False\",\n \"def is_power_of_two(n: Union[int, float]):\\n\\n if n > 1:\\n if n != int(n):\\n return False\\n n = int(n)\\n return (n != 0) and (n & (n - 1) == 0)\\n elif n == 1:\\n return True\\n elif n > 0:\\n return is_power_of_two(1/n)\\n else:\\n return False\",\n \"def test_hackerrank_sample1(self):\\n result = find_digits(12)\\n self.assertEquals(result, 2)\",\n \"def fn(i, s0, s1, c0, c1):\\n if s0 > n or s1 > n: return 0 # impossible \\n if i == len(balls): return int(c0 == c1)\\n ans = 0 \\n for x in range(balls[i]+1): \\n ans += fn(i+1, s0+x, s1+balls[i]-x, c0+(x > 0), c1+(x < balls[i])) * comb(balls[i], x)\\n return ans\",\n \"def Checker(a,b,n,x):\\n if n==0:\\n if abs(a[0]-b[0])>=x: #if the changes in eta from one time step to another is more than .05mm\\n return True #return true to continue the loop\\n else:\\n return False #stop the loop (this only happens if all of the points had a change of less than .05mm)\\n elif abs(a[n]-b[n])>=x: #this checks each of the points in the channel \\n return True #if any have too big a change the loop continues\\n else: #if that point in the channel has small enough change\\n Checker(a,b,n-1) #check the next point in the channel\",\n \"def is_valid(square: tuple, n: int):\\n square_i, square_j = square\\n if (square_i < n and square_i >= 0 and square_j < n and square_j >= 0):\\n return True\\n return False\",\n \"def _eq(a, b):\\n return (a - b) % 2 == 0\",\n \"def test_correct_value(self):\\n self.assertTrue(py_function(6) == 36)\\n self.assertFalse(py_function(5) == 9)\\n for i in range(0, 10):\\n self.assertTrue(py_function(i) == i**2 if i != 0 else 100)\",\n \"def is_pentagonal(n):\\n if (1+(24*n+1)**0.5) % 6 == 0:\\n return True\\n return False\",\n \"def test_binops(self):\",\n \"def fn(mask, k):\\n if not mask: return 0 \\n ans = inf \\n for i in range(n): \\n if mask & (1<<i): \\n ans = min(ans, (nums1[i]^nums2[k]) + fn(mask^(1<<i), k+1))\\n return ans\",\n \"def test_hackerrank_sample2(self):\\n result = find_digits(1012)\\n self.assertEquals(result, 3)\",\n \"def fn(i, j, mask):\\n if j == n: return 1 \\n if i == m: return fn(0, j+1, mask)\\n ans = 0 \\n for x in 1<<2*i, 1<<2*i+1, 0b11<<2*i: \\n mask0 = mask ^ x\\n if mask0 & 0b11<<2*i and (i == 0 or (mask0 >> 2*i) & 0b11 != (mask0 >> 2*i-2) & 0b11): \\n ans += fn(i+1, j, mask0)\\n return ans % 1_000_000_007\",\n \"def trial_div(n: int) -> bool:\\n if n == 1:\\n return False\\n i = 2\\n while i**2 <= n:\\n if n % i == 0:\\n return False\\n i += 1\\n return True\",\n \"def task3_is_power(num):\\n power = 3\\n while num > power:\\n num /= power\\n return num == power\",\n \"def user_function(x, y):\\r\\n return x ** 2 + 2 * y ** 2\",\n \"def test_XOR():\\n\\tk, outputs = 2, [0,1,1,0]\\n\\n\\ttrue_pi0s = set(['00','11'])\\n\\ttrue_pi1s = set(['01','10'])\\n\\n\\ttdt0, tdt1 = make_transition_density_tables(k=k, outputs=outputs)\\n\\tpi0s, pi1s = find_implicants_qm(tdt0) , find_implicants_qm(tdt1)\\n\\n\\tassert (pi0s == true_pi0s) , ('Prime Implicants for 0 does not match. %s != %s' % (pi0s,true_pi0s))\\n\\tassert (pi1s == true_pi1s) , ('Prime Implicants for 1 does not match. %s != %s' % (pi1s,true_pi1s))\\n\\t# Two Symbols\\n\\ttrue_ts0s = [('11',[],[[0,1]]),('00',[],[[0,1]])]\\n\\ttrue_ts1s = [('10',[[0,1]],[])]\\n\\n\\tts0s,ts1s = find_two_symbols_v2(k=k, prime_implicants=pi0s) , find_two_symbols_v2(k=k, prime_implicants=pi1s)\\n\\n\\tassert (ts0s == true_ts0s) , ('Two Symbol for 0 does not match. %s != %s' % (ts0s,true_ts0s))\\n\\tassert (ts1s == true_ts1s) , ('Two Symbol for 1 does not match. %s != %s' % (ts1s,true_ts1s))\",\n \"def primenumber(x):\\n if x >= 2:\\n for y in range(2,x):\\n if not (x % y):\\n return False\\n else:\\n return False\\n return True\",\n \"def verify(self, y):\\n left = self.sgroup.exponentiate(self.a, y)\\n right = (self.x * self.sgroup.exponentiate(self.b, self.c)) % self.sgroup.p\\n is_ok = (left == right)\\n return is_ok\",\n \"def fn(i):\\n if i == 2*n-1 or ans[i] and fn(i+1): return True \\n for x in reversed(range(1, n+1)): \\n if x not in ans: \\n ii = x if x > 1 else 0 \\n if i+ii < 2*n-1 and ans[i] == ans[i+ii] == 0: \\n ans[i] = ans[i+ii] = x\\n if fn(i+1): return True \\n ans[i] = ans[i+ii] = 0\",\n \"def test_domino_with_15_numbers():\\n assert compute(15) == 56, \\\"Not ok\\\"\",\n \"def sat(n: int, nums=[77410, 23223, 54187], lower_bound=2):\\n return all(i % n == 0 for i in nums) and n >= lower_bound\",\n \"def test_domino_with_9_numbers():\\n assert compute(9) == 20, \\\"Not ok\\\"\",\n \"def test_prime(n):\\n if SIEVE[n]:\\n return True\\n else:\\n return False\",\n \"def perfectd(n: int) -> bool:\\n if sum(divisors(n)) - n == n:\\n return True\\n else:\\n return False\",\n \"def test_twoSum(self):\\n self.assertEqual(twoSum([2, 7, 11, 15], 9), [0, 1])\",\n \"def test_results():\\n x = 0.5\\n np.testing.assert_almost_equal(nbf.sum_x_n_calc(\\n x, z_n, k_n_1), npf.sum_x_n_calc(x, z_n, k_n_1))\",\n \"def Ballie_PSW_test(n, max_trivial_trials=100):\\n for i in range(max_trivial_trials):\\n if primes[i] == n:\\n return True\\n if n % primes[i] == 0:\\n return False\\n if primes[i] ** 2 >= n:\\n return True\\n if not fermat_strong_test(n, 2):\\n return False\\n if not lucas_selfridge_test(n):\\n return False\\n return True\",\n \"def nine():\\r\\n \\r\\n a = 3\\r\\n b = 4\\r\\n c = pythagorean(a, b)\\r\\n \\r\\n while a + b + c < 1001:\\r\\n while a + b + c < 1001:\\r\\n if a + b + c == 1000:\\r\\n return a * b * c\\r\\n b += 1\\r\\n c = pythagorean(a, b)\\r\\n a += 1\\r\\n b = a + 1\\r\\n c = pythagorean(a, b)\",\n \"def test_basic(self):\\n# self.assertEqual(solution(\\\"\\\"\\\"noop\\n# addx 3\\n# addx -5\\\"\\\"\\\"), -1)\\n self.assertEqual(solution(\\\"\\\"\\\"addx 15\\naddx -11\\naddx 6\\naddx -3\\naddx 5\\naddx -1\\naddx -8\\naddx 13\\naddx 4\\nnoop\\naddx -1\\naddx 5\\naddx -1\\naddx 5\\naddx -1\\naddx 5\\naddx -1\\naddx 5\\naddx -1\\naddx -35\\naddx 1\\naddx 24\\naddx -19\\naddx 1\\naddx 16\\naddx -11\\nnoop\\nnoop\\naddx 21\\naddx -15\\nnoop\\nnoop\\naddx -3\\naddx 9\\naddx 1\\naddx -3\\naddx 8\\naddx 1\\naddx 5\\nnoop\\nnoop\\nnoop\\nnoop\\nnoop\\naddx -36\\nnoop\\naddx 1\\naddx 7\\nnoop\\nnoop\\nnoop\\naddx 2\\naddx 6\\nnoop\\nnoop\\nnoop\\nnoop\\nnoop\\naddx 1\\nnoop\\nnoop\\naddx 7\\naddx 1\\nnoop\\naddx -13\\naddx 13\\naddx 7\\nnoop\\naddx 1\\naddx -33\\nnoop\\nnoop\\nnoop\\naddx 2\\nnoop\\nnoop\\nnoop\\naddx 8\\nnoop\\naddx -1\\naddx 2\\naddx 1\\nnoop\\naddx 17\\naddx -9\\naddx 1\\naddx 1\\naddx -3\\naddx 11\\nnoop\\nnoop\\naddx 1\\nnoop\\naddx 1\\nnoop\\nnoop\\naddx -13\\naddx -19\\naddx 1\\naddx 3\\naddx 26\\naddx -30\\naddx 12\\naddx -1\\naddx 3\\naddx 1\\nnoop\\nnoop\\nnoop\\naddx -9\\naddx 18\\naddx 1\\naddx 2\\nnoop\\nnoop\\naddx 9\\nnoop\\nnoop\\nnoop\\naddx -1\\naddx 2\\naddx -37\\naddx 1\\naddx 3\\nnoop\\naddx 15\\naddx -21\\naddx 22\\naddx -6\\naddx 1\\nnoop\\naddx 2\\naddx 1\\nnoop\\naddx -10\\nnoop\\nnoop\\naddx 20\\naddx 1\\naddx 2\\naddx 2\\naddx -6\\naddx -11\\nnoop\\nnoop\\nnoop\\\"\\\"\\\"), -1)\",\n \"def sol(n):\\n p = 1\\n res = 0\\n \\n while n:\\n p*=5\\n if n&1:\\n res+=p\\n n=n>>1\\n return res%1000000007\",\n \"def tes_mod(self):\\r\\n x, y = ints('xy')\\r\\n fn = gof.DualLinker().accept(FunctionGraph([x,y], [x%y])).make_function()\\r\\n for a,b in ((0,1), (1,1), (0,-1), (1,-1), (-1,-1),\\r\\n (1,2), (-1,2), (1,-2), (-1,-2),\\r\\n (5,3), (-5,3), (5,-3), (-5,-3)\\r\\n ):\\r\\n self.assertTrue(fn(a,b) == a%b, (a,))\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.67070174","0.6674726","0.6514928","0.65001607","0.64590937","0.6443379","0.643019","0.6427951","0.6402992","0.6362123","0.635343","0.6330218","0.63233894","0.63132364","0.63102883","0.630757","0.62614566","0.62584585","0.6249293","0.6248185","0.62469304","0.62467754","0.62464786","0.6244675","0.6213034","0.6191826","0.6189504","0.6180677","0.6172892","0.6163802","0.6157797","0.6107172","0.61011857","0.6096137","0.6086848","0.60839045","0.60755295","0.606826","0.60643154","0.60567987","0.60427535","0.60300255","0.6029266","0.6004015","0.59897447","0.59808713","0.59462506","0.59341806","0.59273887","0.59185714","0.59179384","0.59173816","0.5912081","0.59065694","0.59008193","0.5898748","0.589335","0.58892775","0.58869743","0.58862084","0.58719146","0.5870374","0.586997","0.5867109","0.58628285","0.5858623","0.58576286","0.58506536","0.58449644","0.5840655","0.5834585","0.58305585","0.5830137","0.58155954","0.58115447","0.5805699","0.58036345","0.5790608","0.57817113","0.5777031","0.577603","0.57746446","0.57740706","0.5771368","0.577012","0.57660526","0.57622814","0.575842","0.57575256","0.57550234","0.575458","0.575315","0.5751976","0.57499796","0.5747241","0.5740197","0.57370406","0.5736894","0.5726949","0.5726363","0.5717013"],"string":"[\n \"0.67070174\",\n \"0.6674726\",\n \"0.6514928\",\n \"0.65001607\",\n \"0.64590937\",\n \"0.6443379\",\n \"0.643019\",\n \"0.6427951\",\n \"0.6402992\",\n \"0.6362123\",\n \"0.635343\",\n \"0.6330218\",\n \"0.63233894\",\n \"0.63132364\",\n \"0.63102883\",\n \"0.630757\",\n \"0.62614566\",\n \"0.62584585\",\n \"0.6249293\",\n \"0.6248185\",\n \"0.62469304\",\n \"0.62467754\",\n \"0.62464786\",\n \"0.6244675\",\n \"0.6213034\",\n \"0.6191826\",\n \"0.6189504\",\n \"0.6180677\",\n \"0.6172892\",\n \"0.6163802\",\n \"0.6157797\",\n \"0.6107172\",\n \"0.61011857\",\n \"0.6096137\",\n \"0.6086848\",\n \"0.60839045\",\n \"0.60755295\",\n \"0.606826\",\n \"0.60643154\",\n \"0.60567987\",\n \"0.60427535\",\n \"0.60300255\",\n \"0.6029266\",\n \"0.6004015\",\n \"0.59897447\",\n \"0.59808713\",\n \"0.59462506\",\n \"0.59341806\",\n \"0.59273887\",\n \"0.59185714\",\n \"0.59179384\",\n \"0.59173816\",\n \"0.5912081\",\n \"0.59065694\",\n \"0.59008193\",\n \"0.5898748\",\n \"0.589335\",\n \"0.58892775\",\n \"0.58869743\",\n \"0.58862084\",\n \"0.58719146\",\n \"0.5870374\",\n \"0.586997\",\n \"0.5867109\",\n \"0.58628285\",\n \"0.5858623\",\n \"0.58576286\",\n \"0.58506536\",\n \"0.58449644\",\n \"0.5840655\",\n \"0.5834585\",\n \"0.58305585\",\n \"0.5830137\",\n \"0.58155954\",\n \"0.58115447\",\n \"0.5805699\",\n \"0.58036345\",\n \"0.5790608\",\n \"0.57817113\",\n \"0.5777031\",\n \"0.577603\",\n \"0.57746446\",\n \"0.57740706\",\n \"0.5771368\",\n \"0.577012\",\n \"0.57660526\",\n \"0.57622814\",\n \"0.575842\",\n \"0.57575256\",\n \"0.57550234\",\n \"0.575458\",\n \"0.575315\",\n \"0.5751976\",\n \"0.57499796\",\n \"0.5747241\",\n \"0.5740197\",\n \"0.57370406\",\n \"0.5736894\",\n \"0.5726949\",\n \"0.5726363\",\n \"0.5717013\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":11389,"cells":{"query":{"kind":"string","value":"Testing task 108 class main logic ( must return the least number, that is bigger than n and is degree of number 2)"},"document":{"kind":"string","value":"def test_task108_main_logic(number, expected_value):\r\n assert algo.Task108.main_logic(number) == expected_value"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["def pollard(N) :\n\tleft = right = seed\n\td = 1\n\twhile d == 1: \n\t\tleft = pseudo(left,N)\n\t\tright = pseudo(pseudo(right,N),N)\n\t\td = gcd(abs(left-right),N)\n\t\tif PRINT_TRACE : \n\t\t\tprint(left,right,d)\n\tif d == N : \n\t\tprint(\"Failure\")\n\telse :\n\t\tprint(\"non trivial factor is %d\"%d)","def factorPR(n):\n\tnumsteps=2*math.floor(math.sqrt(math.sqrt(n)))\n\tfor additive in range(1,5):\n\t\tfast=slow=1; i=1\n\t\twhile i<numsteps:\n\t\t\tslow = (slow*slow + additive) % n\n\t\t\ti = i + 1\n\t\t\tfast = (fast*fast + additive) % n\n\t\t\tfast = (fast*fast + additive) % n\n\t\t\tg = gcd(fast-slow,n)\n\t\t\tif (g != 1):\n\t\t\t\tif (g == n):\n\t\t\t\t\tbreak\n\t\t\t\telse:\n\t\t\t\t\treturn g\n\treturn 1","def get_n_best(self):\n pass","def factorPR(n):\r\n\tfor slow in [2,3,4,6]:\r\n\t\tnumsteps=2*math.floor(math.sqrt(math.sqrt(n))); fast=slow; i=1\r\n\t\twhile i<numsteps:\r\n\t\t\tslow = (slow*slow + 1) % n\r\n\t\t\ti = i + 1\r\n\t\t\tfast = (fast*fast + 1) % n\r\n\t\t\tfast = (fast*fast + 1) % n\r\n\t\t\tg = gcd(fast-slow,n)\r\n\t\t\tif (g != 1):\r\n\t\t\t\tif (g == n):\r\n\t\t\t\t\tbreak\r\n\t\t\t\telse:\r\n\t\t\t\t\treturn g\r\n\treturn 1","def largest_factor(n):\n \"*** YOUR CODE HERE ***\"\n t = 1\n for i in range(2,n-1):\n if n % i == 0:\n t = i\n return t","def gcd1(n1, n2):\n\n best = 1\n\n for i in range(1,n2+1):\n if n1 % i == 0 and n2 % i == 0 and i > best:\n best = i \n \n return best","def solve(n):\r\n c=0\r\n Ans=0\r\n while c<=n:\r\n if isLychrel(c):\r\n Ans+=1\r\n c+=1\r\n return Ans","def faculteit_iteratief(n):\n res = 1\n\n # Voeg de iteratie in: for ...\n\n return res","def get_complexity(n):\n try:\n return complexity_map[n]\n except KeyError:\n if n - 1 in complexity_map:\n complexity_map[n] = complexity_map[n - 1] + 1\n for i in range(2, int(floor(n / 2) + 1)):\n if n % i == 0:\n complexity = get_complexity(i) + get_complexity(n / i)\n if n not in complexity_map or complexity < complexity_map[n]:\n complexity_map[n] = complexity\n return complexity_map[n]","def solve(total):\n\n if not isnatural(total):\n raise ValueError(\"El numero tiene que ser natural\")\n\n suplimit = total//2 + 2\n for m in range(1, suplimit):\n for n in range(m, suplimit):\n suma = (n-m+1)*(m+n) // 2\n if suma < total:\n continue\n elif suma == total:\n yield (m, n)\n break","def problem077():\n\n cond = lambda n: num_prime_sum_ways(n) > 5000\n ans = next(filter(cond, itertools.count(2)))\n return ans","def minNumberOfSemesters(self, n: int, dependencies: List[List[int]], k: int) -> int:\n\n @lru_cache(None)\n def dp(status, take, avaliable):\n if status == target: # all taken\n return 0\n bin_take = bin(take)[2:][::-1]\n for i,v in enumerate(bin_take):\n if v == '1':\n for j in edges[i]: # the indegree number changed during recursion\n indegree[j] -= 1\n if indegree[j] == 0:\n avaliable |= (1 << j)\n status |= (1 << i)\n # print('i, status', i, v, bin(status))\n # take -= (1 << i)\n\n lst = [i for i,v in enumerate(bin(avaliable)[2:][::-1]) if v == '1']\n # print(indegree)\n # print(lst)\n if not lst:\n res = 0\n # print('lst', lst, k)\n elif len(lst) <= k:\n res = dp(status, avaliable, 0)\n else:\n res = float('inf')\n for comb in combinations(lst, k):\n # print(comb)\n t, a = 0, avaliable\n for d in comb:\n t |= (1 << d)\n a -= (1 << d)\n res = min(res, dp(status, t, a))\n for i,v in enumerate(bin_take):\n if v == '1':\n for j in edges[i]: \n indegree[j] += 1\n return 1 + res\n\n self.counts = 0\n edges = defaultdict(list)\n indegree = Counter()\n for i,j in dependencies:\n edges[i].append(j)\n indegree[j] += 1\n\n courses = set(range(1, n+1))\n start = courses - indegree.keys()\n target = 2**(n+1) - 1\n avaliable = 0\n for i in start:\n avaliable |= (1 << i)\n\n return dp(1, 0, avaliable) - 1# first dp not take courses","def solve_ok(number: int) -> int:\n return no_ones(number) % 2","def MaxHdeg(N):\n Seen = set([])\n starter = tuple([1]*(N-1))\n Stack = [starter]\n best = 0\n while Stack:\n t = Stack.pop()\n v = __value(t,N)\n if v>=best:\n best = v\n L = len(t)\n if L>1:\n for i,j in combinations(range(L),2):\n t2 = list(t)\n t2[i] += t[j]\n t2.pop(j)\n t2 = tuple(sorted(t2))\n if not t2 in Seen:\n Stack.append(t2)\n Seen.add(t2)\n return best","def task_factorial():\n # set range of factorials here\n lo, hi = 0, 11\n user_digit = get_int(lo, hi) \n solution = n_factorial(user_digit) \n print(\"The factorial of %d is %d\" % (user_digit, solution))","def McNuggets(n):\n a=0\n b=0\n c=0\n result=0\n while result <= n:\n result = 6*a + 9*b + 20*c\n if result > n:\n return False\n elif result == n:\n return True\n else:\n a+=1\n ...","def aks( n ):\n\n def aks_mod( polynomial , r ):\n \"\"\"\n This function is used in aks.\n polynomial modulo ( x^r - 1 )\n \"\"\"\n aks_mod = polynomial.coefficients\n total = aks_mod[ : r ]\n aks_mod = aks_mod[ r : ]\n while len(aks_mod) - 1 >= r :\n for i in range(r):\n total[i] += aks_mod[i]\n aks_mod = aks_mod[ r : ]\n for i in range(len(aks_mod)):\n total[i] += aks_mod[i]\n return array_poly_mod( total , polynomial.mod )\n\n lg = math.log( n , 2 )\n k = int( lg * lg )\n\n if arith1.powerDetection( n )[ 1 ] != 1: #Power Detection\n print(\" n is not prime \")\n return False\n\n start = 3\n while 1:\n d = arith1.gcd.gcd( start , n )\n if 1 < d < n:\n print(\"n is not prime\")\n return False\n x = n % start\n N = x\n for i in range( 1 , k + 1 ):\n if N == 1:\n break\n N = ( N * x ) % start\n if i == k:\n r = start\n break\n start += 1\n d = arith1.gcd.gcd( r , n )\n if 1 < d < n:\n print(\" n is not prime \")\n return False\n if n <= r:\n print(\" n is prime \")\n return True\n\n e = multiplicative.euler( r ) #Cyclotomic Conguence\n e = math.sqrt( e )\n e = int( e * lg )\n for b in range( 1 , e+1 ):\n f = array_poly_mod( [ b , 1 ] , n )\n total = array_poly_mod( [ 1 ] , n )\n count = n\n while count > 0:\n if count & 1:\n total = total * f\n total = aks_mod( total , r )\n f = f.power()\n f = aks_mod( f , r )\n count = count >> 1\n total_poly = total.coefficients_to_dict()\n if total_poly != { 0 : b , n % r : 1 }:\n print(\" n is not prime \")\n return False\n print(\" n is prime \")\n return True","def minimumNumber(n, password):\n lower = 0\n upper = 0\n num = 0\n special = 0\n\n for let in password:\n if re.search(r'[a-z]', let):\n lower = 1\n elif re.search(r'[A-Z]', let):\n upper = 1\n elif re.search(r'[0-9]', let):\n num = 1\n\n # - needs to be in front or end of [] so as not to be interpreted as escape\n elif re.search(r'[-!@#$%^&*()+ ]', let):\n special = 1\n categories = lower + upper + num + special\n\n if n >= 6 and categories == 4:\n return 0\n elif n >= 6 and categories < 4:\n print('here', categories)\n return (4 - categories)\n elif n < 6 and categories == 4:\n return (6 - n)\n elif (n < 6) and (categories < 4):\n if (n + 4 - categories) >= 6:\n return 4 - categories\n elif (n + 4 - categories) < 6:\n return 6 - n","def problem():\n for a in range(1, 380):\n for b in range(a):\n if a + b + (a**2 + b**2)**0.5 == 1000:\n return int(a * b * (a**2 + b**2)**0.5)","def sixn(m):\n if m <= 2:\n return ()\n if m > 2:\n yield 2\n if m > 3:\n yield 3\n for n in count(1):\n x = 6 * n - 1\n y = x + 2\n if x < m:\n yield x\n else:\n break\n if y < m:\n yield y\n else:\n break","def problem(num=1000000):\r\n chains = []\r\n i = 1\r\n while i < num:\r\n number = i\r\n chain = 1\r\n while number != 1:\r\n if number % 2 == 0:\r\n number /= 2\r\n else:\r\n number = 3 * number + 1\r\n chain += 1\r\n chains.append(chain)\r\n i += 1\r\n\r\n return chains.index(max(chains)) + 1","def test_hackerrank_sample1(self):\n result = find_digits(12)\n self.assertEquals(result, 2)","def solution(n,p):\n \n a=pow(n, (p - 1) // 2, p)\n if(a==1):\n return True\n else :\n return False","def test_hackerrank_sample2(self):\n result = find_digits(1012)\n self.assertEquals(result, 3)","def largest_factor(n):\n \"*** YOUR CODE HERE ***\"\n if(n > 1):\n target = n * n - 1\n for i in range(n - 1, 1, -1):\n if(target % i == 0):\n return i","def factor(n):\n from random import randrange\n while True:\n i = 1\n x = randrange(0, n)\n y = x\n while True:\n i += 1\n x = ((x ** 2) - 1) % n\n d = gcd(y - x, n)\n if d != 1 and d != n:\n return d\n if i > 10000:\n break","def solution(n: int = 28123) -> int:\n\n nums = range(1, n+1)\n abundant = list(filter(is_abundant, nums))\n abundant_sums = set(all_sums(abundant, n))\n fit = set(nums) - abundant_sums\n return fit","def problem9_naive(n):\n for a in range(4, n, 4):\n for b in range(3, n - a):\n c = n - a - b\n if a ** 2 + b ** 2 == c ** 2:\n return a * b * c\n return None","def solution(base: int = 800800, degree: int = 800800) -> int:\n\n upper_bound = degree * log2(base)\n max_prime = int(upper_bound)\n prime_numbers = calculate_prime_numbers(max_prime)\n\n hybrid_integers_count = 0\n left = 0\n right = len(prime_numbers) - 1\n while left < right:\n while (\n prime_numbers[right] * log2(prime_numbers[left])\n + prime_numbers[left] * log2(prime_numbers[right])\n > upper_bound\n ):\n right -= 1\n hybrid_integers_count += right - left\n left += 1\n\n return hybrid_integers_count","def answer():\n for k in range(2,3000):\n for j in range(k-1,0,-1):\n pj, pk = P(j), P(k)\n #print( j, k, pj, pk )\n if isPent(pk-pj):\n #print( j, k, pj, pk, pk+pj, isPent(pk+pj), pk-pj )\n if isPent(pk+pj) and isPent(pk-pj):\n return pk-pj","def w_smallest_factor(n): \n if n == 1: return 1 \n for i in range(2, int(n**.5)): \n if n % i == 0: return i \n return n","def solve() -> int:\n\n return sum(1 for n in range(1, 10_000) if is_lychrel(n))","def minOperations(n):\n if n <= 1:\n return 0\n\n \"\"\"loop for n number of times\"\"\"\n for i in range(2, n + 1):\n if n % i == 0:\n return minOperations(int(n / i)) + i","def problem_5():\n highestDivisor=1\n n=2520\n while highestDivisor<20:\n highestCurrentDivisor=1\n for i in range(1,21):\n if n%i==0:\n highestCurrentDivisor=i\n else:\n break\n if highestCurrentDivisor>highestDivisor:\n highestDivisor=highestCurrentDivisor\n print(\"Highest divisor:\",highestDivisor)\n n=n+1\n return n-1","def smallest_factor(n): \n if n == 1: return 1 \n for i in range(2, int(n**.5) + 1): \n if n % i == 0: return i","def sol(n):\n p = 1\n res = 0\n \n while n:\n p*=5\n if n&1:\n res+=p\n n=n>>1\n return res%1000000007","def solution(n: int = 2000000) -> int:\n\n return sum(takewhile(lambda x: x < n, prime_generator()))","def test_goldbach(n, result):\n from goldbach import goldbach\n assert goldbach(n) == result","def prove_N() -> Proof:\n # Optional Task 6.8","def McNuggets(n):\n # Your Code Here\n\n high = n//6+1\n\n if n != 0:\n for i in range(high):\n for j in range(high):\n for k in range(high):\n if 6*k + 9*j + 20*i == n:\n return True\n\n return False\n\n else:\n return False","def minOperations(n):\n count = 0\n min_val = 2\n if n < 2:\n return 0\n while min_val <= n:\n if (n % min_val == 0):\n count = count + min_val\n n = n / min_val\n else:\n min_val = min_val + 1\n return (count)","def problem26(limit):\n result = 0\n result_d = 0\n\n for d in range(2, limit):\n d_cycle = calc_rec_cycle(d)\n if d_cycle > result:\n result = d_cycle\n result_d = d\n\n return result_d","def problem9_fast(n):\n n2 = n // 2\n ulimit = ceil(sqrt(n2)) - 1\n for u in range(2, ulimit):\n if n2 % u == 0:\n nu = n2 // u\n while nu % 2 == 0:\n nu //= 2\n if u % 2 == 1:\n k = u + 2\n else:\n k = u + 1\n while k < 2 * u and k <= nu:\n if nu % k == 0 and pe_utils.gcd(k, u) == 1:\n d = n2 // (k * u)\n v = k - u\n a = (u ** 2 - v ** 2) * d\n b = 2 * u * v * d\n c = (u ** 2 + v ** 2) * d\n return a * b * c\n k += 2\n return None","def main(number):\n data = [int(input()) for _ in range(number)]\n frist = data[0]\n for i in range(1, len(data)):\n frist = gcd(frist, data[i])\n print(frist)","def Z(n):\n count5 = 0\n i = 1\n while 1:\n a = pow(5, i)\n if a > n:\n return count5\n else:\n count5 += n/a\n i += 1","def test_domino_with_correct_n_numbers():\n assert compute(7) == 12, \"Not ok\"","def primfact(e):\n for n in range(2, e):\n for x in range(2, n):\n if n % x == 0:\n break\n else:\n print n,","def part_1(rules: Rules) -> int:\n\n happiness, _ = max(generate_arrangements(rules))\n print(f\"part 1: optimal arrangement brings {happiness} happiness\")\n return happiness","def validate(n = 5):","def main():\n S = input()\n ans = editorial(S)\n ans2 = dp_simple(S)\n ans3 = cumsum(S)\n\n assert ans == ans2 == ans3\n if len(S) <= 5:\n ans4 = TLE(S)\n assert ans == ans4\n\n print(ans)","def McNuggets(n):\n # Your Code Here\n for c in xrange( n/20+2):\n for b in xrange( (n-20*c)/9+2):\n for a in xrange ((n-20*c-9*b)/6 +2):\n if (6*a + 9*b + 20*c) == n :\n return True\n return False","def smallest_factor(n):\n if n == 1:\n return 1\n for i in range(2, int(math.sqrt(n)) + 1):\n if n % i == 0:\n return i\n return n","def main() -> int:\n\n a = None\n for n, g in enumerate(gen_primes(100000, 1000000)):\n repeat, indices = check_if_has_3_repeated_digits(str(g))\n if repeat:\n a = check_for_family_of_primes(repeat, indices, list(str(g)))\n if len(a) > 7 and min(a) > 100000:\n EULER_LOGGER.debug(f\"{a}\")\n a = min([int(i) for i in a])\n break\n\n return a","def naive_recursive(k, n):\n # If no floors remaining, no more attempts need to be made.\n if n == 0:\n return 0\n # It will take n attempts to find the correct floor if there is only one egg remaining.\n if k == 1:\n return n\n # Solve the problem recursively.\n return min((max(naive_recursive(k, n - x), naive_recursive(k - 1, x - 1)) + 1 for x in range(1, n + 1)))","def main():\n LIMIT = 600\n GOAL = 1000\n for i in range(1, LIMIT + 1):\n for j in range(1, LIMIT + 1):\n for k in range(1, LIMIT + 1):\n if i + j + k == GOAL:\n if i**2 == j**2 + k**2:\n print \"GOAL:\", (i, j, k)","def main(n=20):\n return functools.reduce(lcm, range(1, 20))","def problem():\n size = 1001\n return sum(n**2 * 4 - 6 * n + 6 for n in range(3, size+1, 2)) + 1","def no_math_solution(n: int):\n lookup = {1: 1}\n # Calculate the chain's length of all Collatz sequences started below n\n for i in range(2, n):\n cal_chain_length(i, lookup)\n # Find the longest chain\n longestChain = 1\n for i in range(2, n):\n if (lookup[i] > lookup[longestChain]):\n longestChain = i\n\n return longestChain","def landau2(n):\n\n factors = primish(n)\n\n # TODO: I have no idea here...\n\n #assert sum(factors) <= n\n return product(factors)","def minOperations(n):\n if not n or n < 2:\n return 0\n\n mov = 0\n min_op = 2\n while min_op <= n:\n if n % min_op == 0:\n mov += min_op\n n = n // min_op\n else:\n min_op += 1\n return mov","def g(n):\n \"*** YOUR CODE HERE ***\"\n if n < 4:\n return n\n else:\n return g(n-1) + 2*g(n-2) + 3*g(n-3)","def landau1(n):\n\n i = 2\n sum_factors = 1\n factors = set()\n\n while i <= n: \n common = {j for j in factors if gcd(j, i) != 1}\n if len(common) == 0:\n factors = add_factor(i, n, factors)\n sum_factors = sum(factors)\n elif product(common) <= i:\n difference = factors.difference(common)\n new_factors = add_factor(i, n, difference)\n if product(new_factors) > product(factors):\n factors = new_factors\n sum_factors = sum(factors)\n i += 1\n\n print(n, product(factors), factors)\n return product(factors)","def f_exact(n, k):\n def fact(m):\n return math.factorial(m)\n\n partition = part(n, k)\n\n total = 0\n for p in partition:\n product = 1\n nodes_left = n\n counts = dict([(x, len(list(y))) for x, y in itertools.groupby(p)])\n for num in p:\n product *= fact(num - 1) * comb(nodes_left, num)\n nodes_left -= num\n for num in counts:\n product /= fact(counts[num])\n\n total += product\n return int(total)","def lucas_selfridge_test(n):\n if isqrt(n) ** 2 == n:\n return False\n D = 5\n while jacobi(D, n) != -1:\n if D > 0:\n D = -(D + 2)\n else:\n D = -(D - 2)\n return lucas_strong_test(n, 1, (1 - D) // 4)","def solve(n=10):\n return sum(M_N_S(n, d)[2] for d in range(10))","def J (self, n):","def minOperations(n):\n if type(n) is not int or n < 2:\n return 0\n\n factor = []\n i = 2\n while i <= n:\n if n % i == 0:\n factor.append(i)\n n = n / i\n else:\n i += 1\n\n return sum(factor)","def main():\n num_1 = 12\n num_2 = 76\n print(find_lcm(num_1, num_2))","def solveMontyHall(num):\n\n\t# the number that the first choice is the anwser\n\tNumFirst = 0\n\t# the number that the switched choice is the anwser\n\tNumSwitch = 0\n\n\tfor i in xrange(num):\n\t\t# Set randomly the index of the prize and first choice\n\t\tprizeIndex = random.randint(0, 2)\n\t\tfirstChoiceIndex = random.randint(0, 2)\n\n\t\t# insist on the first choice \n\t\tif firstChoiceIndex == prizeIndex:\n\t\t\tNumFirst += 1\n\t\telse: # failure\n\t\t\tpass\n\n\t\t# choose to switch \n\t\tif firstChoiceIndex == prizeIndex:\n\t\t\tpass # failure\n\t\telse: # means you get the right answer\n\t\t\tNumSwitch += 1\n\n\treturn (NumFirst / float(num), NumSwitch / float(num))","def g(n):\n\t\"*** YOUR CODE HERE ***\"\n\tif n <= 3:\n\t\treturn n\n\telse:\n\t\treturn g(n-1) + 2*g(n-2) + 3*g(n-3)","def fn(n, k):\n if k == 1: return n \n if n == 0: return 0 \n ans = inf \n for x in range(1, n+1): \n ans = min(ans, 1 + max(fn(x-1, k-1), fn(n-x, k)))\n return ans","def solution1(n):\n res = []\n while n > 0:\n m = int(math.floor(math.sqrt(n))**2)\n res.append(m)\n n -= m\n return res","def compute(n):\n if n == 1:\n return 1\n else:\n i = find_i(n)\n return 2 * compute(n - i) + 2 ** i - 1","def part_2(rules: Rules) -> int:\n\n rules_with_myself = add_myself(rules)\n happiness, _ = max(generate_arrangements(rules_with_myself))\n print(f\"part 2: optimal arrangement (including myself) brings {happiness} happiness\")\n return happiness","def g(n):\n \"*** YOUR CODE HERE ***\"\n if n <= 3:\n return n\n else:\n return g(n - 1) + 2 * g(n - 2) + 3 * g(n - 3)","def g(n):\n \"*** YOUR CODE HERE ***\"\n if n <= 3:\n return n\n else:\n return g(n - 1) + 2 * g(n - 2) + 3 * g(n - 3)","def McNuggets(n): \n def check(n):\n if n%6==0 or n%9==0 or n%20==0:\n return True\n \n def all(n):\n for i in (6,9,20):\n if (n-i)>0 and check(n-i):\n return True\n \n while n>0:\n #print n\n if check(n):\n return True \n if all(n):\n return True\n if n>=20:\n n-=20\n elif n>=9:\n n-=9\n else:\n n-=6\n \n #print n\n \n if n==0:\n return True\n else:\n return False","def min_operations(number):\n\n # Solution:\n # 1. The number of steps to reach a target number = number of steps take to make the target number 0\n # 2. We will be greedy, each time if it is possible we will try to make the number half\n steps_count = 0\n while number > 0:\n # check if we can make the number half\n if number % 2 == 0:\n number = number / 2\n else:\n # number can't halved so we can only decrease it by 1\n number -= 1\n steps_count += 1\n\n return steps_count","def main():\n\n import sys\n sys.setrecursionlimit(10**7)\n from itertools import accumulate, combinations, permutations, product # https://docs.python.org/ja/3/library/itertools.html\n # accumulate() returns iterator! to get list: list(accumulate())\n from math import factorial, ceil, floor\n def factorize(n):\n \"\"\"return the factors of the Arg and count of each factor\n \n Args:\n n (long): number to be resolved into factors\n \n Returns:\n list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]\n \"\"\"\n fct = [] # prime factor\n b, e = 2, 0 # base, exponent\n while b * b <= n:\n while n % b == 0:\n n = n // b\n e = e + 1\n if e > 0:\n fct.append((b, e))\n b, e = b + 1, 0\n if n > 1:\n fct.append((n, 1))\n return fct\n def combinations_count(n, r):\n \"\"\"Return the number of selecting r pieces of items from n kinds of items.\n \n Args:\n n (long): number\n r (long): number\n \n Raises:\n Exception: not defined when n or r is negative\n \n Returns:\n long: number\n \"\"\"\n # TODO: How should I do when n - r is negative?\n if n < 0 or r < 0:\n raise Exception('combinations_count(n, r) not defined when n or r is negative')\n if n - r < r: r = n - r\n if r < 0: return 0\n if r == 0: return 1\n if r == 1: return n\n numerator = [n - r + k + 1 for k in range(r)]\n denominator = [k + 1 for k in range(r)]\n for p in range(2,r+1):\n pivot = denominator[p - 1]\n if pivot > 1:\n offset = (n - r) % p\n for k in range(p-1,r,p):\n numerator[k - offset] /= pivot\n denominator[k] /= pivot\n result = 1\n for k in range(r):\n if numerator[k] > 1:\n result *= int(numerator[k])\n return result\n def combinations_with_replacement_count(n, r):\n \"\"\"Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.\n \n Args:\n n (long): number\n r (long): number\n \n Raises:\n Exception: not defined when n or r is negative\n \n Returns:\n long: number\n \"\"\"\n if n < 0 or r < 0:\n raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')\n elif n == 0:\n return 1\n else:\n return combinations_count(n + r - 1, r)\n from bisect import bisect_left, bisect_right\n from collections import deque, Counter, defaultdict # https://docs.python.org/ja/3/library/collections.html#collections.deque\n from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest # https://docs.python.org/ja/3/library/heapq.html\n from copy import deepcopy, copy # https://docs.python.org/ja/3/library/copy.html\n from operator import itemgetter\n # ex1: List.sort(key=itemgetter(1))\n # ex2: sorted(tuples, key=itemgetter(1,2))\n from functools import reduce\n def chmin(x, y):\n \"\"\"change minimum\n if x > y, x = y and return (x, True).\n convenient when solving problems of dp[i]\n \n Args:\n x (long): current minimum value\n y (long): potential minimum value\n \n Returns:\n (x, bool): (x, True) when updated, else (x, False)\n \"\"\"\n if x > y:\n x = y\n return (x, True)\n else:\n return (x, False)\n def chmax(x, y):\n \"\"\"change maximum\n if x < y, x = y and return (x, True).\n convenient when solving problems of dp[i]\n \n Args:\n x (long): current maximum value\n y (long): potential maximum value\n \n Returns:\n (x, bool): (x, True) when updated, else (x, False)\n \"\"\"\n if x < y:\n x = y\n return (x, True)\n else:\n return (x, False)\n\n from fractions import gcd # Deprecated since version 3.5: Use math.gcd() instead.\n def gcds(numbers):\n return reduce(gcd, numbers)\n def lcm(x, y):\n return (x * y) // gcd(x, y)\n def lcms(numbers):\n return reduce(lcm, numbers, 1)\n\n # first create factorial_list\n # fac_list = mod_factorial_list(n)\n INF = 10 ** 18\n MOD = 10 ** 9 + 7\n modpow = lambda a, n, p = MOD: pow(a, n, p) # Recursive function in python is slow!\n def modinv(a, p = MOD):\n # evaluate reciprocal using Fermat's little theorem:\n # a**(p-1) is identical to 1 (mod p) when a and p is coprime\n return modpow(a, p-2, p)\n def modinv_list(n, p = MOD):\n if n <= 1:\n return [0,1][:n+1]\n else:\n inv_t = [0,1]\n for i in range(2, n+1):\n inv_t += [inv_t[p % i] * (p - int(p / i)) % p]\n return inv_t\n def modfactorial_list(n, p = MOD):\n if n == 0:\n return [1]\n else:\n l = [0] * (n+1)\n tmp = 1\n for i in range(1, n+1):\n tmp = tmp * i % p\n l[i] = tmp\n return l\n def modcomb(n, k, fac_list = [], p = MOD):\n # fac_list = modfactorial_list(100)\n # print(modcomb(100, 5, modfactorial_list(100)))\n from math import factorial\n if n < 0 or k < 0 or n < k: return 0\n if n == 0 or k == 0: return 1\n if len(fac_list) <= n:\n a = factorial(n) % p\n b = factorial(k) % p\n c = factorial(n-k) % p\n else:\n a = fac_list[n]\n b = fac_list[k]\n c = fac_list[n-k]\n return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p\n def modadd(a, b, p = MOD):\n return (a + b) % MOD\n def modsub(a, b, p = MOD):\n return (a - b) % p\n def modmul(a, b, p = MOD):\n return ((a % p) * (b % p)) % p\n def moddiv(a, b, p = MOD):\n return modmul(a, modpow(b, p-2, p))\n\n \"\"\" initialize variables and set inputs\n # initialize variables\n # to initialize list, use [0] * n\n # to initialize two dimentional array, use [[0] * N for _ in range(N)]\n # set inputs\n # open(0).read() is a convenient method:\n # ex) n, m, *x = map(int, open(0).read().split())\n # min(x[::2]) - max(x[1::2])\n # ex2) *x, = map(int, open(0).read().split())\n # don't forget to add comma after *x if only one variable is used\n # preprocessing\n # transpose = [x for x in zip(*data)]\n # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [(1, 4, 7), (2, 5, 8), (3, 6, 9)]\n # flat = [flatten for inner in data for flatten in inner]\n # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [1, 2, 3, 4, 5, 6, 7, 8, 9]\n # calculate and output\n # output pattern\n # ex1) print(*l) => when l = [2, 5, 6], printed 2 5 6\n \"\"\"\n\n # functions used\n r = lambda: sys.stdin.readline().strip()\n r_int = lambda: int(r())\n R = lambda: list(map(int, r().split()))\n Rfloat = lambda: list(map(float, r().split()))\n Rtuple = lambda: tuple(map(int, r().split()))\n Rmap = lambda: map(int, r().split())\n\n \"\"\" how to treat input\n # single int: int(r())\n # single string: r()\n # single float: float(r())\n # line int: R()\n # line string: r().split()\n # line (str, int, int): [j if i == 0 else int(j) for i, j in enumerate(r().split())]\n # lines int: [R() for _ in range(n)]\n \"\"\"\n\n # main\n N, Q = R()\n STX = [R() for _ in range(N)]\n STX.sort(key=itemgetter(2))\n\n D = [int(r()) for _ in range(Q)]\n Stopped = [-1] * Q\n ans = [-1] * Q\n\n for s, t, x in STX:\n l = bisect_left(D, s-x)\n r = bisect_left(D,t-x)\n a = l\n while a < r:\n if Stopped[a] == -1:\n ans[a] = x\n Stopped[a] = r\n a += 1\n else:\n a = Stopped[a]\n\n for i in ans:\n print(i)\n\n \"\"\"memo: how to use defaultdict of list\n # initialize\n Dic = defaultdict(list)\n # append / extend\n Dic[x].append(y)\n # for\n for k, v in Dic.items():\n \"\"\"","def solution(N, K):\n\n # not really sure what to return if N=1, it should be invalid?\n rounds = N - 1\n next_num = N\n while K > 0 and next_num >= 4:\n next_num = next_num - next_num % 2\n next_num = next_num // 2\n rounds -= (next_num - 1)\n K -= 1\n return rounds","def goldbach(number):\n for p in primes:\n if p > number:\n return None\n squared = sqrt( (number - p) / 2)\n if int(squared) == squared:\n return p, int(squared)","def chosse(n,k):\n import math \n if (n>=k and k>=0):\n return math.factorial(n) / (math.factorial(k) * math.factorial(n-k))\n else:\n return \"No se puede calcular el numero factorial indicado\"","def problem():\n\n print 'problem #27'\n\n l = 0\n m_a = 0\n m_b = 0\n for a in xrange(-1000, 1000):\n for b in xrange(-1000, 1000):\n p = len(check(a, b))\n if p > l:\n l = p\n m_a = a\n m_b = b\n\n print 'the product of coefficients is %s' % (m_a * m_b)","def perfect_power(n: int):\n k = 2\n max_k = round(n ** (1/2))\n while True:\n m = round(n ** (1/k))\n if m ** k == n:\n return [m, k]\n elif k > max_k:\n return None\n else:\n k += 1","def Problem4(n):\n A = Problem2(n)\n eig = min(sl.eigs(A.asfptype(), which='SM')[0])\n \n print \"lamba*n^2 approaches pi^2 as n goes to infinity\"\n return eig*n**2","def prove_NN() -> Proof:\n # Optional Task 6.7c","def exercise3(self):\n print \"The next line should read '1000000'\"\n print self.smallest_number(7)","def detectMiss(n, k):\n k -= 1\n nlog = math.ceil(math.log(n,2))\n nloglessone = nlog - 1\n lower_base = 2**nloglessone - 1\n lowerbaseBack = lower_base\n diff_list = [2**i for i in range(nloglessone-1, 0, -1)]\n diff_lit_back = diff_list[1:-1]\n if lower_base == k and 2**nlog -1 == n:\n return(k)\n matchres = False\n while(lower_base <= k and len(diff_list)>0 ):\n if lower_base == k:\n matchres = True\n break\n else:\n addVal = diff_list[0]\n lower_base += addVal\n diff_list.remove(addVal)\n if matchres:\n k -= 1\n if k%2==0:\n return(k)\n else:\n while(len(diff_lit_back)>0 and lowerbaseBack<k):\n newAddVal = diff_lit_back[0]\n lowerbaseBack = lowerbaseBack+newAddVal\n postitionIndx = lowerbaseBack + newAddVal\n if lowerbaseBack == k and postitionIndx <= n:\n return(k)\n elif lowerbaseBack == k and postitionIndx > n:\n return(k-1)\n else:\n pass\n diff_lit_back.remove(newAddVal)\n\n return(k)","def Pollard_pm1(n, primes, max_B=1000000):\n B = 10\n g = 1\n while B < max_B and g < n:\n a = randint(2, n - 2)\n g = gcd(a, n)\n if g != 1:\n return g\n for p in primes:\n if p >= B:\n break\n pd = 1 # p^d\n while pd * p <= B:\n pd *= p\n a = powmod(a, pd, n)\n g = gcd(a - 1, n)\n if g != 1 and g != n:\n return g\n B *= 2\n return 1","def ramanujan_hardy_asymptotic(n):\n if(n != int(n)):\n raise ValueError(\n \"n must be integer\"\n )\n \n return int((1/(4*n*math.sqrt(3)))*math.exp(math.sqrt(2*n/3)))","def _n_choose_2(n):\n return (n * (n - 1)) // 2","def solution2(n):\n if n == 0:\n return []\n m = int(math.floor(math.sqrt(n))**2)\n return [m] + solution2(n - m)","def solution(resources, args):\n largest_prime_factor = 1\n number = args.number\n prime_generator = primes.get_prime_generator()\n\n while number > 1:\n prime = next(prime_generator)\n if number % prime == 0:\n number /= prime\n largest_prime_factor = prime\n\n if largest_prime_factor == 1:\n largest_prime_factor = args.number\n\n return largest_prime_factor","def miller_rabin_base_2(n):\n d = n-1\n s = 0\n while not d & 1: # Check for divisibility by 2\n d = d >> 1 # Divide by 2 using a binary right shift\n s += 1\n\n x = pow(2, d, n)\n if x == 1 or x == n-1:\n return True\n for i in range(s-1):\n x = pow(x, 2, n)\n if x == 1:\n return False\n elif x == n - 1:\n return True\n return False","def McNuggets(n):\n # Your Code Here\n\n for a in range(0, n/6+1):\n for b in range(0, n/9+1):\n for c in range(0, n/20+1):\n if 6*a+9*b+20*c == n:\n return True\n return False","def miller_rabin_base_2(n):\n d, s = n - 1, 0\n while not d & 1:\n d, s = d >> 1, s + 1\n\n x = pow(2, d, n)\n if (x == 1) or (x == n - 1):\n return True\n\n for i in range(s - 1):\n x = pow(x, 2, n)\n if x == 1:\n return False\n elif x == n - 1:\n return True\n\n return False","def choose(n, k):\n ans, k = 1, min(k, n-k)\n for i in range(k):\n ans *= n-i\n ans //= i+1\n return ans","def rabin_miller(n, target=128):\n ###############\n ## Start your code here\n return True\n ## End of your code\n ###############","def dfs(x):\n if x <= n:\n ans.append(x)\n for xx in range(10): dfs(10*x + xx)","def McNuggets(n):\n \n '''if n == 0:\n return True\n for i in (6, 9, 20):\n if n >= i and McNuggets(n - i):\n return True\n return False\n '''\n \n for a in range(0,n):\n for b in range(0,n):\n for c in range(0,n):\n if 6*a+9*b+20*c == n:\n return True\n return False","def primitive_root(n):\n if n == 2:\n return 1\n phi = euler_phi(n)\n phi_divisors = factorize(phi)\n for g in range(2, n + 1):\n if gcd(g, n) != 1:\n continue\n for d, _ in phi_divisors:\n if powmod(g, phi // d, n) == 1:\n # g can not be a generator\n break\n else:\n return g\n\n # generator not found\n # Gauss theorem conditions did not met\n return None"],"string":"[\n \"def pollard(N) :\\n\\tleft = right = seed\\n\\td = 1\\n\\twhile d == 1: \\n\\t\\tleft = pseudo(left,N)\\n\\t\\tright = pseudo(pseudo(right,N),N)\\n\\t\\td = gcd(abs(left-right),N)\\n\\t\\tif PRINT_TRACE : \\n\\t\\t\\tprint(left,right,d)\\n\\tif d == N : \\n\\t\\tprint(\\\"Failure\\\")\\n\\telse :\\n\\t\\tprint(\\\"non trivial factor is %d\\\"%d)\",\n \"def factorPR(n):\\n\\tnumsteps=2*math.floor(math.sqrt(math.sqrt(n)))\\n\\tfor additive in range(1,5):\\n\\t\\tfast=slow=1; i=1\\n\\t\\twhile i<numsteps:\\n\\t\\t\\tslow = (slow*slow + additive) % n\\n\\t\\t\\ti = i + 1\\n\\t\\t\\tfast = (fast*fast + additive) % n\\n\\t\\t\\tfast = (fast*fast + additive) % n\\n\\t\\t\\tg = gcd(fast-slow,n)\\n\\t\\t\\tif (g != 1):\\n\\t\\t\\t\\tif (g == n):\\n\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\telse:\\n\\t\\t\\t\\t\\treturn g\\n\\treturn 1\",\n \"def get_n_best(self):\\n pass\",\n \"def factorPR(n):\\r\\n\\tfor slow in [2,3,4,6]:\\r\\n\\t\\tnumsteps=2*math.floor(math.sqrt(math.sqrt(n))); fast=slow; i=1\\r\\n\\t\\twhile i<numsteps:\\r\\n\\t\\t\\tslow = (slow*slow + 1) % n\\r\\n\\t\\t\\ti = i + 1\\r\\n\\t\\t\\tfast = (fast*fast + 1) % n\\r\\n\\t\\t\\tfast = (fast*fast + 1) % n\\r\\n\\t\\t\\tg = gcd(fast-slow,n)\\r\\n\\t\\t\\tif (g != 1):\\r\\n\\t\\t\\t\\tif (g == n):\\r\\n\\t\\t\\t\\t\\tbreak\\r\\n\\t\\t\\t\\telse:\\r\\n\\t\\t\\t\\t\\treturn g\\r\\n\\treturn 1\",\n \"def largest_factor(n):\\n \\\"*** YOUR CODE HERE ***\\\"\\n t = 1\\n for i in range(2,n-1):\\n if n % i == 0:\\n t = i\\n return t\",\n \"def gcd1(n1, n2):\\n\\n best = 1\\n\\n for i in range(1,n2+1):\\n if n1 % i == 0 and n2 % i == 0 and i > best:\\n best = i \\n \\n return best\",\n \"def solve(n):\\r\\n c=0\\r\\n Ans=0\\r\\n while c<=n:\\r\\n if isLychrel(c):\\r\\n Ans+=1\\r\\n c+=1\\r\\n return Ans\",\n \"def faculteit_iteratief(n):\\n res = 1\\n\\n # Voeg de iteratie in: for ...\\n\\n return res\",\n \"def get_complexity(n):\\n try:\\n return complexity_map[n]\\n except KeyError:\\n if n - 1 in complexity_map:\\n complexity_map[n] = complexity_map[n - 1] + 1\\n for i in range(2, int(floor(n / 2) + 1)):\\n if n % i == 0:\\n complexity = get_complexity(i) + get_complexity(n / i)\\n if n not in complexity_map or complexity < complexity_map[n]:\\n complexity_map[n] = complexity\\n return complexity_map[n]\",\n \"def solve(total):\\n\\n if not isnatural(total):\\n raise ValueError(\\\"El numero tiene que ser natural\\\")\\n\\n suplimit = total//2 + 2\\n for m in range(1, suplimit):\\n for n in range(m, suplimit):\\n suma = (n-m+1)*(m+n) // 2\\n if suma < total:\\n continue\\n elif suma == total:\\n yield (m, n)\\n break\",\n \"def problem077():\\n\\n cond = lambda n: num_prime_sum_ways(n) > 5000\\n ans = next(filter(cond, itertools.count(2)))\\n return ans\",\n \"def minNumberOfSemesters(self, n: int, dependencies: List[List[int]], k: int) -> int:\\n\\n @lru_cache(None)\\n def dp(status, take, avaliable):\\n if status == target: # all taken\\n return 0\\n bin_take = bin(take)[2:][::-1]\\n for i,v in enumerate(bin_take):\\n if v == '1':\\n for j in edges[i]: # the indegree number changed during recursion\\n indegree[j] -= 1\\n if indegree[j] == 0:\\n avaliable |= (1 << j)\\n status |= (1 << i)\\n # print('i, status', i, v, bin(status))\\n # take -= (1 << i)\\n\\n lst = [i for i,v in enumerate(bin(avaliable)[2:][::-1]) if v == '1']\\n # print(indegree)\\n # print(lst)\\n if not lst:\\n res = 0\\n # print('lst', lst, k)\\n elif len(lst) <= k:\\n res = dp(status, avaliable, 0)\\n else:\\n res = float('inf')\\n for comb in combinations(lst, k):\\n # print(comb)\\n t, a = 0, avaliable\\n for d in comb:\\n t |= (1 << d)\\n a -= (1 << d)\\n res = min(res, dp(status, t, a))\\n for i,v in enumerate(bin_take):\\n if v == '1':\\n for j in edges[i]: \\n indegree[j] += 1\\n return 1 + res\\n\\n self.counts = 0\\n edges = defaultdict(list)\\n indegree = Counter()\\n for i,j in dependencies:\\n edges[i].append(j)\\n indegree[j] += 1\\n\\n courses = set(range(1, n+1))\\n start = courses - indegree.keys()\\n target = 2**(n+1) - 1\\n avaliable = 0\\n for i in start:\\n avaliable |= (1 << i)\\n\\n return dp(1, 0, avaliable) - 1# first dp not take courses\",\n \"def solve_ok(number: int) -> int:\\n return no_ones(number) % 2\",\n \"def MaxHdeg(N):\\n Seen = set([])\\n starter = tuple([1]*(N-1))\\n Stack = [starter]\\n best = 0\\n while Stack:\\n t = Stack.pop()\\n v = __value(t,N)\\n if v>=best:\\n best = v\\n L = len(t)\\n if L>1:\\n for i,j in combinations(range(L),2):\\n t2 = list(t)\\n t2[i] += t[j]\\n t2.pop(j)\\n t2 = tuple(sorted(t2))\\n if not t2 in Seen:\\n Stack.append(t2)\\n Seen.add(t2)\\n return best\",\n \"def task_factorial():\\n # set range of factorials here\\n lo, hi = 0, 11\\n user_digit = get_int(lo, hi) \\n solution = n_factorial(user_digit) \\n print(\\\"The factorial of %d is %d\\\" % (user_digit, solution))\",\n \"def McNuggets(n):\\n a=0\\n b=0\\n c=0\\n result=0\\n while result <= n:\\n result = 6*a + 9*b + 20*c\\n if result > n:\\n return False\\n elif result == n:\\n return True\\n else:\\n a+=1\\n ...\",\n \"def aks( n ):\\n\\n def aks_mod( polynomial , r ):\\n \\\"\\\"\\\"\\n This function is used in aks.\\n polynomial modulo ( x^r - 1 )\\n \\\"\\\"\\\"\\n aks_mod = polynomial.coefficients\\n total = aks_mod[ : r ]\\n aks_mod = aks_mod[ r : ]\\n while len(aks_mod) - 1 >= r :\\n for i in range(r):\\n total[i] += aks_mod[i]\\n aks_mod = aks_mod[ r : ]\\n for i in range(len(aks_mod)):\\n total[i] += aks_mod[i]\\n return array_poly_mod( total , polynomial.mod )\\n\\n lg = math.log( n , 2 )\\n k = int( lg * lg )\\n\\n if arith1.powerDetection( n )[ 1 ] != 1: #Power Detection\\n print(\\\" n is not prime \\\")\\n return False\\n\\n start = 3\\n while 1:\\n d = arith1.gcd.gcd( start , n )\\n if 1 < d < n:\\n print(\\\"n is not prime\\\")\\n return False\\n x = n % start\\n N = x\\n for i in range( 1 , k + 1 ):\\n if N == 1:\\n break\\n N = ( N * x ) % start\\n if i == k:\\n r = start\\n break\\n start += 1\\n d = arith1.gcd.gcd( r , n )\\n if 1 < d < n:\\n print(\\\" n is not prime \\\")\\n return False\\n if n <= r:\\n print(\\\" n is prime \\\")\\n return True\\n\\n e = multiplicative.euler( r ) #Cyclotomic Conguence\\n e = math.sqrt( e )\\n e = int( e * lg )\\n for b in range( 1 , e+1 ):\\n f = array_poly_mod( [ b , 1 ] , n )\\n total = array_poly_mod( [ 1 ] , n )\\n count = n\\n while count > 0:\\n if count & 1:\\n total = total * f\\n total = aks_mod( total , r )\\n f = f.power()\\n f = aks_mod( f , r )\\n count = count >> 1\\n total_poly = total.coefficients_to_dict()\\n if total_poly != { 0 : b , n % r : 1 }:\\n print(\\\" n is not prime \\\")\\n return False\\n print(\\\" n is prime \\\")\\n return True\",\n \"def minimumNumber(n, password):\\n lower = 0\\n upper = 0\\n num = 0\\n special = 0\\n\\n for let in password:\\n if re.search(r'[a-z]', let):\\n lower = 1\\n elif re.search(r'[A-Z]', let):\\n upper = 1\\n elif re.search(r'[0-9]', let):\\n num = 1\\n\\n # - needs to be in front or end of [] so as not to be interpreted as escape\\n elif re.search(r'[-!@#$%^&*()+ ]', let):\\n special = 1\\n categories = lower + upper + num + special\\n\\n if n >= 6 and categories == 4:\\n return 0\\n elif n >= 6 and categories < 4:\\n print('here', categories)\\n return (4 - categories)\\n elif n < 6 and categories == 4:\\n return (6 - n)\\n elif (n < 6) and (categories < 4):\\n if (n + 4 - categories) >= 6:\\n return 4 - categories\\n elif (n + 4 - categories) < 6:\\n return 6 - n\",\n \"def problem():\\n for a in range(1, 380):\\n for b in range(a):\\n if a + b + (a**2 + b**2)**0.5 == 1000:\\n return int(a * b * (a**2 + b**2)**0.5)\",\n \"def sixn(m):\\n if m <= 2:\\n return ()\\n if m > 2:\\n yield 2\\n if m > 3:\\n yield 3\\n for n in count(1):\\n x = 6 * n - 1\\n y = x + 2\\n if x < m:\\n yield x\\n else:\\n break\\n if y < m:\\n yield y\\n else:\\n break\",\n \"def problem(num=1000000):\\r\\n chains = []\\r\\n i = 1\\r\\n while i < num:\\r\\n number = i\\r\\n chain = 1\\r\\n while number != 1:\\r\\n if number % 2 == 0:\\r\\n number /= 2\\r\\n else:\\r\\n number = 3 * number + 1\\r\\n chain += 1\\r\\n chains.append(chain)\\r\\n i += 1\\r\\n\\r\\n return chains.index(max(chains)) + 1\",\n \"def test_hackerrank_sample1(self):\\n result = find_digits(12)\\n self.assertEquals(result, 2)\",\n \"def solution(n,p):\\n \\n a=pow(n, (p - 1) // 2, p)\\n if(a==1):\\n return True\\n else :\\n return False\",\n \"def test_hackerrank_sample2(self):\\n result = find_digits(1012)\\n self.assertEquals(result, 3)\",\n \"def largest_factor(n):\\n \\\"*** YOUR CODE HERE ***\\\"\\n if(n > 1):\\n target = n * n - 1\\n for i in range(n - 1, 1, -1):\\n if(target % i == 0):\\n return i\",\n \"def factor(n):\\n from random import randrange\\n while True:\\n i = 1\\n x = randrange(0, n)\\n y = x\\n while True:\\n i += 1\\n x = ((x ** 2) - 1) % n\\n d = gcd(y - x, n)\\n if d != 1 and d != n:\\n return d\\n if i > 10000:\\n break\",\n \"def solution(n: int = 28123) -> int:\\n\\n nums = range(1, n+1)\\n abundant = list(filter(is_abundant, nums))\\n abundant_sums = set(all_sums(abundant, n))\\n fit = set(nums) - abundant_sums\\n return fit\",\n \"def problem9_naive(n):\\n for a in range(4, n, 4):\\n for b in range(3, n - a):\\n c = n - a - b\\n if a ** 2 + b ** 2 == c ** 2:\\n return a * b * c\\n return None\",\n \"def solution(base: int = 800800, degree: int = 800800) -> int:\\n\\n upper_bound = degree * log2(base)\\n max_prime = int(upper_bound)\\n prime_numbers = calculate_prime_numbers(max_prime)\\n\\n hybrid_integers_count = 0\\n left = 0\\n right = len(prime_numbers) - 1\\n while left < right:\\n while (\\n prime_numbers[right] * log2(prime_numbers[left])\\n + prime_numbers[left] * log2(prime_numbers[right])\\n > upper_bound\\n ):\\n right -= 1\\n hybrid_integers_count += right - left\\n left += 1\\n\\n return hybrid_integers_count\",\n \"def answer():\\n for k in range(2,3000):\\n for j in range(k-1,0,-1):\\n pj, pk = P(j), P(k)\\n #print( j, k, pj, pk )\\n if isPent(pk-pj):\\n #print( j, k, pj, pk, pk+pj, isPent(pk+pj), pk-pj )\\n if isPent(pk+pj) and isPent(pk-pj):\\n return pk-pj\",\n \"def w_smallest_factor(n): \\n if n == 1: return 1 \\n for i in range(2, int(n**.5)): \\n if n % i == 0: return i \\n return n\",\n \"def solve() -> int:\\n\\n return sum(1 for n in range(1, 10_000) if is_lychrel(n))\",\n \"def minOperations(n):\\n if n <= 1:\\n return 0\\n\\n \\\"\\\"\\\"loop for n number of times\\\"\\\"\\\"\\n for i in range(2, n + 1):\\n if n % i == 0:\\n return minOperations(int(n / i)) + i\",\n \"def problem_5():\\n highestDivisor=1\\n n=2520\\n while highestDivisor<20:\\n highestCurrentDivisor=1\\n for i in range(1,21):\\n if n%i==0:\\n highestCurrentDivisor=i\\n else:\\n break\\n if highestCurrentDivisor>highestDivisor:\\n highestDivisor=highestCurrentDivisor\\n print(\\\"Highest divisor:\\\",highestDivisor)\\n n=n+1\\n return n-1\",\n \"def smallest_factor(n): \\n if n == 1: return 1 \\n for i in range(2, int(n**.5) + 1): \\n if n % i == 0: return i\",\n \"def sol(n):\\n p = 1\\n res = 0\\n \\n while n:\\n p*=5\\n if n&1:\\n res+=p\\n n=n>>1\\n return res%1000000007\",\n \"def solution(n: int = 2000000) -> int:\\n\\n return sum(takewhile(lambda x: x < n, prime_generator()))\",\n \"def test_goldbach(n, result):\\n from goldbach import goldbach\\n assert goldbach(n) == result\",\n \"def prove_N() -> Proof:\\n # Optional Task 6.8\",\n \"def McNuggets(n):\\n # Your Code Here\\n\\n high = n//6+1\\n\\n if n != 0:\\n for i in range(high):\\n for j in range(high):\\n for k in range(high):\\n if 6*k + 9*j + 20*i == n:\\n return True\\n\\n return False\\n\\n else:\\n return False\",\n \"def minOperations(n):\\n count = 0\\n min_val = 2\\n if n < 2:\\n return 0\\n while min_val <= n:\\n if (n % min_val == 0):\\n count = count + min_val\\n n = n / min_val\\n else:\\n min_val = min_val + 1\\n return (count)\",\n \"def problem26(limit):\\n result = 0\\n result_d = 0\\n\\n for d in range(2, limit):\\n d_cycle = calc_rec_cycle(d)\\n if d_cycle > result:\\n result = d_cycle\\n result_d = d\\n\\n return result_d\",\n \"def problem9_fast(n):\\n n2 = n // 2\\n ulimit = ceil(sqrt(n2)) - 1\\n for u in range(2, ulimit):\\n if n2 % u == 0:\\n nu = n2 // u\\n while nu % 2 == 0:\\n nu //= 2\\n if u % 2 == 1:\\n k = u + 2\\n else:\\n k = u + 1\\n while k < 2 * u and k <= nu:\\n if nu % k == 0 and pe_utils.gcd(k, u) == 1:\\n d = n2 // (k * u)\\n v = k - u\\n a = (u ** 2 - v ** 2) * d\\n b = 2 * u * v * d\\n c = (u ** 2 + v ** 2) * d\\n return a * b * c\\n k += 2\\n return None\",\n \"def main(number):\\n data = [int(input()) for _ in range(number)]\\n frist = data[0]\\n for i in range(1, len(data)):\\n frist = gcd(frist, data[i])\\n print(frist)\",\n \"def Z(n):\\n count5 = 0\\n i = 1\\n while 1:\\n a = pow(5, i)\\n if a > n:\\n return count5\\n else:\\n count5 += n/a\\n i += 1\",\n \"def test_domino_with_correct_n_numbers():\\n assert compute(7) == 12, \\\"Not ok\\\"\",\n \"def primfact(e):\\n for n in range(2, e):\\n for x in range(2, n):\\n if n % x == 0:\\n break\\n else:\\n print n,\",\n \"def part_1(rules: Rules) -> int:\\n\\n happiness, _ = max(generate_arrangements(rules))\\n print(f\\\"part 1: optimal arrangement brings {happiness} happiness\\\")\\n return happiness\",\n \"def validate(n = 5):\",\n \"def main():\\n S = input()\\n ans = editorial(S)\\n ans2 = dp_simple(S)\\n ans3 = cumsum(S)\\n\\n assert ans == ans2 == ans3\\n if len(S) <= 5:\\n ans4 = TLE(S)\\n assert ans == ans4\\n\\n print(ans)\",\n \"def McNuggets(n):\\n # Your Code Here\\n for c in xrange( n/20+2):\\n for b in xrange( (n-20*c)/9+2):\\n for a in xrange ((n-20*c-9*b)/6 +2):\\n if (6*a + 9*b + 20*c) == n :\\n return True\\n return False\",\n \"def smallest_factor(n):\\n if n == 1:\\n return 1\\n for i in range(2, int(math.sqrt(n)) + 1):\\n if n % i == 0:\\n return i\\n return n\",\n \"def main() -> int:\\n\\n a = None\\n for n, g in enumerate(gen_primes(100000, 1000000)):\\n repeat, indices = check_if_has_3_repeated_digits(str(g))\\n if repeat:\\n a = check_for_family_of_primes(repeat, indices, list(str(g)))\\n if len(a) > 7 and min(a) > 100000:\\n EULER_LOGGER.debug(f\\\"{a}\\\")\\n a = min([int(i) for i in a])\\n break\\n\\n return a\",\n \"def naive_recursive(k, n):\\n # If no floors remaining, no more attempts need to be made.\\n if n == 0:\\n return 0\\n # It will take n attempts to find the correct floor if there is only one egg remaining.\\n if k == 1:\\n return n\\n # Solve the problem recursively.\\n return min((max(naive_recursive(k, n - x), naive_recursive(k - 1, x - 1)) + 1 for x in range(1, n + 1)))\",\n \"def main():\\n LIMIT = 600\\n GOAL = 1000\\n for i in range(1, LIMIT + 1):\\n for j in range(1, LIMIT + 1):\\n for k in range(1, LIMIT + 1):\\n if i + j + k == GOAL:\\n if i**2 == j**2 + k**2:\\n print \\\"GOAL:\\\", (i, j, k)\",\n \"def main(n=20):\\n return functools.reduce(lcm, range(1, 20))\",\n \"def problem():\\n size = 1001\\n return sum(n**2 * 4 - 6 * n + 6 for n in range(3, size+1, 2)) + 1\",\n \"def no_math_solution(n: int):\\n lookup = {1: 1}\\n # Calculate the chain's length of all Collatz sequences started below n\\n for i in range(2, n):\\n cal_chain_length(i, lookup)\\n # Find the longest chain\\n longestChain = 1\\n for i in range(2, n):\\n if (lookup[i] > lookup[longestChain]):\\n longestChain = i\\n\\n return longestChain\",\n \"def landau2(n):\\n\\n factors = primish(n)\\n\\n # TODO: I have no idea here...\\n\\n #assert sum(factors) <= n\\n return product(factors)\",\n \"def minOperations(n):\\n if not n or n < 2:\\n return 0\\n\\n mov = 0\\n min_op = 2\\n while min_op <= n:\\n if n % min_op == 0:\\n mov += min_op\\n n = n // min_op\\n else:\\n min_op += 1\\n return mov\",\n \"def g(n):\\n \\\"*** YOUR CODE HERE ***\\\"\\n if n < 4:\\n return n\\n else:\\n return g(n-1) + 2*g(n-2) + 3*g(n-3)\",\n \"def landau1(n):\\n\\n i = 2\\n sum_factors = 1\\n factors = set()\\n\\n while i <= n: \\n common = {j for j in factors if gcd(j, i) != 1}\\n if len(common) == 0:\\n factors = add_factor(i, n, factors)\\n sum_factors = sum(factors)\\n elif product(common) <= i:\\n difference = factors.difference(common)\\n new_factors = add_factor(i, n, difference)\\n if product(new_factors) > product(factors):\\n factors = new_factors\\n sum_factors = sum(factors)\\n i += 1\\n\\n print(n, product(factors), factors)\\n return product(factors)\",\n \"def f_exact(n, k):\\n def fact(m):\\n return math.factorial(m)\\n\\n partition = part(n, k)\\n\\n total = 0\\n for p in partition:\\n product = 1\\n nodes_left = n\\n counts = dict([(x, len(list(y))) for x, y in itertools.groupby(p)])\\n for num in p:\\n product *= fact(num - 1) * comb(nodes_left, num)\\n nodes_left -= num\\n for num in counts:\\n product /= fact(counts[num])\\n\\n total += product\\n return int(total)\",\n \"def lucas_selfridge_test(n):\\n if isqrt(n) ** 2 == n:\\n return False\\n D = 5\\n while jacobi(D, n) != -1:\\n if D > 0:\\n D = -(D + 2)\\n else:\\n D = -(D - 2)\\n return lucas_strong_test(n, 1, (1 - D) // 4)\",\n \"def solve(n=10):\\n return sum(M_N_S(n, d)[2] for d in range(10))\",\n \"def J (self, n):\",\n \"def minOperations(n):\\n if type(n) is not int or n < 2:\\n return 0\\n\\n factor = []\\n i = 2\\n while i <= n:\\n if n % i == 0:\\n factor.append(i)\\n n = n / i\\n else:\\n i += 1\\n\\n return sum(factor)\",\n \"def main():\\n num_1 = 12\\n num_2 = 76\\n print(find_lcm(num_1, num_2))\",\n \"def solveMontyHall(num):\\n\\n\\t# the number that the first choice is the anwser\\n\\tNumFirst = 0\\n\\t# the number that the switched choice is the anwser\\n\\tNumSwitch = 0\\n\\n\\tfor i in xrange(num):\\n\\t\\t# Set randomly the index of the prize and first choice\\n\\t\\tprizeIndex = random.randint(0, 2)\\n\\t\\tfirstChoiceIndex = random.randint(0, 2)\\n\\n\\t\\t# insist on the first choice \\n\\t\\tif firstChoiceIndex == prizeIndex:\\n\\t\\t\\tNumFirst += 1\\n\\t\\telse: # failure\\n\\t\\t\\tpass\\n\\n\\t\\t# choose to switch \\n\\t\\tif firstChoiceIndex == prizeIndex:\\n\\t\\t\\tpass # failure\\n\\t\\telse: # means you get the right answer\\n\\t\\t\\tNumSwitch += 1\\n\\n\\treturn (NumFirst / float(num), NumSwitch / float(num))\",\n \"def g(n):\\n\\t\\\"*** YOUR CODE HERE ***\\\"\\n\\tif n <= 3:\\n\\t\\treturn n\\n\\telse:\\n\\t\\treturn g(n-1) + 2*g(n-2) + 3*g(n-3)\",\n \"def fn(n, k):\\n if k == 1: return n \\n if n == 0: return 0 \\n ans = inf \\n for x in range(1, n+1): \\n ans = min(ans, 1 + max(fn(x-1, k-1), fn(n-x, k)))\\n return ans\",\n \"def solution1(n):\\n res = []\\n while n > 0:\\n m = int(math.floor(math.sqrt(n))**2)\\n res.append(m)\\n n -= m\\n return res\",\n \"def compute(n):\\n if n == 1:\\n return 1\\n else:\\n i = find_i(n)\\n return 2 * compute(n - i) + 2 ** i - 1\",\n \"def part_2(rules: Rules) -> int:\\n\\n rules_with_myself = add_myself(rules)\\n happiness, _ = max(generate_arrangements(rules_with_myself))\\n print(f\\\"part 2: optimal arrangement (including myself) brings {happiness} happiness\\\")\\n return happiness\",\n \"def g(n):\\n \\\"*** YOUR CODE HERE ***\\\"\\n if n <= 3:\\n return n\\n else:\\n return g(n - 1) + 2 * g(n - 2) + 3 * g(n - 3)\",\n \"def g(n):\\n \\\"*** YOUR CODE HERE ***\\\"\\n if n <= 3:\\n return n\\n else:\\n return g(n - 1) + 2 * g(n - 2) + 3 * g(n - 3)\",\n \"def McNuggets(n): \\n def check(n):\\n if n%6==0 or n%9==0 or n%20==0:\\n return True\\n \\n def all(n):\\n for i in (6,9,20):\\n if (n-i)>0 and check(n-i):\\n return True\\n \\n while n>0:\\n #print n\\n if check(n):\\n return True \\n if all(n):\\n return True\\n if n>=20:\\n n-=20\\n elif n>=9:\\n n-=9\\n else:\\n n-=6\\n \\n #print n\\n \\n if n==0:\\n return True\\n else:\\n return False\",\n \"def min_operations(number):\\n\\n # Solution:\\n # 1. The number of steps to reach a target number = number of steps take to make the target number 0\\n # 2. We will be greedy, each time if it is possible we will try to make the number half\\n steps_count = 0\\n while number > 0:\\n # check if we can make the number half\\n if number % 2 == 0:\\n number = number / 2\\n else:\\n # number can't halved so we can only decrease it by 1\\n number -= 1\\n steps_count += 1\\n\\n return steps_count\",\n \"def main():\\n\\n import sys\\n sys.setrecursionlimit(10**7)\\n from itertools import accumulate, combinations, permutations, product # https://docs.python.org/ja/3/library/itertools.html\\n # accumulate() returns iterator! to get list: list(accumulate())\\n from math import factorial, ceil, floor\\n def factorize(n):\\n \\\"\\\"\\\"return the factors of the Arg and count of each factor\\n \\n Args:\\n n (long): number to be resolved into factors\\n \\n Returns:\\n list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]\\n \\\"\\\"\\\"\\n fct = [] # prime factor\\n b, e = 2, 0 # base, exponent\\n while b * b <= n:\\n while n % b == 0:\\n n = n // b\\n e = e + 1\\n if e > 0:\\n fct.append((b, e))\\n b, e = b + 1, 0\\n if n > 1:\\n fct.append((n, 1))\\n return fct\\n def combinations_count(n, r):\\n \\\"\\\"\\\"Return the number of selecting r pieces of items from n kinds of items.\\n \\n Args:\\n n (long): number\\n r (long): number\\n \\n Raises:\\n Exception: not defined when n or r is negative\\n \\n Returns:\\n long: number\\n \\\"\\\"\\\"\\n # TODO: How should I do when n - r is negative?\\n if n < 0 or r < 0:\\n raise Exception('combinations_count(n, r) not defined when n or r is negative')\\n if n - r < r: r = n - r\\n if r < 0: return 0\\n if r == 0: return 1\\n if r == 1: return n\\n numerator = [n - r + k + 1 for k in range(r)]\\n denominator = [k + 1 for k in range(r)]\\n for p in range(2,r+1):\\n pivot = denominator[p - 1]\\n if pivot > 1:\\n offset = (n - r) % p\\n for k in range(p-1,r,p):\\n numerator[k - offset] /= pivot\\n denominator[k] /= pivot\\n result = 1\\n for k in range(r):\\n if numerator[k] > 1:\\n result *= int(numerator[k])\\n return result\\n def combinations_with_replacement_count(n, r):\\n \\\"\\\"\\\"Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.\\n \\n Args:\\n n (long): number\\n r (long): number\\n \\n Raises:\\n Exception: not defined when n or r is negative\\n \\n Returns:\\n long: number\\n \\\"\\\"\\\"\\n if n < 0 or r < 0:\\n raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')\\n elif n == 0:\\n return 1\\n else:\\n return combinations_count(n + r - 1, r)\\n from bisect import bisect_left, bisect_right\\n from collections import deque, Counter, defaultdict # https://docs.python.org/ja/3/library/collections.html#collections.deque\\n from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest # https://docs.python.org/ja/3/library/heapq.html\\n from copy import deepcopy, copy # https://docs.python.org/ja/3/library/copy.html\\n from operator import itemgetter\\n # ex1: List.sort(key=itemgetter(1))\\n # ex2: sorted(tuples, key=itemgetter(1,2))\\n from functools import reduce\\n def chmin(x, y):\\n \\\"\\\"\\\"change minimum\\n if x > y, x = y and return (x, True).\\n convenient when solving problems of dp[i]\\n \\n Args:\\n x (long): current minimum value\\n y (long): potential minimum value\\n \\n Returns:\\n (x, bool): (x, True) when updated, else (x, False)\\n \\\"\\\"\\\"\\n if x > y:\\n x = y\\n return (x, True)\\n else:\\n return (x, False)\\n def chmax(x, y):\\n \\\"\\\"\\\"change maximum\\n if x < y, x = y and return (x, True).\\n convenient when solving problems of dp[i]\\n \\n Args:\\n x (long): current maximum value\\n y (long): potential maximum value\\n \\n Returns:\\n (x, bool): (x, True) when updated, else (x, False)\\n \\\"\\\"\\\"\\n if x < y:\\n x = y\\n return (x, True)\\n else:\\n return (x, False)\\n\\n from fractions import gcd # Deprecated since version 3.5: Use math.gcd() instead.\\n def gcds(numbers):\\n return reduce(gcd, numbers)\\n def lcm(x, y):\\n return (x * y) // gcd(x, y)\\n def lcms(numbers):\\n return reduce(lcm, numbers, 1)\\n\\n # first create factorial_list\\n # fac_list = mod_factorial_list(n)\\n INF = 10 ** 18\\n MOD = 10 ** 9 + 7\\n modpow = lambda a, n, p = MOD: pow(a, n, p) # Recursive function in python is slow!\\n def modinv(a, p = MOD):\\n # evaluate reciprocal using Fermat's little theorem:\\n # a**(p-1) is identical to 1 (mod p) when a and p is coprime\\n return modpow(a, p-2, p)\\n def modinv_list(n, p = MOD):\\n if n <= 1:\\n return [0,1][:n+1]\\n else:\\n inv_t = [0,1]\\n for i in range(2, n+1):\\n inv_t += [inv_t[p % i] * (p - int(p / i)) % p]\\n return inv_t\\n def modfactorial_list(n, p = MOD):\\n if n == 0:\\n return [1]\\n else:\\n l = [0] * (n+1)\\n tmp = 1\\n for i in range(1, n+1):\\n tmp = tmp * i % p\\n l[i] = tmp\\n return l\\n def modcomb(n, k, fac_list = [], p = MOD):\\n # fac_list = modfactorial_list(100)\\n # print(modcomb(100, 5, modfactorial_list(100)))\\n from math import factorial\\n if n < 0 or k < 0 or n < k: return 0\\n if n == 0 or k == 0: return 1\\n if len(fac_list) <= n:\\n a = factorial(n) % p\\n b = factorial(k) % p\\n c = factorial(n-k) % p\\n else:\\n a = fac_list[n]\\n b = fac_list[k]\\n c = fac_list[n-k]\\n return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p\\n def modadd(a, b, p = MOD):\\n return (a + b) % MOD\\n def modsub(a, b, p = MOD):\\n return (a - b) % p\\n def modmul(a, b, p = MOD):\\n return ((a % p) * (b % p)) % p\\n def moddiv(a, b, p = MOD):\\n return modmul(a, modpow(b, p-2, p))\\n\\n \\\"\\\"\\\" initialize variables and set inputs\\n # initialize variables\\n # to initialize list, use [0] * n\\n # to initialize two dimentional array, use [[0] * N for _ in range(N)]\\n # set inputs\\n # open(0).read() is a convenient method:\\n # ex) n, m, *x = map(int, open(0).read().split())\\n # min(x[::2]) - max(x[1::2])\\n # ex2) *x, = map(int, open(0).read().split())\\n # don't forget to add comma after *x if only one variable is used\\n # preprocessing\\n # transpose = [x for x in zip(*data)]\\n # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [(1, 4, 7), (2, 5, 8), (3, 6, 9)]\\n # flat = [flatten for inner in data for flatten in inner]\\n # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [1, 2, 3, 4, 5, 6, 7, 8, 9]\\n # calculate and output\\n # output pattern\\n # ex1) print(*l) => when l = [2, 5, 6], printed 2 5 6\\n \\\"\\\"\\\"\\n\\n # functions used\\n r = lambda: sys.stdin.readline().strip()\\n r_int = lambda: int(r())\\n R = lambda: list(map(int, r().split()))\\n Rfloat = lambda: list(map(float, r().split()))\\n Rtuple = lambda: tuple(map(int, r().split()))\\n Rmap = lambda: map(int, r().split())\\n\\n \\\"\\\"\\\" how to treat input\\n # single int: int(r())\\n # single string: r()\\n # single float: float(r())\\n # line int: R()\\n # line string: r().split()\\n # line (str, int, int): [j if i == 0 else int(j) for i, j in enumerate(r().split())]\\n # lines int: [R() for _ in range(n)]\\n \\\"\\\"\\\"\\n\\n # main\\n N, Q = R()\\n STX = [R() for _ in range(N)]\\n STX.sort(key=itemgetter(2))\\n\\n D = [int(r()) for _ in range(Q)]\\n Stopped = [-1] * Q\\n ans = [-1] * Q\\n\\n for s, t, x in STX:\\n l = bisect_left(D, s-x)\\n r = bisect_left(D,t-x)\\n a = l\\n while a < r:\\n if Stopped[a] == -1:\\n ans[a] = x\\n Stopped[a] = r\\n a += 1\\n else:\\n a = Stopped[a]\\n\\n for i in ans:\\n print(i)\\n\\n \\\"\\\"\\\"memo: how to use defaultdict of list\\n # initialize\\n Dic = defaultdict(list)\\n # append / extend\\n Dic[x].append(y)\\n # for\\n for k, v in Dic.items():\\n \\\"\\\"\\\"\",\n \"def solution(N, K):\\n\\n # not really sure what to return if N=1, it should be invalid?\\n rounds = N - 1\\n next_num = N\\n while K > 0 and next_num >= 4:\\n next_num = next_num - next_num % 2\\n next_num = next_num // 2\\n rounds -= (next_num - 1)\\n K -= 1\\n return rounds\",\n \"def goldbach(number):\\n for p in primes:\\n if p > number:\\n return None\\n squared = sqrt( (number - p) / 2)\\n if int(squared) == squared:\\n return p, int(squared)\",\n \"def chosse(n,k):\\n import math \\n if (n>=k and k>=0):\\n return math.factorial(n) / (math.factorial(k) * math.factorial(n-k))\\n else:\\n return \\\"No se puede calcular el numero factorial indicado\\\"\",\n \"def problem():\\n\\n print 'problem #27'\\n\\n l = 0\\n m_a = 0\\n m_b = 0\\n for a in xrange(-1000, 1000):\\n for b in xrange(-1000, 1000):\\n p = len(check(a, b))\\n if p > l:\\n l = p\\n m_a = a\\n m_b = b\\n\\n print 'the product of coefficients is %s' % (m_a * m_b)\",\n \"def perfect_power(n: int):\\n k = 2\\n max_k = round(n ** (1/2))\\n while True:\\n m = round(n ** (1/k))\\n if m ** k == n:\\n return [m, k]\\n elif k > max_k:\\n return None\\n else:\\n k += 1\",\n \"def Problem4(n):\\n A = Problem2(n)\\n eig = min(sl.eigs(A.asfptype(), which='SM')[0])\\n \\n print \\\"lamba*n^2 approaches pi^2 as n goes to infinity\\\"\\n return eig*n**2\",\n \"def prove_NN() -> Proof:\\n # Optional Task 6.7c\",\n \"def exercise3(self):\\n print \\\"The next line should read '1000000'\\\"\\n print self.smallest_number(7)\",\n \"def detectMiss(n, k):\\n k -= 1\\n nlog = math.ceil(math.log(n,2))\\n nloglessone = nlog - 1\\n lower_base = 2**nloglessone - 1\\n lowerbaseBack = lower_base\\n diff_list = [2**i for i in range(nloglessone-1, 0, -1)]\\n diff_lit_back = diff_list[1:-1]\\n if lower_base == k and 2**nlog -1 == n:\\n return(k)\\n matchres = False\\n while(lower_base <= k and len(diff_list)>0 ):\\n if lower_base == k:\\n matchres = True\\n break\\n else:\\n addVal = diff_list[0]\\n lower_base += addVal\\n diff_list.remove(addVal)\\n if matchres:\\n k -= 1\\n if k%2==0:\\n return(k)\\n else:\\n while(len(diff_lit_back)>0 and lowerbaseBack<k):\\n newAddVal = diff_lit_back[0]\\n lowerbaseBack = lowerbaseBack+newAddVal\\n postitionIndx = lowerbaseBack + newAddVal\\n if lowerbaseBack == k and postitionIndx <= n:\\n return(k)\\n elif lowerbaseBack == k and postitionIndx > n:\\n return(k-1)\\n else:\\n pass\\n diff_lit_back.remove(newAddVal)\\n\\n return(k)\",\n \"def Pollard_pm1(n, primes, max_B=1000000):\\n B = 10\\n g = 1\\n while B < max_B and g < n:\\n a = randint(2, n - 2)\\n g = gcd(a, n)\\n if g != 1:\\n return g\\n for p in primes:\\n if p >= B:\\n break\\n pd = 1 # p^d\\n while pd * p <= B:\\n pd *= p\\n a = powmod(a, pd, n)\\n g = gcd(a - 1, n)\\n if g != 1 and g != n:\\n return g\\n B *= 2\\n return 1\",\n \"def ramanujan_hardy_asymptotic(n):\\n if(n != int(n)):\\n raise ValueError(\\n \\\"n must be integer\\\"\\n )\\n \\n return int((1/(4*n*math.sqrt(3)))*math.exp(math.sqrt(2*n/3)))\",\n \"def _n_choose_2(n):\\n return (n * (n - 1)) // 2\",\n \"def solution2(n):\\n if n == 0:\\n return []\\n m = int(math.floor(math.sqrt(n))**2)\\n return [m] + solution2(n - m)\",\n \"def solution(resources, args):\\n largest_prime_factor = 1\\n number = args.number\\n prime_generator = primes.get_prime_generator()\\n\\n while number > 1:\\n prime = next(prime_generator)\\n if number % prime == 0:\\n number /= prime\\n largest_prime_factor = prime\\n\\n if largest_prime_factor == 1:\\n largest_prime_factor = args.number\\n\\n return largest_prime_factor\",\n \"def miller_rabin_base_2(n):\\n d = n-1\\n s = 0\\n while not d & 1: # Check for divisibility by 2\\n d = d >> 1 # Divide by 2 using a binary right shift\\n s += 1\\n\\n x = pow(2, d, n)\\n if x == 1 or x == n-1:\\n return True\\n for i in range(s-1):\\n x = pow(x, 2, n)\\n if x == 1:\\n return False\\n elif x == n - 1:\\n return True\\n return False\",\n \"def McNuggets(n):\\n # Your Code Here\\n\\n for a in range(0, n/6+1):\\n for b in range(0, n/9+1):\\n for c in range(0, n/20+1):\\n if 6*a+9*b+20*c == n:\\n return True\\n return False\",\n \"def miller_rabin_base_2(n):\\n d, s = n - 1, 0\\n while not d & 1:\\n d, s = d >> 1, s + 1\\n\\n x = pow(2, d, n)\\n if (x == 1) or (x == n - 1):\\n return True\\n\\n for i in range(s - 1):\\n x = pow(x, 2, n)\\n if x == 1:\\n return False\\n elif x == n - 1:\\n return True\\n\\n return False\",\n \"def choose(n, k):\\n ans, k = 1, min(k, n-k)\\n for i in range(k):\\n ans *= n-i\\n ans //= i+1\\n return ans\",\n \"def rabin_miller(n, target=128):\\n ###############\\n ## Start your code here\\n return True\\n ## End of your code\\n ###############\",\n \"def dfs(x):\\n if x <= n:\\n ans.append(x)\\n for xx in range(10): dfs(10*x + xx)\",\n \"def McNuggets(n):\\n \\n '''if n == 0:\\n return True\\n for i in (6, 9, 20):\\n if n >= i and McNuggets(n - i):\\n return True\\n return False\\n '''\\n \\n for a in range(0,n):\\n for b in range(0,n):\\n for c in range(0,n):\\n if 6*a+9*b+20*c == n:\\n return True\\n return False\",\n \"def primitive_root(n):\\n if n == 2:\\n return 1\\n phi = euler_phi(n)\\n phi_divisors = factorize(phi)\\n for g in range(2, n + 1):\\n if gcd(g, n) != 1:\\n continue\\n for d, _ in phi_divisors:\\n if powmod(g, phi // d, n) == 1:\\n # g can not be a generator\\n break\\n else:\\n return g\\n\\n # generator not found\\n # Gauss theorem conditions did not met\\n return None\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6351067","0.6322759","0.62906826","0.6278602","0.6233129","0.62023616","0.6182629","0.6170508","0.61595374","0.6153705","0.6142571","0.6103457","0.6080529","0.60778254","0.6067927","0.6057732","0.60488695","0.60452557","0.60165286","0.60158545","0.6010093","0.6008591","0.6004157","0.60036445","0.5997799","0.59959185","0.59931946","0.5980503","0.5972461","0.59679466","0.59678286","0.59583956","0.59491897","0.59477544","0.5943179","0.59394205","0.59346694","0.59244573","0.59160167","0.5913519","0.59122527","0.5906058","0.5904918","0.5901727","0.58954275","0.5891677","0.5886922","0.5881227","0.58791965","0.586876","0.58660054","0.5855343","0.5850648","0.58479017","0.58404946","0.5833851","0.5832978","0.5832872","0.58276427","0.5826777","0.582544","0.5822727","0.5811863","0.58070445","0.5797882","0.5794465","0.57932216","0.579129","0.5788559","0.57815665","0.5777866","0.5777555","0.57745785","0.5770098","0.5768677","0.5768677","0.57686234","0.57665575","0.575807","0.5750701","0.57480973","0.57479024","0.5746887","0.57342416","0.5734194","0.5731481","0.5727873","0.57262707","0.57261014","0.5724288","0.5714509","0.571318","0.57128876","0.57121366","0.57069427","0.57062054","0.5703041","0.57022315","0.57006747","0.56996757","0.5698869"],"string":"[\n \"0.6351067\",\n \"0.6322759\",\n \"0.62906826\",\n \"0.6278602\",\n \"0.6233129\",\n \"0.62023616\",\n \"0.6182629\",\n \"0.6170508\",\n \"0.61595374\",\n \"0.6153705\",\n \"0.6142571\",\n \"0.6103457\",\n \"0.6080529\",\n \"0.60778254\",\n \"0.6067927\",\n \"0.6057732\",\n \"0.60488695\",\n \"0.60452557\",\n \"0.60165286\",\n \"0.60158545\",\n \"0.6010093\",\n \"0.6008591\",\n \"0.6004157\",\n \"0.60036445\",\n \"0.5997799\",\n \"0.59959185\",\n \"0.59931946\",\n \"0.5980503\",\n \"0.5972461\",\n \"0.59679466\",\n \"0.59678286\",\n \"0.59583956\",\n \"0.59491897\",\n \"0.59477544\",\n \"0.5943179\",\n \"0.59394205\",\n \"0.59346694\",\n \"0.59244573\",\n \"0.59160167\",\n \"0.5913519\",\n \"0.59122527\",\n \"0.5906058\",\n \"0.5904918\",\n \"0.5901727\",\n \"0.58954275\",\n \"0.5891677\",\n \"0.5886922\",\n \"0.5881227\",\n \"0.58791965\",\n \"0.586876\",\n \"0.58660054\",\n \"0.5855343\",\n \"0.5850648\",\n \"0.58479017\",\n \"0.58404946\",\n \"0.5833851\",\n \"0.5832978\",\n \"0.5832872\",\n \"0.58276427\",\n \"0.5826777\",\n \"0.582544\",\n \"0.5822727\",\n \"0.5811863\",\n \"0.58070445\",\n \"0.5797882\",\n \"0.5794465\",\n \"0.57932216\",\n \"0.579129\",\n \"0.5788559\",\n \"0.57815665\",\n \"0.5777866\",\n \"0.5777555\",\n \"0.57745785\",\n \"0.5770098\",\n \"0.5768677\",\n \"0.5768677\",\n \"0.57686234\",\n \"0.57665575\",\n \"0.575807\",\n \"0.5750701\",\n \"0.57480973\",\n \"0.57479024\",\n \"0.5746887\",\n \"0.57342416\",\n \"0.5734194\",\n \"0.5731481\",\n \"0.5727873\",\n \"0.57262707\",\n \"0.57261014\",\n \"0.5724288\",\n \"0.5714509\",\n \"0.571318\",\n \"0.57128876\",\n \"0.57121366\",\n \"0.57069427\",\n \"0.57062054\",\n \"0.5703041\",\n \"0.57022315\",\n \"0.57006747\",\n \"0.56996757\",\n \"0.5698869\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":11390,"cells":{"query":{"kind":"string","value":"Testing task 331a class main logic ( must return the sum of 3 integers in power 2, that is equal to n)"},"document":{"kind":"string","value":"def test_task331a_main_logic(number, expected_value):\r\n assert algo.Task331a.main_logic(number) == expected_value"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["def sum_of_three_squares(n):\n special = {1:(1, 0, 0), 2:(1, 1, 0), 3:(1, 1, 1), 10: (1, 3, 0), 34: (3, 3, 4), 58:(3, 7, 0),\n 85:(6, 7, 0), 130:(3, 11, 0), 214:(3, 6, 13), 226:(8, 9, 9), 370:(8, 9, 15),\n 526:(6, 7, 21), 706:(15, 15, 16), 730:(1, 27, 0), 1414:(6, 17, 33), 1906:(13, 21, 36),\n 2986: (21, 32, 39), 9634: (56, 57, 57)}\n\n v = 0\n\n if n == 0:\n return (0, 0, 0)\n\n v = multiplicity(4, n)\n n //= 4**v\n\n if n % 8 == 7:\n return\n\n if n in special.keys():\n x, y, z = special[n]\n return _sorted_tuple(2**v*x, 2**v*y, 2**v*z)\n\n s, _exact = integer_nthroot(n, 2)\n\n if _exact:\n return (2**v*s, 0, 0)\n\n x = None\n\n if n % 8 == 3:\n s = s if _odd(s) else s - 1\n\n for x in range(s, -1, -2):\n N = (n - x**2) // 2\n if isprime(N):\n y, z = prime_as_sum_of_two_squares(N)\n return _sorted_tuple(2**v*x, 2**v*(y + z), 2**v*abs(y - z))\n return\n\n if n % 8 in (2, 6):\n s = s if _odd(s) else s - 1\n else:\n s = s - 1 if _odd(s) else s\n\n for x in range(s, -1, -2):\n N = n - x**2\n if isprime(N):\n y, z = prime_as_sum_of_two_squares(N)\n return _sorted_tuple(2**v*x, 2**v*y, 2**v*z)","def exercise2():\n # You _DO_NOT_ need to modify this code for Lab 10.\n n = easygui.integerbox( \"Enter n:\", \"Input\", lowerbound=0, upperbound=2 ** 31 )\n\n s = summation( n, 1 )\n f = n * ( n + 1 ) // 2\n easygui.msgbox( \"n = {}, summation( n, 1 ) = {}, formula result = {}\".format( n, s, f ) )\n\n s = summation( n, 2 )\n f = n * ( n + 1 ) * ( 2 * n + 1 ) // 6\n easygui.msgbox( \"n = {}, summation( n, 2 ) = {}, formula result = {}\".format( n, s, f ) )\n\n s = summation( n, 3 )\n f = ( n * ( n + 1 ) // 2 ) ** 2\n easygui.msgbox( \"n = {}, summation( n, 3 ) = {}, formula result = {}\".format( n, s, f ) )","def solution(nums):\n solution = Solution()\n output = solution.threeSum(nums)\n\n print(output)","def problem():\n size = 1001\n return sum(n**2 * 4 - 6 * n + 6 for n in range(3, size+1, 2)) + 1","def solve(n=4 * 10**6):\r\n target_sum = 0\r\n fib_sequence = fibonacci_generator()\r\n for num in fib_sequence:\r\n if num >= n:\r\n break\r\n\r\n if num % 2 == 0:\r\n target_sum += num\r\n\r\n return target_sum","def problem1():\n return sum(i for i in range(1000) if i % 3 == 0 or i % 5 == 0)","def multiples_sum_3_5(n):\n\tsum = 0\n\tfor x in range(1,n):\n\t\tif (x%3==0) or (x%5==0):\n\t\t\tsum += x\n\treturn sum","def problem9_naive(n):\n for a in range(4, n, 4):\n for b in range(3, n - a):\n c = n - a - b\n if a ** 2 + b ** 2 == c ** 2:\n return a * b * c\n return None","def compute(n):\n if n == 1:\n return 1\n else:\n i = find_i(n)\n return 2 * compute(n - i) + 2 ** i - 1","def totalSolutions(n:int):\n\n memo = [0]*6\n memo[5] = 1\n if n == 1:\n return 1\n\n for i in range(n):\n solutions = sum(memo)\n memo.pop(0)\n memo.append(solutions)\n\n return memo.pop()","def solution(n):\n i = 1\n j = 2\n sum = 0\n while j <= n:\n if j % 2 == 0:\n sum += j\n i, j = j, i + j\n\n return sum","def minOperations(n):\n if type(n) is not int or n < 2:\n return 0\n\n summation = []\n\n while n % 2 == 0:\n summation.append(2)\n n = n // 2\n\n for i in range(3, n + 1, 2):\n while n % i == 0:\n summation.append(i)\n n = n // i\n\n return (sum(summation))","def solution3(n):\n res = []\n while n > 0:\n m = int(math.sqrt(n))**2\n res.append(m)\n n -= m\n return res","def sumTo(n):\n\n sum_all = (n * (n+1))/2\n\n return sum_all","def problem(args:int) -> int:\r\n\ta, b, c = 1, 2, 0\r\n\tresult = [a]\r\n\twhile c <= args:\r\n\t\tc = a + b\r\n\t\ta = b\r\n\t\tb = c\r\n\t\tresult.append(a)\r\n\tresult = np.array(result)\r\n\treturn sum(result[result % 2 == 0])","def solution(n: int = 28123) -> int:\n\n nums = range(1, n+1)\n abundant = list(filter(is_abundant, nums))\n abundant_sums = set(all_sums(abundant, n))\n fit = set(nums) - abundant_sums\n return fit","def sol(n):\n p = 1\n res = 0\n \n while n:\n p*=5\n if n&1:\n res+=p\n n=n>>1\n return res%1000000007","def square_of_sum(n):\n return ((n * (n+1)) / 2)**2","def sum_of_squares(n):\n return (n * (n+1) * (2*n + 1)) / 6","def summation_i_squared(n):\n if (type(n) is not int) or (n is None) or (n < 1):\n return None\n else:\n numbers = range(1, n + 1)\n result = 0\n result = map(lambda i: i ** 2, numbers)\n return sum(result)","def problem2(m, p):\n total = 0\n for k in range(m, m ** p):\n if is_prime(k):\n total = total + sum_of_digits(k)\n return total","def summation( n, exponent ):\n result = 0\n num = 1\n while num < n + 1:\n result += num ** exponent\n num += 1\n return result","def test_hackerrank_sample2(self):\n result = find_digits(1012)\n self.assertEquals(result, 3)","def sum_of_squares(n):\n result = i = 0\n while i < n:\n result += i\n i += 1\n return result","def solution(resources, args):\n retval = 0\n repeats = [3, 5, 6, 9, 10, 12, 15]\n\n i = 0\n n = args.number - 1\n\n while n > 15:\n retval += sum(repeats)\n retval += 15*len(repeats)*i\n n -= 15\n i += 1\n while n >= 3:\n if n % 3 == 0 or n % 5 == 0:\n retval += 15*i + n\n n -= 1\n return retval","def test_sum_pos_3() -> None:\n # 2nd step - 3rd square\n assert nth(sw.sum_walk(), 1) == 2","def product_of_n():\n try:\n input_value = int(input(\"Enter value for n: \"))\n except:\n return None\n \n sum_int = 1\n \n try:\n for number in range(1, input_value+1):\n sum_int *= number\n \n print(\"The result is:\", sum_int)\n return None\n except:\n return None","def main(n):\n return sum(f(i) for i in xrange(n))","def test_bigSum():\n\n assert bigSum() == 20000000100000000","def total(n):\n if n < 0:\n return None\n else:\n result = 0\n for i in range(n + 1):\n result += i\n return result","def total(n):\n if n < 0:\n return None\n else:\n result = 0\n for i in range(n + 1):\n result += i\n return result","def problem9_fast(n):\n n2 = n // 2\n ulimit = ceil(sqrt(n2)) - 1\n for u in range(2, ulimit):\n if n2 % u == 0:\n nu = n2 // u\n while nu % 2 == 0:\n nu //= 2\n if u % 2 == 1:\n k = u + 2\n else:\n k = u + 1\n while k < 2 * u and k <= nu:\n if nu % k == 0 and pe_utils.gcd(k, u) == 1:\n d = n2 // (k * u)\n v = k - u\n a = (u ** 2 - v ** 2) * d\n b = 2 * u * v * d\n c = (u ** 2 + v ** 2) * d\n return a * b * c\n k += 2\n return None","def no_math_solution(n: int):\n # After 2 (the second fibonacci number), every third number is even\n if(n < 2):\n return 0\n fibs = [2, 3, 5]\n sum = 0\n while(fibs[0] <= n):\n sum += fibs[0]\n fibs[0] = fibs[1] + fibs[2]\n fibs[1] = fibs[0] + fibs[2]\n fibs[2] = fibs[0] + fibs[1]\n return sum","def solve(n=10):\n return sum(M_N_S(n, d)[2] for d in range(10))","def solve():\n sum_of_squares = 0\n for i in range(1, 101):\n sum_of_squares += i * i\n square_of_sum = sum(range(1, 101)) ** 2\n return square_of_sum - sum_of_squares","def six():\r\n \r\n sum_squared = 0\r\n squared_sum = 0\r\n \r\n for i in range(1, 101):\r\n sum_squared += i**2\r\n squared_sum += i\r\n squared_sum = squared_sum**2\r\n \r\n return squared_sum - sum_squared","def solution(number):\n\n # a is a list with all the numbers below input that are multiples of 3 or 5\n a = [x for x in range(1,number) if x % 3 == 0 or x % 5 == 0]\n return sum(a)","def row_sum_odd_numbers(n):\n return n**3","def problem001():\n\n sum = 0\n for i in range(199):\n i += 1\n if i % 3 == 0:\n continue\n sum += i*5;\n for i in range(333):\n i += 1\n sum += i*3\n print sum\n\n sum = 0\n for i in range(999):\n i += 1\n if (i % 3 == 0 or i % 5 == 0):\n sum += i\n print sum\n\n print reduce(lambda x,y: x+y, filter(lambda n: n%3==0 or n%5==0, range(1000)))\n #arithmetic progressions\n #http://en.wikipedia.org/wiki/Arithmetic_progression\n x = 1000;\n print 1.5*(int)((x-1)/3)*(int)((x+2)/3) + 2.5*(int)((x-1)/5)*(int)((x+4)/5) - 7.5*(int)((x-1)/15)*(int)((x+14)/15);","def get_total_complexity(n):\n total = 0\n for i in range(1, n + 1):\n total += get_complexity(i)\n return total","def test_getSum_twoNumbers(self):\r\n self.assertEqual(17, Arith().add(8, 9))","def solution(n: int = 2000000) -> int:\n\n return sum(takewhile(lambda x: x < n, prime_generator()))","def two_of_three(a, b, c):\n \"*** YOUR CODE HERE ***\"\n return pow(a, 2) + pow(b,2) + pow(c,2) - pow(min(a,b,c),2)","def sum_of_squares(n):\n sum = 0\n\n for i in range(0,n):\n sum += i*i\n\n return sum","def triangular_number_solution():\n return 5 * partial_sum(199) + 3 * partial_sum(333) - 15 * partial_sum(66)","def fakultet (n = 1):\n sum = 1\n for i in range(n, 1, -1):\n sum *= i\n return sum","def sum_multiples(num):\n pass","def totient(n: int) -> int:\n if SHOW_WORKING: print(f\"totient({n})\")\n print(f\"\\ttotient(n) = p1^(e1 - 1) * (p1 - 1) * p2^(e2 - 1) * (p2 - 1) * ... * pk^(ek - 1) * (pk - 1)\")\n\n result: int = 1\n \n working_str1: str = ''\n working_str2: str = ''\n working_str3: str = ''\n working_str4: str = ''\n\n n_prime_factors: Dict[int, int] = prime_factors(n)\n\n for p, e in n_prime_factors.items():\n result *= p ** (e - 1) * (p - 1)\n working_str1 += f\"{p}^({e} - 1) * ({p} - 1) * \"\n working_str2 += f\"{p}^{e - 1} * {p - 1} * \"\n working_str3 += f\"{p ** (e - 1)} * {p - 1} * \"\n working_str4 += f\"{p ** (e - 1) * (p - 1)} * \"\n \n working_str1 = working_str1[:-2]\n working_str2 = working_str2[:-2]\n working_str3 = working_str3[:-2]\n working_str4 = working_str4[:-2]\n\n n_prime_factorisation: str = ' * '.join([str(p) + '^' + str(e) for p, e in n_prime_factors.items()])\n\n if SHOW_WORKING: print(f\"\\n\\ttotient({n}) = totient({n_prime_factorisation}) \\n\\t\\t= {working_str1} \\n\\t\\t= {working_str2} \\n\\t\\t= {working_str3} \\n\\t\\t= {working_str4} \\n\\t\\t= {result}\")\n\n return result","def solveProblem021():\n total = 0\n for i in range(2, 10000):\n divs = getProperDivisors(i)\n s = sum(divs)\n # Skip stuff greater than, we'll get to it later if it's less than max.\n if s > i:\n continue\n if s == i:\n continue\n t = sum(getProperDivisors(s))\n if t == i:\n total = total + i + s\n print(\"The Sum is: %d\" % (total,))","def test_sum(n, m, o, result):\n from series import sum_series\n assert sum_series(n, m, o) == result","def Z(n):\n count5 = 0\n i = 1\n while 1:\n a = pow(5, i)\n if a > n:\n return count5\n else:\n count5 += n/a\n i += 1","def fn(n):\n if n == 0: return 1\n return sum(fn(i)*fn(n-i-1) for i in range(n))","def sum_of_nth( n ):\n if n > 0:\n return sum( range(n + 1) )\n else:\n return 0","def sum_evens( n ):\n result = 0\n num = 0\n while num < n + 1:\n result += num\n num += 2\n return result","def sat(n: int):\n return pow(2, n, n) == 3","def method1():\n n = 1000\n s = 0 \n\n for i in range(n):\n if i%3 == 0:\n s += i\n elif i%5 == 0:\n s += i\n\n return s","def power(x, m, n):\n a = 1\n while m > 0:\n if m % 2 == 1:\n a=(a*x)%n\n x=(x*x)%n\n m//=2\n return a","def test_hackerrank_sample1(self):\n result = find_digits(12)\n self.assertEquals(result, 2)","def aks( n ):\n\n def aks_mod( polynomial , r ):\n \"\"\"\n This function is used in aks.\n polynomial modulo ( x^r - 1 )\n \"\"\"\n aks_mod = polynomial.coefficients\n total = aks_mod[ : r ]\n aks_mod = aks_mod[ r : ]\n while len(aks_mod) - 1 >= r :\n for i in range(r):\n total[i] += aks_mod[i]\n aks_mod = aks_mod[ r : ]\n for i in range(len(aks_mod)):\n total[i] += aks_mod[i]\n return array_poly_mod( total , polynomial.mod )\n\n lg = math.log( n , 2 )\n k = int( lg * lg )\n\n if arith1.powerDetection( n )[ 1 ] != 1: #Power Detection\n print(\" n is not prime \")\n return False\n\n start = 3\n while 1:\n d = arith1.gcd.gcd( start , n )\n if 1 < d < n:\n print(\"n is not prime\")\n return False\n x = n % start\n N = x\n for i in range( 1 , k + 1 ):\n if N == 1:\n break\n N = ( N * x ) % start\n if i == k:\n r = start\n break\n start += 1\n d = arith1.gcd.gcd( r , n )\n if 1 < d < n:\n print(\" n is not prime \")\n return False\n if n <= r:\n print(\" n is prime \")\n return True\n\n e = multiplicative.euler( r ) #Cyclotomic Conguence\n e = math.sqrt( e )\n e = int( e * lg )\n for b in range( 1 , e+1 ):\n f = array_poly_mod( [ b , 1 ] , n )\n total = array_poly_mod( [ 1 ] , n )\n count = n\n while count > 0:\n if count & 1:\n total = total * f\n total = aks_mod( total , r )\n f = f.power()\n f = aks_mod( f , r )\n count = count >> 1\n total_poly = total.coefficients_to_dict()\n if total_poly != { 0 : b , n % r : 1 }:\n print(\" n is not prime \")\n return False\n print(\" n is prime \")\n return True","def question_30(x: int) -> int:\n # Base case below:\n if x == 0:\n return 1\n # Recursive function below:\n else:\n result = 1\n while x > 0:\n for i in range(x):\n result *= 2 ** question_30(i)\n x -= 1\n return result","def solve() -> int:\n\n return sum(1 for n in range(1, 10_000) if is_lychrel(n))","def main():\n result = 0\n for n in range(1, 1001):\n result += n**n\n\n result = str(result)\n answer = result[len(result)-10::]\n\n print \"answer: \" + answer","def problem():\n for a in range(1, 380):\n for b in range(a):\n if a + b + (a**2 + b**2)**0.5 == 1000:\n return int(a * b * (a**2 + b**2)**0.5)","def power(x, n):\n power = 1\n for i in range(abs(n)):\n power = multiply(power, x) \n return power","def f_exact(n, k):\n def fact(m):\n return math.factorial(m)\n\n partition = part(n, k)\n\n total = 0\n for p in partition:\n product = 1\n nodes_left = n\n counts = dict([(x, len(list(y))) for x, y in itertools.groupby(p)])\n for num in p:\n product *= fact(num - 1) * comb(nodes_left, num)\n nodes_left -= num\n for num in counts:\n product /= fact(counts[num])\n\n total += product\n return int(total)","def ramanujan_hardy_asymptotic(n):\n if(n != int(n)):\n raise ValueError(\n \"n must be integer\"\n )\n \n return int((1/(4*n*math.sqrt(3)))*math.exp(math.sqrt(2*n/3)))","def fact(n):\n answer = 1\n while n > 1:\n answer *= n\n n -= 1\n return answer","def solve(n=1000):\r\n return str(sum(x**x for x in range(1, n + 1)))[-10:]","def sum_of_squares(n, k, zeros=False):\n yield from power_representation(n, 2, k, zeros)","def f(z):\n if abs(z) > 2:\n return 1\n else:\n n = 1\n while abs(z) < 2:\n n += 1\n if n > 100:\n return 0\n else:\n z = z**2 + c\n return n","def eulerTotient(n): #\n result = 1\n for i in range(2, n): \n if (nt.gcd(i, n) == 1): \n result+=1\n return result","def _power(self, a, n, m):\n res = 1\n while n != 0:\n if n % 2 != 0:\n res *= a\n res %= m\n n -= 1\n else:\n a *= a\n a %= m\n n //= 2\n return res","def square(n: int) -> int:\n return int(n ** 2)","def main():\n\n import sys\n sys.setrecursionlimit(10**7)\n from itertools import accumulate, combinations, permutations, product # https://docs.python.org/ja/3/library/itertools.html\n # accumulate() returns iterator! to get list: list(accumulate())\n from math import factorial, ceil, floor\n def factorize(n):\n \"\"\"return the factors of the Arg and count of each factor\n \n Args:\n n (long): number to be resolved into factors\n \n Returns:\n list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]\n \"\"\"\n fct = [] # prime factor\n b, e = 2, 0 # base, exponent\n while b * b <= n:\n while n % b == 0:\n n = n // b\n e = e + 1\n if e > 0:\n fct.append((b, e))\n b, e = b + 1, 0\n if n > 1:\n fct.append((n, 1))\n return fct\n def combinations_count(n, r):\n \"\"\"Return the number of selecting r pieces of items from n kinds of items.\n \n Args:\n n (long): number\n r (long): number\n \n Raises:\n Exception: not defined when n or r is negative\n \n Returns:\n long: number\n \"\"\"\n # TODO: How should I do when n - r is negative?\n if n < 0 or r < 0:\n raise Exception('combinations_count(n, r) not defined when n or r is negative')\n if n - r < r: r = n - r\n if r < 0: return 0\n if r == 0: return 1\n if r == 1: return n\n numerator = [n - r + k + 1 for k in range(r)]\n denominator = [k + 1 for k in range(r)]\n for p in range(2,r+1):\n pivot = denominator[p - 1]\n if pivot > 1:\n offset = (n - r) % p\n for k in range(p-1,r,p):\n numerator[k - offset] /= pivot\n denominator[k] /= pivot\n result = 1\n for k in range(r):\n if numerator[k] > 1:\n result *= int(numerator[k])\n return result\n def combinations_with_replacement_count(n, r):\n \"\"\"Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.\n \n Args:\n n (long): number\n r (long): number\n \n Raises:\n Exception: not defined when n or r is negative\n \n Returns:\n long: number\n \"\"\"\n if n < 0 or r < 0:\n raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')\n elif n == 0:\n return 1\n else:\n return combinations_count(n + r - 1, r)\n from bisect import bisect_left, bisect_right\n from collections import deque, Counter, defaultdict # https://docs.python.org/ja/3/library/collections.html#collections.deque\n from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest # https://docs.python.org/ja/3/library/heapq.html\n from copy import deepcopy, copy # https://docs.python.org/ja/3/library/copy.html\n from operator import itemgetter\n # ex1: List.sort(key=itemgetter(1))\n # ex2: sorted(tuples, key=itemgetter(1,2))\n from functools import reduce\n def chmin(x, y):\n \"\"\"change minimum\n if x > y, x = y and return (x, True).\n convenient when solving problems of dp[i]\n \n Args:\n x (long): current minimum value\n y (long): potential minimum value\n \n Returns:\n (x, bool): (x, True) when updated, else (x, False)\n \"\"\"\n if x > y:\n x = y\n return (x, True)\n else:\n return (x, False)\n def chmax(x, y):\n \"\"\"change maximum\n if x < y, x = y and return (x, True).\n convenient when solving problems of dp[i]\n \n Args:\n x (long): current maximum value\n y (long): potential maximum value\n \n Returns:\n (x, bool): (x, True) when updated, else (x, False)\n \"\"\"\n if x < y:\n x = y\n return (x, True)\n else:\n return (x, False)\n\n from fractions import gcd # Deprecated since version 3.5: Use math.gcd() instead.\n def gcds(numbers):\n return reduce(gcd, numbers)\n def lcm(x, y):\n return (x * y) // gcd(x, y)\n def lcms(numbers):\n return reduce(lcm, numbers, 1)\n\n # first create factorial_list\n # fac_list = mod_factorial_list(n)\n INF = 10 ** 18\n MOD = 10 ** 9 + 7\n modpow = lambda a, n, p = MOD: pow(a, n, p) # Recursive function in python is slow!\n def modinv(a, p = MOD):\n # evaluate reciprocal using Fermat's little theorem:\n # a**(p-1) is identical to 1 (mod p) when a and p is coprime\n return modpow(a, p-2, p)\n def modinv_list(n, p = MOD):\n if n <= 1:\n return [0,1][:n+1]\n else:\n inv_t = [0,1]\n for i in range(2, n+1):\n inv_t += [inv_t[p % i] * (p - int(p / i)) % p]\n return inv_t\n def modfactorial_list(n, p = MOD):\n if n == 0:\n return [1]\n else:\n l = [0] * (n+1)\n tmp = 1\n for i in range(1, n+1):\n tmp = tmp * i % p\n l[i] = tmp\n return l\n def modcomb(n, k, fac_list = [], p = MOD):\n # fac_list = modfactorial_list(100)\n # print(modcomb(100, 5, modfactorial_list(100)))\n from math import factorial\n if n < 0 or k < 0 or n < k: return 0\n if n == 0 or k == 0: return 1\n if len(fac_list) <= n:\n a = factorial(n) % p\n b = factorial(k) % p\n c = factorial(n-k) % p\n else:\n a = fac_list[n]\n b = fac_list[k]\n c = fac_list[n-k]\n return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p\n def modadd(a, b, p = MOD):\n return (a + b) % MOD\n def modsub(a, b, p = MOD):\n return (a - b) % p\n def modmul(a, b, p = MOD):\n return ((a % p) * (b % p)) % p\n def moddiv(a, b, p = MOD):\n return modmul(a, modpow(b, p-2, p))\n\n \"\"\" initialize variables and set inputs\n # initialize variables\n # to initialize list, use [0] * n\n # to initialize two dimentional array, use [[0] * N for _ in range(N)]\n # set inputs\n # open(0).read() is a convenient method:\n # ex) n, m, *x = map(int, open(0).read().split())\n # min(x[::2]) - max(x[1::2])\n # ex2) *x, = map(int, open(0).read().split())\n # don't forget to add comma after *x if only one variable is used\n # preprocessing\n # transpose = [x for x in zip(*data)]\n # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [(1, 4, 7), (2, 5, 8), (3, 6, 9)]\n # flat = [flatten for inner in data for flatten in inner]\n # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [1, 2, 3, 4, 5, 6, 7, 8, 9]\n # calculate and output\n # output pattern\n # ex1) print(*l) => when l = [2, 5, 6], printed 2 5 6\n \"\"\"\n\n # functions used\n r = lambda: sys.stdin.readline().strip()\n r_int = lambda: int(r())\n R = lambda: list(map(int, r().split()))\n Rfloat = lambda: list(map(float, r().split()))\n Rtuple = lambda: tuple(map(int, r().split()))\n Rmap = lambda: map(int, r().split())\n\n \"\"\" how to treat input\n # single int: int(r())\n # single string: r()\n # single float: float(r())\n # line int: R()\n # line string: r().split()\n # line (str, int, int): [j if i == 0 else int(j) for i, j in enumerate(r().split())]\n # lines int: [R() for _ in range(n)]\n \"\"\"\n\n # main\n N, Q = R()\n STX = [R() for _ in range(N)]\n STX.sort(key=itemgetter(2))\n\n D = [int(r()) for _ in range(Q)]\n Stopped = [-1] * Q\n ans = [-1] * Q\n\n for s, t, x in STX:\n l = bisect_left(D, s-x)\n r = bisect_left(D,t-x)\n a = l\n while a < r:\n if Stopped[a] == -1:\n ans[a] = x\n Stopped[a] = r\n a += 1\n else:\n a = Stopped[a]\n\n for i in ans:\n print(i)\n\n \"\"\"memo: how to use defaultdict of list\n # initialize\n Dic = defaultdict(list)\n # append / extend\n Dic[x].append(y)\n # for\n for k, v in Dic.items():\n \"\"\"","def sol(n, mem):\n if mem[n] != -1:\n return mem[n]\n \n mem[n] = 0\n for i in range(2, n+1):\n mem[n]+=sol(n-i, mem)*sol(i-2, mem)\n \n return mem[n]","def integer_sum(n):\n\n sum = 0\n k = 0\n\n # INVARIANT\n # The sum of far is equal to the sum of the first k integer numbers\n # VARIANT: n-k\n #\n while (k!=n):\n k += 1\n sum += k\n\n return sum","def summation_i_squared(n):\n\n if type(n) != int or n < 1:\n return None\n else:\n if type(n) == int:\n if n > 1:\n return n**2 + summation_i_squared(n-1)\n return n","def get_squares(n):\n\n return sum([i * i for i in range(n)])","def game_nim_sum():\n global piles\n global num_piles \n nim_sum = 0\n for x in piles:\n nim_sum = nim_sum^x\n \n return nim_sum","def lucas(n):\n\t'''\n\tlucL1=1\n\tlucL2=2\n\tif n<0:\n\t\tprint(\"please enter positive int value\")\n\n\telif n==0:\n\t\treturn 2\n\n\telif n==1:\n\t\treturn 1\n\n\telse:\n\t\tfor i in range(n-1):\n\t\t\tlucC=lucL1+lucL2\n\t\t\tlucL2=lucL1\n\t\t\tlucL1=lucC\n\t\treturn lucC\n\t'''\n\treturn sum_series(n,2,1)","def powerize(n, p):\n return sum(int(d)**p for d in str(n))","def solution1(n):\n res = []\n while n > 0:\n m = int(math.floor(math.sqrt(n))**2)\n res.append(m)\n n -= m\n return res","def solution(n):\n total = sum(\n [\n i\n for i in range(1, n)\n if sum_of_divisors(sum_of_divisors(i)) == i and sum_of_divisors(i) != i\n ]\n )\n return total","def test_suite():\n test(sum_all_elements([1,3,1,4,3,8]) == 5)\n test(sum_all_elements([1,3,5,7]) == 16)\n test(sum_all_elements([1, -7, 10, 23]) == -6)\n test(sum_all_elements(range(1,555,2)) == 76729)","def one():\r\n \r\n i = 1\r\n sum = 0\r\n while i < 1000:\r\n if i % 3 == 0 or i % 5 == 0:\r\n sum = sum + i\r\n i = i + 1\r\n else:\r\n i = i + 1\r\n return sum","def get_3_5_sum(num):\n nums = range(num)\n mults = [num for num in nums if (num % 3 == 0 or num % 5 == 0)]\n return sum(mults)","def three_sum(nums: [int]) -> [[int]]:\n check_validity(nums, 0, repetitive_numbers=True)\n if len(nums) <= 2 or not nums:\n return []\n nums.sort()\n result = []\n for i in range(len(nums)):\n left = i\n middle = left + 1\n right = len(nums) - 1\n while left < right and middle < right:\n first = nums[left]\n second = nums[middle]\n third = nums[right]\n if first + second + third > 0:\n right -= 1\n continue\n elif first + second + third == 0 and [first, second, third] not in result:\n result.append([first, second, third])\n middle += 1\n return result","def combinations(n) -> float:\r\n c = math.factorial(n) / (math.factorial(2) * math.factorial(n - 2))\r\n return c","def pythagorean_triples(n):\n pass","def cube(n):\n return n**3","def nextpow2(i):\n n = 1\n while n < i:\n n *= 2\n return n","def cube_sum(i):\r\n return sum([i ** 3 for i in integer_to_digits(i)])","def question_26(list_num: int) -> int:\n return sum(list_num)","def zernike_num_coeff(n):\n \n\tif not (n>=0):\n\t\tprint('Input parameter must be >= 0')\n\t\traise AssertionError() \n \n\treturn sum(xrange(n+1)) + n+1","def next_integer(n):\n if n % 2 == 0:\n return n // 2\n else:\n return 3 * n + 1","def sumTo(n):\n \n the_sum = 0 #current sum\n a_number = 1 #where we are\n while a_number <= n:\n the_sum += a_number\n a_number += 1\n return the_sum","def sum_to(n):\n the_sum = 0\n for counter in range(n+1):\n the_sum = the_sum + counter\n return the_sum","def main():\n # Since a < b < c, we have a + b + c = 1000 > a + a + a, making a < 334.\n for a in range(1, 334):\n # Then b + c = 1000 - a > b + b, making b < 500 - a/2.\n for b in range(a + 1, 501 - a // 2):\n c = 1000 - a - b\n\n # check for Pythagorean triplet\n if a * a + b * b == c * c:\n return a * b * c","def square_and_multiply(x, exponent, n):\n result = 1\n while exponent > 0:\n if exponent % 2:\n result = (result * x) % n\n x = (x * x) % n\n exponent = exponent // 2\n return result","def McNuggets(n):\n a=0\n b=0\n c=0\n result=0\n while result <= n:\n result = 6*a + 9*b + 20*c\n if result > n:\n return False\n elif result == n:\n return True\n else:\n a+=1\n ...","def solve(needed_sum: int, power: int) -> int:\n if not (1 <= needed_sum <= 1000 and 2 <= power <= 10):\n raise ValueError(\n \"Invalid input\\n\"\n \"needed_sum must be between 1 and 1000, power between 2 and 10.\"\n )\n\n return backtrack(needed_sum, power, 1, 0, 0)[1] # Return the solutions_count"],"string":"[\n \"def sum_of_three_squares(n):\\n special = {1:(1, 0, 0), 2:(1, 1, 0), 3:(1, 1, 1), 10: (1, 3, 0), 34: (3, 3, 4), 58:(3, 7, 0),\\n 85:(6, 7, 0), 130:(3, 11, 0), 214:(3, 6, 13), 226:(8, 9, 9), 370:(8, 9, 15),\\n 526:(6, 7, 21), 706:(15, 15, 16), 730:(1, 27, 0), 1414:(6, 17, 33), 1906:(13, 21, 36),\\n 2986: (21, 32, 39), 9634: (56, 57, 57)}\\n\\n v = 0\\n\\n if n == 0:\\n return (0, 0, 0)\\n\\n v = multiplicity(4, n)\\n n //= 4**v\\n\\n if n % 8 == 7:\\n return\\n\\n if n in special.keys():\\n x, y, z = special[n]\\n return _sorted_tuple(2**v*x, 2**v*y, 2**v*z)\\n\\n s, _exact = integer_nthroot(n, 2)\\n\\n if _exact:\\n return (2**v*s, 0, 0)\\n\\n x = None\\n\\n if n % 8 == 3:\\n s = s if _odd(s) else s - 1\\n\\n for x in range(s, -1, -2):\\n N = (n - x**2) // 2\\n if isprime(N):\\n y, z = prime_as_sum_of_two_squares(N)\\n return _sorted_tuple(2**v*x, 2**v*(y + z), 2**v*abs(y - z))\\n return\\n\\n if n % 8 in (2, 6):\\n s = s if _odd(s) else s - 1\\n else:\\n s = s - 1 if _odd(s) else s\\n\\n for x in range(s, -1, -2):\\n N = n - x**2\\n if isprime(N):\\n y, z = prime_as_sum_of_two_squares(N)\\n return _sorted_tuple(2**v*x, 2**v*y, 2**v*z)\",\n \"def exercise2():\\n # You _DO_NOT_ need to modify this code for Lab 10.\\n n = easygui.integerbox( \\\"Enter n:\\\", \\\"Input\\\", lowerbound=0, upperbound=2 ** 31 )\\n\\n s = summation( n, 1 )\\n f = n * ( n + 1 ) // 2\\n easygui.msgbox( \\\"n = {}, summation( n, 1 ) = {}, formula result = {}\\\".format( n, s, f ) )\\n\\n s = summation( n, 2 )\\n f = n * ( n + 1 ) * ( 2 * n + 1 ) // 6\\n easygui.msgbox( \\\"n = {}, summation( n, 2 ) = {}, formula result = {}\\\".format( n, s, f ) )\\n\\n s = summation( n, 3 )\\n f = ( n * ( n + 1 ) // 2 ) ** 2\\n easygui.msgbox( \\\"n = {}, summation( n, 3 ) = {}, formula result = {}\\\".format( n, s, f ) )\",\n \"def solution(nums):\\n solution = Solution()\\n output = solution.threeSum(nums)\\n\\n print(output)\",\n \"def problem():\\n size = 1001\\n return sum(n**2 * 4 - 6 * n + 6 for n in range(3, size+1, 2)) + 1\",\n \"def solve(n=4 * 10**6):\\r\\n target_sum = 0\\r\\n fib_sequence = fibonacci_generator()\\r\\n for num in fib_sequence:\\r\\n if num >= n:\\r\\n break\\r\\n\\r\\n if num % 2 == 0:\\r\\n target_sum += num\\r\\n\\r\\n return target_sum\",\n \"def problem1():\\n return sum(i for i in range(1000) if i % 3 == 0 or i % 5 == 0)\",\n \"def multiples_sum_3_5(n):\\n\\tsum = 0\\n\\tfor x in range(1,n):\\n\\t\\tif (x%3==0) or (x%5==0):\\n\\t\\t\\tsum += x\\n\\treturn sum\",\n \"def problem9_naive(n):\\n for a in range(4, n, 4):\\n for b in range(3, n - a):\\n c = n - a - b\\n if a ** 2 + b ** 2 == c ** 2:\\n return a * b * c\\n return None\",\n \"def compute(n):\\n if n == 1:\\n return 1\\n else:\\n i = find_i(n)\\n return 2 * compute(n - i) + 2 ** i - 1\",\n \"def totalSolutions(n:int):\\n\\n memo = [0]*6\\n memo[5] = 1\\n if n == 1:\\n return 1\\n\\n for i in range(n):\\n solutions = sum(memo)\\n memo.pop(0)\\n memo.append(solutions)\\n\\n return memo.pop()\",\n \"def solution(n):\\n i = 1\\n j = 2\\n sum = 0\\n while j <= n:\\n if j % 2 == 0:\\n sum += j\\n i, j = j, i + j\\n\\n return sum\",\n \"def minOperations(n):\\n if type(n) is not int or n < 2:\\n return 0\\n\\n summation = []\\n\\n while n % 2 == 0:\\n summation.append(2)\\n n = n // 2\\n\\n for i in range(3, n + 1, 2):\\n while n % i == 0:\\n summation.append(i)\\n n = n // i\\n\\n return (sum(summation))\",\n \"def solution3(n):\\n res = []\\n while n > 0:\\n m = int(math.sqrt(n))**2\\n res.append(m)\\n n -= m\\n return res\",\n \"def sumTo(n):\\n\\n sum_all = (n * (n+1))/2\\n\\n return sum_all\",\n \"def problem(args:int) -> int:\\r\\n\\ta, b, c = 1, 2, 0\\r\\n\\tresult = [a]\\r\\n\\twhile c <= args:\\r\\n\\t\\tc = a + b\\r\\n\\t\\ta = b\\r\\n\\t\\tb = c\\r\\n\\t\\tresult.append(a)\\r\\n\\tresult = np.array(result)\\r\\n\\treturn sum(result[result % 2 == 0])\",\n \"def solution(n: int = 28123) -> int:\\n\\n nums = range(1, n+1)\\n abundant = list(filter(is_abundant, nums))\\n abundant_sums = set(all_sums(abundant, n))\\n fit = set(nums) - abundant_sums\\n return fit\",\n \"def sol(n):\\n p = 1\\n res = 0\\n \\n while n:\\n p*=5\\n if n&1:\\n res+=p\\n n=n>>1\\n return res%1000000007\",\n \"def square_of_sum(n):\\n return ((n * (n+1)) / 2)**2\",\n \"def sum_of_squares(n):\\n return (n * (n+1) * (2*n + 1)) / 6\",\n \"def summation_i_squared(n):\\n if (type(n) is not int) or (n is None) or (n < 1):\\n return None\\n else:\\n numbers = range(1, n + 1)\\n result = 0\\n result = map(lambda i: i ** 2, numbers)\\n return sum(result)\",\n \"def problem2(m, p):\\n total = 0\\n for k in range(m, m ** p):\\n if is_prime(k):\\n total = total + sum_of_digits(k)\\n return total\",\n \"def summation( n, exponent ):\\n result = 0\\n num = 1\\n while num < n + 1:\\n result += num ** exponent\\n num += 1\\n return result\",\n \"def test_hackerrank_sample2(self):\\n result = find_digits(1012)\\n self.assertEquals(result, 3)\",\n \"def sum_of_squares(n):\\n result = i = 0\\n while i < n:\\n result += i\\n i += 1\\n return result\",\n \"def solution(resources, args):\\n retval = 0\\n repeats = [3, 5, 6, 9, 10, 12, 15]\\n\\n i = 0\\n n = args.number - 1\\n\\n while n > 15:\\n retval += sum(repeats)\\n retval += 15*len(repeats)*i\\n n -= 15\\n i += 1\\n while n >= 3:\\n if n % 3 == 0 or n % 5 == 0:\\n retval += 15*i + n\\n n -= 1\\n return retval\",\n \"def test_sum_pos_3() -> None:\\n # 2nd step - 3rd square\\n assert nth(sw.sum_walk(), 1) == 2\",\n \"def product_of_n():\\n try:\\n input_value = int(input(\\\"Enter value for n: \\\"))\\n except:\\n return None\\n \\n sum_int = 1\\n \\n try:\\n for number in range(1, input_value+1):\\n sum_int *= number\\n \\n print(\\\"The result is:\\\", sum_int)\\n return None\\n except:\\n return None\",\n \"def main(n):\\n return sum(f(i) for i in xrange(n))\",\n \"def test_bigSum():\\n\\n assert bigSum() == 20000000100000000\",\n \"def total(n):\\n if n < 0:\\n return None\\n else:\\n result = 0\\n for i in range(n + 1):\\n result += i\\n return result\",\n \"def total(n):\\n if n < 0:\\n return None\\n else:\\n result = 0\\n for i in range(n + 1):\\n result += i\\n return result\",\n \"def problem9_fast(n):\\n n2 = n // 2\\n ulimit = ceil(sqrt(n2)) - 1\\n for u in range(2, ulimit):\\n if n2 % u == 0:\\n nu = n2 // u\\n while nu % 2 == 0:\\n nu //= 2\\n if u % 2 == 1:\\n k = u + 2\\n else:\\n k = u + 1\\n while k < 2 * u and k <= nu:\\n if nu % k == 0 and pe_utils.gcd(k, u) == 1:\\n d = n2 // (k * u)\\n v = k - u\\n a = (u ** 2 - v ** 2) * d\\n b = 2 * u * v * d\\n c = (u ** 2 + v ** 2) * d\\n return a * b * c\\n k += 2\\n return None\",\n \"def no_math_solution(n: int):\\n # After 2 (the second fibonacci number), every third number is even\\n if(n < 2):\\n return 0\\n fibs = [2, 3, 5]\\n sum = 0\\n while(fibs[0] <= n):\\n sum += fibs[0]\\n fibs[0] = fibs[1] + fibs[2]\\n fibs[1] = fibs[0] + fibs[2]\\n fibs[2] = fibs[0] + fibs[1]\\n return sum\",\n \"def solve(n=10):\\n return sum(M_N_S(n, d)[2] for d in range(10))\",\n \"def solve():\\n sum_of_squares = 0\\n for i in range(1, 101):\\n sum_of_squares += i * i\\n square_of_sum = sum(range(1, 101)) ** 2\\n return square_of_sum - sum_of_squares\",\n \"def six():\\r\\n \\r\\n sum_squared = 0\\r\\n squared_sum = 0\\r\\n \\r\\n for i in range(1, 101):\\r\\n sum_squared += i**2\\r\\n squared_sum += i\\r\\n squared_sum = squared_sum**2\\r\\n \\r\\n return squared_sum - sum_squared\",\n \"def solution(number):\\n\\n # a is a list with all the numbers below input that are multiples of 3 or 5\\n a = [x for x in range(1,number) if x % 3 == 0 or x % 5 == 0]\\n return sum(a)\",\n \"def row_sum_odd_numbers(n):\\n return n**3\",\n \"def problem001():\\n\\n sum = 0\\n for i in range(199):\\n i += 1\\n if i % 3 == 0:\\n continue\\n sum += i*5;\\n for i in range(333):\\n i += 1\\n sum += i*3\\n print sum\\n\\n sum = 0\\n for i in range(999):\\n i += 1\\n if (i % 3 == 0 or i % 5 == 0):\\n sum += i\\n print sum\\n\\n print reduce(lambda x,y: x+y, filter(lambda n: n%3==0 or n%5==0, range(1000)))\\n #arithmetic progressions\\n #http://en.wikipedia.org/wiki/Arithmetic_progression\\n x = 1000;\\n print 1.5*(int)((x-1)/3)*(int)((x+2)/3) + 2.5*(int)((x-1)/5)*(int)((x+4)/5) - 7.5*(int)((x-1)/15)*(int)((x+14)/15);\",\n \"def get_total_complexity(n):\\n total = 0\\n for i in range(1, n + 1):\\n total += get_complexity(i)\\n return total\",\n \"def test_getSum_twoNumbers(self):\\r\\n self.assertEqual(17, Arith().add(8, 9))\",\n \"def solution(n: int = 2000000) -> int:\\n\\n return sum(takewhile(lambda x: x < n, prime_generator()))\",\n \"def two_of_three(a, b, c):\\n \\\"*** YOUR CODE HERE ***\\\"\\n return pow(a, 2) + pow(b,2) + pow(c,2) - pow(min(a,b,c),2)\",\n \"def sum_of_squares(n):\\n sum = 0\\n\\n for i in range(0,n):\\n sum += i*i\\n\\n return sum\",\n \"def triangular_number_solution():\\n return 5 * partial_sum(199) + 3 * partial_sum(333) - 15 * partial_sum(66)\",\n \"def fakultet (n = 1):\\n sum = 1\\n for i in range(n, 1, -1):\\n sum *= i\\n return sum\",\n \"def sum_multiples(num):\\n pass\",\n \"def totient(n: int) -> int:\\n if SHOW_WORKING: print(f\\\"totient({n})\\\")\\n print(f\\\"\\\\ttotient(n) = p1^(e1 - 1) * (p1 - 1) * p2^(e2 - 1) * (p2 - 1) * ... * pk^(ek - 1) * (pk - 1)\\\")\\n\\n result: int = 1\\n \\n working_str1: str = ''\\n working_str2: str = ''\\n working_str3: str = ''\\n working_str4: str = ''\\n\\n n_prime_factors: Dict[int, int] = prime_factors(n)\\n\\n for p, e in n_prime_factors.items():\\n result *= p ** (e - 1) * (p - 1)\\n working_str1 += f\\\"{p}^({e} - 1) * ({p} - 1) * \\\"\\n working_str2 += f\\\"{p}^{e - 1} * {p - 1} * \\\"\\n working_str3 += f\\\"{p ** (e - 1)} * {p - 1} * \\\"\\n working_str4 += f\\\"{p ** (e - 1) * (p - 1)} * \\\"\\n \\n working_str1 = working_str1[:-2]\\n working_str2 = working_str2[:-2]\\n working_str3 = working_str3[:-2]\\n working_str4 = working_str4[:-2]\\n\\n n_prime_factorisation: str = ' * '.join([str(p) + '^' + str(e) for p, e in n_prime_factors.items()])\\n\\n if SHOW_WORKING: print(f\\\"\\\\n\\\\ttotient({n}) = totient({n_prime_factorisation}) \\\\n\\\\t\\\\t= {working_str1} \\\\n\\\\t\\\\t= {working_str2} \\\\n\\\\t\\\\t= {working_str3} \\\\n\\\\t\\\\t= {working_str4} \\\\n\\\\t\\\\t= {result}\\\")\\n\\n return result\",\n \"def solveProblem021():\\n total = 0\\n for i in range(2, 10000):\\n divs = getProperDivisors(i)\\n s = sum(divs)\\n # Skip stuff greater than, we'll get to it later if it's less than max.\\n if s > i:\\n continue\\n if s == i:\\n continue\\n t = sum(getProperDivisors(s))\\n if t == i:\\n total = total + i + s\\n print(\\\"The Sum is: %d\\\" % (total,))\",\n \"def test_sum(n, m, o, result):\\n from series import sum_series\\n assert sum_series(n, m, o) == result\",\n \"def Z(n):\\n count5 = 0\\n i = 1\\n while 1:\\n a = pow(5, i)\\n if a > n:\\n return count5\\n else:\\n count5 += n/a\\n i += 1\",\n \"def fn(n):\\n if n == 0: return 1\\n return sum(fn(i)*fn(n-i-1) for i in range(n))\",\n \"def sum_of_nth( n ):\\n if n > 0:\\n return sum( range(n + 1) )\\n else:\\n return 0\",\n \"def sum_evens( n ):\\n result = 0\\n num = 0\\n while num < n + 1:\\n result += num\\n num += 2\\n return result\",\n \"def sat(n: int):\\n return pow(2, n, n) == 3\",\n \"def method1():\\n n = 1000\\n s = 0 \\n\\n for i in range(n):\\n if i%3 == 0:\\n s += i\\n elif i%5 == 0:\\n s += i\\n\\n return s\",\n \"def power(x, m, n):\\n a = 1\\n while m > 0:\\n if m % 2 == 1:\\n a=(a*x)%n\\n x=(x*x)%n\\n m//=2\\n return a\",\n \"def test_hackerrank_sample1(self):\\n result = find_digits(12)\\n self.assertEquals(result, 2)\",\n \"def aks( n ):\\n\\n def aks_mod( polynomial , r ):\\n \\\"\\\"\\\"\\n This function is used in aks.\\n polynomial modulo ( x^r - 1 )\\n \\\"\\\"\\\"\\n aks_mod = polynomial.coefficients\\n total = aks_mod[ : r ]\\n aks_mod = aks_mod[ r : ]\\n while len(aks_mod) - 1 >= r :\\n for i in range(r):\\n total[i] += aks_mod[i]\\n aks_mod = aks_mod[ r : ]\\n for i in range(len(aks_mod)):\\n total[i] += aks_mod[i]\\n return array_poly_mod( total , polynomial.mod )\\n\\n lg = math.log( n , 2 )\\n k = int( lg * lg )\\n\\n if arith1.powerDetection( n )[ 1 ] != 1: #Power Detection\\n print(\\\" n is not prime \\\")\\n return False\\n\\n start = 3\\n while 1:\\n d = arith1.gcd.gcd( start , n )\\n if 1 < d < n:\\n print(\\\"n is not prime\\\")\\n return False\\n x = n % start\\n N = x\\n for i in range( 1 , k + 1 ):\\n if N == 1:\\n break\\n N = ( N * x ) % start\\n if i == k:\\n r = start\\n break\\n start += 1\\n d = arith1.gcd.gcd( r , n )\\n if 1 < d < n:\\n print(\\\" n is not prime \\\")\\n return False\\n if n <= r:\\n print(\\\" n is prime \\\")\\n return True\\n\\n e = multiplicative.euler( r ) #Cyclotomic Conguence\\n e = math.sqrt( e )\\n e = int( e * lg )\\n for b in range( 1 , e+1 ):\\n f = array_poly_mod( [ b , 1 ] , n )\\n total = array_poly_mod( [ 1 ] , n )\\n count = n\\n while count > 0:\\n if count & 1:\\n total = total * f\\n total = aks_mod( total , r )\\n f = f.power()\\n f = aks_mod( f , r )\\n count = count >> 1\\n total_poly = total.coefficients_to_dict()\\n if total_poly != { 0 : b , n % r : 1 }:\\n print(\\\" n is not prime \\\")\\n return False\\n print(\\\" n is prime \\\")\\n return True\",\n \"def question_30(x: int) -> int:\\n # Base case below:\\n if x == 0:\\n return 1\\n # Recursive function below:\\n else:\\n result = 1\\n while x > 0:\\n for i in range(x):\\n result *= 2 ** question_30(i)\\n x -= 1\\n return result\",\n \"def solve() -> int:\\n\\n return sum(1 for n in range(1, 10_000) if is_lychrel(n))\",\n \"def main():\\n result = 0\\n for n in range(1, 1001):\\n result += n**n\\n\\n result = str(result)\\n answer = result[len(result)-10::]\\n\\n print \\\"answer: \\\" + answer\",\n \"def problem():\\n for a in range(1, 380):\\n for b in range(a):\\n if a + b + (a**2 + b**2)**0.5 == 1000:\\n return int(a * b * (a**2 + b**2)**0.5)\",\n \"def power(x, n):\\n power = 1\\n for i in range(abs(n)):\\n power = multiply(power, x) \\n return power\",\n \"def f_exact(n, k):\\n def fact(m):\\n return math.factorial(m)\\n\\n partition = part(n, k)\\n\\n total = 0\\n for p in partition:\\n product = 1\\n nodes_left = n\\n counts = dict([(x, len(list(y))) for x, y in itertools.groupby(p)])\\n for num in p:\\n product *= fact(num - 1) * comb(nodes_left, num)\\n nodes_left -= num\\n for num in counts:\\n product /= fact(counts[num])\\n\\n total += product\\n return int(total)\",\n \"def ramanujan_hardy_asymptotic(n):\\n if(n != int(n)):\\n raise ValueError(\\n \\\"n must be integer\\\"\\n )\\n \\n return int((1/(4*n*math.sqrt(3)))*math.exp(math.sqrt(2*n/3)))\",\n \"def fact(n):\\n answer = 1\\n while n > 1:\\n answer *= n\\n n -= 1\\n return answer\",\n \"def solve(n=1000):\\r\\n return str(sum(x**x for x in range(1, n + 1)))[-10:]\",\n \"def sum_of_squares(n, k, zeros=False):\\n yield from power_representation(n, 2, k, zeros)\",\n \"def f(z):\\n if abs(z) > 2:\\n return 1\\n else:\\n n = 1\\n while abs(z) < 2:\\n n += 1\\n if n > 100:\\n return 0\\n else:\\n z = z**2 + c\\n return n\",\n \"def eulerTotient(n): #\\n result = 1\\n for i in range(2, n): \\n if (nt.gcd(i, n) == 1): \\n result+=1\\n return result\",\n \"def _power(self, a, n, m):\\n res = 1\\n while n != 0:\\n if n % 2 != 0:\\n res *= a\\n res %= m\\n n -= 1\\n else:\\n a *= a\\n a %= m\\n n //= 2\\n return res\",\n \"def square(n: int) -> int:\\n return int(n ** 2)\",\n \"def main():\\n\\n import sys\\n sys.setrecursionlimit(10**7)\\n from itertools import accumulate, combinations, permutations, product # https://docs.python.org/ja/3/library/itertools.html\\n # accumulate() returns iterator! to get list: list(accumulate())\\n from math import factorial, ceil, floor\\n def factorize(n):\\n \\\"\\\"\\\"return the factors of the Arg and count of each factor\\n \\n Args:\\n n (long): number to be resolved into factors\\n \\n Returns:\\n list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]\\n \\\"\\\"\\\"\\n fct = [] # prime factor\\n b, e = 2, 0 # base, exponent\\n while b * b <= n:\\n while n % b == 0:\\n n = n // b\\n e = e + 1\\n if e > 0:\\n fct.append((b, e))\\n b, e = b + 1, 0\\n if n > 1:\\n fct.append((n, 1))\\n return fct\\n def combinations_count(n, r):\\n \\\"\\\"\\\"Return the number of selecting r pieces of items from n kinds of items.\\n \\n Args:\\n n (long): number\\n r (long): number\\n \\n Raises:\\n Exception: not defined when n or r is negative\\n \\n Returns:\\n long: number\\n \\\"\\\"\\\"\\n # TODO: How should I do when n - r is negative?\\n if n < 0 or r < 0:\\n raise Exception('combinations_count(n, r) not defined when n or r is negative')\\n if n - r < r: r = n - r\\n if r < 0: return 0\\n if r == 0: return 1\\n if r == 1: return n\\n numerator = [n - r + k + 1 for k in range(r)]\\n denominator = [k + 1 for k in range(r)]\\n for p in range(2,r+1):\\n pivot = denominator[p - 1]\\n if pivot > 1:\\n offset = (n - r) % p\\n for k in range(p-1,r,p):\\n numerator[k - offset] /= pivot\\n denominator[k] /= pivot\\n result = 1\\n for k in range(r):\\n if numerator[k] > 1:\\n result *= int(numerator[k])\\n return result\\n def combinations_with_replacement_count(n, r):\\n \\\"\\\"\\\"Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.\\n \\n Args:\\n n (long): number\\n r (long): number\\n \\n Raises:\\n Exception: not defined when n or r is negative\\n \\n Returns:\\n long: number\\n \\\"\\\"\\\"\\n if n < 0 or r < 0:\\n raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')\\n elif n == 0:\\n return 1\\n else:\\n return combinations_count(n + r - 1, r)\\n from bisect import bisect_left, bisect_right\\n from collections import deque, Counter, defaultdict # https://docs.python.org/ja/3/library/collections.html#collections.deque\\n from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest # https://docs.python.org/ja/3/library/heapq.html\\n from copy import deepcopy, copy # https://docs.python.org/ja/3/library/copy.html\\n from operator import itemgetter\\n # ex1: List.sort(key=itemgetter(1))\\n # ex2: sorted(tuples, key=itemgetter(1,2))\\n from functools import reduce\\n def chmin(x, y):\\n \\\"\\\"\\\"change minimum\\n if x > y, x = y and return (x, True).\\n convenient when solving problems of dp[i]\\n \\n Args:\\n x (long): current minimum value\\n y (long): potential minimum value\\n \\n Returns:\\n (x, bool): (x, True) when updated, else (x, False)\\n \\\"\\\"\\\"\\n if x > y:\\n x = y\\n return (x, True)\\n else:\\n return (x, False)\\n def chmax(x, y):\\n \\\"\\\"\\\"change maximum\\n if x < y, x = y and return (x, True).\\n convenient when solving problems of dp[i]\\n \\n Args:\\n x (long): current maximum value\\n y (long): potential maximum value\\n \\n Returns:\\n (x, bool): (x, True) when updated, else (x, False)\\n \\\"\\\"\\\"\\n if x < y:\\n x = y\\n return (x, True)\\n else:\\n return (x, False)\\n\\n from fractions import gcd # Deprecated since version 3.5: Use math.gcd() instead.\\n def gcds(numbers):\\n return reduce(gcd, numbers)\\n def lcm(x, y):\\n return (x * y) // gcd(x, y)\\n def lcms(numbers):\\n return reduce(lcm, numbers, 1)\\n\\n # first create factorial_list\\n # fac_list = mod_factorial_list(n)\\n INF = 10 ** 18\\n MOD = 10 ** 9 + 7\\n modpow = lambda a, n, p = MOD: pow(a, n, p) # Recursive function in python is slow!\\n def modinv(a, p = MOD):\\n # evaluate reciprocal using Fermat's little theorem:\\n # a**(p-1) is identical to 1 (mod p) when a and p is coprime\\n return modpow(a, p-2, p)\\n def modinv_list(n, p = MOD):\\n if n <= 1:\\n return [0,1][:n+1]\\n else:\\n inv_t = [0,1]\\n for i in range(2, n+1):\\n inv_t += [inv_t[p % i] * (p - int(p / i)) % p]\\n return inv_t\\n def modfactorial_list(n, p = MOD):\\n if n == 0:\\n return [1]\\n else:\\n l = [0] * (n+1)\\n tmp = 1\\n for i in range(1, n+1):\\n tmp = tmp * i % p\\n l[i] = tmp\\n return l\\n def modcomb(n, k, fac_list = [], p = MOD):\\n # fac_list = modfactorial_list(100)\\n # print(modcomb(100, 5, modfactorial_list(100)))\\n from math import factorial\\n if n < 0 or k < 0 or n < k: return 0\\n if n == 0 or k == 0: return 1\\n if len(fac_list) <= n:\\n a = factorial(n) % p\\n b = factorial(k) % p\\n c = factorial(n-k) % p\\n else:\\n a = fac_list[n]\\n b = fac_list[k]\\n c = fac_list[n-k]\\n return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p\\n def modadd(a, b, p = MOD):\\n return (a + b) % MOD\\n def modsub(a, b, p = MOD):\\n return (a - b) % p\\n def modmul(a, b, p = MOD):\\n return ((a % p) * (b % p)) % p\\n def moddiv(a, b, p = MOD):\\n return modmul(a, modpow(b, p-2, p))\\n\\n \\\"\\\"\\\" initialize variables and set inputs\\n # initialize variables\\n # to initialize list, use [0] * n\\n # to initialize two dimentional array, use [[0] * N for _ in range(N)]\\n # set inputs\\n # open(0).read() is a convenient method:\\n # ex) n, m, *x = map(int, open(0).read().split())\\n # min(x[::2]) - max(x[1::2])\\n # ex2) *x, = map(int, open(0).read().split())\\n # don't forget to add comma after *x if only one variable is used\\n # preprocessing\\n # transpose = [x for x in zip(*data)]\\n # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [(1, 4, 7), (2, 5, 8), (3, 6, 9)]\\n # flat = [flatten for inner in data for flatten in inner]\\n # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [1, 2, 3, 4, 5, 6, 7, 8, 9]\\n # calculate and output\\n # output pattern\\n # ex1) print(*l) => when l = [2, 5, 6], printed 2 5 6\\n \\\"\\\"\\\"\\n\\n # functions used\\n r = lambda: sys.stdin.readline().strip()\\n r_int = lambda: int(r())\\n R = lambda: list(map(int, r().split()))\\n Rfloat = lambda: list(map(float, r().split()))\\n Rtuple = lambda: tuple(map(int, r().split()))\\n Rmap = lambda: map(int, r().split())\\n\\n \\\"\\\"\\\" how to treat input\\n # single int: int(r())\\n # single string: r()\\n # single float: float(r())\\n # line int: R()\\n # line string: r().split()\\n # line (str, int, int): [j if i == 0 else int(j) for i, j in enumerate(r().split())]\\n # lines int: [R() for _ in range(n)]\\n \\\"\\\"\\\"\\n\\n # main\\n N, Q = R()\\n STX = [R() for _ in range(N)]\\n STX.sort(key=itemgetter(2))\\n\\n D = [int(r()) for _ in range(Q)]\\n Stopped = [-1] * Q\\n ans = [-1] * Q\\n\\n for s, t, x in STX:\\n l = bisect_left(D, s-x)\\n r = bisect_left(D,t-x)\\n a = l\\n while a < r:\\n if Stopped[a] == -1:\\n ans[a] = x\\n Stopped[a] = r\\n a += 1\\n else:\\n a = Stopped[a]\\n\\n for i in ans:\\n print(i)\\n\\n \\\"\\\"\\\"memo: how to use defaultdict of list\\n # initialize\\n Dic = defaultdict(list)\\n # append / extend\\n Dic[x].append(y)\\n # for\\n for k, v in Dic.items():\\n \\\"\\\"\\\"\",\n \"def sol(n, mem):\\n if mem[n] != -1:\\n return mem[n]\\n \\n mem[n] = 0\\n for i in range(2, n+1):\\n mem[n]+=sol(n-i, mem)*sol(i-2, mem)\\n \\n return mem[n]\",\n \"def integer_sum(n):\\n\\n sum = 0\\n k = 0\\n\\n # INVARIANT\\n # The sum of far is equal to the sum of the first k integer numbers\\n # VARIANT: n-k\\n #\\n while (k!=n):\\n k += 1\\n sum += k\\n\\n return sum\",\n \"def summation_i_squared(n):\\n\\n if type(n) != int or n < 1:\\n return None\\n else:\\n if type(n) == int:\\n if n > 1:\\n return n**2 + summation_i_squared(n-1)\\n return n\",\n \"def get_squares(n):\\n\\n return sum([i * i for i in range(n)])\",\n \"def game_nim_sum():\\n global piles\\n global num_piles \\n nim_sum = 0\\n for x in piles:\\n nim_sum = nim_sum^x\\n \\n return nim_sum\",\n \"def lucas(n):\\n\\t'''\\n\\tlucL1=1\\n\\tlucL2=2\\n\\tif n<0:\\n\\t\\tprint(\\\"please enter positive int value\\\")\\n\\n\\telif n==0:\\n\\t\\treturn 2\\n\\n\\telif n==1:\\n\\t\\treturn 1\\n\\n\\telse:\\n\\t\\tfor i in range(n-1):\\n\\t\\t\\tlucC=lucL1+lucL2\\n\\t\\t\\tlucL2=lucL1\\n\\t\\t\\tlucL1=lucC\\n\\t\\treturn lucC\\n\\t'''\\n\\treturn sum_series(n,2,1)\",\n \"def powerize(n, p):\\n return sum(int(d)**p for d in str(n))\",\n \"def solution1(n):\\n res = []\\n while n > 0:\\n m = int(math.floor(math.sqrt(n))**2)\\n res.append(m)\\n n -= m\\n return res\",\n \"def solution(n):\\n total = sum(\\n [\\n i\\n for i in range(1, n)\\n if sum_of_divisors(sum_of_divisors(i)) == i and sum_of_divisors(i) != i\\n ]\\n )\\n return total\",\n \"def test_suite():\\n test(sum_all_elements([1,3,1,4,3,8]) == 5)\\n test(sum_all_elements([1,3,5,7]) == 16)\\n test(sum_all_elements([1, -7, 10, 23]) == -6)\\n test(sum_all_elements(range(1,555,2)) == 76729)\",\n \"def one():\\r\\n \\r\\n i = 1\\r\\n sum = 0\\r\\n while i < 1000:\\r\\n if i % 3 == 0 or i % 5 == 0:\\r\\n sum = sum + i\\r\\n i = i + 1\\r\\n else:\\r\\n i = i + 1\\r\\n return sum\",\n \"def get_3_5_sum(num):\\n nums = range(num)\\n mults = [num for num in nums if (num % 3 == 0 or num % 5 == 0)]\\n return sum(mults)\",\n \"def three_sum(nums: [int]) -> [[int]]:\\n check_validity(nums, 0, repetitive_numbers=True)\\n if len(nums) <= 2 or not nums:\\n return []\\n nums.sort()\\n result = []\\n for i in range(len(nums)):\\n left = i\\n middle = left + 1\\n right = len(nums) - 1\\n while left < right and middle < right:\\n first = nums[left]\\n second = nums[middle]\\n third = nums[right]\\n if first + second + third > 0:\\n right -= 1\\n continue\\n elif first + second + third == 0 and [first, second, third] not in result:\\n result.append([first, second, third])\\n middle += 1\\n return result\",\n \"def combinations(n) -> float:\\r\\n c = math.factorial(n) / (math.factorial(2) * math.factorial(n - 2))\\r\\n return c\",\n \"def pythagorean_triples(n):\\n pass\",\n \"def cube(n):\\n return n**3\",\n \"def nextpow2(i):\\n n = 1\\n while n < i:\\n n *= 2\\n return n\",\n \"def cube_sum(i):\\r\\n return sum([i ** 3 for i in integer_to_digits(i)])\",\n \"def question_26(list_num: int) -> int:\\n return sum(list_num)\",\n \"def zernike_num_coeff(n):\\n \\n\\tif not (n>=0):\\n\\t\\tprint('Input parameter must be >= 0')\\n\\t\\traise AssertionError() \\n \\n\\treturn sum(xrange(n+1)) + n+1\",\n \"def next_integer(n):\\n if n % 2 == 0:\\n return n // 2\\n else:\\n return 3 * n + 1\",\n \"def sumTo(n):\\n \\n the_sum = 0 #current sum\\n a_number = 1 #where we are\\n while a_number <= n:\\n the_sum += a_number\\n a_number += 1\\n return the_sum\",\n \"def sum_to(n):\\n the_sum = 0\\n for counter in range(n+1):\\n the_sum = the_sum + counter\\n return the_sum\",\n \"def main():\\n # Since a < b < c, we have a + b + c = 1000 > a + a + a, making a < 334.\\n for a in range(1, 334):\\n # Then b + c = 1000 - a > b + b, making b < 500 - a/2.\\n for b in range(a + 1, 501 - a // 2):\\n c = 1000 - a - b\\n\\n # check for Pythagorean triplet\\n if a * a + b * b == c * c:\\n return a * b * c\",\n \"def square_and_multiply(x, exponent, n):\\n result = 1\\n while exponent > 0:\\n if exponent % 2:\\n result = (result * x) % n\\n x = (x * x) % n\\n exponent = exponent // 2\\n return result\",\n \"def McNuggets(n):\\n a=0\\n b=0\\n c=0\\n result=0\\n while result <= n:\\n result = 6*a + 9*b + 20*c\\n if result > n:\\n return False\\n elif result == n:\\n return True\\n else:\\n a+=1\\n ...\",\n \"def solve(needed_sum: int, power: int) -> int:\\n if not (1 <= needed_sum <= 1000 and 2 <= power <= 10):\\n raise ValueError(\\n \\\"Invalid input\\\\n\\\"\\n \\\"needed_sum must be between 1 and 1000, power between 2 and 10.\\\"\\n )\\n\\n return backtrack(needed_sum, power, 1, 0, 0)[1] # Return the solutions_count\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.71092266","0.69121766","0.6900263","0.6852991","0.68254423","0.6779459","0.6768679","0.6742208","0.66945046","0.66854495","0.66733605","0.6636726","0.65705687","0.6565622","0.65579176","0.6534161","0.65196925","0.650806","0.64977133","0.6482399","0.64755505","0.6474429","0.646307","0.64555484","0.6443007","0.63935465","0.6382156","0.63686764","0.6367196","0.63622767","0.63622767","0.63551545","0.63479334","0.63459027","0.6344653","0.6342228","0.6321848","0.63182986","0.63076806","0.63062835","0.62803155","0.62780565","0.6273603","0.62727684","0.6258489","0.6257392","0.6251705","0.6251544","0.6246612","0.62462544","0.62442094","0.6240344","0.62157154","0.62100047","0.6192255","0.61728525","0.61708593","0.6166787","0.6163233","0.6155475","0.614547","0.614276","0.6140784","0.614038","0.6140011","0.61376965","0.6134588","0.61334854","0.6124202","0.61237514","0.6122448","0.612225","0.61198413","0.6117957","0.61112624","0.6103451","0.61028486","0.6099078","0.60958636","0.60955215","0.60915434","0.6089455","0.6087316","0.6086536","0.6085627","0.60844237","0.6083087","0.6075585","0.60753363","0.60706186","0.6068381","0.6062614","0.6062017","0.60596555","0.60443705","0.60343814","0.60327804","0.6026138","0.60239995","0.60234135","0.6023279"],"string":"[\n \"0.71092266\",\n \"0.69121766\",\n \"0.6900263\",\n \"0.6852991\",\n \"0.68254423\",\n \"0.6779459\",\n \"0.6768679\",\n \"0.6742208\",\n \"0.66945046\",\n \"0.66854495\",\n \"0.66733605\",\n \"0.6636726\",\n \"0.65705687\",\n \"0.6565622\",\n \"0.65579176\",\n \"0.6534161\",\n \"0.65196925\",\n \"0.650806\",\n \"0.64977133\",\n \"0.6482399\",\n \"0.64755505\",\n \"0.6474429\",\n \"0.646307\",\n \"0.64555484\",\n \"0.6443007\",\n \"0.63935465\",\n \"0.6382156\",\n \"0.63686764\",\n \"0.6367196\",\n \"0.63622767\",\n \"0.63622767\",\n \"0.63551545\",\n \"0.63479334\",\n \"0.63459027\",\n \"0.6344653\",\n \"0.6342228\",\n \"0.6321848\",\n \"0.63182986\",\n \"0.63076806\",\n \"0.63062835\",\n \"0.62803155\",\n \"0.62780565\",\n \"0.6273603\",\n \"0.62727684\",\n \"0.6258489\",\n \"0.6257392\",\n \"0.6251705\",\n \"0.6251544\",\n \"0.6246612\",\n \"0.62462544\",\n \"0.62442094\",\n \"0.6240344\",\n \"0.62157154\",\n \"0.62100047\",\n \"0.6192255\",\n \"0.61728525\",\n \"0.61708593\",\n \"0.6166787\",\n \"0.6163233\",\n \"0.6155475\",\n \"0.614547\",\n \"0.614276\",\n \"0.6140784\",\n \"0.614038\",\n \"0.6140011\",\n \"0.61376965\",\n \"0.6134588\",\n \"0.61334854\",\n \"0.6124202\",\n \"0.61237514\",\n \"0.6122448\",\n \"0.612225\",\n \"0.61198413\",\n \"0.6117957\",\n \"0.61112624\",\n \"0.6103451\",\n \"0.61028486\",\n \"0.6099078\",\n \"0.60958636\",\n \"0.60955215\",\n \"0.60915434\",\n \"0.6089455\",\n \"0.6087316\",\n \"0.6086536\",\n \"0.6085627\",\n \"0.60844237\",\n \"0.6083087\",\n \"0.6075585\",\n \"0.60753363\",\n \"0.60706186\",\n \"0.6068381\",\n \"0.6062614\",\n \"0.6062017\",\n \"0.60596555\",\n \"0.60443705\",\n \"0.60343814\",\n \"0.60327804\",\n \"0.6026138\",\n \"0.60239995\",\n \"0.60234135\",\n \"0.6023279\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":11391,"cells":{"query":{"kind":"string","value":"Testing task 331b class main logic ( must return the array of sums of 3 integers in power 2, that is equal to n)"},"document":{"kind":"string","value":"def test_task331b_main_logic(number, expected_value):\r\n assert algo.Task331b.main_logic(number) == expected_value"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["def sum_of_three_squares(n):\n special = {1:(1, 0, 0), 2:(1, 1, 0), 3:(1, 1, 1), 10: (1, 3, 0), 34: (3, 3, 4), 58:(3, 7, 0),\n 85:(6, 7, 0), 130:(3, 11, 0), 214:(3, 6, 13), 226:(8, 9, 9), 370:(8, 9, 15),\n 526:(6, 7, 21), 706:(15, 15, 16), 730:(1, 27, 0), 1414:(6, 17, 33), 1906:(13, 21, 36),\n 2986: (21, 32, 39), 9634: (56, 57, 57)}\n\n v = 0\n\n if n == 0:\n return (0, 0, 0)\n\n v = multiplicity(4, n)\n n //= 4**v\n\n if n % 8 == 7:\n return\n\n if n in special.keys():\n x, y, z = special[n]\n return _sorted_tuple(2**v*x, 2**v*y, 2**v*z)\n\n s, _exact = integer_nthroot(n, 2)\n\n if _exact:\n return (2**v*s, 0, 0)\n\n x = None\n\n if n % 8 == 3:\n s = s if _odd(s) else s - 1\n\n for x in range(s, -1, -2):\n N = (n - x**2) // 2\n if isprime(N):\n y, z = prime_as_sum_of_two_squares(N)\n return _sorted_tuple(2**v*x, 2**v*(y + z), 2**v*abs(y - z))\n return\n\n if n % 8 in (2, 6):\n s = s if _odd(s) else s - 1\n else:\n s = s - 1 if _odd(s) else s\n\n for x in range(s, -1, -2):\n N = n - x**2\n if isprime(N):\n y, z = prime_as_sum_of_two_squares(N)\n return _sorted_tuple(2**v*x, 2**v*y, 2**v*z)","def solution(nums):\n solution = Solution()\n output = solution.threeSum(nums)\n\n print(output)","def totalSolutions(n:int):\n\n memo = [0]*6\n memo[5] = 1\n if n == 1:\n return 1\n\n for i in range(n):\n solutions = sum(memo)\n memo.pop(0)\n memo.append(solutions)\n\n return memo.pop()","def problem(args:int) -> int:\r\n\ta, b, c = 1, 2, 0\r\n\tresult = [a]\r\n\twhile c <= args:\r\n\t\tc = a + b\r\n\t\ta = b\r\n\t\tb = c\r\n\t\tresult.append(a)\r\n\tresult = np.array(result)\r\n\treturn sum(result[result % 2 == 0])","def problem():\n size = 1001\n return sum(n**2 * 4 - 6 * n + 6 for n in range(3, size+1, 2)) + 1","def three_sum(nums: [int]) -> [[int]]:\n check_validity(nums, 0, repetitive_numbers=True)\n if len(nums) <= 2 or not nums:\n return []\n nums.sort()\n result = []\n for i in range(len(nums)):\n left = i\n middle = left + 1\n right = len(nums) - 1\n while left < right and middle < right:\n first = nums[left]\n second = nums[middle]\n third = nums[right]\n if first + second + third > 0:\n right -= 1\n continue\n elif first + second + third == 0 and [first, second, third] not in result:\n result.append([first, second, third])\n middle += 1\n return result","def test_suite():\n test(sum_all_elements([1,3,1,4,3,8]) == 5)\n test(sum_all_elements([1,3,5,7]) == 16)\n test(sum_all_elements([1, -7, 10, 23]) == -6)\n test(sum_all_elements(range(1,555,2)) == 76729)","def main(n):\n return sum(f(i) for i in xrange(n))","def problem1():\n return sum(i for i in range(1000) if i % 3 == 0 or i % 5 == 0)","def multiples_sum_3_5(n):\n\tsum = 0\n\tfor x in range(1,n):\n\t\tif (x%3==0) or (x%5==0):\n\t\t\tsum += x\n\treturn sum","def sumOfSquares(n):\n sumVars = []\n for x in range(1,n+1):\n sumVars.append(x**2)\n return sumVars","def solve(n=4 * 10**6):\r\n target_sum = 0\r\n fib_sequence = fibonacci_generator()\r\n for num in fib_sequence:\r\n if num >= n:\r\n break\r\n\r\n if num % 2 == 0:\r\n target_sum += num\r\n\r\n return target_sum","def solution(n: int = 28123) -> int:\n\n nums = range(1, n+1)\n abundant = list(filter(is_abundant, nums))\n abundant_sums = set(all_sums(abundant, n))\n fit = set(nums) - abundant_sums\n return fit","def solution3(n):\n res = []\n while n > 0:\n m = int(math.sqrt(n))**2\n res.append(m)\n n -= m\n return res","def sumTo(n):\n\n sum_all = (n * (n+1))/2\n\n return sum_all","def test_large_sum(self):\n for n in [10, 20, 30, 40, 50]:\n A = np.arange(n*n)\n A = np.reshape(A, (n, n))\n x = Variable(n, n)\n p = Problem(Minimize(at.sum_entries(x)), [x >= A])\n result = p.solve()\n answer = n*n*(n*n+1)/2 - n*n\n print(result - answer)\n self.assertAlmostEqual(result, answer)","def task_8_sum_of_ints(data: List[int]) -> int:\n return sum(data)","def row_sum_odd_numbers(n):\n return n**3","def get_squares(n):\n\n return sum([i * i for i in range(n)])","def sum_of_squares(n):\n result = i = 0\n while i < n:\n result += i\n i += 1\n return result","def minOperations(n):\n if type(n) is not int or n < 2:\n return 0\n\n summation = []\n\n while n % 2 == 0:\n summation.append(2)\n n = n // 2\n\n for i in range(3, n + 1, 2):\n while n % i == 0:\n summation.append(i)\n n = n // i\n\n return (sum(summation))","def exercise2():\n # You _DO_NOT_ need to modify this code for Lab 10.\n n = easygui.integerbox( \"Enter n:\", \"Input\", lowerbound=0, upperbound=2 ** 31 )\n\n s = summation( n, 1 )\n f = n * ( n + 1 ) // 2\n easygui.msgbox( \"n = {}, summation( n, 1 ) = {}, formula result = {}\".format( n, s, f ) )\n\n s = summation( n, 2 )\n f = n * ( n + 1 ) * ( 2 * n + 1 ) // 6\n easygui.msgbox( \"n = {}, summation( n, 2 ) = {}, formula result = {}\".format( n, s, f ) )\n\n s = summation( n, 3 )\n f = ( n * ( n + 1 ) // 2 ) ** 2\n easygui.msgbox( \"n = {}, summation( n, 3 ) = {}, formula result = {}\".format( n, s, f ) )","def test_sum(n, m, o, result):\n from series import sum_series\n assert sum_series(n, m, o) == result","def solve(n=10):\n return sum(M_N_S(n, d)[2] for d in range(10))","def solution(n):\n i = 1\n j = 2\n sum = 0\n while j <= n:\n if j % 2 == 0:\n sum += j\n i, j = j, i + j\n\n return sum","def sum_of_squares(n, k, zeros=False):\n yield from power_representation(n, 2, k, zeros)","def get_solution():\n return jnp.sum(jnp.arange(10))","def sum_of_squares(n):\n sum = 0\n\n for i in range(0,n):\n sum += i*i\n\n return sum","def three_sum(nums: List[int]) -> List[List[int]]:\n\n size = len(nums)\n res = list()\n if size < 3:\n return res\n #\n\n nums.sort()\n seen_dict = dict()\n for i in range(size - 2):\n num = nums[i]\n if num in seen_dict:\n continue\n #\n seen_dict[num] = 1\n two_sum_res = two_sum(nums, i + 1, -num)\n for item in two_sum_res:\n item.append(num)\n item.sort()\n res.append(item)\n #\n #\n return res","def summation( n, exponent ):\n result = 0\n num = 1\n while num < n + 1:\n result += num ** exponent\n num += 1\n return result","def sum_of_squares(n):\n return (n * (n+1) * (2*n + 1)) / 6","def test_sum_of_long_array():\n assert find_maximal_subarray_sum([1, 3, -1, -3, 5, 3, 6, 7], 3) == 16","def triangular_number_solution():\n return 5 * partial_sum(199) + 3 * partial_sum(333) - 15 * partial_sum(66)","def square_of_sum(n):\n return ((n * (n+1)) / 2)**2","def test_sum_pos_3() -> None:\n # 2nd step - 3rd square\n assert nth(sw.sum_walk(), 1) == 2","def summation_i_squared(n):\n if (type(n) is not int) or (n is None) or (n < 1):\n return None\n else:\n numbers = range(1, n + 1)\n result = 0\n result = map(lambda i: i ** 2, numbers)\n return sum(result)","def solution(resources, args):\n retval = 0\n repeats = [3, 5, 6, 9, 10, 12, 15]\n\n i = 0\n n = args.number - 1\n\n while n > 15:\n retval += sum(repeats)\n retval += 15*len(repeats)*i\n n -= 15\n i += 1\n while n >= 3:\n if n % 3 == 0 or n % 5 == 0:\n retval += 15*i + n\n n -= 1\n return retval","def binaire(x,n):\n a,q = [],0\n \n for i in range(n):\n q = x%2\n x //=2\n a = [q] + a\n \n return(a)","def solution(n: int) -> int:\n sizearr = n + 1\n\n # create zero-filled multi_arr\n multi_arr = [[0 for x in range(sizearr)] for n in range(sizearr)]\n\n # base value is always skipped after being padded\n multi_arr[0][0] = 1\n for last in range(1, sizearr):\n for next in range(0, sizearr):\n multi_arr[last][next] = multi_arr[last - 1][next]\n if next >= last:\n multi_arr[last][next] += multi_arr[last - 1][next - last]\n\n return multi_arr[n][n] - 1","def game_nim_sum():\n global piles\n global num_piles \n nim_sum = 0\n for x in piles:\n nim_sum = nim_sum^x\n \n return nim_sum","def multi_2(cur,p,n):\n\tr=p\n\twhile n>1:\n\t\tr=sum(cur,r,p)\n\t\tn-=1\n\treturn r","def checkio(array):\n sums = 0\n answer = 0\n if not array:\n return 0\n even_array = array[::2]\n for i in even_array:\n sums += i\n answer = sums * array[-1]\n return answer","def arrayManipulation_brute(n, queries):\n arr = [0] * n\n\n for i, row in enumerate(queries):\n a, b, k = row[0], row[1], row[2]\n for j in range(a - 1, b):\n arr[j] = arr[j] + k\n print(f'array size {arr.__sizeof__()/1000000}')\n return max(arr)","def level_sums(n,r,s):\n# from numpy import zeros\n from copy import copy\n OutSet=[]\n# a=zeros(r,int)\n a=[0 for i in range(r)]\n if(s):\n t=n\n h=-1\n a[0]=n\n s=False\n OutSet.append(copy(a))\n else:\n return OutSet \n while (a[r-1] != n):\n if(1<t):\n h=-1\n h+=1\n t=a[h]\n a[h]=0\n a[0]=t-1\n a[h+1]+=1\n OutSet.append(copy(a))\n else:\n return OutSet","def __init__(self, nums):\n self.sums,tmp =[],0\n for n in nums:\n tmp +=n\n self.sums.append(tmp)","def total(n):\n if n < 0:\n return None\n else:\n result = 0\n for i in range(n + 1):\n result += i\n return result","def total(n):\n if n < 0:\n return None\n else:\n result = 0\n for i in range(n + 1):\n result += i\n return result","def solve():\n sum_of_squares = 0\n for i in range(1, 101):\n sum_of_squares += i * i\n square_of_sum = sum(range(1, 101)) ** 2\n return square_of_sum - sum_of_squares","def sum3(nums):\n count = 0\n for num in nums:\n count += num\n return count","def main(l, k):\n S = 0\n T = product(xrange(2), repeat=k)\n for ts in T:\n tmp = []\n\n for t, c in zip(ts, cs):\n tmp.append(((-1)*c)**t)\n\n S += (sum(tmp)**l)\n val = (sum(tmp)**l)\n print val\n return S / float(2**(k))","def main(l, k):\n S = 0\n T = product(xrange(2), repeat=k)\n for ts in T:\n tmp = []\n\n for t, c in zip(ts, cs):\n tmp.append(((-1)*c)**t)\n\n S += (sum(tmp)**l)\n val = (sum(tmp)**l)\n print val\n return S / float(2**(k))","def sum_n_m(n, m):\n total = 0\n for i in range(n, m+1):\n total += i\n return total","def evansPerfectNumbers(n):\n assert n>1\n perfect = []\n for i in range(1,n+1):\n sums = 0\n for j in range(1,i):\n sums += evansMod(i,j)*j\n if sums == i:\n perfect.append(i)\n #print(perfect) #for testing only\n return perfect","def get_total_complexity(n):\n total = 0\n for i in range(1, n + 1):\n total += get_complexity(i)\n return total","def test_results():\n x = 0.5\n np.testing.assert_almost_equal(nbf.sum_x_n_calc(\n x, z_n, k_n_1), npf.sum_x_n_calc(x, z_n, k_n_1))","def aks( n ):\n\n def aks_mod( polynomial , r ):\n \"\"\"\n This function is used in aks.\n polynomial modulo ( x^r - 1 )\n \"\"\"\n aks_mod = polynomial.coefficients\n total = aks_mod[ : r ]\n aks_mod = aks_mod[ r : ]\n while len(aks_mod) - 1 >= r :\n for i in range(r):\n total[i] += aks_mod[i]\n aks_mod = aks_mod[ r : ]\n for i in range(len(aks_mod)):\n total[i] += aks_mod[i]\n return array_poly_mod( total , polynomial.mod )\n\n lg = math.log( n , 2 )\n k = int( lg * lg )\n\n if arith1.powerDetection( n )[ 1 ] != 1: #Power Detection\n print(\" n is not prime \")\n return False\n\n start = 3\n while 1:\n d = arith1.gcd.gcd( start , n )\n if 1 < d < n:\n print(\"n is not prime\")\n return False\n x = n % start\n N = x\n for i in range( 1 , k + 1 ):\n if N == 1:\n break\n N = ( N * x ) % start\n if i == k:\n r = start\n break\n start += 1\n d = arith1.gcd.gcd( r , n )\n if 1 < d < n:\n print(\" n is not prime \")\n return False\n if n <= r:\n print(\" n is prime \")\n return True\n\n e = multiplicative.euler( r ) #Cyclotomic Conguence\n e = math.sqrt( e )\n e = int( e * lg )\n for b in range( 1 , e+1 ):\n f = array_poly_mod( [ b , 1 ] , n )\n total = array_poly_mod( [ 1 ] , n )\n count = n\n while count > 0:\n if count & 1:\n total = total * f\n total = aks_mod( total , r )\n f = f.power()\n f = aks_mod( f , r )\n count = count >> 1\n total_poly = total.coefficients_to_dict()\n if total_poly != { 0 : b , n % r : 1 }:\n print(\" n is not prime \")\n return False\n print(\" n is prime \")\n return True","def test_safe_sum_p_log_p(self):\r\n m = array([2, 4, 0, 8])\r\n self.assertEqual(safe_sum_p_log_p(m, 2), 2 * 1 + 4 * 2 + 8 * 3)","def threeSum(self, nums):\n # sort\n nums.sort()\n length = len(nums)\n result = []\n # get unique list\n unique = set()\n for i in xrange(length):\n # if nums[i] exist in unique\n if nums[i] in unique:\n continue\n else:\n unique.add(nums[i])\n j = i + 1\n k = length - 1\n # get unique nums[j]\n unique_local = set()\n while k > j:\n unique_local.add(nums[j])\n # when need j+=1: sign = 1\n sign = 0\n if (nums[j] + nums[k]) < -nums[i]:\n j += 1\n sign = 1\n elif (nums[j] + nums[k]) > -nums[i]:\n k -= 1\n else: #nums[j] + nums[k] == -nums[i]\n lst = [nums[i], nums[j], nums[k]]\n result.append(lst)\n j += 1\n k -= 1\n sign = 1\n if sign == 1:\n # if nums[j] in unique_local: j++\n while j < length and nums[j] in unique_local:\n j += 1\n return result","def multi_1(cur,p,n):\n\tr=p\n\tfor k in range(0,n-1):\n\t\tr=sum(cur,r,p)\n\treturn r","def no_math_solution(n: int):\n # After 2 (the second fibonacci number), every third number is even\n if(n < 2):\n return 0\n fibs = [2, 3, 5]\n sum = 0\n while(fibs[0] <= n):\n sum += fibs[0]\n fibs[0] = fibs[1] + fibs[2]\n fibs[1] = fibs[0] + fibs[2]\n fibs[2] = fibs[0] + fibs[1]\n return sum","def sum_multiples(num):\n pass","def cube_sum(i):\r\n return sum([i ** 3 for i in integer_to_digits(i)])","def test_bigSum():\n\n assert bigSum() == 20000000100000000","def problem9_naive(n):\n for a in range(4, n, 4):\n for b in range(3, n - a):\n c = n - a - b\n if a ** 2 + b ** 2 == c ** 2:\n return a * b * c\n return None","def lucas(n):\n lucval = sum_series(n, 2, 1)\n print(lucval)\n return lucval","def problem001():\n\n sum = 0\n for i in range(199):\n i += 1\n if i % 3 == 0:\n continue\n sum += i*5;\n for i in range(333):\n i += 1\n sum += i*3\n print sum\n\n sum = 0\n for i in range(999):\n i += 1\n if (i % 3 == 0 or i % 5 == 0):\n sum += i\n print sum\n\n print reduce(lambda x,y: x+y, filter(lambda n: n%3==0 or n%5==0, range(1000)))\n #arithmetic progressions\n #http://en.wikipedia.org/wiki/Arithmetic_progression\n x = 1000;\n print 1.5*(int)((x-1)/3)*(int)((x+2)/3) + 2.5*(int)((x-1)/5)*(int)((x+4)/5) - 7.5*(int)((x-1)/15)*(int)((x+14)/15);","def sum_of_nth( n ):\n if n > 0:\n return sum( range(n + 1) )\n else:\n return 0","def solution(number):\n\n # a is a list with all the numbers below input that are multiples of 3 or 5\n a = [x for x in range(1,number) if x % 3 == 0 or x % 5 == 0]\n return sum(a)","def sumTotal(n):\n\n sum_total = 0\n\n for i in range(1, n+1):\n sum_total = sum_total + i\n\n return sum_total","def processPart2(inputs):\n total = 0\n inputs = inputs if type(inputs) is list else [inputs]\n for input in inputs:\n [a, b, c] = sorted(map(int, input.split('x')))\n total = total + (a * 2 + b * 2 + (a * b * c))\n return total","def summation(self):\n return sum(self.read_ints())","def fakultet (n = 1):\n sum = 1\n for i in range(n, 1, -1):\n sum *= i\n return sum","def solution2(n):\n if n == 0:\n return []\n m = int(math.floor(math.sqrt(n))**2)\n return [m] + solution2(n - m)","def binomial_coefficient3(n, k):\n return reduce(lambda a, b: a * (n - b) / (b + 1), xrange(k), 1)","def solution1(n):\n res = []\n while n > 0:\n m = int(math.floor(math.sqrt(n))**2)\n res.append(m)\n n -= m\n return res","def problem2(m, p):\n total = 0\n for k in range(m, m ** p):\n if is_prime(k):\n total = total + sum_of_digits(k)\n return total","def integer_sum(n):\n\n sum = 0\n k = 0\n\n # INVARIANT\n # The sum of far is equal to the sum of the first k integer numbers\n # VARIANT: n-k\n #\n while (k!=n):\n k += 1\n sum += k\n\n return sum","def create_sum(length, n, take='take'):\n\n\tresult = []\n\t# Generate n sums.\n\tfor j in range(n):\n\t\tfirst = []\n\t\tsecond = []\n\t\t# Generate a random number of <length> digits.\n\t\tfor i in range(length):\n\t\t\tfirst.append(random.randint(0,9))\n\t\t# Generate a random number of <length> digits.\n\t\tfor dig in first:\n\t\t\t# If take / carry is allowed, second number is purely random.\n\t\t\tif take == 'take':\n\t\t\t\tsecond.append(random.randint(0,9))\n\t\t\t# If take / carry is not allowed, second number is restricted so that its addition does not cross 9.\n\t\t\telse:\n\t\t\t\tsecond.append(random.randint(0,9-dig))\n\t\t# Convert from list of numbers to strings.\n\t\tdig1 = num_to_str(first)\n\t\tdig2 = num_to_str(second)\n\t\t# Append to the result.\n\t\tresult.append((dig1, dig2))\n\t# Return the result.\n\treturn result","def sum_to(n):\n the_sum = 0\n for counter in range(n+1):\n the_sum = the_sum + counter\n return the_sum","def test_twoSum(self):\n self.assertEqual(twoSum([2, 7, 11, 15], 9), [0, 1])","def binary_sums(start, limit):\n for n in range(start, limit):\n for i in range(1, n/2 + 1):\n yield i, n - i","def solution(n):\n total = sum(\n [\n i\n for i in range(1, n)\n if sum_of_divisors(sum_of_divisors(i)) == i and sum_of_divisors(i) != i\n ]\n )\n return total","def sum_series(n, a=0, b=1):\n\tseq = []\n\tnth_term = 0\n\t\n\tfor i in range(0,n+1):\n\t\tif i == 0:\n\t\t\tseq.append(a)\n\t\tif i == 1:\n\t\t\tseq.append(b)\n\t\tif i > 1:\n\t\t\tnth_term = seq[-1] + seq[-2]\n\t\t\tseq.append(nth_term)\n\t\n\tprint(seq)\n\tprint(seq[n])\n\treturn(seq[n])","def fn(n):\n if n == 0: return 1\n return sum(fn(i)*fn(n-i-1) for i in range(n))","def q3(array):\n a = array[1]\n b = array[6]\n c = array[11]\n d = array[12]\n a1 = roll(a, 00) + roll(b, 00) + roll(b, 12) + roll(c, 12) + roll(d, 28) + roll(a, 28) + roll(b, 28)\n b1 = roll(b, 19) + roll(c, 19) + roll(d, 3) + roll(a, 3) + roll(b, 3) + roll(c, 7) + roll(d, 23) + roll(a,\n 23) + roll(\n b, 23) + roll(a, 15) + roll(b, 15) + roll(b, 27) + roll(c, 27) + roll(d, 11) + roll(a, 11) + roll(b, 11) + roll(\n d, 31) + roll(a, 31) + roll(b, 31)\n c1 = roll(c, 0) + roll(d, 16) + roll(a, 16) + roll(b, 16) + roll(a, 8) + roll(b, 8) + roll(b, 20) + roll(c,\n 20) + roll(\n d, 4) + roll(a, 4) + roll(b, 4) + roll(d, 24) + roll(a, 24) + roll(b, 24)\n d1 = roll(a, 8) + roll(b, 8) + roll(b, 20) + roll(c, 20) + roll(d, 4) + roll(a, 4) + roll(b, 4) + roll(d,\n 24) + roll(a,\n 24) + roll(\n b, 24)\n\n return array[0], a1, array[2], array[3], array[4], array[5], b1, array[7], array[8], array[9], array[10], c1, d1, \\\n array[\n 13], array[14], array[15]","def sum_square_difference(n):\n\tdifference = (n-1)*(n)*(n+1)*(3*n+2)/12\n\treturn difference","def add_numbers(arr1: StaticArray, arr2: StaticArray) -> StaticArray:\n num_1 = 0\n num_2 = 0\n length_1 = arr1.size()\n length_2 = arr2.size()\n\n # converts each array to a single number\n for index in range(arr1.size()):\n num_1 += arr1[index] * (10 ** (length_1 - index))\n for index in range(arr2.size()):\n num_2 += arr2[index] * (10 ** (length_2 - index))\n result = num_1 + num_2\n\n # sets the length equal to the largest array\n if length_1 > length_2:\n length = length_1\n else:\n length = length_2\n\n # creates a result array\n result_arr = StaticArray(length)\n result_arr_index = 0 # keep track of the next open position\n # loops to constantly divide the resulting sum by 10 to break the sum into individual digit elements\n while result > 0:\n num_3 = result / (10 ** length)\n if num_3 == 10:\n num_3 = 0\n elif num_3 > 10:\n # if element overflows, creates a new temp array to transfer to the new result array\n working_arr = StaticArray(result_arr.size() + 1)\n for index in range(result_arr.size()):\n working_arr.set(index, result_arr[index])\n result_arr = StaticArray(working_arr.size())\n for index in range(working_arr.size()):\n result_arr.set(index, working_arr[index])\n num_3 /= 10\n length += 1 # increases the base position to account for > 10\n # records resulting element in result array\n num_3 = int(num_3)\n result_arr.set(result_arr_index, num_3)\n result_arr_index += 1\n # reduces the sum by the amount taken out\n num_4 = num_3 * (10 ** length)\n result -= num_4\n length -= 1 # decreases the base position\n\n # replaces None values with zeros\n for index in range(result_arr.size()):\n if result_arr[index] is None:\n result_arr.set(index, 0)\n\n return result_arr","def create_array( n ):","def compute(n):\n if n == 1:\n return 1\n else:\n i = find_i(n)\n return 2 * compute(n - i) + 2 ** i - 1","def six():\r\n \r\n sum_squared = 0\r\n squared_sum = 0\r\n \r\n for i in range(1, 101):\r\n sum_squared += i**2\r\n squared_sum += i\r\n squared_sum = squared_sum**2\r\n \r\n return squared_sum - sum_squared","def solveProblem021():\n total = 0\n for i in range(2, 10000):\n divs = getProperDivisors(i)\n s = sum(divs)\n # Skip stuff greater than, we'll get to it later if it's less than max.\n if s > i:\n continue\n if s == i:\n continue\n t = sum(getProperDivisors(s))\n if t == i:\n total = total + i + s\n print(\"The Sum is: %d\" % (total,))","def get_3_5_sum(num):\n nums = range(num)\n mults = [num for num in nums if (num % 3 == 0 or num % 5 == 0)]\n return sum(mults)","def threeSumMulti(self, arr: List[int], target: int) -> int:\n # Solution 1 - 4992 ms\n # Solution 2 - 60 ms\n c = collections.Counter(arr)\n\n res = 0\n if target % 3 == 0:\n n = c.get(target // 3, 0)\n res += n * (n - 1) * (n - 2) // 6\n\n keys = sorted(c.keys())\n for k in keys:\n n = c[k]\n if n > 1 and target > k != target - 2 * k:\n res += c.get(target - 2 * k, 0) * n * (n - 1) // 2\n\n for i in range(len(keys)):\n if keys[i] >= target // 3: break\n for j in range(i + 1, len(keys)):\n new = target - (keys[i] + keys[j])\n if new <= keys[j]: break\n if new in c:\n res += c[keys[i]] * c[keys[j]] * c[new]\n\n return res % (10 ** 9 + 7)","def main():\n\n import sys\n sys.setrecursionlimit(10**7)\n from itertools import accumulate, combinations, permutations, product # https://docs.python.org/ja/3/library/itertools.html\n # accumulate() returns iterator! to get list: list(accumulate())\n from math import factorial, ceil, floor\n def factorize(n):\n \"\"\"return the factors of the Arg and count of each factor\n \n Args:\n n (long): number to be resolved into factors\n \n Returns:\n list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]\n \"\"\"\n fct = [] # prime factor\n b, e = 2, 0 # base, exponent\n while b * b <= n:\n while n % b == 0:\n n = n // b\n e = e + 1\n if e > 0:\n fct.append((b, e))\n b, e = b + 1, 0\n if n > 1:\n fct.append((n, 1))\n return fct\n def combinations_count(n, r):\n \"\"\"Return the number of selecting r pieces of items from n kinds of items.\n \n Args:\n n (long): number\n r (long): number\n \n Raises:\n Exception: not defined when n or r is negative\n \n Returns:\n long: number\n \"\"\"\n # TODO: How should I do when n - r is negative?\n if n < 0 or r < 0:\n raise Exception('combinations_count(n, r) not defined when n or r is negative')\n if n - r < r: r = n - r\n if r < 0: return 0\n if r == 0: return 1\n if r == 1: return n\n numerator = [n - r + k + 1 for k in range(r)]\n denominator = [k + 1 for k in range(r)]\n for p in range(2,r+1):\n pivot = denominator[p - 1]\n if pivot > 1:\n offset = (n - r) % p\n for k in range(p-1,r,p):\n numerator[k - offset] /= pivot\n denominator[k] /= pivot\n result = 1\n for k in range(r):\n if numerator[k] > 1:\n result *= int(numerator[k])\n return result\n def combinations_with_replacement_count(n, r):\n \"\"\"Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.\n \n Args:\n n (long): number\n r (long): number\n \n Raises:\n Exception: not defined when n or r is negative\n \n Returns:\n long: number\n \"\"\"\n if n < 0 or r < 0:\n raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')\n elif n == 0:\n return 1\n else:\n return combinations_count(n + r - 1, r)\n from bisect import bisect_left, bisect_right\n from collections import deque, Counter, defaultdict # https://docs.python.org/ja/3/library/collections.html#collections.deque\n from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest # https://docs.python.org/ja/3/library/heapq.html\n from copy import deepcopy, copy # https://docs.python.org/ja/3/library/copy.html\n from operator import itemgetter\n # ex1: List.sort(key=itemgetter(1))\n # ex2: sorted(tuples, key=itemgetter(1,2))\n from functools import reduce\n def chmin(x, y):\n \"\"\"change minimum\n if x > y, x = y and return (x, True).\n convenient when solving problems of dp[i]\n \n Args:\n x (long): current minimum value\n y (long): potential minimum value\n \n Returns:\n (x, bool): (x, True) when updated, else (x, False)\n \"\"\"\n if x > y:\n x = y\n return (x, True)\n else:\n return (x, False)\n def chmax(x, y):\n \"\"\"change maximum\n if x < y, x = y and return (x, True).\n convenient when solving problems of dp[i]\n \n Args:\n x (long): current maximum value\n y (long): potential maximum value\n \n Returns:\n (x, bool): (x, True) when updated, else (x, False)\n \"\"\"\n if x < y:\n x = y\n return (x, True)\n else:\n return (x, False)\n\n from fractions import gcd # Deprecated since version 3.5: Use math.gcd() instead.\n def gcds(numbers):\n return reduce(gcd, numbers)\n def lcm(x, y):\n return (x * y) // gcd(x, y)\n def lcms(numbers):\n return reduce(lcm, numbers, 1)\n\n # first create factorial_list\n # fac_list = mod_factorial_list(n)\n INF = 10 ** 18\n MOD = 10 ** 9 + 7\n modpow = lambda a, n, p = MOD: pow(a, n, p) # Recursive function in python is slow!\n def modinv(a, p = MOD):\n # evaluate reciprocal using Fermat's little theorem:\n # a**(p-1) is identical to 1 (mod p) when a and p is coprime\n return modpow(a, p-2, p)\n def modinv_list(n, p = MOD):\n if n <= 1:\n return [0,1][:n+1]\n else:\n inv_t = [0,1]\n for i in range(2, n+1):\n inv_t += [inv_t[p % i] * (p - int(p / i)) % p]\n return inv_t\n def modfactorial_list(n, p = MOD):\n if n == 0:\n return [1]\n else:\n l = [0] * (n+1)\n tmp = 1\n for i in range(1, n+1):\n tmp = tmp * i % p\n l[i] = tmp\n return l\n def modcomb(n, k, fac_list = [], p = MOD):\n # fac_list = modfactorial_list(100)\n # print(modcomb(100, 5, modfactorial_list(100)))\n from math import factorial\n if n < 0 or k < 0 or n < k: return 0\n if n == 0 or k == 0: return 1\n if len(fac_list) <= n:\n a = factorial(n) % p\n b = factorial(k) % p\n c = factorial(n-k) % p\n else:\n a = fac_list[n]\n b = fac_list[k]\n c = fac_list[n-k]\n return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p\n def modadd(a, b, p = MOD):\n return (a + b) % MOD\n def modsub(a, b, p = MOD):\n return (a - b) % p\n def modmul(a, b, p = MOD):\n return ((a % p) * (b % p)) % p\n def moddiv(a, b, p = MOD):\n return modmul(a, modpow(b, p-2, p))\n\n \"\"\" initialize variables and set inputs\n # initialize variables\n # to initialize list, use [0] * n\n # to initialize two dimentional array, use [[0] * N for _ in range(N)]\n # set inputs\n # open(0).read() is a convenient method:\n # ex) n, m, *x = map(int, open(0).read().split())\n # min(x[::2]) - max(x[1::2])\n # ex2) *x, = map(int, open(0).read().split())\n # don't forget to add comma after *x if only one variable is used\n # preprocessing\n # transpose = [x for x in zip(*data)]\n # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [(1, 4, 7), (2, 5, 8), (3, 6, 9)]\n # flat = [flatten for inner in data for flatten in inner]\n # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [1, 2, 3, 4, 5, 6, 7, 8, 9]\n # calculate and output\n # output pattern\n # ex1) print(*l) => when l = [2, 5, 6], printed 2 5 6\n \"\"\"\n\n # functions used\n r = lambda: sys.stdin.readline().strip()\n r_int = lambda: int(r())\n R = lambda: list(map(int, r().split()))\n Rfloat = lambda: list(map(float, r().split()))\n Rtuple = lambda: tuple(map(int, r().split()))\n Rmap = lambda: map(int, r().split())\n\n \"\"\" how to treat input\n # single int: int(r())\n # single string: r()\n # single float: float(r())\n # line int: R()\n # line string: r().split()\n # line (str, int, int): [j if i == 0 else int(j) for i, j in enumerate(r().split())]\n # lines int: [R() for _ in range(n)]\n \"\"\"\n\n # main\n N, Q = R()\n STX = [R() for _ in range(N)]\n STX.sort(key=itemgetter(2))\n\n D = [int(r()) for _ in range(Q)]\n Stopped = [-1] * Q\n ans = [-1] * Q\n\n for s, t, x in STX:\n l = bisect_left(D, s-x)\n r = bisect_left(D,t-x)\n a = l\n while a < r:\n if Stopped[a] == -1:\n ans[a] = x\n Stopped[a] = r\n a += 1\n else:\n a = Stopped[a]\n\n for i in ans:\n print(i)\n\n \"\"\"memo: how to use defaultdict of list\n # initialize\n Dic = defaultdict(list)\n # append / extend\n Dic[x].append(y)\n # for\n for k, v in Dic.items():\n \"\"\"","def n_suma(a1,nr_wyrazu,r):\n return (2*a1+(nr_wyrazu-1))*nr_wyrazu/2","def sum_to_n(n):\n total = 0\n for i in range(1,n+1):\n total += i\n return total","def threeSumMulti(self, A: List[int], target: int) -> int:\n counter = defaultdict(int)\n for a in A:\n counter[a] += 1\n\n keys = list(counter.keys())\n keys.sort()\n n = len(keys)\n ret = 0\n for i in range(n):\n j = i # not i + 1\n k = n - 1\n while j <= k: # not <\n a, b, c = keys[i], keys[j], keys[k]\n if b + c < target - a:\n j += 1\n elif b + c > target - a:\n k -= 1\n else: # equal\n if a < b < c:\n ret += counter[a] * counter[b] * counter[c]\n elif a == b < c:\n # nC2\n ret += counter[a] * (counter[a] - 1) // 2 * counter[c]\n elif a < b == c:\n ret += counter[a] * counter[b] * (counter[b] - 1) // 2\n elif a== b == c:\n # nC3\n ret += counter[a] * (counter[a] - 1) * (counter[a] - 2) // (3 * 2)\n else:\n raise\n\n ret %= MOD\n j += 1\n k -= 1\n\n return ret","def sol(n, mem):\n if mem[n] != -1:\n return mem[n]\n \n mem[n] = 0\n for i in range(2, n+1):\n mem[n]+=sol(n-i, mem)*sol(i-2, mem)\n \n return mem[n]","def get_integers(n: int) -> int:\n l = [int(sqrt(n))]\n val = l[0] * l[0]\n index = 0\n while val != n:\n val = sum([x*x for x in l])\n if val > n:\n l[index] -= 1\n elif val < n:\n index += 1\n l.append(l[index - 1])\n\n return len(l)","def crea_cubi(n):\n lst = []\n for i in range(1, n + 1):\n lst = lst + [i**3]\n return lst","def lucas(n):\n\t'''\n\tlucL1=1\n\tlucL2=2\n\tif n<0:\n\t\tprint(\"please enter positive int value\")\n\n\telif n==0:\n\t\treturn 2\n\n\telif n==1:\n\t\treturn 1\n\n\telse:\n\t\tfor i in range(n-1):\n\t\t\tlucC=lucL1+lucL2\n\t\t\tlucL2=lucL1\n\t\t\tlucL1=lucC\n\t\treturn lucC\n\t'''\n\treturn sum_series(n,2,1)"],"string":"[\n \"def sum_of_three_squares(n):\\n special = {1:(1, 0, 0), 2:(1, 1, 0), 3:(1, 1, 1), 10: (1, 3, 0), 34: (3, 3, 4), 58:(3, 7, 0),\\n 85:(6, 7, 0), 130:(3, 11, 0), 214:(3, 6, 13), 226:(8, 9, 9), 370:(8, 9, 15),\\n 526:(6, 7, 21), 706:(15, 15, 16), 730:(1, 27, 0), 1414:(6, 17, 33), 1906:(13, 21, 36),\\n 2986: (21, 32, 39), 9634: (56, 57, 57)}\\n\\n v = 0\\n\\n if n == 0:\\n return (0, 0, 0)\\n\\n v = multiplicity(4, n)\\n n //= 4**v\\n\\n if n % 8 == 7:\\n return\\n\\n if n in special.keys():\\n x, y, z = special[n]\\n return _sorted_tuple(2**v*x, 2**v*y, 2**v*z)\\n\\n s, _exact = integer_nthroot(n, 2)\\n\\n if _exact:\\n return (2**v*s, 0, 0)\\n\\n x = None\\n\\n if n % 8 == 3:\\n s = s if _odd(s) else s - 1\\n\\n for x in range(s, -1, -2):\\n N = (n - x**2) // 2\\n if isprime(N):\\n y, z = prime_as_sum_of_two_squares(N)\\n return _sorted_tuple(2**v*x, 2**v*(y + z), 2**v*abs(y - z))\\n return\\n\\n if n % 8 in (2, 6):\\n s = s if _odd(s) else s - 1\\n else:\\n s = s - 1 if _odd(s) else s\\n\\n for x in range(s, -1, -2):\\n N = n - x**2\\n if isprime(N):\\n y, z = prime_as_sum_of_two_squares(N)\\n return _sorted_tuple(2**v*x, 2**v*y, 2**v*z)\",\n \"def solution(nums):\\n solution = Solution()\\n output = solution.threeSum(nums)\\n\\n print(output)\",\n \"def totalSolutions(n:int):\\n\\n memo = [0]*6\\n memo[5] = 1\\n if n == 1:\\n return 1\\n\\n for i in range(n):\\n solutions = sum(memo)\\n memo.pop(0)\\n memo.append(solutions)\\n\\n return memo.pop()\",\n \"def problem(args:int) -> int:\\r\\n\\ta, b, c = 1, 2, 0\\r\\n\\tresult = [a]\\r\\n\\twhile c <= args:\\r\\n\\t\\tc = a + b\\r\\n\\t\\ta = b\\r\\n\\t\\tb = c\\r\\n\\t\\tresult.append(a)\\r\\n\\tresult = np.array(result)\\r\\n\\treturn sum(result[result % 2 == 0])\",\n \"def problem():\\n size = 1001\\n return sum(n**2 * 4 - 6 * n + 6 for n in range(3, size+1, 2)) + 1\",\n \"def three_sum(nums: [int]) -> [[int]]:\\n check_validity(nums, 0, repetitive_numbers=True)\\n if len(nums) <= 2 or not nums:\\n return []\\n nums.sort()\\n result = []\\n for i in range(len(nums)):\\n left = i\\n middle = left + 1\\n right = len(nums) - 1\\n while left < right and middle < right:\\n first = nums[left]\\n second = nums[middle]\\n third = nums[right]\\n if first + second + third > 0:\\n right -= 1\\n continue\\n elif first + second + third == 0 and [first, second, third] not in result:\\n result.append([first, second, third])\\n middle += 1\\n return result\",\n \"def test_suite():\\n test(sum_all_elements([1,3,1,4,3,8]) == 5)\\n test(sum_all_elements([1,3,5,7]) == 16)\\n test(sum_all_elements([1, -7, 10, 23]) == -6)\\n test(sum_all_elements(range(1,555,2)) == 76729)\",\n \"def main(n):\\n return sum(f(i) for i in xrange(n))\",\n \"def problem1():\\n return sum(i for i in range(1000) if i % 3 == 0 or i % 5 == 0)\",\n \"def multiples_sum_3_5(n):\\n\\tsum = 0\\n\\tfor x in range(1,n):\\n\\t\\tif (x%3==0) or (x%5==0):\\n\\t\\t\\tsum += x\\n\\treturn sum\",\n \"def sumOfSquares(n):\\n sumVars = []\\n for x in range(1,n+1):\\n sumVars.append(x**2)\\n return sumVars\",\n \"def solve(n=4 * 10**6):\\r\\n target_sum = 0\\r\\n fib_sequence = fibonacci_generator()\\r\\n for num in fib_sequence:\\r\\n if num >= n:\\r\\n break\\r\\n\\r\\n if num % 2 == 0:\\r\\n target_sum += num\\r\\n\\r\\n return target_sum\",\n \"def solution(n: int = 28123) -> int:\\n\\n nums = range(1, n+1)\\n abundant = list(filter(is_abundant, nums))\\n abundant_sums = set(all_sums(abundant, n))\\n fit = set(nums) - abundant_sums\\n return fit\",\n \"def solution3(n):\\n res = []\\n while n > 0:\\n m = int(math.sqrt(n))**2\\n res.append(m)\\n n -= m\\n return res\",\n \"def sumTo(n):\\n\\n sum_all = (n * (n+1))/2\\n\\n return sum_all\",\n \"def test_large_sum(self):\\n for n in [10, 20, 30, 40, 50]:\\n A = np.arange(n*n)\\n A = np.reshape(A, (n, n))\\n x = Variable(n, n)\\n p = Problem(Minimize(at.sum_entries(x)), [x >= A])\\n result = p.solve()\\n answer = n*n*(n*n+1)/2 - n*n\\n print(result - answer)\\n self.assertAlmostEqual(result, answer)\",\n \"def task_8_sum_of_ints(data: List[int]) -> int:\\n return sum(data)\",\n \"def row_sum_odd_numbers(n):\\n return n**3\",\n \"def get_squares(n):\\n\\n return sum([i * i for i in range(n)])\",\n \"def sum_of_squares(n):\\n result = i = 0\\n while i < n:\\n result += i\\n i += 1\\n return result\",\n \"def minOperations(n):\\n if type(n) is not int or n < 2:\\n return 0\\n\\n summation = []\\n\\n while n % 2 == 0:\\n summation.append(2)\\n n = n // 2\\n\\n for i in range(3, n + 1, 2):\\n while n % i == 0:\\n summation.append(i)\\n n = n // i\\n\\n return (sum(summation))\",\n \"def exercise2():\\n # You _DO_NOT_ need to modify this code for Lab 10.\\n n = easygui.integerbox( \\\"Enter n:\\\", \\\"Input\\\", lowerbound=0, upperbound=2 ** 31 )\\n\\n s = summation( n, 1 )\\n f = n * ( n + 1 ) // 2\\n easygui.msgbox( \\\"n = {}, summation( n, 1 ) = {}, formula result = {}\\\".format( n, s, f ) )\\n\\n s = summation( n, 2 )\\n f = n * ( n + 1 ) * ( 2 * n + 1 ) // 6\\n easygui.msgbox( \\\"n = {}, summation( n, 2 ) = {}, formula result = {}\\\".format( n, s, f ) )\\n\\n s = summation( n, 3 )\\n f = ( n * ( n + 1 ) // 2 ) ** 2\\n easygui.msgbox( \\\"n = {}, summation( n, 3 ) = {}, formula result = {}\\\".format( n, s, f ) )\",\n \"def test_sum(n, m, o, result):\\n from series import sum_series\\n assert sum_series(n, m, o) == result\",\n \"def solve(n=10):\\n return sum(M_N_S(n, d)[2] for d in range(10))\",\n \"def solution(n):\\n i = 1\\n j = 2\\n sum = 0\\n while j <= n:\\n if j % 2 == 0:\\n sum += j\\n i, j = j, i + j\\n\\n return sum\",\n \"def sum_of_squares(n, k, zeros=False):\\n yield from power_representation(n, 2, k, zeros)\",\n \"def get_solution():\\n return jnp.sum(jnp.arange(10))\",\n \"def sum_of_squares(n):\\n sum = 0\\n\\n for i in range(0,n):\\n sum += i*i\\n\\n return sum\",\n \"def three_sum(nums: List[int]) -> List[List[int]]:\\n\\n size = len(nums)\\n res = list()\\n if size < 3:\\n return res\\n #\\n\\n nums.sort()\\n seen_dict = dict()\\n for i in range(size - 2):\\n num = nums[i]\\n if num in seen_dict:\\n continue\\n #\\n seen_dict[num] = 1\\n two_sum_res = two_sum(nums, i + 1, -num)\\n for item in two_sum_res:\\n item.append(num)\\n item.sort()\\n res.append(item)\\n #\\n #\\n return res\",\n \"def summation( n, exponent ):\\n result = 0\\n num = 1\\n while num < n + 1:\\n result += num ** exponent\\n num += 1\\n return result\",\n \"def sum_of_squares(n):\\n return (n * (n+1) * (2*n + 1)) / 6\",\n \"def test_sum_of_long_array():\\n assert find_maximal_subarray_sum([1, 3, -1, -3, 5, 3, 6, 7], 3) == 16\",\n \"def triangular_number_solution():\\n return 5 * partial_sum(199) + 3 * partial_sum(333) - 15 * partial_sum(66)\",\n \"def square_of_sum(n):\\n return ((n * (n+1)) / 2)**2\",\n \"def test_sum_pos_3() -> None:\\n # 2nd step - 3rd square\\n assert nth(sw.sum_walk(), 1) == 2\",\n \"def summation_i_squared(n):\\n if (type(n) is not int) or (n is None) or (n < 1):\\n return None\\n else:\\n numbers = range(1, n + 1)\\n result = 0\\n result = map(lambda i: i ** 2, numbers)\\n return sum(result)\",\n \"def solution(resources, args):\\n retval = 0\\n repeats = [3, 5, 6, 9, 10, 12, 15]\\n\\n i = 0\\n n = args.number - 1\\n\\n while n > 15:\\n retval += sum(repeats)\\n retval += 15*len(repeats)*i\\n n -= 15\\n i += 1\\n while n >= 3:\\n if n % 3 == 0 or n % 5 == 0:\\n retval += 15*i + n\\n n -= 1\\n return retval\",\n \"def binaire(x,n):\\n a,q = [],0\\n \\n for i in range(n):\\n q = x%2\\n x //=2\\n a = [q] + a\\n \\n return(a)\",\n \"def solution(n: int) -> int:\\n sizearr = n + 1\\n\\n # create zero-filled multi_arr\\n multi_arr = [[0 for x in range(sizearr)] for n in range(sizearr)]\\n\\n # base value is always skipped after being padded\\n multi_arr[0][0] = 1\\n for last in range(1, sizearr):\\n for next in range(0, sizearr):\\n multi_arr[last][next] = multi_arr[last - 1][next]\\n if next >= last:\\n multi_arr[last][next] += multi_arr[last - 1][next - last]\\n\\n return multi_arr[n][n] - 1\",\n \"def game_nim_sum():\\n global piles\\n global num_piles \\n nim_sum = 0\\n for x in piles:\\n nim_sum = nim_sum^x\\n \\n return nim_sum\",\n \"def multi_2(cur,p,n):\\n\\tr=p\\n\\twhile n>1:\\n\\t\\tr=sum(cur,r,p)\\n\\t\\tn-=1\\n\\treturn r\",\n \"def checkio(array):\\n sums = 0\\n answer = 0\\n if not array:\\n return 0\\n even_array = array[::2]\\n for i in even_array:\\n sums += i\\n answer = sums * array[-1]\\n return answer\",\n \"def arrayManipulation_brute(n, queries):\\n arr = [0] * n\\n\\n for i, row in enumerate(queries):\\n a, b, k = row[0], row[1], row[2]\\n for j in range(a - 1, b):\\n arr[j] = arr[j] + k\\n print(f'array size {arr.__sizeof__()/1000000}')\\n return max(arr)\",\n \"def level_sums(n,r,s):\\n# from numpy import zeros\\n from copy import copy\\n OutSet=[]\\n# a=zeros(r,int)\\n a=[0 for i in range(r)]\\n if(s):\\n t=n\\n h=-1\\n a[0]=n\\n s=False\\n OutSet.append(copy(a))\\n else:\\n return OutSet \\n while (a[r-1] != n):\\n if(1<t):\\n h=-1\\n h+=1\\n t=a[h]\\n a[h]=0\\n a[0]=t-1\\n a[h+1]+=1\\n OutSet.append(copy(a))\\n else:\\n return OutSet\",\n \"def __init__(self, nums):\\n self.sums,tmp =[],0\\n for n in nums:\\n tmp +=n\\n self.sums.append(tmp)\",\n \"def total(n):\\n if n < 0:\\n return None\\n else:\\n result = 0\\n for i in range(n + 1):\\n result += i\\n return result\",\n \"def total(n):\\n if n < 0:\\n return None\\n else:\\n result = 0\\n for i in range(n + 1):\\n result += i\\n return result\",\n \"def solve():\\n sum_of_squares = 0\\n for i in range(1, 101):\\n sum_of_squares += i * i\\n square_of_sum = sum(range(1, 101)) ** 2\\n return square_of_sum - sum_of_squares\",\n \"def sum3(nums):\\n count = 0\\n for num in nums:\\n count += num\\n return count\",\n \"def main(l, k):\\n S = 0\\n T = product(xrange(2), repeat=k)\\n for ts in T:\\n tmp = []\\n\\n for t, c in zip(ts, cs):\\n tmp.append(((-1)*c)**t)\\n\\n S += (sum(tmp)**l)\\n val = (sum(tmp)**l)\\n print val\\n return S / float(2**(k))\",\n \"def main(l, k):\\n S = 0\\n T = product(xrange(2), repeat=k)\\n for ts in T:\\n tmp = []\\n\\n for t, c in zip(ts, cs):\\n tmp.append(((-1)*c)**t)\\n\\n S += (sum(tmp)**l)\\n val = (sum(tmp)**l)\\n print val\\n return S / float(2**(k))\",\n \"def sum_n_m(n, m):\\n total = 0\\n for i in range(n, m+1):\\n total += i\\n return total\",\n \"def evansPerfectNumbers(n):\\n assert n>1\\n perfect = []\\n for i in range(1,n+1):\\n sums = 0\\n for j in range(1,i):\\n sums += evansMod(i,j)*j\\n if sums == i:\\n perfect.append(i)\\n #print(perfect) #for testing only\\n return perfect\",\n \"def get_total_complexity(n):\\n total = 0\\n for i in range(1, n + 1):\\n total += get_complexity(i)\\n return total\",\n \"def test_results():\\n x = 0.5\\n np.testing.assert_almost_equal(nbf.sum_x_n_calc(\\n x, z_n, k_n_1), npf.sum_x_n_calc(x, z_n, k_n_1))\",\n \"def aks( n ):\\n\\n def aks_mod( polynomial , r ):\\n \\\"\\\"\\\"\\n This function is used in aks.\\n polynomial modulo ( x^r - 1 )\\n \\\"\\\"\\\"\\n aks_mod = polynomial.coefficients\\n total = aks_mod[ : r ]\\n aks_mod = aks_mod[ r : ]\\n while len(aks_mod) - 1 >= r :\\n for i in range(r):\\n total[i] += aks_mod[i]\\n aks_mod = aks_mod[ r : ]\\n for i in range(len(aks_mod)):\\n total[i] += aks_mod[i]\\n return array_poly_mod( total , polynomial.mod )\\n\\n lg = math.log( n , 2 )\\n k = int( lg * lg )\\n\\n if arith1.powerDetection( n )[ 1 ] != 1: #Power Detection\\n print(\\\" n is not prime \\\")\\n return False\\n\\n start = 3\\n while 1:\\n d = arith1.gcd.gcd( start , n )\\n if 1 < d < n:\\n print(\\\"n is not prime\\\")\\n return False\\n x = n % start\\n N = x\\n for i in range( 1 , k + 1 ):\\n if N == 1:\\n break\\n N = ( N * x ) % start\\n if i == k:\\n r = start\\n break\\n start += 1\\n d = arith1.gcd.gcd( r , n )\\n if 1 < d < n:\\n print(\\\" n is not prime \\\")\\n return False\\n if n <= r:\\n print(\\\" n is prime \\\")\\n return True\\n\\n e = multiplicative.euler( r ) #Cyclotomic Conguence\\n e = math.sqrt( e )\\n e = int( e * lg )\\n for b in range( 1 , e+1 ):\\n f = array_poly_mod( [ b , 1 ] , n )\\n total = array_poly_mod( [ 1 ] , n )\\n count = n\\n while count > 0:\\n if count & 1:\\n total = total * f\\n total = aks_mod( total , r )\\n f = f.power()\\n f = aks_mod( f , r )\\n count = count >> 1\\n total_poly = total.coefficients_to_dict()\\n if total_poly != { 0 : b , n % r : 1 }:\\n print(\\\" n is not prime \\\")\\n return False\\n print(\\\" n is prime \\\")\\n return True\",\n \"def test_safe_sum_p_log_p(self):\\r\\n m = array([2, 4, 0, 8])\\r\\n self.assertEqual(safe_sum_p_log_p(m, 2), 2 * 1 + 4 * 2 + 8 * 3)\",\n \"def threeSum(self, nums):\\n # sort\\n nums.sort()\\n length = len(nums)\\n result = []\\n # get unique list\\n unique = set()\\n for i in xrange(length):\\n # if nums[i] exist in unique\\n if nums[i] in unique:\\n continue\\n else:\\n unique.add(nums[i])\\n j = i + 1\\n k = length - 1\\n # get unique nums[j]\\n unique_local = set()\\n while k > j:\\n unique_local.add(nums[j])\\n # when need j+=1: sign = 1\\n sign = 0\\n if (nums[j] + nums[k]) < -nums[i]:\\n j += 1\\n sign = 1\\n elif (nums[j] + nums[k]) > -nums[i]:\\n k -= 1\\n else: #nums[j] + nums[k] == -nums[i]\\n lst = [nums[i], nums[j], nums[k]]\\n result.append(lst)\\n j += 1\\n k -= 1\\n sign = 1\\n if sign == 1:\\n # if nums[j] in unique_local: j++\\n while j < length and nums[j] in unique_local:\\n j += 1\\n return result\",\n \"def multi_1(cur,p,n):\\n\\tr=p\\n\\tfor k in range(0,n-1):\\n\\t\\tr=sum(cur,r,p)\\n\\treturn r\",\n \"def no_math_solution(n: int):\\n # After 2 (the second fibonacci number), every third number is even\\n if(n < 2):\\n return 0\\n fibs = [2, 3, 5]\\n sum = 0\\n while(fibs[0] <= n):\\n sum += fibs[0]\\n fibs[0] = fibs[1] + fibs[2]\\n fibs[1] = fibs[0] + fibs[2]\\n fibs[2] = fibs[0] + fibs[1]\\n return sum\",\n \"def sum_multiples(num):\\n pass\",\n \"def cube_sum(i):\\r\\n return sum([i ** 3 for i in integer_to_digits(i)])\",\n \"def test_bigSum():\\n\\n assert bigSum() == 20000000100000000\",\n \"def problem9_naive(n):\\n for a in range(4, n, 4):\\n for b in range(3, n - a):\\n c = n - a - b\\n if a ** 2 + b ** 2 == c ** 2:\\n return a * b * c\\n return None\",\n \"def lucas(n):\\n lucval = sum_series(n, 2, 1)\\n print(lucval)\\n return lucval\",\n \"def problem001():\\n\\n sum = 0\\n for i in range(199):\\n i += 1\\n if i % 3 == 0:\\n continue\\n sum += i*5;\\n for i in range(333):\\n i += 1\\n sum += i*3\\n print sum\\n\\n sum = 0\\n for i in range(999):\\n i += 1\\n if (i % 3 == 0 or i % 5 == 0):\\n sum += i\\n print sum\\n\\n print reduce(lambda x,y: x+y, filter(lambda n: n%3==0 or n%5==0, range(1000)))\\n #arithmetic progressions\\n #http://en.wikipedia.org/wiki/Arithmetic_progression\\n x = 1000;\\n print 1.5*(int)((x-1)/3)*(int)((x+2)/3) + 2.5*(int)((x-1)/5)*(int)((x+4)/5) - 7.5*(int)((x-1)/15)*(int)((x+14)/15);\",\n \"def sum_of_nth( n ):\\n if n > 0:\\n return sum( range(n + 1) )\\n else:\\n return 0\",\n \"def solution(number):\\n\\n # a is a list with all the numbers below input that are multiples of 3 or 5\\n a = [x for x in range(1,number) if x % 3 == 0 or x % 5 == 0]\\n return sum(a)\",\n \"def sumTotal(n):\\n\\n sum_total = 0\\n\\n for i in range(1, n+1):\\n sum_total = sum_total + i\\n\\n return sum_total\",\n \"def processPart2(inputs):\\n total = 0\\n inputs = inputs if type(inputs) is list else [inputs]\\n for input in inputs:\\n [a, b, c] = sorted(map(int, input.split('x')))\\n total = total + (a * 2 + b * 2 + (a * b * c))\\n return total\",\n \"def summation(self):\\n return sum(self.read_ints())\",\n \"def fakultet (n = 1):\\n sum = 1\\n for i in range(n, 1, -1):\\n sum *= i\\n return sum\",\n \"def solution2(n):\\n if n == 0:\\n return []\\n m = int(math.floor(math.sqrt(n))**2)\\n return [m] + solution2(n - m)\",\n \"def binomial_coefficient3(n, k):\\n return reduce(lambda a, b: a * (n - b) / (b + 1), xrange(k), 1)\",\n \"def solution1(n):\\n res = []\\n while n > 0:\\n m = int(math.floor(math.sqrt(n))**2)\\n res.append(m)\\n n -= m\\n return res\",\n \"def problem2(m, p):\\n total = 0\\n for k in range(m, m ** p):\\n if is_prime(k):\\n total = total + sum_of_digits(k)\\n return total\",\n \"def integer_sum(n):\\n\\n sum = 0\\n k = 0\\n\\n # INVARIANT\\n # The sum of far is equal to the sum of the first k integer numbers\\n # VARIANT: n-k\\n #\\n while (k!=n):\\n k += 1\\n sum += k\\n\\n return sum\",\n \"def create_sum(length, n, take='take'):\\n\\n\\tresult = []\\n\\t# Generate n sums.\\n\\tfor j in range(n):\\n\\t\\tfirst = []\\n\\t\\tsecond = []\\n\\t\\t# Generate a random number of <length> digits.\\n\\t\\tfor i in range(length):\\n\\t\\t\\tfirst.append(random.randint(0,9))\\n\\t\\t# Generate a random number of <length> digits.\\n\\t\\tfor dig in first:\\n\\t\\t\\t# If take / carry is allowed, second number is purely random.\\n\\t\\t\\tif take == 'take':\\n\\t\\t\\t\\tsecond.append(random.randint(0,9))\\n\\t\\t\\t# If take / carry is not allowed, second number is restricted so that its addition does not cross 9.\\n\\t\\t\\telse:\\n\\t\\t\\t\\tsecond.append(random.randint(0,9-dig))\\n\\t\\t# Convert from list of numbers to strings.\\n\\t\\tdig1 = num_to_str(first)\\n\\t\\tdig2 = num_to_str(second)\\n\\t\\t# Append to the result.\\n\\t\\tresult.append((dig1, dig2))\\n\\t# Return the result.\\n\\treturn result\",\n \"def sum_to(n):\\n the_sum = 0\\n for counter in range(n+1):\\n the_sum = the_sum + counter\\n return the_sum\",\n \"def test_twoSum(self):\\n self.assertEqual(twoSum([2, 7, 11, 15], 9), [0, 1])\",\n \"def binary_sums(start, limit):\\n for n in range(start, limit):\\n for i in range(1, n/2 + 1):\\n yield i, n - i\",\n \"def solution(n):\\n total = sum(\\n [\\n i\\n for i in range(1, n)\\n if sum_of_divisors(sum_of_divisors(i)) == i and sum_of_divisors(i) != i\\n ]\\n )\\n return total\",\n \"def sum_series(n, a=0, b=1):\\n\\tseq = []\\n\\tnth_term = 0\\n\\t\\n\\tfor i in range(0,n+1):\\n\\t\\tif i == 0:\\n\\t\\t\\tseq.append(a)\\n\\t\\tif i == 1:\\n\\t\\t\\tseq.append(b)\\n\\t\\tif i > 1:\\n\\t\\t\\tnth_term = seq[-1] + seq[-2]\\n\\t\\t\\tseq.append(nth_term)\\n\\t\\n\\tprint(seq)\\n\\tprint(seq[n])\\n\\treturn(seq[n])\",\n \"def fn(n):\\n if n == 0: return 1\\n return sum(fn(i)*fn(n-i-1) for i in range(n))\",\n \"def q3(array):\\n a = array[1]\\n b = array[6]\\n c = array[11]\\n d = array[12]\\n a1 = roll(a, 00) + roll(b, 00) + roll(b, 12) + roll(c, 12) + roll(d, 28) + roll(a, 28) + roll(b, 28)\\n b1 = roll(b, 19) + roll(c, 19) + roll(d, 3) + roll(a, 3) + roll(b, 3) + roll(c, 7) + roll(d, 23) + roll(a,\\n 23) + roll(\\n b, 23) + roll(a, 15) + roll(b, 15) + roll(b, 27) + roll(c, 27) + roll(d, 11) + roll(a, 11) + roll(b, 11) + roll(\\n d, 31) + roll(a, 31) + roll(b, 31)\\n c1 = roll(c, 0) + roll(d, 16) + roll(a, 16) + roll(b, 16) + roll(a, 8) + roll(b, 8) + roll(b, 20) + roll(c,\\n 20) + roll(\\n d, 4) + roll(a, 4) + roll(b, 4) + roll(d, 24) + roll(a, 24) + roll(b, 24)\\n d1 = roll(a, 8) + roll(b, 8) + roll(b, 20) + roll(c, 20) + roll(d, 4) + roll(a, 4) + roll(b, 4) + roll(d,\\n 24) + roll(a,\\n 24) + roll(\\n b, 24)\\n\\n return array[0], a1, array[2], array[3], array[4], array[5], b1, array[7], array[8], array[9], array[10], c1, d1, \\\\\\n array[\\n 13], array[14], array[15]\",\n \"def sum_square_difference(n):\\n\\tdifference = (n-1)*(n)*(n+1)*(3*n+2)/12\\n\\treturn difference\",\n \"def add_numbers(arr1: StaticArray, arr2: StaticArray) -> StaticArray:\\n num_1 = 0\\n num_2 = 0\\n length_1 = arr1.size()\\n length_2 = arr2.size()\\n\\n # converts each array to a single number\\n for index in range(arr1.size()):\\n num_1 += arr1[index] * (10 ** (length_1 - index))\\n for index in range(arr2.size()):\\n num_2 += arr2[index] * (10 ** (length_2 - index))\\n result = num_1 + num_2\\n\\n # sets the length equal to the largest array\\n if length_1 > length_2:\\n length = length_1\\n else:\\n length = length_2\\n\\n # creates a result array\\n result_arr = StaticArray(length)\\n result_arr_index = 0 # keep track of the next open position\\n # loops to constantly divide the resulting sum by 10 to break the sum into individual digit elements\\n while result > 0:\\n num_3 = result / (10 ** length)\\n if num_3 == 10:\\n num_3 = 0\\n elif num_3 > 10:\\n # if element overflows, creates a new temp array to transfer to the new result array\\n working_arr = StaticArray(result_arr.size() + 1)\\n for index in range(result_arr.size()):\\n working_arr.set(index, result_arr[index])\\n result_arr = StaticArray(working_arr.size())\\n for index in range(working_arr.size()):\\n result_arr.set(index, working_arr[index])\\n num_3 /= 10\\n length += 1 # increases the base position to account for > 10\\n # records resulting element in result array\\n num_3 = int(num_3)\\n result_arr.set(result_arr_index, num_3)\\n result_arr_index += 1\\n # reduces the sum by the amount taken out\\n num_4 = num_3 * (10 ** length)\\n result -= num_4\\n length -= 1 # decreases the base position\\n\\n # replaces None values with zeros\\n for index in range(result_arr.size()):\\n if result_arr[index] is None:\\n result_arr.set(index, 0)\\n\\n return result_arr\",\n \"def create_array( n ):\",\n \"def compute(n):\\n if n == 1:\\n return 1\\n else:\\n i = find_i(n)\\n return 2 * compute(n - i) + 2 ** i - 1\",\n \"def six():\\r\\n \\r\\n sum_squared = 0\\r\\n squared_sum = 0\\r\\n \\r\\n for i in range(1, 101):\\r\\n sum_squared += i**2\\r\\n squared_sum += i\\r\\n squared_sum = squared_sum**2\\r\\n \\r\\n return squared_sum - sum_squared\",\n \"def solveProblem021():\\n total = 0\\n for i in range(2, 10000):\\n divs = getProperDivisors(i)\\n s = sum(divs)\\n # Skip stuff greater than, we'll get to it later if it's less than max.\\n if s > i:\\n continue\\n if s == i:\\n continue\\n t = sum(getProperDivisors(s))\\n if t == i:\\n total = total + i + s\\n print(\\\"The Sum is: %d\\\" % (total,))\",\n \"def get_3_5_sum(num):\\n nums = range(num)\\n mults = [num for num in nums if (num % 3 == 0 or num % 5 == 0)]\\n return sum(mults)\",\n \"def threeSumMulti(self, arr: List[int], target: int) -> int:\\n # Solution 1 - 4992 ms\\n # Solution 2 - 60 ms\\n c = collections.Counter(arr)\\n\\n res = 0\\n if target % 3 == 0:\\n n = c.get(target // 3, 0)\\n res += n * (n - 1) * (n - 2) // 6\\n\\n keys = sorted(c.keys())\\n for k in keys:\\n n = c[k]\\n if n > 1 and target > k != target - 2 * k:\\n res += c.get(target - 2 * k, 0) * n * (n - 1) // 2\\n\\n for i in range(len(keys)):\\n if keys[i] >= target // 3: break\\n for j in range(i + 1, len(keys)):\\n new = target - (keys[i] + keys[j])\\n if new <= keys[j]: break\\n if new in c:\\n res += c[keys[i]] * c[keys[j]] * c[new]\\n\\n return res % (10 ** 9 + 7)\",\n \"def main():\\n\\n import sys\\n sys.setrecursionlimit(10**7)\\n from itertools import accumulate, combinations, permutations, product # https://docs.python.org/ja/3/library/itertools.html\\n # accumulate() returns iterator! to get list: list(accumulate())\\n from math import factorial, ceil, floor\\n def factorize(n):\\n \\\"\\\"\\\"return the factors of the Arg and count of each factor\\n \\n Args:\\n n (long): number to be resolved into factors\\n \\n Returns:\\n list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]\\n \\\"\\\"\\\"\\n fct = [] # prime factor\\n b, e = 2, 0 # base, exponent\\n while b * b <= n:\\n while n % b == 0:\\n n = n // b\\n e = e + 1\\n if e > 0:\\n fct.append((b, e))\\n b, e = b + 1, 0\\n if n > 1:\\n fct.append((n, 1))\\n return fct\\n def combinations_count(n, r):\\n \\\"\\\"\\\"Return the number of selecting r pieces of items from n kinds of items.\\n \\n Args:\\n n (long): number\\n r (long): number\\n \\n Raises:\\n Exception: not defined when n or r is negative\\n \\n Returns:\\n long: number\\n \\\"\\\"\\\"\\n # TODO: How should I do when n - r is negative?\\n if n < 0 or r < 0:\\n raise Exception('combinations_count(n, r) not defined when n or r is negative')\\n if n - r < r: r = n - r\\n if r < 0: return 0\\n if r == 0: return 1\\n if r == 1: return n\\n numerator = [n - r + k + 1 for k in range(r)]\\n denominator = [k + 1 for k in range(r)]\\n for p in range(2,r+1):\\n pivot = denominator[p - 1]\\n if pivot > 1:\\n offset = (n - r) % p\\n for k in range(p-1,r,p):\\n numerator[k - offset] /= pivot\\n denominator[k] /= pivot\\n result = 1\\n for k in range(r):\\n if numerator[k] > 1:\\n result *= int(numerator[k])\\n return result\\n def combinations_with_replacement_count(n, r):\\n \\\"\\\"\\\"Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.\\n \\n Args:\\n n (long): number\\n r (long): number\\n \\n Raises:\\n Exception: not defined when n or r is negative\\n \\n Returns:\\n long: number\\n \\\"\\\"\\\"\\n if n < 0 or r < 0:\\n raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')\\n elif n == 0:\\n return 1\\n else:\\n return combinations_count(n + r - 1, r)\\n from bisect import bisect_left, bisect_right\\n from collections import deque, Counter, defaultdict # https://docs.python.org/ja/3/library/collections.html#collections.deque\\n from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest # https://docs.python.org/ja/3/library/heapq.html\\n from copy import deepcopy, copy # https://docs.python.org/ja/3/library/copy.html\\n from operator import itemgetter\\n # ex1: List.sort(key=itemgetter(1))\\n # ex2: sorted(tuples, key=itemgetter(1,2))\\n from functools import reduce\\n def chmin(x, y):\\n \\\"\\\"\\\"change minimum\\n if x > y, x = y and return (x, True).\\n convenient when solving problems of dp[i]\\n \\n Args:\\n x (long): current minimum value\\n y (long): potential minimum value\\n \\n Returns:\\n (x, bool): (x, True) when updated, else (x, False)\\n \\\"\\\"\\\"\\n if x > y:\\n x = y\\n return (x, True)\\n else:\\n return (x, False)\\n def chmax(x, y):\\n \\\"\\\"\\\"change maximum\\n if x < y, x = y and return (x, True).\\n convenient when solving problems of dp[i]\\n \\n Args:\\n x (long): current maximum value\\n y (long): potential maximum value\\n \\n Returns:\\n (x, bool): (x, True) when updated, else (x, False)\\n \\\"\\\"\\\"\\n if x < y:\\n x = y\\n return (x, True)\\n else:\\n return (x, False)\\n\\n from fractions import gcd # Deprecated since version 3.5: Use math.gcd() instead.\\n def gcds(numbers):\\n return reduce(gcd, numbers)\\n def lcm(x, y):\\n return (x * y) // gcd(x, y)\\n def lcms(numbers):\\n return reduce(lcm, numbers, 1)\\n\\n # first create factorial_list\\n # fac_list = mod_factorial_list(n)\\n INF = 10 ** 18\\n MOD = 10 ** 9 + 7\\n modpow = lambda a, n, p = MOD: pow(a, n, p) # Recursive function in python is slow!\\n def modinv(a, p = MOD):\\n # evaluate reciprocal using Fermat's little theorem:\\n # a**(p-1) is identical to 1 (mod p) when a and p is coprime\\n return modpow(a, p-2, p)\\n def modinv_list(n, p = MOD):\\n if n <= 1:\\n return [0,1][:n+1]\\n else:\\n inv_t = [0,1]\\n for i in range(2, n+1):\\n inv_t += [inv_t[p % i] * (p - int(p / i)) % p]\\n return inv_t\\n def modfactorial_list(n, p = MOD):\\n if n == 0:\\n return [1]\\n else:\\n l = [0] * (n+1)\\n tmp = 1\\n for i in range(1, n+1):\\n tmp = tmp * i % p\\n l[i] = tmp\\n return l\\n def modcomb(n, k, fac_list = [], p = MOD):\\n # fac_list = modfactorial_list(100)\\n # print(modcomb(100, 5, modfactorial_list(100)))\\n from math import factorial\\n if n < 0 or k < 0 or n < k: return 0\\n if n == 0 or k == 0: return 1\\n if len(fac_list) <= n:\\n a = factorial(n) % p\\n b = factorial(k) % p\\n c = factorial(n-k) % p\\n else:\\n a = fac_list[n]\\n b = fac_list[k]\\n c = fac_list[n-k]\\n return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p\\n def modadd(a, b, p = MOD):\\n return (a + b) % MOD\\n def modsub(a, b, p = MOD):\\n return (a - b) % p\\n def modmul(a, b, p = MOD):\\n return ((a % p) * (b % p)) % p\\n def moddiv(a, b, p = MOD):\\n return modmul(a, modpow(b, p-2, p))\\n\\n \\\"\\\"\\\" initialize variables and set inputs\\n # initialize variables\\n # to initialize list, use [0] * n\\n # to initialize two dimentional array, use [[0] * N for _ in range(N)]\\n # set inputs\\n # open(0).read() is a convenient method:\\n # ex) n, m, *x = map(int, open(0).read().split())\\n # min(x[::2]) - max(x[1::2])\\n # ex2) *x, = map(int, open(0).read().split())\\n # don't forget to add comma after *x if only one variable is used\\n # preprocessing\\n # transpose = [x for x in zip(*data)]\\n # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [(1, 4, 7), (2, 5, 8), (3, 6, 9)]\\n # flat = [flatten for inner in data for flatten in inner]\\n # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [1, 2, 3, 4, 5, 6, 7, 8, 9]\\n # calculate and output\\n # output pattern\\n # ex1) print(*l) => when l = [2, 5, 6], printed 2 5 6\\n \\\"\\\"\\\"\\n\\n # functions used\\n r = lambda: sys.stdin.readline().strip()\\n r_int = lambda: int(r())\\n R = lambda: list(map(int, r().split()))\\n Rfloat = lambda: list(map(float, r().split()))\\n Rtuple = lambda: tuple(map(int, r().split()))\\n Rmap = lambda: map(int, r().split())\\n\\n \\\"\\\"\\\" how to treat input\\n # single int: int(r())\\n # single string: r()\\n # single float: float(r())\\n # line int: R()\\n # line string: r().split()\\n # line (str, int, int): [j if i == 0 else int(j) for i, j in enumerate(r().split())]\\n # lines int: [R() for _ in range(n)]\\n \\\"\\\"\\\"\\n\\n # main\\n N, Q = R()\\n STX = [R() for _ in range(N)]\\n STX.sort(key=itemgetter(2))\\n\\n D = [int(r()) for _ in range(Q)]\\n Stopped = [-1] * Q\\n ans = [-1] * Q\\n\\n for s, t, x in STX:\\n l = bisect_left(D, s-x)\\n r = bisect_left(D,t-x)\\n a = l\\n while a < r:\\n if Stopped[a] == -1:\\n ans[a] = x\\n Stopped[a] = r\\n a += 1\\n else:\\n a = Stopped[a]\\n\\n for i in ans:\\n print(i)\\n\\n \\\"\\\"\\\"memo: how to use defaultdict of list\\n # initialize\\n Dic = defaultdict(list)\\n # append / extend\\n Dic[x].append(y)\\n # for\\n for k, v in Dic.items():\\n \\\"\\\"\\\"\",\n \"def n_suma(a1,nr_wyrazu,r):\\n return (2*a1+(nr_wyrazu-1))*nr_wyrazu/2\",\n \"def sum_to_n(n):\\n total = 0\\n for i in range(1,n+1):\\n total += i\\n return total\",\n \"def threeSumMulti(self, A: List[int], target: int) -> int:\\n counter = defaultdict(int)\\n for a in A:\\n counter[a] += 1\\n\\n keys = list(counter.keys())\\n keys.sort()\\n n = len(keys)\\n ret = 0\\n for i in range(n):\\n j = i # not i + 1\\n k = n - 1\\n while j <= k: # not <\\n a, b, c = keys[i], keys[j], keys[k]\\n if b + c < target - a:\\n j += 1\\n elif b + c > target - a:\\n k -= 1\\n else: # equal\\n if a < b < c:\\n ret += counter[a] * counter[b] * counter[c]\\n elif a == b < c:\\n # nC2\\n ret += counter[a] * (counter[a] - 1) // 2 * counter[c]\\n elif a < b == c:\\n ret += counter[a] * counter[b] * (counter[b] - 1) // 2\\n elif a== b == c:\\n # nC3\\n ret += counter[a] * (counter[a] - 1) * (counter[a] - 2) // (3 * 2)\\n else:\\n raise\\n\\n ret %= MOD\\n j += 1\\n k -= 1\\n\\n return ret\",\n \"def sol(n, mem):\\n if mem[n] != -1:\\n return mem[n]\\n \\n mem[n] = 0\\n for i in range(2, n+1):\\n mem[n]+=sol(n-i, mem)*sol(i-2, mem)\\n \\n return mem[n]\",\n \"def get_integers(n: int) -> int:\\n l = [int(sqrt(n))]\\n val = l[0] * l[0]\\n index = 0\\n while val != n:\\n val = sum([x*x for x in l])\\n if val > n:\\n l[index] -= 1\\n elif val < n:\\n index += 1\\n l.append(l[index - 1])\\n\\n return len(l)\",\n \"def crea_cubi(n):\\n lst = []\\n for i in range(1, n + 1):\\n lst = lst + [i**3]\\n return lst\",\n \"def lucas(n):\\n\\t'''\\n\\tlucL1=1\\n\\tlucL2=2\\n\\tif n<0:\\n\\t\\tprint(\\\"please enter positive int value\\\")\\n\\n\\telif n==0:\\n\\t\\treturn 2\\n\\n\\telif n==1:\\n\\t\\treturn 1\\n\\n\\telse:\\n\\t\\tfor i in range(n-1):\\n\\t\\t\\tlucC=lucL1+lucL2\\n\\t\\t\\tlucL2=lucL1\\n\\t\\t\\tlucL1=lucC\\n\\t\\treturn lucC\\n\\t'''\\n\\treturn sum_series(n,2,1)\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6796521","0.67540747","0.6711268","0.67015684","0.6571917","0.6558617","0.65404266","0.650606","0.64722335","0.64675075","0.645329","0.6389222","0.63783646","0.63763386","0.6341474","0.633265","0.63314736","0.63301826","0.6326787","0.6307143","0.62873214","0.6286905","0.62855816","0.6277762","0.6252278","0.6230731","0.6218524","0.6214158","0.62024635","0.6172552","0.61632836","0.6157493","0.6141578","0.61413723","0.6133829","0.61254686","0.61249214","0.61016214","0.60979825","0.6095052","0.6094009","0.6092655","0.6087996","0.60772717","0.6075199","0.60644084","0.60644084","0.6057247","0.60556084","0.60506666","0.60506666","0.6039431","0.603863","0.60386235","0.602947","0.6016068","0.60002947","0.5999224","0.59964067","0.59883296","0.59855765","0.5984987","0.59786594","0.5976716","0.5972864","0.59662795","0.59661615","0.5966064","0.5961883","0.59524167","0.59467953","0.5938766","0.59321606","0.59294903","0.59277743","0.5923709","0.5918845","0.59175086","0.59070337","0.5904182","0.5896783","0.5881129","0.58707386","0.5867562","0.58653235","0.58594495","0.58585316","0.5855824","0.58549064","0.58519435","0.5850943","0.5847687","0.5845826","0.58329207","0.5829904","0.5829808","0.5828598","0.5825569","0.58210236","0.582035","0.58177906"],"string":"[\n \"0.6796521\",\n \"0.67540747\",\n \"0.6711268\",\n \"0.67015684\",\n \"0.6571917\",\n \"0.6558617\",\n \"0.65404266\",\n \"0.650606\",\n \"0.64722335\",\n \"0.64675075\",\n \"0.645329\",\n \"0.6389222\",\n \"0.63783646\",\n \"0.63763386\",\n \"0.6341474\",\n \"0.633265\",\n \"0.63314736\",\n \"0.63301826\",\n \"0.6326787\",\n \"0.6307143\",\n \"0.62873214\",\n \"0.6286905\",\n \"0.62855816\",\n \"0.6277762\",\n \"0.6252278\",\n \"0.6230731\",\n \"0.6218524\",\n \"0.6214158\",\n \"0.62024635\",\n \"0.6172552\",\n \"0.61632836\",\n \"0.6157493\",\n \"0.6141578\",\n \"0.61413723\",\n \"0.6133829\",\n \"0.61254686\",\n \"0.61249214\",\n \"0.61016214\",\n \"0.60979825\",\n \"0.6095052\",\n \"0.6094009\",\n \"0.6092655\",\n \"0.6087996\",\n \"0.60772717\",\n \"0.6075199\",\n \"0.60644084\",\n \"0.60644084\",\n \"0.6057247\",\n \"0.60556084\",\n \"0.60506666\",\n \"0.60506666\",\n \"0.6039431\",\n \"0.603863\",\n \"0.60386235\",\n \"0.602947\",\n \"0.6016068\",\n \"0.60002947\",\n \"0.5999224\",\n \"0.59964067\",\n \"0.59883296\",\n \"0.59855765\",\n \"0.5984987\",\n \"0.59786594\",\n \"0.5976716\",\n \"0.5972864\",\n \"0.59662795\",\n \"0.59661615\",\n \"0.5966064\",\n \"0.5961883\",\n \"0.59524167\",\n \"0.59467953\",\n \"0.5938766\",\n \"0.59321606\",\n \"0.59294903\",\n \"0.59277743\",\n \"0.5923709\",\n \"0.5918845\",\n \"0.59175086\",\n \"0.59070337\",\n \"0.5904182\",\n \"0.5896783\",\n \"0.5881129\",\n \"0.58707386\",\n \"0.5867562\",\n \"0.58653235\",\n \"0.58594495\",\n \"0.58585316\",\n \"0.5855824\",\n \"0.58549064\",\n \"0.58519435\",\n \"0.5850943\",\n \"0.5847687\",\n \"0.5845826\",\n \"0.58329207\",\n \"0.5829904\",\n \"0.5829808\",\n \"0.5828598\",\n \"0.5825569\",\n \"0.58210236\",\n \"0.582035\",\n \"0.58177906\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":11392,"cells":{"query":{"kind":"string","value":"Testing base class with validation method for exceptions"},"document":{"kind":"string","value":"def test_task_with_two_int_validation_parameters_validate_exceptions_task87(data, expected_value):\r\n\r\n with pytest.raises(expected_value):\r\n algo.Task87.validate_data(data)"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["def test_validation(self):\n self.validationFails()","def test_should_not_be_callable(self):\n with self.assertRaises(NotImplementedError):\n BaseValidator()(\"any-value\")","def test_validate(self):\n pass","def test_validation(self):\r\n\r\n with self.assertRaises(ValidationError):\r\n List().validate({'blake':31, 'something_else':'that'})\r\n\r\n with self.assertRaises(ValidationError):\r\n List().validate('stringy')\r\n\r\n with self.assertRaises(ValidationError):\r\n List().validate(1)","def test_validation(self):\n\n with self.assertRaises(ValidationError):\n List().validate({'blake':31, 'something_else':'that'})\n\n with self.assertRaises(ValidationError):\n List().validate('stringy')\n\n with self.assertRaises(ValidationError):\n List().validate(1)","def test_base_validate_models():\n with pytest.raises(ValueError):\n base_validate_models([])\n\n assert [\"m\"] == base_validate_models([\"m\"])","def test_invalidargumentBaseModel(self):\n with self.assertRaises(NameError) as e:\n b1 = BaseModel(hi)\n self.assertEqual(str(e.exception), \"name 'hi' is not defined\")","def __validate__(self):","def test_class_errored(self, cls, exception):","def test_validation(self):\n\n with self.assertRaises(ValidationError):\n Dictionary().validate([1,2,3])\n\n with self.assertRaises(ValidationError):\n Dictionary().validate('stringy')\n\n with self.assertRaises(ValidationError):\n Dictionary().validate(1)","def test_validation(self):\r\n\r\n with self.assertRaises(ValidationError):\r\n Dictionary().validate([1,2,3])\r\n\r\n with self.assertRaises(ValidationError):\r\n Dictionary().validate('stringy')\r\n\r\n with self.assertRaises(ValidationError):\r\n Dictionary().validate(1)","def Validate(self):\n raise NotImplementedError","def test_validators():","def test_base(self):\n with pytest.raises(AttributeError) as exc:\n Fidelity(\"epoch\", 1, 2, 0)\n assert \"Base should be greater than or equal to 1\" == str(exc.value)","def validate(self, *args, **kwargs):\n raise NotImplementedError('Validate not implemented')","def validate(self):\n raise NotImplementedError()","def test_base_class_expection():\n with pytest.raises(TypeError):\n cardinal.CardinalPoints()","def test_encode_errors(self):\n if self._cls == 'MetaschemaType':\n if self._invalid_validate:\n self.assert_raises(NotImplementedError, self.import_cls.encode,\n self._invalid_validate[0], self.typedef)\n else:\n if self._invalid_validate:\n self.assert_raises((ValueError,\n jsonschema.exceptions.ValidationError),\n self.import_cls.encode,\n self._invalid_validate[0], self.typedef)","def validate(cls, **kwargs: Any) -> None: # pragma no cover","def validate(self):\n raise NotImplementedError","def validate(self):\n raise NotImplementedError","def __validate():\n # TODO: implement","def test_wrong_input(self):\r\n self.assertRaises(Exception, self.validate, (3, 2, 8, 8), (4, 2, 5, 5),\r\n 'valid', input=T.dmatrix())\r\n self.assertRaises(Exception, self.validate, (3, 2, 8, 8), (4, 2, 5, 5),\r\n 'valid', filters=T.dvector())\r\n self.assertRaises(Exception, self.validate, (3, 2, 8, 8), (4, 2, 5, 5),\r\n 'valid', input=T.dtensor3())","def test_exception(self):\n self.assertRaises(TypeError, lambda: self.init_model())","def testValidate_Invalid(self):\n values = {\n messages.IntegerField: \"10\",\n messages.FloatField: \"blah\",\n messages.BooleanField: 0,\n messages.BytesField: 10.20,\n messages.StringField: 42,\n }\n\n def action(field_class):\n # Optional.\n field = field_class(1)\n self.assertRaises(messages.ValidationError,\n field.validate,\n values[field_class])\n\n # Required.\n field = field_class(1, required=True)\n self.assertRaises(messages.ValidationError,\n field.validate,\n values[field_class])\n\n # Repeated.\n field = field_class(1, repeated=True)\n self.assertRaises(messages.ValidationError,\n field.validate,\n [values[field_class]])\n self.assertRaises(messages.ValidationError,\n field.validate,\n (values[field_class],))\n self.ActionOnAllFieldClasses(action)","def test_not_enough_inputs(self):\n n = Node('a')\n with self.assertRaises(ValidationError):\n n.validate()\n n.validate(False)","def test_missing_required_field_raises_error():\n with pytest.raises(ValidationError):\n Entity()","def test_init_invalid_retire_date(self):\n # Whether this raises a ValueError or TypeError is an\n # implementation detail delegated to `datetime`\n with self.assertRaises((ValueError, TypeError)):\n Person(\n self.initial_year, self.name, self.birth_date,\n retirement_date='invalid')","def __validate(self):\n pass","def test_acc(self):\n raise Exception(\" not implemented in base model\")","def _validate(self):\n pass","def check_errors(self):\n raise NotImplementedError(\"Implement it in a subclass.\")","def validate(self):\n ...","def test_custom_validation_exceptions(self):\n expected = {\n \"errors\": [\n {\n \"status\": \"400\",\n \"source\": {\n \"pointer\": \"/data/attributes/email\",\n },\n \"detail\": \"Enter a valid email address.\",\n \"code\": \"invalid\",\n },\n {\n \"id\": \"armageddon101\",\n \"detail\": \"Hey! You need a last name!\",\n \"meta\": \"something\",\n \"source\": {\"pointer\": \"/data/attributes/lastName\"},\n },\n ]\n }\n response = self.client.post(\n \"/identities\",\n {\n \"data\": {\n \"type\": \"users\",\n \"attributes\": {\n \"email\": \"bar\",\n \"last_name\": \"alajflajaljalajlfjafljalj\",\n },\n }\n },\n )\n\n assert expected == response.json()","def test_lt_invalid(self):\n with self.assertRaises(TypeError):\n self.instance < 12","def test_errs(self):\n b1 = BaseModel()\n with self.assertRaises(AttributeError):\n FileStorage.__objects\n FileStorage.__File_path\n\n with self.assertRaises(TypeError):\n models.storage.new()\n models.storage.new(self, b1)\n models.save(b1)\n models.reload(b1)\n models.all(b1)","def test_002_import_exception(self):\n m = schematics_flexible.BaseFlexible(\n {'code': '07',\n 'properties': {\"a\": \"this is test\"}},\n store_handler=get_mock())\n try:\n m.validate()\n except schematicsValidationError:\n pass\n else:\n self.assertTrue(False,\n 'Model must raise exception when import raise')","def test_bad_curie():\n with pytest.raises(ValidationError):\n entity = Entity(id=\"this is not a curie\")","def test_validation(self):\n def test(**invalid_fields):\n with self.assertRaises(AssertionError):\n c = models.Citizen(**{'relatives': [], **invalid_fields})\n\n # Must throw errors in every case\n test(citizen_id=-1, )\n test(apartment='WRONG-STRING')\n test(town='', )\n test(street='', )\n test(building='', )\n test(name=None, )\n test(birth_date='WRONG-STRING')\n test(birth_date='31.02.2019')\n test(relatives=['a'])","def test_base_opt_validate():\n opt = scheme._BaseOpt()\n with pytest.raises(NotImplementedError):\n opt.validate('foo', 'test-data')","def test_error_expression(self):\n error_expression = expression.InvalidExpression(\"an error message\")\n # All three of \"penalty_expression\", \"constraint_expression\" and\n # \"extra_constraints\" should raise.\n with self.assertRaises(RuntimeError):\n _ = error_expression.penalty_expression\n with self.assertRaises(RuntimeError):\n _ = error_expression.constraint_expression\n with self.assertRaises(RuntimeError):\n _ = error_expression.extra_constraints","def test_trestle_validation_error() -> None:\n msg = 'Custom validation error'\n try:\n raise TrestleValidationError(msg)\n except TrestleValidationError as err:\n assert str(err) == msg\n assert err.msg == msg","def test_constructor_wrong_options(self):\n with self.assertRaises(TypeError):\n base = BaseExporter(something_else=6)","def test_call_invalid_input(self):\r\n with self.assertRaises(ValueError):\r\n self.estimator1(42, confidence_level=0)","def validate(self):","def validate(self):","def test_foo(self):\n foo = Foo(value=1)\n with self.assertRaises(TypeError):\n foo.foo()","def test_from_object_fail(self):\n class InvalidClass(object):\n pass\n Invalid_object = InvalidClass()\n with self.assertRaises(TypeError):\n BaseDataClass.from_object(Invalid_object)","def test_minimal_validation(self, asset_class: Type[_PandasDataAsset]):\n with pytest.raises(pydantic.ValidationError) as exc_info:\n asset_class( # type: ignore[call-arg]\n name=\"test\",\n invalid_keyword_arg=\"bad\",\n )\n\n errors_dict = exc_info.value.errors()\n assert {\n \"loc\": (\"invalid_keyword_arg\",),\n \"msg\": \"extra fields not permitted\",\n \"type\": \"value_error.extra\",\n } == errors_dict[ # the extra keyword error will always be the last error\n -1 # we don't care about any other errors for this test\n ]","def test_init_invalid_birth_date(self):\n # Whether this raises a ValueError or TypeError is an\n # implementation detail delegated to `datetime`\n with self.assertRaises((ValueError, TypeError)):\n Person(\n self.initial_year, self.name, 'invalid',\n retirement_date=self.retirement_date)","def Invalid(\r\n self, s: str = \"\", e: Type[BaseException] = None, fail: bool = False\r\n) -> None:\r\n ...","def check_validity(self):","def __call__(self, *args, **kwargs):\n if isinstance(self._exp, type) and issubclass(self._exp, Exception):\n with pytest.raises(self._exp):\n self._f(*args, **kwargs)\n else:\n assert self._exp == self._f(*args, **kwargs)","def test_04_one_args(self):\n with self.assertRaises(TypeError) as x:\n r = Rectangle(7)\n self.assertEqual(\"__init__() missing 1 required positional argument:\\\n 'height'\", str(x.exception))","def test_create_valiation(self):\n with self.assertRaises(ValidationError) as test:\n contact = Contact.objects.create(email='3232131')\n contact.full_clean()\n the_exception = dict(test.exception)\n self.assertEqual(the_exception['name'], ['This field cannot be blank.'])\n self.assertEqual(the_exception['email'], ['Enter a valid email address.'])","def test_base_exception(self) -> None:\n with pytest.raises(BaseException) as e:\n 1 / 0\n assert isinstance(e.value, ZeroDivisionError)","def test_with_invalid_input(self):\n for dataset_type in ['ruler', 'pencil', 'cheese']:\n with self.assertRaises(ValueError) as exc:\n check_dataset_type(dataset_type)\n self.assertEqual(\"Dataset type not 'regular' or 'raw' is %s\" % dataset_type,\n str(exc.exception))","def test_property_invalid(self):\n\n self.assertRaises(DataObjectError,\n setattr(self, \"foobar\", \"some value\")\n )","def test_001_validate_with_bad_properties(self):\n m = schematics_flexible.BaseFlexible(\n {'code': '06',\n 'properties': {\"a\": \"this is test\"}},\n store_handler=get_mock())\n try:\n m.validate()\n except schematicsValidationError:\n pass\n else:\n self.assertTrue(False,\n 'Model must raise exception when validate raise')","def test_new_invalid(self) -> None:\n with pytest.raises(TypeError) as excinfo:\n RunwayTestDefinition({}) # type: ignore\n assert str(excinfo.value).startswith(\"expected data of type\")","def test_get_other_typeerror_2(self):\n v = versions.Version(name='foo', version='1.2.3')\n self.assertRaises(TypeError, v._get_other, '1')","def test_members_are_set_when_args_are_invalid(self):\n\n self.assertRaises(ValueError, Vec3, \"abc\", 6, \"q\")","def testinvalidability(self):\n self.assertRaises(AbilityError, AmuletAbility, 'Invalid')\n self.assertRaises(AbilityError, AmuletAbility, '')","def test_error(cls, err, data):\n do_error_test(cls, err, data)","def validate(self):\n pass","def validate(self):\n pass","def validate(self):\n pass","def validate(self):\n pass","def validate(self):\n pass","def validate(self):\n pass","def validate(self):\n pass","def validate(self):\n pass","def test_domain_validator(self):\n id_stud = 1\n nume_stud = \"Mircea Augustin\"\n stud = Student(id_stud,nume_stud)\n self.assertEqual(stud.get_id_stud(),id_stud)\n self.assertEqual(stud.get_nume_stud(),nume_stud)\n self.assertEqual(str(stud),\"1 | Mircea Augustin\")\n stud2 = Student(id_stud,\"Horatiu Murdar\")\n self.assertEqual(stud,stud2)\n \"\"\"\n test validator student\n \"\"\"\n validStud = ValidatorStudent()\n stud = Student(1,\"Caine Rau\")\n validStud.valideaza_stud(stud)\n stud2 = Student(-1,\"\")\n self.assertRaisesRegex(ValidError,\"Id student invalid!Nume student invalid!\",validStud.valideaza_stud,stud2)\n \"\"\"\n test domeniu pt disc\n \"\"\"\n id_disc = 1\n nume_disc = \"Analiza\"\n nume_prof = \"Berinde Stefan\"\n disc = Disciplina(id_disc,nume_disc,nume_prof)\n self.assertEqual(disc.get_id_disc(),id_disc)\n self.assertEqual(disc.get_nume_disc(),nume_disc)\n self.assertEqual(disc.get_nume_prof(),nume_prof)\n self.assertEqual(str(disc),\"1 | Analiza | Berinde Stefan\")\n disc2 = Disciplina(id_disc,\"Logica\",\"Pop\")\n self.assertEqual(disc,disc2)\n \"\"\"\n test validare disc\n \"\"\"\n validDisc = ValidatorDisciplina()\n id_disc = 1\n nume_disc = \"Analiza\"\n nume_prof = \"Berinde Stefan\"\n disc = Disciplina(id_disc,nume_disc,nume_prof)\n validDisc.valideaza_disc(disc)\n disc_gresit = Disciplina(-1,\"\",\"\")\n self.assertRaisesRegex(ValidError,\"Id disciplina invalid!Nume disciplina invalid!Nume profesor invalid!\",validDisc.valideaza_disc,disc_gresit)\n \"\"\"\n test domeniu pt note\n \"\"\"\n id_nota = 0\n id_stud = 3\n nume_stud = \"Mircea Augustin\"\n stud = Student(id_stud,nume_stud)\n id_disc = 2\n nume_disc = \"Analiza\"\n nume_prof = \"Berinde Stefan\"\n disc = Disciplina(id_disc,nume_disc,nume_prof)\n val_nota = 9.5\n nota = Nota(id_nota,stud,disc,val_nota)\n self.assertEqual(nota.get_id_nota(),id_nota)\n self.assertEqual(nota.get_stud(),stud)\n self.assertEqual(nota.get_disc(),disc)\n self.assertEqual(nota.get_val_nota(),val_nota)\n nota2 = Nota(id_nota,Student(0,\"a\"),Disciplina(0,\"a\",\"a\"),5.4)\n self.assertEqual(nota,nota2)\n \"\"\"\n test validare pt note - BlackBox\n \"\"\"\n validNota = ValidatorNota()\n stud = Student(0,\"a\")\n disc = Disciplina(0,\"a\",\"a\")\n validNota.valideaza_nota(Nota(3,Student(3,\"Chef Scarlatescu\"),Disciplina(2,\"Analiza\",\"Berinde Stefan\"),5.4))\n validNota.valideaza_nota(Nota(0,Student(-1,\"a\"),Disciplina(0,\"\",\"a\"),1))\n validNota.valideaza_nota(Nota(0,stud,disc,10))\n self.assertRaisesRegex(ValidError,\"Id nota invalid! Valoare nota invalida!\",validNota.valideaza_nota, Nota(-1,stud,disc,0.9) )\n self.assertRaisesRegex(ValidError,\"Id nota invalid! Valoare nota invalida!\",validNota.valideaza_nota, Nota(-50,stud,disc,0) )\n self.assertRaisesRegex(ValidError,\"Valoare nota invalida!\",validNota.valideaza_nota, Nota(0,stud,disc,-1) )\n self.assertRaisesRegex(ValidError,\"Valoare nota invalida!\",validNota.valideaza_nota, Nota(0,stud,disc,10.1) )\n self.assertRaisesRegex(ValidError,\"Valoare nota invalida!\",validNota.valideaza_nota, Nota(0,stud,disc,50) )","def test_to_python_method_validation_errors(self):\n field = DecimalFractionField()\n with self.assertRaises(ValidationError):\n field.clean(\"abcd\")\n\n with self.assertRaises(ValidationError):\n field.clean(\"1 1 1/3\")\n\n with self.assertRaises(ValidationError):\n field.clean(\"1 1\")","def test_validate_input_bad_input(self):\r\n self.assertRaises(ValueError, _validate_input,\r\n None, None, None, None, None)\r\n self.assertRaises(ValueError, _validate_input,\r\n self.dist_matrix_header, self.dist_matrix,\r\n self.mapping_header, self.mapping, None)\r\n self.assertRaises(ValueError, _validate_input,\r\n self.dist_matrix_header, 12,\r\n self.mapping_header, self.mapping, None)\r\n self.assertRaises(ValueError, _validate_input,\r\n self.dist_matrix_header, self.dist_matrix,\r\n self.mapping_header, self.mapping, 42)\r\n self.assertRaises(ValueError, _validate_input,\r\n self.dist_matrix_header, self.dist_matrix,\r\n self.mapping_header, self.mapping, \"aeiou\")","def test_11_None_input(self):\n with self.assertRaises(TypeError) as x:\n r = Rectangle(None)\n self.assertEqual(\"__init__() missing 1 required positional argument:\\\n 'height'\", str(x.exception))","def test_value_init17(self):\n with self.assertRaises(TypeError) as err:\n r1 = Rectangle(1, 2, 3, \"hi\")\n msg = \"y must be an integer\"\n self.assertEqual(str(err.exception), msg)","def test_raising_exceptions(self):\n with self.assertRaises(TypeError):\n r = Rectangle(10, \"2\")\n with self.assertRaises(TypeError):\n r = Rectangle(10, 2.1)\n with self.assertRaises(TypeError):\n r = Rectangle(10, True, \"\")\n with self.assertRaises(TypeError):\n r = Rectangle(10, 10, 1.25)\n with self.assertRaises(TypeError):\n r = Rectangle(10, 10, \" \", True, False)\n with self.assertRaises(TypeError):\n r = Rectangle(10, None)\n with self.assertRaises(TypeError):\n r = Rectangle(\"2\", 10, 1, 1, \"str\")\n with self.assertRaises(TypeError):\n r = Rectangle(2.1, 10, 1, 1.5, 1)\n with self.assertRaises(TypeError):\n r = Rectangle(True, 10, 5, \"\", 10)\n with self.assertRaises(TypeError):\n r = Rectangle(False, 10)\n with self.assertRaises(ValueError):\n r = Rectangle(10, 0)\n with self.assertRaises(ValueError):\n r = Rectangle(0, 10)\n with self.assertRaises(ValueError):\n r = Rectangle(10, -1)\n with self.assertRaises(ValueError):\n r = Rectangle(-1, 10)\n with self.assertRaises(ValueError):\n r = Rectangle(0, 0)\n with self.assertRaises(ValueError):\n r = Rectangle(-1, -1)\n with self.assertRaises(ValueError):\n r = Rectangle(10, 5, 1, -1)\n with self.assertRaises(ValueError):\n r = Rectangle(10, 6, -2, 1)\n with self.assertRaises(ValueError):\n r = Rectangle(2, 2, -5, -5)\n with self.assertRaises(ValueError):\n r = Rectangle(10, 1, -1, 1, 1)\n with self.assertRaises(ValueError):\n r = Rectangle(10, 4, 1, -1, 10)\n with self.assertRaises(TypeError):\n r = Rectangle()\n with self.assertRaises(TypeError):\n r = Rectangle(10)\n with self.assertRaises(TypeError):\n r = Rectangle(10, 5, 1, 1, 1, 5)","def validate(self, data):\n raise NotImplementedError(\"Inherit this class and override this method.\")","def test_invalid_version_fields(self):\n self.assertRaises(ValueError, versions.Version, version='1234', name='foo')","def test_that_field_required_validations_are_triggered_on_incorrect_attribute_setting(\n self,\n ):\n person = Person(first_name=\"Johnny\", last_name=\"John\")\n\n with pytest.raises(ValidationError) as error:\n person.first_name = \"\" # Simulate an error by force-resetting an attribute\n\n assert error.value.messages == {\"first_name\": [\"is required\"]}","def test_invalid_instantiation(invalid_instance):\n with pytest.raises(ValueError):\n invalid_instance()","def test_get_other_typeerror(self):\n v = versions.Version(name='foo', version='1.2.3')\n self.assertRaises(TypeError, v._get_other, 3.4)","def __init__(self, message=\"\"):\n super(ValidationError, self).__init__(message)","def test_fails(self):\n raise FoolishError(\"I am a broken test\")","def test_other(self):\n self.assertRaises(ValueError, isStringTrue, \"dog\")\n return","def test_constructor_bad_value(self):\n self.assertRaises(line_format_errors.InputLineError,\n lambda: D1Line(self.bad_line))","def test_12_No_args(self):\n with self.assertRaises(TypeError) as x:\n r = Rectangle()\n self.assertEqual(\"__init__() missing 2 required positional\\\n arguments: 'width' and 'height'\", str(x.exception))","def _check_validity(self):\n pass","def validate_result(self):\n raise NotImplementedError","def test_raises_when_init_has_superset_of_args(self):\n\n with pytest.raises(exceptions.APIImplementationError) as exc_info:\n\n class API(platform.PlatformAPI):\n def __init__(self, base_url, token, org_name, user, other):\n pass\n\n assert \"other\" in str(exc_info.value)","def test_exceptions(self):\n\n with self.assertRaises(TypeError, msg=\"size must be an integer\"):\n Square(6.5)\n with self.assertRaises(TypeError, msg=\"size must be an integer\"):\n Square(False)\n with self.assertRaises(TypeError, msg=\"size must be an integer\"):\n Square(6j)\n with self.assertRaises(TypeError, msg=\"size must be an integer\"):\n Square([4, 1])\n with self.assertRaises(TypeError, msg=\"size must be an integer\"):\n Square({\"Milk\": 1})\n with self.assertRaises(TypeError, msg=\"size must be an integer\"):\n Square((3, 9))\n with self.assertRaises(TypeError, msg=\"x must be an integer\"):\n Square(2, 3.5, 4)\n with self.assertRaises(TypeError, msg=\"x must be an integer\"):\n Square(2, True, 4)\n with self.assertRaises(TypeError, msg=\"x must be an integer\"):\n Square(2, 3j, 4)\n with self.assertRaises(TypeError, msg=\"x must be an integer\"):\n Square(2, \"3\", 4)\n with self.assertRaises(TypeError, msg=\"x must be an integer\"):\n Square(2, [3], 4)\n with self.assertRaises(TypeError, msg=\"x must be an integer\"):\n Square(2, {\"My\": 3}, 4)\n with self.assertRaises(TypeError, msg=\"x must be an integer\"):\n Square(2, (3, 3), 4)\n with self.assertRaises(TypeError, msg=\"y must be an integer\"):\n Square(2, 3, 4.2)\n with self.assertRaises(TypeError, msg=\"y must be an integer\"):\n Square(2, 3, False)\n with self.assertRaises(TypeError, msg=\"y must be an integer\"):\n Square(2, 3, 4j)\n with self.assertRaises(TypeError, msg=\"y must be an integer\"):\n Square(2, 3, \"4\")\n with self.assertRaises(TypeError, msg=\"y must be an integer\"):\n Square(2, 3, [4])\n with self.assertRaises(TypeError, msg=\"y must be an integer\"):\n Square(2, 3, {\"its\": 4})\n with self.assertRaises(TypeError, msg=\"y must be an integer\"):\n Square(2, 3, (4, 4))\n with self.assertRaises(ValueError, msg=\"size must be > 0\"):\n Square(0)\n with self.assertRaises(ValueError, msg=\"size must be > 0\"):\n Square(-2)\n with self.assertRaises(ValueError, msg=\"x must be >= 0\"):\n Square(1, -8, 9)\n with self.assertRaises(ValueError, msg=\"y must be >= 0\"):\n Square(1, 8, -9)","def test04(self):\n self.assertRaises(TypeError, robustApply, oneArgument, \"this\", blah=\"that\")","def testinvalidsize(self):\n self.assertRaises(AbilityError, AttributeAbility, size=0)\n self.assertRaises(AbilityError, AttributeAbility, size=6)","def test_value_init15(self):\n with self.assertRaises(ValueError) as err:\n r1 = Rectangle(0, 0)\n msg = \"width must be > 0\"\n self.assertEqual(str(err.exception), msg)","def test_value_init6(self):\n with self.assertRaises(TypeError) as err:\n r1 = Rectangle(10, \"hi\")\n msg = \"height must be an integer\"\n self.assertEqual(str(err.exception), msg)","def test_validate_on_invalid_data_type(self):\n args = (self.bytes_a, 'invalid')\n self.assertRaises(TypeError, objects.OpaqueObject, *args)","def testinvalidattribute(self):\n self.assertRaises(AbilityError, AttributeAbility, 'Invalid')\n self.assertRaises(AbilityError, AttributeAbility, '', 3)","def test_value_init12(self):\n with self.assertRaises(ValueError) as err:\n r1 = Rectangle(10, 1, 17, -9)\n msg = \"y must be >= 0\"\n self.assertEqual(str(err.exception), msg)","def _assert_validation_error( # type: ignore[override]\n self, expected_error_substring: str\n ) -> None:\n with self.assertRaisesRegex(\n utils.ValidationError, expected_error_substring):\n self.collection.validate()","def test_value_init7(self):\n with self.assertRaises(ValueError) as err:\n r1 = Rectangle(-4, 5)\n msg = \"width must be > 0\"\n self.assertEqual(str(err.exception), msg)"],"string":"[\n \"def test_validation(self):\\n self.validationFails()\",\n \"def test_should_not_be_callable(self):\\n with self.assertRaises(NotImplementedError):\\n BaseValidator()(\\\"any-value\\\")\",\n \"def test_validate(self):\\n pass\",\n \"def test_validation(self):\\r\\n\\r\\n with self.assertRaises(ValidationError):\\r\\n List().validate({'blake':31, 'something_else':'that'})\\r\\n\\r\\n with self.assertRaises(ValidationError):\\r\\n List().validate('stringy')\\r\\n\\r\\n with self.assertRaises(ValidationError):\\r\\n List().validate(1)\",\n \"def test_validation(self):\\n\\n with self.assertRaises(ValidationError):\\n List().validate({'blake':31, 'something_else':'that'})\\n\\n with self.assertRaises(ValidationError):\\n List().validate('stringy')\\n\\n with self.assertRaises(ValidationError):\\n List().validate(1)\",\n \"def test_base_validate_models():\\n with pytest.raises(ValueError):\\n base_validate_models([])\\n\\n assert [\\\"m\\\"] == base_validate_models([\\\"m\\\"])\",\n \"def test_invalidargumentBaseModel(self):\\n with self.assertRaises(NameError) as e:\\n b1 = BaseModel(hi)\\n self.assertEqual(str(e.exception), \\\"name 'hi' is not defined\\\")\",\n \"def __validate__(self):\",\n \"def test_class_errored(self, cls, exception):\",\n \"def test_validation(self):\\n\\n with self.assertRaises(ValidationError):\\n Dictionary().validate([1,2,3])\\n\\n with self.assertRaises(ValidationError):\\n Dictionary().validate('stringy')\\n\\n with self.assertRaises(ValidationError):\\n Dictionary().validate(1)\",\n \"def test_validation(self):\\r\\n\\r\\n with self.assertRaises(ValidationError):\\r\\n Dictionary().validate([1,2,3])\\r\\n\\r\\n with self.assertRaises(ValidationError):\\r\\n Dictionary().validate('stringy')\\r\\n\\r\\n with self.assertRaises(ValidationError):\\r\\n Dictionary().validate(1)\",\n \"def Validate(self):\\n raise NotImplementedError\",\n \"def test_validators():\",\n \"def test_base(self):\\n with pytest.raises(AttributeError) as exc:\\n Fidelity(\\\"epoch\\\", 1, 2, 0)\\n assert \\\"Base should be greater than or equal to 1\\\" == str(exc.value)\",\n \"def validate(self, *args, **kwargs):\\n raise NotImplementedError('Validate not implemented')\",\n \"def validate(self):\\n raise NotImplementedError()\",\n \"def test_base_class_expection():\\n with pytest.raises(TypeError):\\n cardinal.CardinalPoints()\",\n \"def test_encode_errors(self):\\n if self._cls == 'MetaschemaType':\\n if self._invalid_validate:\\n self.assert_raises(NotImplementedError, self.import_cls.encode,\\n self._invalid_validate[0], self.typedef)\\n else:\\n if self._invalid_validate:\\n self.assert_raises((ValueError,\\n jsonschema.exceptions.ValidationError),\\n self.import_cls.encode,\\n self._invalid_validate[0], self.typedef)\",\n \"def validate(cls, **kwargs: Any) -> None: # pragma no cover\",\n \"def validate(self):\\n raise NotImplementedError\",\n \"def validate(self):\\n raise NotImplementedError\",\n \"def __validate():\\n # TODO: implement\",\n \"def test_wrong_input(self):\\r\\n self.assertRaises(Exception, self.validate, (3, 2, 8, 8), (4, 2, 5, 5),\\r\\n 'valid', input=T.dmatrix())\\r\\n self.assertRaises(Exception, self.validate, (3, 2, 8, 8), (4, 2, 5, 5),\\r\\n 'valid', filters=T.dvector())\\r\\n self.assertRaises(Exception, self.validate, (3, 2, 8, 8), (4, 2, 5, 5),\\r\\n 'valid', input=T.dtensor3())\",\n \"def test_exception(self):\\n self.assertRaises(TypeError, lambda: self.init_model())\",\n \"def testValidate_Invalid(self):\\n values = {\\n messages.IntegerField: \\\"10\\\",\\n messages.FloatField: \\\"blah\\\",\\n messages.BooleanField: 0,\\n messages.BytesField: 10.20,\\n messages.StringField: 42,\\n }\\n\\n def action(field_class):\\n # Optional.\\n field = field_class(1)\\n self.assertRaises(messages.ValidationError,\\n field.validate,\\n values[field_class])\\n\\n # Required.\\n field = field_class(1, required=True)\\n self.assertRaises(messages.ValidationError,\\n field.validate,\\n values[field_class])\\n\\n # Repeated.\\n field = field_class(1, repeated=True)\\n self.assertRaises(messages.ValidationError,\\n field.validate,\\n [values[field_class]])\\n self.assertRaises(messages.ValidationError,\\n field.validate,\\n (values[field_class],))\\n self.ActionOnAllFieldClasses(action)\",\n \"def test_not_enough_inputs(self):\\n n = Node('a')\\n with self.assertRaises(ValidationError):\\n n.validate()\\n n.validate(False)\",\n \"def test_missing_required_field_raises_error():\\n with pytest.raises(ValidationError):\\n Entity()\",\n \"def test_init_invalid_retire_date(self):\\n # Whether this raises a ValueError or TypeError is an\\n # implementation detail delegated to `datetime`\\n with self.assertRaises((ValueError, TypeError)):\\n Person(\\n self.initial_year, self.name, self.birth_date,\\n retirement_date='invalid')\",\n \"def __validate(self):\\n pass\",\n \"def test_acc(self):\\n raise Exception(\\\" not implemented in base model\\\")\",\n \"def _validate(self):\\n pass\",\n \"def check_errors(self):\\n raise NotImplementedError(\\\"Implement it in a subclass.\\\")\",\n \"def validate(self):\\n ...\",\n \"def test_custom_validation_exceptions(self):\\n expected = {\\n \\\"errors\\\": [\\n {\\n \\\"status\\\": \\\"400\\\",\\n \\\"source\\\": {\\n \\\"pointer\\\": \\\"/data/attributes/email\\\",\\n },\\n \\\"detail\\\": \\\"Enter a valid email address.\\\",\\n \\\"code\\\": \\\"invalid\\\",\\n },\\n {\\n \\\"id\\\": \\\"armageddon101\\\",\\n \\\"detail\\\": \\\"Hey! You need a last name!\\\",\\n \\\"meta\\\": \\\"something\\\",\\n \\\"source\\\": {\\\"pointer\\\": \\\"/data/attributes/lastName\\\"},\\n },\\n ]\\n }\\n response = self.client.post(\\n \\\"/identities\\\",\\n {\\n \\\"data\\\": {\\n \\\"type\\\": \\\"users\\\",\\n \\\"attributes\\\": {\\n \\\"email\\\": \\\"bar\\\",\\n \\\"last_name\\\": \\\"alajflajaljalajlfjafljalj\\\",\\n },\\n }\\n },\\n )\\n\\n assert expected == response.json()\",\n \"def test_lt_invalid(self):\\n with self.assertRaises(TypeError):\\n self.instance < 12\",\n \"def test_errs(self):\\n b1 = BaseModel()\\n with self.assertRaises(AttributeError):\\n FileStorage.__objects\\n FileStorage.__File_path\\n\\n with self.assertRaises(TypeError):\\n models.storage.new()\\n models.storage.new(self, b1)\\n models.save(b1)\\n models.reload(b1)\\n models.all(b1)\",\n \"def test_002_import_exception(self):\\n m = schematics_flexible.BaseFlexible(\\n {'code': '07',\\n 'properties': {\\\"a\\\": \\\"this is test\\\"}},\\n store_handler=get_mock())\\n try:\\n m.validate()\\n except schematicsValidationError:\\n pass\\n else:\\n self.assertTrue(False,\\n 'Model must raise exception when import raise')\",\n \"def test_bad_curie():\\n with pytest.raises(ValidationError):\\n entity = Entity(id=\\\"this is not a curie\\\")\",\n \"def test_validation(self):\\n def test(**invalid_fields):\\n with self.assertRaises(AssertionError):\\n c = models.Citizen(**{'relatives': [], **invalid_fields})\\n\\n # Must throw errors in every case\\n test(citizen_id=-1, )\\n test(apartment='WRONG-STRING')\\n test(town='', )\\n test(street='', )\\n test(building='', )\\n test(name=None, )\\n test(birth_date='WRONG-STRING')\\n test(birth_date='31.02.2019')\\n test(relatives=['a'])\",\n \"def test_base_opt_validate():\\n opt = scheme._BaseOpt()\\n with pytest.raises(NotImplementedError):\\n opt.validate('foo', 'test-data')\",\n \"def test_error_expression(self):\\n error_expression = expression.InvalidExpression(\\\"an error message\\\")\\n # All three of \\\"penalty_expression\\\", \\\"constraint_expression\\\" and\\n # \\\"extra_constraints\\\" should raise.\\n with self.assertRaises(RuntimeError):\\n _ = error_expression.penalty_expression\\n with self.assertRaises(RuntimeError):\\n _ = error_expression.constraint_expression\\n with self.assertRaises(RuntimeError):\\n _ = error_expression.extra_constraints\",\n \"def test_trestle_validation_error() -> None:\\n msg = 'Custom validation error'\\n try:\\n raise TrestleValidationError(msg)\\n except TrestleValidationError as err:\\n assert str(err) == msg\\n assert err.msg == msg\",\n \"def test_constructor_wrong_options(self):\\n with self.assertRaises(TypeError):\\n base = BaseExporter(something_else=6)\",\n \"def test_call_invalid_input(self):\\r\\n with self.assertRaises(ValueError):\\r\\n self.estimator1(42, confidence_level=0)\",\n \"def validate(self):\",\n \"def validate(self):\",\n \"def test_foo(self):\\n foo = Foo(value=1)\\n with self.assertRaises(TypeError):\\n foo.foo()\",\n \"def test_from_object_fail(self):\\n class InvalidClass(object):\\n pass\\n Invalid_object = InvalidClass()\\n with self.assertRaises(TypeError):\\n BaseDataClass.from_object(Invalid_object)\",\n \"def test_minimal_validation(self, asset_class: Type[_PandasDataAsset]):\\n with pytest.raises(pydantic.ValidationError) as exc_info:\\n asset_class( # type: ignore[call-arg]\\n name=\\\"test\\\",\\n invalid_keyword_arg=\\\"bad\\\",\\n )\\n\\n errors_dict = exc_info.value.errors()\\n assert {\\n \\\"loc\\\": (\\\"invalid_keyword_arg\\\",),\\n \\\"msg\\\": \\\"extra fields not permitted\\\",\\n \\\"type\\\": \\\"value_error.extra\\\",\\n } == errors_dict[ # the extra keyword error will always be the last error\\n -1 # we don't care about any other errors for this test\\n ]\",\n \"def test_init_invalid_birth_date(self):\\n # Whether this raises a ValueError or TypeError is an\\n # implementation detail delegated to `datetime`\\n with self.assertRaises((ValueError, TypeError)):\\n Person(\\n self.initial_year, self.name, 'invalid',\\n retirement_date=self.retirement_date)\",\n \"def Invalid(\\r\\n self, s: str = \\\"\\\", e: Type[BaseException] = None, fail: bool = False\\r\\n) -> None:\\r\\n ...\",\n \"def check_validity(self):\",\n \"def __call__(self, *args, **kwargs):\\n if isinstance(self._exp, type) and issubclass(self._exp, Exception):\\n with pytest.raises(self._exp):\\n self._f(*args, **kwargs)\\n else:\\n assert self._exp == self._f(*args, **kwargs)\",\n \"def test_04_one_args(self):\\n with self.assertRaises(TypeError) as x:\\n r = Rectangle(7)\\n self.assertEqual(\\\"__init__() missing 1 required positional argument:\\\\\\n 'height'\\\", str(x.exception))\",\n \"def test_create_valiation(self):\\n with self.assertRaises(ValidationError) as test:\\n contact = Contact.objects.create(email='3232131')\\n contact.full_clean()\\n the_exception = dict(test.exception)\\n self.assertEqual(the_exception['name'], ['This field cannot be blank.'])\\n self.assertEqual(the_exception['email'], ['Enter a valid email address.'])\",\n \"def test_base_exception(self) -> None:\\n with pytest.raises(BaseException) as e:\\n 1 / 0\\n assert isinstance(e.value, ZeroDivisionError)\",\n \"def test_with_invalid_input(self):\\n for dataset_type in ['ruler', 'pencil', 'cheese']:\\n with self.assertRaises(ValueError) as exc:\\n check_dataset_type(dataset_type)\\n self.assertEqual(\\\"Dataset type not 'regular' or 'raw' is %s\\\" % dataset_type,\\n str(exc.exception))\",\n \"def test_property_invalid(self):\\n\\n self.assertRaises(DataObjectError,\\n setattr(self, \\\"foobar\\\", \\\"some value\\\")\\n )\",\n \"def test_001_validate_with_bad_properties(self):\\n m = schematics_flexible.BaseFlexible(\\n {'code': '06',\\n 'properties': {\\\"a\\\": \\\"this is test\\\"}},\\n store_handler=get_mock())\\n try:\\n m.validate()\\n except schematicsValidationError:\\n pass\\n else:\\n self.assertTrue(False,\\n 'Model must raise exception when validate raise')\",\n \"def test_new_invalid(self) -> None:\\n with pytest.raises(TypeError) as excinfo:\\n RunwayTestDefinition({}) # type: ignore\\n assert str(excinfo.value).startswith(\\\"expected data of type\\\")\",\n \"def test_get_other_typeerror_2(self):\\n v = versions.Version(name='foo', version='1.2.3')\\n self.assertRaises(TypeError, v._get_other, '1')\",\n \"def test_members_are_set_when_args_are_invalid(self):\\n\\n self.assertRaises(ValueError, Vec3, \\\"abc\\\", 6, \\\"q\\\")\",\n \"def testinvalidability(self):\\n self.assertRaises(AbilityError, AmuletAbility, 'Invalid')\\n self.assertRaises(AbilityError, AmuletAbility, '')\",\n \"def test_error(cls, err, data):\\n do_error_test(cls, err, data)\",\n \"def validate(self):\\n pass\",\n \"def validate(self):\\n pass\",\n \"def validate(self):\\n pass\",\n \"def validate(self):\\n pass\",\n \"def validate(self):\\n pass\",\n \"def validate(self):\\n pass\",\n \"def validate(self):\\n pass\",\n \"def validate(self):\\n pass\",\n \"def test_domain_validator(self):\\n id_stud = 1\\n nume_stud = \\\"Mircea Augustin\\\"\\n stud = Student(id_stud,nume_stud)\\n self.assertEqual(stud.get_id_stud(),id_stud)\\n self.assertEqual(stud.get_nume_stud(),nume_stud)\\n self.assertEqual(str(stud),\\\"1 | Mircea Augustin\\\")\\n stud2 = Student(id_stud,\\\"Horatiu Murdar\\\")\\n self.assertEqual(stud,stud2)\\n \\\"\\\"\\\"\\n test validator student\\n \\\"\\\"\\\"\\n validStud = ValidatorStudent()\\n stud = Student(1,\\\"Caine Rau\\\")\\n validStud.valideaza_stud(stud)\\n stud2 = Student(-1,\\\"\\\")\\n self.assertRaisesRegex(ValidError,\\\"Id student invalid!Nume student invalid!\\\",validStud.valideaza_stud,stud2)\\n \\\"\\\"\\\"\\n test domeniu pt disc\\n \\\"\\\"\\\"\\n id_disc = 1\\n nume_disc = \\\"Analiza\\\"\\n nume_prof = \\\"Berinde Stefan\\\"\\n disc = Disciplina(id_disc,nume_disc,nume_prof)\\n self.assertEqual(disc.get_id_disc(),id_disc)\\n self.assertEqual(disc.get_nume_disc(),nume_disc)\\n self.assertEqual(disc.get_nume_prof(),nume_prof)\\n self.assertEqual(str(disc),\\\"1 | Analiza | Berinde Stefan\\\")\\n disc2 = Disciplina(id_disc,\\\"Logica\\\",\\\"Pop\\\")\\n self.assertEqual(disc,disc2)\\n \\\"\\\"\\\"\\n test validare disc\\n \\\"\\\"\\\"\\n validDisc = ValidatorDisciplina()\\n id_disc = 1\\n nume_disc = \\\"Analiza\\\"\\n nume_prof = \\\"Berinde Stefan\\\"\\n disc = Disciplina(id_disc,nume_disc,nume_prof)\\n validDisc.valideaza_disc(disc)\\n disc_gresit = Disciplina(-1,\\\"\\\",\\\"\\\")\\n self.assertRaisesRegex(ValidError,\\\"Id disciplina invalid!Nume disciplina invalid!Nume profesor invalid!\\\",validDisc.valideaza_disc,disc_gresit)\\n \\\"\\\"\\\"\\n test domeniu pt note\\n \\\"\\\"\\\"\\n id_nota = 0\\n id_stud = 3\\n nume_stud = \\\"Mircea Augustin\\\"\\n stud = Student(id_stud,nume_stud)\\n id_disc = 2\\n nume_disc = \\\"Analiza\\\"\\n nume_prof = \\\"Berinde Stefan\\\"\\n disc = Disciplina(id_disc,nume_disc,nume_prof)\\n val_nota = 9.5\\n nota = Nota(id_nota,stud,disc,val_nota)\\n self.assertEqual(nota.get_id_nota(),id_nota)\\n self.assertEqual(nota.get_stud(),stud)\\n self.assertEqual(nota.get_disc(),disc)\\n self.assertEqual(nota.get_val_nota(),val_nota)\\n nota2 = Nota(id_nota,Student(0,\\\"a\\\"),Disciplina(0,\\\"a\\\",\\\"a\\\"),5.4)\\n self.assertEqual(nota,nota2)\\n \\\"\\\"\\\"\\n test validare pt note - BlackBox\\n \\\"\\\"\\\"\\n validNota = ValidatorNota()\\n stud = Student(0,\\\"a\\\")\\n disc = Disciplina(0,\\\"a\\\",\\\"a\\\")\\n validNota.valideaza_nota(Nota(3,Student(3,\\\"Chef Scarlatescu\\\"),Disciplina(2,\\\"Analiza\\\",\\\"Berinde Stefan\\\"),5.4))\\n validNota.valideaza_nota(Nota(0,Student(-1,\\\"a\\\"),Disciplina(0,\\\"\\\",\\\"a\\\"),1))\\n validNota.valideaza_nota(Nota(0,stud,disc,10))\\n self.assertRaisesRegex(ValidError,\\\"Id nota invalid! Valoare nota invalida!\\\",validNota.valideaza_nota, Nota(-1,stud,disc,0.9) )\\n self.assertRaisesRegex(ValidError,\\\"Id nota invalid! Valoare nota invalida!\\\",validNota.valideaza_nota, Nota(-50,stud,disc,0) )\\n self.assertRaisesRegex(ValidError,\\\"Valoare nota invalida!\\\",validNota.valideaza_nota, Nota(0,stud,disc,-1) )\\n self.assertRaisesRegex(ValidError,\\\"Valoare nota invalida!\\\",validNota.valideaza_nota, Nota(0,stud,disc,10.1) )\\n self.assertRaisesRegex(ValidError,\\\"Valoare nota invalida!\\\",validNota.valideaza_nota, Nota(0,stud,disc,50) )\",\n \"def test_to_python_method_validation_errors(self):\\n field = DecimalFractionField()\\n with self.assertRaises(ValidationError):\\n field.clean(\\\"abcd\\\")\\n\\n with self.assertRaises(ValidationError):\\n field.clean(\\\"1 1 1/3\\\")\\n\\n with self.assertRaises(ValidationError):\\n field.clean(\\\"1 1\\\")\",\n \"def test_validate_input_bad_input(self):\\r\\n self.assertRaises(ValueError, _validate_input,\\r\\n None, None, None, None, None)\\r\\n self.assertRaises(ValueError, _validate_input,\\r\\n self.dist_matrix_header, self.dist_matrix,\\r\\n self.mapping_header, self.mapping, None)\\r\\n self.assertRaises(ValueError, _validate_input,\\r\\n self.dist_matrix_header, 12,\\r\\n self.mapping_header, self.mapping, None)\\r\\n self.assertRaises(ValueError, _validate_input,\\r\\n self.dist_matrix_header, self.dist_matrix,\\r\\n self.mapping_header, self.mapping, 42)\\r\\n self.assertRaises(ValueError, _validate_input,\\r\\n self.dist_matrix_header, self.dist_matrix,\\r\\n self.mapping_header, self.mapping, \\\"aeiou\\\")\",\n \"def test_11_None_input(self):\\n with self.assertRaises(TypeError) as x:\\n r = Rectangle(None)\\n self.assertEqual(\\\"__init__() missing 1 required positional argument:\\\\\\n 'height'\\\", str(x.exception))\",\n \"def test_value_init17(self):\\n with self.assertRaises(TypeError) as err:\\n r1 = Rectangle(1, 2, 3, \\\"hi\\\")\\n msg = \\\"y must be an integer\\\"\\n self.assertEqual(str(err.exception), msg)\",\n \"def test_raising_exceptions(self):\\n with self.assertRaises(TypeError):\\n r = Rectangle(10, \\\"2\\\")\\n with self.assertRaises(TypeError):\\n r = Rectangle(10, 2.1)\\n with self.assertRaises(TypeError):\\n r = Rectangle(10, True, \\\"\\\")\\n with self.assertRaises(TypeError):\\n r = Rectangle(10, 10, 1.25)\\n with self.assertRaises(TypeError):\\n r = Rectangle(10, 10, \\\" \\\", True, False)\\n with self.assertRaises(TypeError):\\n r = Rectangle(10, None)\\n with self.assertRaises(TypeError):\\n r = Rectangle(\\\"2\\\", 10, 1, 1, \\\"str\\\")\\n with self.assertRaises(TypeError):\\n r = Rectangle(2.1, 10, 1, 1.5, 1)\\n with self.assertRaises(TypeError):\\n r = Rectangle(True, 10, 5, \\\"\\\", 10)\\n with self.assertRaises(TypeError):\\n r = Rectangle(False, 10)\\n with self.assertRaises(ValueError):\\n r = Rectangle(10, 0)\\n with self.assertRaises(ValueError):\\n r = Rectangle(0, 10)\\n with self.assertRaises(ValueError):\\n r = Rectangle(10, -1)\\n with self.assertRaises(ValueError):\\n r = Rectangle(-1, 10)\\n with self.assertRaises(ValueError):\\n r = Rectangle(0, 0)\\n with self.assertRaises(ValueError):\\n r = Rectangle(-1, -1)\\n with self.assertRaises(ValueError):\\n r = Rectangle(10, 5, 1, -1)\\n with self.assertRaises(ValueError):\\n r = Rectangle(10, 6, -2, 1)\\n with self.assertRaises(ValueError):\\n r = Rectangle(2, 2, -5, -5)\\n with self.assertRaises(ValueError):\\n r = Rectangle(10, 1, -1, 1, 1)\\n with self.assertRaises(ValueError):\\n r = Rectangle(10, 4, 1, -1, 10)\\n with self.assertRaises(TypeError):\\n r = Rectangle()\\n with self.assertRaises(TypeError):\\n r = Rectangle(10)\\n with self.assertRaises(TypeError):\\n r = Rectangle(10, 5, 1, 1, 1, 5)\",\n \"def validate(self, data):\\n raise NotImplementedError(\\\"Inherit this class and override this method.\\\")\",\n \"def test_invalid_version_fields(self):\\n self.assertRaises(ValueError, versions.Version, version='1234', name='foo')\",\n \"def test_that_field_required_validations_are_triggered_on_incorrect_attribute_setting(\\n self,\\n ):\\n person = Person(first_name=\\\"Johnny\\\", last_name=\\\"John\\\")\\n\\n with pytest.raises(ValidationError) as error:\\n person.first_name = \\\"\\\" # Simulate an error by force-resetting an attribute\\n\\n assert error.value.messages == {\\\"first_name\\\": [\\\"is required\\\"]}\",\n \"def test_invalid_instantiation(invalid_instance):\\n with pytest.raises(ValueError):\\n invalid_instance()\",\n \"def test_get_other_typeerror(self):\\n v = versions.Version(name='foo', version='1.2.3')\\n self.assertRaises(TypeError, v._get_other, 3.4)\",\n \"def __init__(self, message=\\\"\\\"):\\n super(ValidationError, self).__init__(message)\",\n \"def test_fails(self):\\n raise FoolishError(\\\"I am a broken test\\\")\",\n \"def test_other(self):\\n self.assertRaises(ValueError, isStringTrue, \\\"dog\\\")\\n return\",\n \"def test_constructor_bad_value(self):\\n self.assertRaises(line_format_errors.InputLineError,\\n lambda: D1Line(self.bad_line))\",\n \"def test_12_No_args(self):\\n with self.assertRaises(TypeError) as x:\\n r = Rectangle()\\n self.assertEqual(\\\"__init__() missing 2 required positional\\\\\\n arguments: 'width' and 'height'\\\", str(x.exception))\",\n \"def _check_validity(self):\\n pass\",\n \"def validate_result(self):\\n raise NotImplementedError\",\n \"def test_raises_when_init_has_superset_of_args(self):\\n\\n with pytest.raises(exceptions.APIImplementationError) as exc_info:\\n\\n class API(platform.PlatformAPI):\\n def __init__(self, base_url, token, org_name, user, other):\\n pass\\n\\n assert \\\"other\\\" in str(exc_info.value)\",\n \"def test_exceptions(self):\\n\\n with self.assertRaises(TypeError, msg=\\\"size must be an integer\\\"):\\n Square(6.5)\\n with self.assertRaises(TypeError, msg=\\\"size must be an integer\\\"):\\n Square(False)\\n with self.assertRaises(TypeError, msg=\\\"size must be an integer\\\"):\\n Square(6j)\\n with self.assertRaises(TypeError, msg=\\\"size must be an integer\\\"):\\n Square([4, 1])\\n with self.assertRaises(TypeError, msg=\\\"size must be an integer\\\"):\\n Square({\\\"Milk\\\": 1})\\n with self.assertRaises(TypeError, msg=\\\"size must be an integer\\\"):\\n Square((3, 9))\\n with self.assertRaises(TypeError, msg=\\\"x must be an integer\\\"):\\n Square(2, 3.5, 4)\\n with self.assertRaises(TypeError, msg=\\\"x must be an integer\\\"):\\n Square(2, True, 4)\\n with self.assertRaises(TypeError, msg=\\\"x must be an integer\\\"):\\n Square(2, 3j, 4)\\n with self.assertRaises(TypeError, msg=\\\"x must be an integer\\\"):\\n Square(2, \\\"3\\\", 4)\\n with self.assertRaises(TypeError, msg=\\\"x must be an integer\\\"):\\n Square(2, [3], 4)\\n with self.assertRaises(TypeError, msg=\\\"x must be an integer\\\"):\\n Square(2, {\\\"My\\\": 3}, 4)\\n with self.assertRaises(TypeError, msg=\\\"x must be an integer\\\"):\\n Square(2, (3, 3), 4)\\n with self.assertRaises(TypeError, msg=\\\"y must be an integer\\\"):\\n Square(2, 3, 4.2)\\n with self.assertRaises(TypeError, msg=\\\"y must be an integer\\\"):\\n Square(2, 3, False)\\n with self.assertRaises(TypeError, msg=\\\"y must be an integer\\\"):\\n Square(2, 3, 4j)\\n with self.assertRaises(TypeError, msg=\\\"y must be an integer\\\"):\\n Square(2, 3, \\\"4\\\")\\n with self.assertRaises(TypeError, msg=\\\"y must be an integer\\\"):\\n Square(2, 3, [4])\\n with self.assertRaises(TypeError, msg=\\\"y must be an integer\\\"):\\n Square(2, 3, {\\\"its\\\": 4})\\n with self.assertRaises(TypeError, msg=\\\"y must be an integer\\\"):\\n Square(2, 3, (4, 4))\\n with self.assertRaises(ValueError, msg=\\\"size must be > 0\\\"):\\n Square(0)\\n with self.assertRaises(ValueError, msg=\\\"size must be > 0\\\"):\\n Square(-2)\\n with self.assertRaises(ValueError, msg=\\\"x must be >= 0\\\"):\\n Square(1, -8, 9)\\n with self.assertRaises(ValueError, msg=\\\"y must be >= 0\\\"):\\n Square(1, 8, -9)\",\n \"def test04(self):\\n self.assertRaises(TypeError, robustApply, oneArgument, \\\"this\\\", blah=\\\"that\\\")\",\n \"def testinvalidsize(self):\\n self.assertRaises(AbilityError, AttributeAbility, size=0)\\n self.assertRaises(AbilityError, AttributeAbility, size=6)\",\n \"def test_value_init15(self):\\n with self.assertRaises(ValueError) as err:\\n r1 = Rectangle(0, 0)\\n msg = \\\"width must be > 0\\\"\\n self.assertEqual(str(err.exception), msg)\",\n \"def test_value_init6(self):\\n with self.assertRaises(TypeError) as err:\\n r1 = Rectangle(10, \\\"hi\\\")\\n msg = \\\"height must be an integer\\\"\\n self.assertEqual(str(err.exception), msg)\",\n \"def test_validate_on_invalid_data_type(self):\\n args = (self.bytes_a, 'invalid')\\n self.assertRaises(TypeError, objects.OpaqueObject, *args)\",\n \"def testinvalidattribute(self):\\n self.assertRaises(AbilityError, AttributeAbility, 'Invalid')\\n self.assertRaises(AbilityError, AttributeAbility, '', 3)\",\n \"def test_value_init12(self):\\n with self.assertRaises(ValueError) as err:\\n r1 = Rectangle(10, 1, 17, -9)\\n msg = \\\"y must be >= 0\\\"\\n self.assertEqual(str(err.exception), msg)\",\n \"def _assert_validation_error( # type: ignore[override]\\n self, expected_error_substring: str\\n ) -> None:\\n with self.assertRaisesRegex(\\n utils.ValidationError, expected_error_substring):\\n self.collection.validate()\",\n \"def test_value_init7(self):\\n with self.assertRaises(ValueError) as err:\\n r1 = Rectangle(-4, 5)\\n msg = \\\"width must be > 0\\\"\\n self.assertEqual(str(err.exception), msg)\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7366222","0.7237699","0.721509","0.7119311","0.7103784","0.70534474","0.7048264","0.6987562","0.6925039","0.6916672","0.6913254","0.6906676","0.68661255","0.68530154","0.68451655","0.68323594","0.68066764","0.6797967","0.6775788","0.67419225","0.67419225","0.6733247","0.6730697","0.6722662","0.6720216","0.66907567","0.66765404","0.66692656","0.66607714","0.66484046","0.66277206","0.66106933","0.66102284","0.6610196","0.6574951","0.65748227","0.6573513","0.65668887","0.65658957","0.65610874","0.6560925","0.65522444","0.6548679","0.6546936","0.65366346","0.65366346","0.6511592","0.6503953","0.6497619","0.648453","0.648115","0.6480178","0.6478114","0.646288","0.64555466","0.64552873","0.64551","0.6454287","0.6431127","0.6424193","0.6419743","0.6415004","0.6403812","0.6392456","0.63774633","0.63774633","0.63774633","0.63774633","0.63774633","0.63774633","0.63774633","0.63774633","0.63729966","0.6372462","0.6369305","0.6366909","0.6362629","0.6362034","0.63610125","0.6359107","0.63479984","0.63417596","0.6334898","0.63311476","0.6325517","0.6325169","0.6318713","0.63160026","0.63065916","0.63025564","0.63011307","0.6300085","0.62991714","0.6297665","0.62970793","0.6296993","0.6292317","0.62906206","0.6289713","0.6288218","0.62811404"],"string":"[\n \"0.7366222\",\n \"0.7237699\",\n \"0.721509\",\n \"0.7119311\",\n \"0.7103784\",\n \"0.70534474\",\n \"0.7048264\",\n \"0.6987562\",\n \"0.6925039\",\n \"0.6916672\",\n \"0.6913254\",\n \"0.6906676\",\n \"0.68661255\",\n \"0.68530154\",\n \"0.68451655\",\n \"0.68323594\",\n \"0.68066764\",\n \"0.6797967\",\n \"0.6775788\",\n \"0.67419225\",\n \"0.67419225\",\n \"0.6733247\",\n \"0.6730697\",\n \"0.6722662\",\n \"0.6720216\",\n \"0.66907567\",\n \"0.66765404\",\n \"0.66692656\",\n \"0.66607714\",\n \"0.66484046\",\n \"0.66277206\",\n \"0.66106933\",\n \"0.66102284\",\n \"0.6610196\",\n \"0.6574951\",\n \"0.65748227\",\n \"0.6573513\",\n \"0.65668887\",\n \"0.65658957\",\n \"0.65610874\",\n \"0.6560925\",\n \"0.65522444\",\n \"0.6548679\",\n \"0.6546936\",\n \"0.65366346\",\n \"0.65366346\",\n \"0.6511592\",\n \"0.6503953\",\n \"0.6497619\",\n \"0.648453\",\n \"0.648115\",\n \"0.6480178\",\n \"0.6478114\",\n \"0.646288\",\n \"0.64555466\",\n \"0.64552873\",\n \"0.64551\",\n \"0.6454287\",\n \"0.6431127\",\n \"0.6424193\",\n \"0.6419743\",\n \"0.6415004\",\n \"0.6403812\",\n \"0.6392456\",\n \"0.63774633\",\n \"0.63774633\",\n \"0.63774633\",\n \"0.63774633\",\n \"0.63774633\",\n \"0.63774633\",\n \"0.63774633\",\n \"0.63774633\",\n \"0.63729966\",\n \"0.6372462\",\n \"0.6369305\",\n \"0.6366909\",\n \"0.6362629\",\n \"0.6362034\",\n \"0.63610125\",\n \"0.6359107\",\n \"0.63479984\",\n \"0.63417596\",\n \"0.6334898\",\n \"0.63311476\",\n \"0.6325517\",\n \"0.6325169\",\n \"0.6318713\",\n \"0.63160026\",\n \"0.63065916\",\n \"0.63025564\",\n \"0.63011307\",\n \"0.6300085\",\n \"0.62991714\",\n \"0.6297665\",\n \"0.62970793\",\n \"0.6296993\",\n \"0.6292317\",\n \"0.62906206\",\n \"0.6289713\",\n \"0.6288218\",\n \"0.62811404\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":11393,"cells":{"query":{"kind":"string","value":"Testing task 87 class main logic"},"document":{"kind":"string","value":"def test_task87_main_logic(number, quantity, expected_value):\r\n assert algo.Task87.main_logic(number, quantity) == expected_value"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["def task():","def task5(self):\n\n pass","def task(self):","def task(self):","def test_solve_task(self):\n pass","def task4(self):\n\n pass","def task1(self):\n \n pass","def task3(self):\n\n pass","def test_get_run(self):\n pass","def task4_1(self):\n\n pass","def runtest(self):","def task():\n pass","def task():\n pass","def test_get_task_output(self):\n pass","def task2(self):\n\n pass","def setUp(self):\n self.t = Task()\n self.t(\"add one mississippi\")\n self.t(\"add two mississippi\")","def task2_3():","def setUp(self):\n self.t = Task()","def setUp(self):\n self.t = Task()","def tasks():","def runTests(self):\n \n pass","def task():\n\n\tprint('Example task executed.')","def setUp(self):\n self.t = Task()\n self.t(\"add one\")","def task_4_3_1():\n # TODO Task 4.3.1: Your code goes here\n pass","def task_4_3_2():\n # TODO Task 4.3.2: Your code goes here\n pass","def task_4_2_1():\n # TODO Task 4.2.1: Your code goes here\n pass","def task_4_3_3():\n # TODO Task 4.3.3: Your code goes here\n pass","def test_basic_execution(self):","def main():\n\n parser = argparse.ArgumentParser(description=\"generateTestStubs\")\n\n parser.add_argument(\"taskFile\",\n help=\"Path for assignment file.\")\n\n args = parser.parse_args()\n\n if not os.path.exists(args.taskFile):\n print(\"Task file does not exist.\")\n sys.exit(1)\n\n taskMgr = EEWebLPProject()\n taskMgr.initLP()\n\n #taskMgr.listProjects()\n #taskMgr.loadTree([\"project_id=8008922\"])\n tasks = taskMgr.getTasks([\"project_id=6890048\"],parent_id=8008922)\n\n fileByAssignee = taskMgr.getTaskOwners(args.taskFile)\n taskMgr.updateTaskOwners(fileByAssignee,tasks)","def _test(self):\n pass","def _test(self):\n pass","def _test(self):\n pass","def main():\n\n # Run all the requirements for part A\n ##############################\n # Question 3\n # runs naive A*\n question_3()\n\n ##############################\n # Question 5\n # runs online A*\n question_5()\n\n ##############################\n # Question 7\n # runs online A* on fine grid\n question_7()\n\n\n # Run all the requirements for part B\n ##############################\n # Question 9\n question_9()\n\n ##############################\n # Question 10\n question_10()\n\n ##############################\n # Question 1\n question_11()","def run_task(self) -> Task:","def _test(self):","def _test(self):","def _test(self):","def _test(self):","def _test(self):","def startTestRun(self):","def do_work(self):","def run_test(self):\n raise NotImplementedError","def test_4():","def test_main(self):\n results = main(0.1, files)\n # 1\n self.assertEqual(results, \"All Done Successfully\")\n results = main(0.1, get_files_bad_file_path())\n # 2\n self.assertIn(\"skipping to next\", results)\n results = main(0.1, get_files_bad_type())\n # 3\n self.assertIn(\"skipping to next\", results)\n results = main(0.1, get_files_bad_name_table())\n # 4\n self.assertIn(\"closing app. . .\", results)","def run_tests(self):\n raise NotImplementedError","def test(self):\n pass","def RUN(self):","def test_run_started(self):","def main(self):\r\n pass","def run_starter(self, expect_to_fail=False):","def tests():","def main():\n run_test_all()","def __main() :\n launchTests()","def test_T01():","def test_5():","def main(self):","def run_task(data_dir, task_id):\n print(\"Train and test for task %d ...\" % task_id)\n\n print(\"We are going to use this\")\n \n\n # Parse data\n train_files = glob.glob('%s/qa3_*_train.txt' % (data_dir, task_id))\n test_files = glob.glob('%s/qa3_*_test.txt' % (data_dir, task_id))\n\n dictionary = {\"nil\": 0}\n train_story, train_questions, train_qstory = parse_babi_task(train_files, dictionary, False)\n test_story, test_questions, test_qstory = parse_babi_task(test_files, dictionary, False)\n\n general_config = BabiConfig(train_story, train_questions, dictionary)\n\n\n # #### R: this line build a empty model to train\n # memory, model, loss = build_model(general_config)\n\n # if general_config.linear_start:\n # train_linear_start(train_story, train_questions, train_qstory, memory, model, loss, general_config)\n # else:\n # train(train_story, train_questions, train_qstory, memory, model, loss, general_config)\n\n\n\n # memory, model, loss = build_model(general_config)\n\n # this line\n test(test_story, test_questions, test_qstory, memory, model, loss, general_config)","def test_create_run(self):\n pass","def test_script(self) -> None:\n main()","def test_init_on_task_run(self):\n launcher = TaskLauncher(self.db, self.task_run, self.get_mock_assignment_data_array())\n self.assertEqual(self.db, launcher.db)\n self.assertEqual(self.task_run, launcher.task_run)\n self.assertEqual(len(launcher.assignments), 0)\n self.assertEqual(len(launcher.units), 0)\n self.assertEqual(launcher.provider_type, MockProvider.PROVIDER_TYPE)","def main():\n test_problem1a()\n test_problem1b()\n test_problem1c()","def main():\n tng.api.runner()","def main():\n test_problem3()","def test_3():","def main(cls):\n raise NotImplementedError","def _run(self):\n raise NotImplementedError","def _run(self):\n raise NotImplementedError","def test_task_add():\n pytest.fail('Not implemented yet.')","def generate_tasks(self, task):","def Run():\r\n pass","def test_runGame(self):\n # this is tested by playing the game. No good way to unit test this.\n pass","def task_gen(self):\n pass","def run(self):\n \n pass","def setUpClass(cls):\n cls.t = Task()\n cls.t('add foo entry:2008-12-22 start:2008-12-22')\n cls.t('add bar entry:2009-04-17 start:2009-04-17')","def create_task():","def _run(self):\n raise NotImplementedError","def main(self) -> None:\n pass","def getTestResults():","def unitary_test():","def test_T1():","def test_T1():","def test(self):","def test(self):","def main():\n test_problem2()","def run(self):\n pass","def run(self):\n pass","def run(self):\n pass","def run(self):\n pass","def run(self):\n pass","def run(self):\n pass","def run(self):\n pass","def run(self):\n pass","def run(self):\n pass","def run(self):\n pass","def run(self):\n pass","def run(self):\n pass","def run(self):\n pass","def run(self):\n pass","def run(self):\n pass","def executor(self):","def test_main():\n # Setup\n # Exercise\n # Verify"],"string":"[\n \"def task():\",\n \"def task5(self):\\n\\n pass\",\n \"def task(self):\",\n \"def task(self):\",\n \"def test_solve_task(self):\\n pass\",\n \"def task4(self):\\n\\n pass\",\n \"def task1(self):\\n \\n pass\",\n \"def task3(self):\\n\\n pass\",\n \"def test_get_run(self):\\n pass\",\n \"def task4_1(self):\\n\\n pass\",\n \"def runtest(self):\",\n \"def task():\\n pass\",\n \"def task():\\n pass\",\n \"def test_get_task_output(self):\\n pass\",\n \"def task2(self):\\n\\n pass\",\n \"def setUp(self):\\n self.t = Task()\\n self.t(\\\"add one mississippi\\\")\\n self.t(\\\"add two mississippi\\\")\",\n \"def task2_3():\",\n \"def setUp(self):\\n self.t = Task()\",\n \"def setUp(self):\\n self.t = Task()\",\n \"def tasks():\",\n \"def runTests(self):\\n \\n pass\",\n \"def task():\\n\\n\\tprint('Example task executed.')\",\n \"def setUp(self):\\n self.t = Task()\\n self.t(\\\"add one\\\")\",\n \"def task_4_3_1():\\n # TODO Task 4.3.1: Your code goes here\\n pass\",\n \"def task_4_3_2():\\n # TODO Task 4.3.2: Your code goes here\\n pass\",\n \"def task_4_2_1():\\n # TODO Task 4.2.1: Your code goes here\\n pass\",\n \"def task_4_3_3():\\n # TODO Task 4.3.3: Your code goes here\\n pass\",\n \"def test_basic_execution(self):\",\n \"def main():\\n\\n parser = argparse.ArgumentParser(description=\\\"generateTestStubs\\\")\\n\\n parser.add_argument(\\\"taskFile\\\",\\n help=\\\"Path for assignment file.\\\")\\n\\n args = parser.parse_args()\\n\\n if not os.path.exists(args.taskFile):\\n print(\\\"Task file does not exist.\\\")\\n sys.exit(1)\\n\\n taskMgr = EEWebLPProject()\\n taskMgr.initLP()\\n\\n #taskMgr.listProjects()\\n #taskMgr.loadTree([\\\"project_id=8008922\\\"])\\n tasks = taskMgr.getTasks([\\\"project_id=6890048\\\"],parent_id=8008922)\\n\\n fileByAssignee = taskMgr.getTaskOwners(args.taskFile)\\n taskMgr.updateTaskOwners(fileByAssignee,tasks)\",\n \"def _test(self):\\n pass\",\n \"def _test(self):\\n pass\",\n \"def _test(self):\\n pass\",\n \"def main():\\n\\n # Run all the requirements for part A\\n ##############################\\n # Question 3\\n # runs naive A*\\n question_3()\\n\\n ##############################\\n # Question 5\\n # runs online A*\\n question_5()\\n\\n ##############################\\n # Question 7\\n # runs online A* on fine grid\\n question_7()\\n\\n\\n # Run all the requirements for part B\\n ##############################\\n # Question 9\\n question_9()\\n\\n ##############################\\n # Question 10\\n question_10()\\n\\n ##############################\\n # Question 1\\n question_11()\",\n \"def run_task(self) -> Task:\",\n \"def _test(self):\",\n \"def _test(self):\",\n \"def _test(self):\",\n \"def _test(self):\",\n \"def _test(self):\",\n \"def startTestRun(self):\",\n \"def do_work(self):\",\n \"def run_test(self):\\n raise NotImplementedError\",\n \"def test_4():\",\n \"def test_main(self):\\n results = main(0.1, files)\\n # 1\\n self.assertEqual(results, \\\"All Done Successfully\\\")\\n results = main(0.1, get_files_bad_file_path())\\n # 2\\n self.assertIn(\\\"skipping to next\\\", results)\\n results = main(0.1, get_files_bad_type())\\n # 3\\n self.assertIn(\\\"skipping to next\\\", results)\\n results = main(0.1, get_files_bad_name_table())\\n # 4\\n self.assertIn(\\\"closing app. . .\\\", results)\",\n \"def run_tests(self):\\n raise NotImplementedError\",\n \"def test(self):\\n pass\",\n \"def RUN(self):\",\n \"def test_run_started(self):\",\n \"def main(self):\\r\\n pass\",\n \"def run_starter(self, expect_to_fail=False):\",\n \"def tests():\",\n \"def main():\\n run_test_all()\",\n \"def __main() :\\n launchTests()\",\n \"def test_T01():\",\n \"def test_5():\",\n \"def main(self):\",\n \"def run_task(data_dir, task_id):\\n print(\\\"Train and test for task %d ...\\\" % task_id)\\n\\n print(\\\"We are going to use this\\\")\\n \\n\\n # Parse data\\n train_files = glob.glob('%s/qa3_*_train.txt' % (data_dir, task_id))\\n test_files = glob.glob('%s/qa3_*_test.txt' % (data_dir, task_id))\\n\\n dictionary = {\\\"nil\\\": 0}\\n train_story, train_questions, train_qstory = parse_babi_task(train_files, dictionary, False)\\n test_story, test_questions, test_qstory = parse_babi_task(test_files, dictionary, False)\\n\\n general_config = BabiConfig(train_story, train_questions, dictionary)\\n\\n\\n # #### R: this line build a empty model to train\\n # memory, model, loss = build_model(general_config)\\n\\n # if general_config.linear_start:\\n # train_linear_start(train_story, train_questions, train_qstory, memory, model, loss, general_config)\\n # else:\\n # train(train_story, train_questions, train_qstory, memory, model, loss, general_config)\\n\\n\\n\\n # memory, model, loss = build_model(general_config)\\n\\n # this line\\n test(test_story, test_questions, test_qstory, memory, model, loss, general_config)\",\n \"def test_create_run(self):\\n pass\",\n \"def test_script(self) -> None:\\n main()\",\n \"def test_init_on_task_run(self):\\n launcher = TaskLauncher(self.db, self.task_run, self.get_mock_assignment_data_array())\\n self.assertEqual(self.db, launcher.db)\\n self.assertEqual(self.task_run, launcher.task_run)\\n self.assertEqual(len(launcher.assignments), 0)\\n self.assertEqual(len(launcher.units), 0)\\n self.assertEqual(launcher.provider_type, MockProvider.PROVIDER_TYPE)\",\n \"def main():\\n test_problem1a()\\n test_problem1b()\\n test_problem1c()\",\n \"def main():\\n tng.api.runner()\",\n \"def main():\\n test_problem3()\",\n \"def test_3():\",\n \"def main(cls):\\n raise NotImplementedError\",\n \"def _run(self):\\n raise NotImplementedError\",\n \"def _run(self):\\n raise NotImplementedError\",\n \"def test_task_add():\\n pytest.fail('Not implemented yet.')\",\n \"def generate_tasks(self, task):\",\n \"def Run():\\r\\n pass\",\n \"def test_runGame(self):\\n # this is tested by playing the game. No good way to unit test this.\\n pass\",\n \"def task_gen(self):\\n pass\",\n \"def run(self):\\n \\n pass\",\n \"def setUpClass(cls):\\n cls.t = Task()\\n cls.t('add foo entry:2008-12-22 start:2008-12-22')\\n cls.t('add bar entry:2009-04-17 start:2009-04-17')\",\n \"def create_task():\",\n \"def _run(self):\\n raise NotImplementedError\",\n \"def main(self) -> None:\\n pass\",\n \"def getTestResults():\",\n \"def unitary_test():\",\n \"def test_T1():\",\n \"def test_T1():\",\n \"def test(self):\",\n \"def test(self):\",\n \"def main():\\n test_problem2()\",\n \"def run(self):\\n pass\",\n \"def run(self):\\n pass\",\n \"def run(self):\\n pass\",\n \"def run(self):\\n pass\",\n \"def run(self):\\n pass\",\n \"def run(self):\\n pass\",\n \"def run(self):\\n pass\",\n \"def run(self):\\n pass\",\n \"def run(self):\\n pass\",\n \"def run(self):\\n pass\",\n \"def run(self):\\n pass\",\n \"def run(self):\\n pass\",\n \"def run(self):\\n pass\",\n \"def run(self):\\n pass\",\n \"def run(self):\\n pass\",\n \"def executor(self):\",\n \"def test_main():\\n # Setup\\n # Exercise\\n # Verify\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.76041514","0.7486486","0.74503386","0.74503386","0.7376307","0.73466694","0.7306746","0.7189935","0.7185765","0.71620274","0.7104699","0.7092412","0.7092412","0.7046849","0.70468414","0.70148546","0.69969004","0.69918513","0.69918513","0.69721514","0.69410145","0.6892891","0.6835636","0.6819364","0.679809","0.6794591","0.6757822","0.6757331","0.67293054","0.6696113","0.6696113","0.6696113","0.66756994","0.66639143","0.6615995","0.6615995","0.6615995","0.6615995","0.6615995","0.6612593","0.66019166","0.6569476","0.6558126","0.65552807","0.65442735","0.6535935","0.65150464","0.651414","0.6499801","0.64902747","0.6489771","0.648206","0.6473288","0.6468453","0.64543986","0.6447636","0.6444427","0.6440666","0.6440518","0.64392823","0.64327693","0.64277136","0.6425636","0.64057213","0.6401705","0.6392971","0.6392971","0.6387312","0.6371992","0.63567436","0.6353032","0.6344387","0.63428885","0.6332036","0.6322566","0.63172734","0.6311024","0.63022184","0.6297482","0.6280561","0.6280561","0.6277703","0.6277703","0.6276716","0.62727225","0.62727225","0.62727225","0.62727225","0.62727225","0.62727225","0.62727225","0.62727225","0.62727225","0.62727225","0.62727225","0.62727225","0.62727225","0.62727225","0.62727225","0.62678915","0.6264401"],"string":"[\n \"0.76041514\",\n \"0.7486486\",\n \"0.74503386\",\n \"0.74503386\",\n \"0.7376307\",\n \"0.73466694\",\n \"0.7306746\",\n \"0.7189935\",\n \"0.7185765\",\n \"0.71620274\",\n \"0.7104699\",\n \"0.7092412\",\n \"0.7092412\",\n \"0.7046849\",\n \"0.70468414\",\n \"0.70148546\",\n \"0.69969004\",\n \"0.69918513\",\n \"0.69918513\",\n \"0.69721514\",\n \"0.69410145\",\n \"0.6892891\",\n \"0.6835636\",\n \"0.6819364\",\n \"0.679809\",\n \"0.6794591\",\n \"0.6757822\",\n \"0.6757331\",\n \"0.67293054\",\n \"0.6696113\",\n \"0.6696113\",\n \"0.6696113\",\n \"0.66756994\",\n \"0.66639143\",\n \"0.6615995\",\n \"0.6615995\",\n \"0.6615995\",\n \"0.6615995\",\n \"0.6615995\",\n \"0.6612593\",\n \"0.66019166\",\n \"0.6569476\",\n \"0.6558126\",\n \"0.65552807\",\n \"0.65442735\",\n \"0.6535935\",\n \"0.65150464\",\n \"0.651414\",\n \"0.6499801\",\n \"0.64902747\",\n \"0.6489771\",\n \"0.648206\",\n \"0.6473288\",\n \"0.6468453\",\n \"0.64543986\",\n \"0.6447636\",\n \"0.6444427\",\n \"0.6440666\",\n \"0.6440518\",\n \"0.64392823\",\n \"0.64327693\",\n \"0.64277136\",\n \"0.6425636\",\n \"0.64057213\",\n \"0.6401705\",\n \"0.6392971\",\n \"0.6392971\",\n \"0.6387312\",\n \"0.6371992\",\n \"0.63567436\",\n \"0.6353032\",\n \"0.6344387\",\n \"0.63428885\",\n \"0.6332036\",\n \"0.6322566\",\n \"0.63172734\",\n \"0.6311024\",\n \"0.63022184\",\n \"0.6297482\",\n \"0.6280561\",\n \"0.6280561\",\n \"0.6277703\",\n \"0.6277703\",\n \"0.6276716\",\n \"0.62727225\",\n \"0.62727225\",\n \"0.62727225\",\n \"0.62727225\",\n \"0.62727225\",\n \"0.62727225\",\n \"0.62727225\",\n \"0.62727225\",\n \"0.62727225\",\n \"0.62727225\",\n \"0.62727225\",\n \"0.62727225\",\n \"0.62727225\",\n \"0.62727225\",\n \"0.62727225\",\n \"0.62678915\",\n \"0.6264401\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":11394,"cells":{"query":{"kind":"string","value":"Testing base class with validation method for exceptions"},"document":{"kind":"string","value":"def test_task_with_two_int_validation_parameters_validate_exceptions_task226(data, expected_value):\r\n\r\n with pytest.raises(expected_value):\r\n algo.TaskWithTwoIntValidationParameters.validate_data(data)"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["def test_validation(self):\n self.validationFails()","def test_should_not_be_callable(self):\n with self.assertRaises(NotImplementedError):\n BaseValidator()(\"any-value\")","def test_validate(self):\n pass","def test_validation(self):\r\n\r\n with self.assertRaises(ValidationError):\r\n List().validate({'blake':31, 'something_else':'that'})\r\n\r\n with self.assertRaises(ValidationError):\r\n List().validate('stringy')\r\n\r\n with self.assertRaises(ValidationError):\r\n List().validate(1)","def test_validation(self):\n\n with self.assertRaises(ValidationError):\n List().validate({'blake':31, 'something_else':'that'})\n\n with self.assertRaises(ValidationError):\n List().validate('stringy')\n\n with self.assertRaises(ValidationError):\n List().validate(1)","def test_base_validate_models():\n with pytest.raises(ValueError):\n base_validate_models([])\n\n assert [\"m\"] == base_validate_models([\"m\"])","def test_invalidargumentBaseModel(self):\n with self.assertRaises(NameError) as e:\n b1 = BaseModel(hi)\n self.assertEqual(str(e.exception), \"name 'hi' is not defined\")","def __validate__(self):","def test_class_errored(self, cls, exception):","def test_validation(self):\n\n with self.assertRaises(ValidationError):\n Dictionary().validate([1,2,3])\n\n with self.assertRaises(ValidationError):\n Dictionary().validate('stringy')\n\n with self.assertRaises(ValidationError):\n Dictionary().validate(1)","def test_validation(self):\r\n\r\n with self.assertRaises(ValidationError):\r\n Dictionary().validate([1,2,3])\r\n\r\n with self.assertRaises(ValidationError):\r\n Dictionary().validate('stringy')\r\n\r\n with self.assertRaises(ValidationError):\r\n Dictionary().validate(1)","def Validate(self):\n raise NotImplementedError","def test_validators():","def test_base(self):\n with pytest.raises(AttributeError) as exc:\n Fidelity(\"epoch\", 1, 2, 0)\n assert \"Base should be greater than or equal to 1\" == str(exc.value)","def validate(self, *args, **kwargs):\n raise NotImplementedError('Validate not implemented')","def validate(self):\n raise NotImplementedError()","def test_base_class_expection():\n with pytest.raises(TypeError):\n cardinal.CardinalPoints()","def test_encode_errors(self):\n if self._cls == 'MetaschemaType':\n if self._invalid_validate:\n self.assert_raises(NotImplementedError, self.import_cls.encode,\n self._invalid_validate[0], self.typedef)\n else:\n if self._invalid_validate:\n self.assert_raises((ValueError,\n jsonschema.exceptions.ValidationError),\n self.import_cls.encode,\n self._invalid_validate[0], self.typedef)","def validate(cls, **kwargs: Any) -> None: # pragma no cover","def validate(self):\n raise NotImplementedError","def validate(self):\n raise NotImplementedError","def __validate():\n # TODO: implement","def test_wrong_input(self):\r\n self.assertRaises(Exception, self.validate, (3, 2, 8, 8), (4, 2, 5, 5),\r\n 'valid', input=T.dmatrix())\r\n self.assertRaises(Exception, self.validate, (3, 2, 8, 8), (4, 2, 5, 5),\r\n 'valid', filters=T.dvector())\r\n self.assertRaises(Exception, self.validate, (3, 2, 8, 8), (4, 2, 5, 5),\r\n 'valid', input=T.dtensor3())","def test_exception(self):\n self.assertRaises(TypeError, lambda: self.init_model())","def testValidate_Invalid(self):\n values = {\n messages.IntegerField: \"10\",\n messages.FloatField: \"blah\",\n messages.BooleanField: 0,\n messages.BytesField: 10.20,\n messages.StringField: 42,\n }\n\n def action(field_class):\n # Optional.\n field = field_class(1)\n self.assertRaises(messages.ValidationError,\n field.validate,\n values[field_class])\n\n # Required.\n field = field_class(1, required=True)\n self.assertRaises(messages.ValidationError,\n field.validate,\n values[field_class])\n\n # Repeated.\n field = field_class(1, repeated=True)\n self.assertRaises(messages.ValidationError,\n field.validate,\n [values[field_class]])\n self.assertRaises(messages.ValidationError,\n field.validate,\n (values[field_class],))\n self.ActionOnAllFieldClasses(action)","def test_not_enough_inputs(self):\n n = Node('a')\n with self.assertRaises(ValidationError):\n n.validate()\n n.validate(False)","def test_missing_required_field_raises_error():\n with pytest.raises(ValidationError):\n Entity()","def test_init_invalid_retire_date(self):\n # Whether this raises a ValueError or TypeError is an\n # implementation detail delegated to `datetime`\n with self.assertRaises((ValueError, TypeError)):\n Person(\n self.initial_year, self.name, self.birth_date,\n retirement_date='invalid')","def __validate(self):\n pass","def test_acc(self):\n raise Exception(\" not implemented in base model\")","def _validate(self):\n pass","def check_errors(self):\n raise NotImplementedError(\"Implement it in a subclass.\")","def validate(self):\n ...","def test_custom_validation_exceptions(self):\n expected = {\n \"errors\": [\n {\n \"status\": \"400\",\n \"source\": {\n \"pointer\": \"/data/attributes/email\",\n },\n \"detail\": \"Enter a valid email address.\",\n \"code\": \"invalid\",\n },\n {\n \"id\": \"armageddon101\",\n \"detail\": \"Hey! You need a last name!\",\n \"meta\": \"something\",\n \"source\": {\"pointer\": \"/data/attributes/lastName\"},\n },\n ]\n }\n response = self.client.post(\n \"/identities\",\n {\n \"data\": {\n \"type\": \"users\",\n \"attributes\": {\n \"email\": \"bar\",\n \"last_name\": \"alajflajaljalajlfjafljalj\",\n },\n }\n },\n )\n\n assert expected == response.json()","def test_lt_invalid(self):\n with self.assertRaises(TypeError):\n self.instance < 12","def test_errs(self):\n b1 = BaseModel()\n with self.assertRaises(AttributeError):\n FileStorage.__objects\n FileStorage.__File_path\n\n with self.assertRaises(TypeError):\n models.storage.new()\n models.storage.new(self, b1)\n models.save(b1)\n models.reload(b1)\n models.all(b1)","def test_002_import_exception(self):\n m = schematics_flexible.BaseFlexible(\n {'code': '07',\n 'properties': {\"a\": \"this is test\"}},\n store_handler=get_mock())\n try:\n m.validate()\n except schematicsValidationError:\n pass\n else:\n self.assertTrue(False,\n 'Model must raise exception when import raise')","def test_bad_curie():\n with pytest.raises(ValidationError):\n entity = Entity(id=\"this is not a curie\")","def test_validation(self):\n def test(**invalid_fields):\n with self.assertRaises(AssertionError):\n c = models.Citizen(**{'relatives': [], **invalid_fields})\n\n # Must throw errors in every case\n test(citizen_id=-1, )\n test(apartment='WRONG-STRING')\n test(town='', )\n test(street='', )\n test(building='', )\n test(name=None, )\n test(birth_date='WRONG-STRING')\n test(birth_date='31.02.2019')\n test(relatives=['a'])","def test_base_opt_validate():\n opt = scheme._BaseOpt()\n with pytest.raises(NotImplementedError):\n opt.validate('foo', 'test-data')","def test_error_expression(self):\n error_expression = expression.InvalidExpression(\"an error message\")\n # All three of \"penalty_expression\", \"constraint_expression\" and\n # \"extra_constraints\" should raise.\n with self.assertRaises(RuntimeError):\n _ = error_expression.penalty_expression\n with self.assertRaises(RuntimeError):\n _ = error_expression.constraint_expression\n with self.assertRaises(RuntimeError):\n _ = error_expression.extra_constraints","def test_trestle_validation_error() -> None:\n msg = 'Custom validation error'\n try:\n raise TrestleValidationError(msg)\n except TrestleValidationError as err:\n assert str(err) == msg\n assert err.msg == msg","def test_constructor_wrong_options(self):\n with self.assertRaises(TypeError):\n base = BaseExporter(something_else=6)","def test_call_invalid_input(self):\r\n with self.assertRaises(ValueError):\r\n self.estimator1(42, confidence_level=0)","def validate(self):","def validate(self):","def test_foo(self):\n foo = Foo(value=1)\n with self.assertRaises(TypeError):\n foo.foo()","def test_from_object_fail(self):\n class InvalidClass(object):\n pass\n Invalid_object = InvalidClass()\n with self.assertRaises(TypeError):\n BaseDataClass.from_object(Invalid_object)","def test_minimal_validation(self, asset_class: Type[_PandasDataAsset]):\n with pytest.raises(pydantic.ValidationError) as exc_info:\n asset_class( # type: ignore[call-arg]\n name=\"test\",\n invalid_keyword_arg=\"bad\",\n )\n\n errors_dict = exc_info.value.errors()\n assert {\n \"loc\": (\"invalid_keyword_arg\",),\n \"msg\": \"extra fields not permitted\",\n \"type\": \"value_error.extra\",\n } == errors_dict[ # the extra keyword error will always be the last error\n -1 # we don't care about any other errors for this test\n ]","def test_init_invalid_birth_date(self):\n # Whether this raises a ValueError or TypeError is an\n # implementation detail delegated to `datetime`\n with self.assertRaises((ValueError, TypeError)):\n Person(\n self.initial_year, self.name, 'invalid',\n retirement_date=self.retirement_date)","def Invalid(\r\n self, s: str = \"\", e: Type[BaseException] = None, fail: bool = False\r\n) -> None:\r\n ...","def check_validity(self):","def __call__(self, *args, **kwargs):\n if isinstance(self._exp, type) and issubclass(self._exp, Exception):\n with pytest.raises(self._exp):\n self._f(*args, **kwargs)\n else:\n assert self._exp == self._f(*args, **kwargs)","def test_04_one_args(self):\n with self.assertRaises(TypeError) as x:\n r = Rectangle(7)\n self.assertEqual(\"__init__() missing 1 required positional argument:\\\n 'height'\", str(x.exception))","def test_create_valiation(self):\n with self.assertRaises(ValidationError) as test:\n contact = Contact.objects.create(email='3232131')\n contact.full_clean()\n the_exception = dict(test.exception)\n self.assertEqual(the_exception['name'], ['This field cannot be blank.'])\n self.assertEqual(the_exception['email'], ['Enter a valid email address.'])","def test_base_exception(self) -> None:\n with pytest.raises(BaseException) as e:\n 1 / 0\n assert isinstance(e.value, ZeroDivisionError)","def test_with_invalid_input(self):\n for dataset_type in ['ruler', 'pencil', 'cheese']:\n with self.assertRaises(ValueError) as exc:\n check_dataset_type(dataset_type)\n self.assertEqual(\"Dataset type not 'regular' or 'raw' is %s\" % dataset_type,\n str(exc.exception))","def test_property_invalid(self):\n\n self.assertRaises(DataObjectError,\n setattr(self, \"foobar\", \"some value\")\n )","def test_001_validate_with_bad_properties(self):\n m = schematics_flexible.BaseFlexible(\n {'code': '06',\n 'properties': {\"a\": \"this is test\"}},\n store_handler=get_mock())\n try:\n m.validate()\n except schematicsValidationError:\n pass\n else:\n self.assertTrue(False,\n 'Model must raise exception when validate raise')","def test_new_invalid(self) -> None:\n with pytest.raises(TypeError) as excinfo:\n RunwayTestDefinition({}) # type: ignore\n assert str(excinfo.value).startswith(\"expected data of type\")","def test_get_other_typeerror_2(self):\n v = versions.Version(name='foo', version='1.2.3')\n self.assertRaises(TypeError, v._get_other, '1')","def test_members_are_set_when_args_are_invalid(self):\n\n self.assertRaises(ValueError, Vec3, \"abc\", 6, \"q\")","def testinvalidability(self):\n self.assertRaises(AbilityError, AmuletAbility, 'Invalid')\n self.assertRaises(AbilityError, AmuletAbility, '')","def test_error(cls, err, data):\n do_error_test(cls, err, data)","def validate(self):\n pass","def validate(self):\n pass","def validate(self):\n pass","def validate(self):\n pass","def validate(self):\n pass","def validate(self):\n pass","def validate(self):\n pass","def validate(self):\n pass","def test_domain_validator(self):\n id_stud = 1\n nume_stud = \"Mircea Augustin\"\n stud = Student(id_stud,nume_stud)\n self.assertEqual(stud.get_id_stud(),id_stud)\n self.assertEqual(stud.get_nume_stud(),nume_stud)\n self.assertEqual(str(stud),\"1 | Mircea Augustin\")\n stud2 = Student(id_stud,\"Horatiu Murdar\")\n self.assertEqual(stud,stud2)\n \"\"\"\n test validator student\n \"\"\"\n validStud = ValidatorStudent()\n stud = Student(1,\"Caine Rau\")\n validStud.valideaza_stud(stud)\n stud2 = Student(-1,\"\")\n self.assertRaisesRegex(ValidError,\"Id student invalid!Nume student invalid!\",validStud.valideaza_stud,stud2)\n \"\"\"\n test domeniu pt disc\n \"\"\"\n id_disc = 1\n nume_disc = \"Analiza\"\n nume_prof = \"Berinde Stefan\"\n disc = Disciplina(id_disc,nume_disc,nume_prof)\n self.assertEqual(disc.get_id_disc(),id_disc)\n self.assertEqual(disc.get_nume_disc(),nume_disc)\n self.assertEqual(disc.get_nume_prof(),nume_prof)\n self.assertEqual(str(disc),\"1 | Analiza | Berinde Stefan\")\n disc2 = Disciplina(id_disc,\"Logica\",\"Pop\")\n self.assertEqual(disc,disc2)\n \"\"\"\n test validare disc\n \"\"\"\n validDisc = ValidatorDisciplina()\n id_disc = 1\n nume_disc = \"Analiza\"\n nume_prof = \"Berinde Stefan\"\n disc = Disciplina(id_disc,nume_disc,nume_prof)\n validDisc.valideaza_disc(disc)\n disc_gresit = Disciplina(-1,\"\",\"\")\n self.assertRaisesRegex(ValidError,\"Id disciplina invalid!Nume disciplina invalid!Nume profesor invalid!\",validDisc.valideaza_disc,disc_gresit)\n \"\"\"\n test domeniu pt note\n \"\"\"\n id_nota = 0\n id_stud = 3\n nume_stud = \"Mircea Augustin\"\n stud = Student(id_stud,nume_stud)\n id_disc = 2\n nume_disc = \"Analiza\"\n nume_prof = \"Berinde Stefan\"\n disc = Disciplina(id_disc,nume_disc,nume_prof)\n val_nota = 9.5\n nota = Nota(id_nota,stud,disc,val_nota)\n self.assertEqual(nota.get_id_nota(),id_nota)\n self.assertEqual(nota.get_stud(),stud)\n self.assertEqual(nota.get_disc(),disc)\n self.assertEqual(nota.get_val_nota(),val_nota)\n nota2 = Nota(id_nota,Student(0,\"a\"),Disciplina(0,\"a\",\"a\"),5.4)\n self.assertEqual(nota,nota2)\n \"\"\"\n test validare pt note - BlackBox\n \"\"\"\n validNota = ValidatorNota()\n stud = Student(0,\"a\")\n disc = Disciplina(0,\"a\",\"a\")\n validNota.valideaza_nota(Nota(3,Student(3,\"Chef Scarlatescu\"),Disciplina(2,\"Analiza\",\"Berinde Stefan\"),5.4))\n validNota.valideaza_nota(Nota(0,Student(-1,\"a\"),Disciplina(0,\"\",\"a\"),1))\n validNota.valideaza_nota(Nota(0,stud,disc,10))\n self.assertRaisesRegex(ValidError,\"Id nota invalid! Valoare nota invalida!\",validNota.valideaza_nota, Nota(-1,stud,disc,0.9) )\n self.assertRaisesRegex(ValidError,\"Id nota invalid! Valoare nota invalida!\",validNota.valideaza_nota, Nota(-50,stud,disc,0) )\n self.assertRaisesRegex(ValidError,\"Valoare nota invalida!\",validNota.valideaza_nota, Nota(0,stud,disc,-1) )\n self.assertRaisesRegex(ValidError,\"Valoare nota invalida!\",validNota.valideaza_nota, Nota(0,stud,disc,10.1) )\n self.assertRaisesRegex(ValidError,\"Valoare nota invalida!\",validNota.valideaza_nota, Nota(0,stud,disc,50) )","def test_to_python_method_validation_errors(self):\n field = DecimalFractionField()\n with self.assertRaises(ValidationError):\n field.clean(\"abcd\")\n\n with self.assertRaises(ValidationError):\n field.clean(\"1 1 1/3\")\n\n with self.assertRaises(ValidationError):\n field.clean(\"1 1\")","def test_validate_input_bad_input(self):\r\n self.assertRaises(ValueError, _validate_input,\r\n None, None, None, None, None)\r\n self.assertRaises(ValueError, _validate_input,\r\n self.dist_matrix_header, self.dist_matrix,\r\n self.mapping_header, self.mapping, None)\r\n self.assertRaises(ValueError, _validate_input,\r\n self.dist_matrix_header, 12,\r\n self.mapping_header, self.mapping, None)\r\n self.assertRaises(ValueError, _validate_input,\r\n self.dist_matrix_header, self.dist_matrix,\r\n self.mapping_header, self.mapping, 42)\r\n self.assertRaises(ValueError, _validate_input,\r\n self.dist_matrix_header, self.dist_matrix,\r\n self.mapping_header, self.mapping, \"aeiou\")","def test_11_None_input(self):\n with self.assertRaises(TypeError) as x:\n r = Rectangle(None)\n self.assertEqual(\"__init__() missing 1 required positional argument:\\\n 'height'\", str(x.exception))","def test_value_init17(self):\n with self.assertRaises(TypeError) as err:\n r1 = Rectangle(1, 2, 3, \"hi\")\n msg = \"y must be an integer\"\n self.assertEqual(str(err.exception), msg)","def test_raising_exceptions(self):\n with self.assertRaises(TypeError):\n r = Rectangle(10, \"2\")\n with self.assertRaises(TypeError):\n r = Rectangle(10, 2.1)\n with self.assertRaises(TypeError):\n r = Rectangle(10, True, \"\")\n with self.assertRaises(TypeError):\n r = Rectangle(10, 10, 1.25)\n with self.assertRaises(TypeError):\n r = Rectangle(10, 10, \" \", True, False)\n with self.assertRaises(TypeError):\n r = Rectangle(10, None)\n with self.assertRaises(TypeError):\n r = Rectangle(\"2\", 10, 1, 1, \"str\")\n with self.assertRaises(TypeError):\n r = Rectangle(2.1, 10, 1, 1.5, 1)\n with self.assertRaises(TypeError):\n r = Rectangle(True, 10, 5, \"\", 10)\n with self.assertRaises(TypeError):\n r = Rectangle(False, 10)\n with self.assertRaises(ValueError):\n r = Rectangle(10, 0)\n with self.assertRaises(ValueError):\n r = Rectangle(0, 10)\n with self.assertRaises(ValueError):\n r = Rectangle(10, -1)\n with self.assertRaises(ValueError):\n r = Rectangle(-1, 10)\n with self.assertRaises(ValueError):\n r = Rectangle(0, 0)\n with self.assertRaises(ValueError):\n r = Rectangle(-1, -1)\n with self.assertRaises(ValueError):\n r = Rectangle(10, 5, 1, -1)\n with self.assertRaises(ValueError):\n r = Rectangle(10, 6, -2, 1)\n with self.assertRaises(ValueError):\n r = Rectangle(2, 2, -5, -5)\n with self.assertRaises(ValueError):\n r = Rectangle(10, 1, -1, 1, 1)\n with self.assertRaises(ValueError):\n r = Rectangle(10, 4, 1, -1, 10)\n with self.assertRaises(TypeError):\n r = Rectangle()\n with self.assertRaises(TypeError):\n r = Rectangle(10)\n with self.assertRaises(TypeError):\n r = Rectangle(10, 5, 1, 1, 1, 5)","def validate(self, data):\n raise NotImplementedError(\"Inherit this class and override this method.\")","def test_invalid_version_fields(self):\n self.assertRaises(ValueError, versions.Version, version='1234', name='foo')","def test_that_field_required_validations_are_triggered_on_incorrect_attribute_setting(\n self,\n ):\n person = Person(first_name=\"Johnny\", last_name=\"John\")\n\n with pytest.raises(ValidationError) as error:\n person.first_name = \"\" # Simulate an error by force-resetting an attribute\n\n assert error.value.messages == {\"first_name\": [\"is required\"]}","def test_invalid_instantiation(invalid_instance):\n with pytest.raises(ValueError):\n invalid_instance()","def test_get_other_typeerror(self):\n v = versions.Version(name='foo', version='1.2.3')\n self.assertRaises(TypeError, v._get_other, 3.4)","def __init__(self, message=\"\"):\n super(ValidationError, self).__init__(message)","def test_fails(self):\n raise FoolishError(\"I am a broken test\")","def test_other(self):\n self.assertRaises(ValueError, isStringTrue, \"dog\")\n return","def test_constructor_bad_value(self):\n self.assertRaises(line_format_errors.InputLineError,\n lambda: D1Line(self.bad_line))","def test_12_No_args(self):\n with self.assertRaises(TypeError) as x:\n r = Rectangle()\n self.assertEqual(\"__init__() missing 2 required positional\\\n arguments: 'width' and 'height'\", str(x.exception))","def _check_validity(self):\n pass","def validate_result(self):\n raise NotImplementedError","def test_raises_when_init_has_superset_of_args(self):\n\n with pytest.raises(exceptions.APIImplementationError) as exc_info:\n\n class API(platform.PlatformAPI):\n def __init__(self, base_url, token, org_name, user, other):\n pass\n\n assert \"other\" in str(exc_info.value)","def test_exceptions(self):\n\n with self.assertRaises(TypeError, msg=\"size must be an integer\"):\n Square(6.5)\n with self.assertRaises(TypeError, msg=\"size must be an integer\"):\n Square(False)\n with self.assertRaises(TypeError, msg=\"size must be an integer\"):\n Square(6j)\n with self.assertRaises(TypeError, msg=\"size must be an integer\"):\n Square([4, 1])\n with self.assertRaises(TypeError, msg=\"size must be an integer\"):\n Square({\"Milk\": 1})\n with self.assertRaises(TypeError, msg=\"size must be an integer\"):\n Square((3, 9))\n with self.assertRaises(TypeError, msg=\"x must be an integer\"):\n Square(2, 3.5, 4)\n with self.assertRaises(TypeError, msg=\"x must be an integer\"):\n Square(2, True, 4)\n with self.assertRaises(TypeError, msg=\"x must be an integer\"):\n Square(2, 3j, 4)\n with self.assertRaises(TypeError, msg=\"x must be an integer\"):\n Square(2, \"3\", 4)\n with self.assertRaises(TypeError, msg=\"x must be an integer\"):\n Square(2, [3], 4)\n with self.assertRaises(TypeError, msg=\"x must be an integer\"):\n Square(2, {\"My\": 3}, 4)\n with self.assertRaises(TypeError, msg=\"x must be an integer\"):\n Square(2, (3, 3), 4)\n with self.assertRaises(TypeError, msg=\"y must be an integer\"):\n Square(2, 3, 4.2)\n with self.assertRaises(TypeError, msg=\"y must be an integer\"):\n Square(2, 3, False)\n with self.assertRaises(TypeError, msg=\"y must be an integer\"):\n Square(2, 3, 4j)\n with self.assertRaises(TypeError, msg=\"y must be an integer\"):\n Square(2, 3, \"4\")\n with self.assertRaises(TypeError, msg=\"y must be an integer\"):\n Square(2, 3, [4])\n with self.assertRaises(TypeError, msg=\"y must be an integer\"):\n Square(2, 3, {\"its\": 4})\n with self.assertRaises(TypeError, msg=\"y must be an integer\"):\n Square(2, 3, (4, 4))\n with self.assertRaises(ValueError, msg=\"size must be > 0\"):\n Square(0)\n with self.assertRaises(ValueError, msg=\"size must be > 0\"):\n Square(-2)\n with self.assertRaises(ValueError, msg=\"x must be >= 0\"):\n Square(1, -8, 9)\n with self.assertRaises(ValueError, msg=\"y must be >= 0\"):\n Square(1, 8, -9)","def test04(self):\n self.assertRaises(TypeError, robustApply, oneArgument, \"this\", blah=\"that\")","def testinvalidsize(self):\n self.assertRaises(AbilityError, AttributeAbility, size=0)\n self.assertRaises(AbilityError, AttributeAbility, size=6)","def test_value_init15(self):\n with self.assertRaises(ValueError) as err:\n r1 = Rectangle(0, 0)\n msg = \"width must be > 0\"\n self.assertEqual(str(err.exception), msg)","def test_value_init6(self):\n with self.assertRaises(TypeError) as err:\n r1 = Rectangle(10, \"hi\")\n msg = \"height must be an integer\"\n self.assertEqual(str(err.exception), msg)","def test_validate_on_invalid_data_type(self):\n args = (self.bytes_a, 'invalid')\n self.assertRaises(TypeError, objects.OpaqueObject, *args)","def testinvalidattribute(self):\n self.assertRaises(AbilityError, AttributeAbility, 'Invalid')\n self.assertRaises(AbilityError, AttributeAbility, '', 3)","def test_value_init12(self):\n with self.assertRaises(ValueError) as err:\n r1 = Rectangle(10, 1, 17, -9)\n msg = \"y must be >= 0\"\n self.assertEqual(str(err.exception), msg)","def _assert_validation_error( # type: ignore[override]\n self, expected_error_substring: str\n ) -> None:\n with self.assertRaisesRegex(\n utils.ValidationError, expected_error_substring):\n self.collection.validate()","def test_value_init7(self):\n with self.assertRaises(ValueError) as err:\n r1 = Rectangle(-4, 5)\n msg = \"width must be > 0\"\n self.assertEqual(str(err.exception), msg)"],"string":"[\n \"def test_validation(self):\\n self.validationFails()\",\n \"def test_should_not_be_callable(self):\\n with self.assertRaises(NotImplementedError):\\n BaseValidator()(\\\"any-value\\\")\",\n \"def test_validate(self):\\n pass\",\n \"def test_validation(self):\\r\\n\\r\\n with self.assertRaises(ValidationError):\\r\\n List().validate({'blake':31, 'something_else':'that'})\\r\\n\\r\\n with self.assertRaises(ValidationError):\\r\\n List().validate('stringy')\\r\\n\\r\\n with self.assertRaises(ValidationError):\\r\\n List().validate(1)\",\n \"def test_validation(self):\\n\\n with self.assertRaises(ValidationError):\\n List().validate({'blake':31, 'something_else':'that'})\\n\\n with self.assertRaises(ValidationError):\\n List().validate('stringy')\\n\\n with self.assertRaises(ValidationError):\\n List().validate(1)\",\n \"def test_base_validate_models():\\n with pytest.raises(ValueError):\\n base_validate_models([])\\n\\n assert [\\\"m\\\"] == base_validate_models([\\\"m\\\"])\",\n \"def test_invalidargumentBaseModel(self):\\n with self.assertRaises(NameError) as e:\\n b1 = BaseModel(hi)\\n self.assertEqual(str(e.exception), \\\"name 'hi' is not defined\\\")\",\n \"def __validate__(self):\",\n \"def test_class_errored(self, cls, exception):\",\n \"def test_validation(self):\\n\\n with self.assertRaises(ValidationError):\\n Dictionary().validate([1,2,3])\\n\\n with self.assertRaises(ValidationError):\\n Dictionary().validate('stringy')\\n\\n with self.assertRaises(ValidationError):\\n Dictionary().validate(1)\",\n \"def test_validation(self):\\r\\n\\r\\n with self.assertRaises(ValidationError):\\r\\n Dictionary().validate([1,2,3])\\r\\n\\r\\n with self.assertRaises(ValidationError):\\r\\n Dictionary().validate('stringy')\\r\\n\\r\\n with self.assertRaises(ValidationError):\\r\\n Dictionary().validate(1)\",\n \"def Validate(self):\\n raise NotImplementedError\",\n \"def test_validators():\",\n \"def test_base(self):\\n with pytest.raises(AttributeError) as exc:\\n Fidelity(\\\"epoch\\\", 1, 2, 0)\\n assert \\\"Base should be greater than or equal to 1\\\" == str(exc.value)\",\n \"def validate(self, *args, **kwargs):\\n raise NotImplementedError('Validate not implemented')\",\n \"def validate(self):\\n raise NotImplementedError()\",\n \"def test_base_class_expection():\\n with pytest.raises(TypeError):\\n cardinal.CardinalPoints()\",\n \"def test_encode_errors(self):\\n if self._cls == 'MetaschemaType':\\n if self._invalid_validate:\\n self.assert_raises(NotImplementedError, self.import_cls.encode,\\n self._invalid_validate[0], self.typedef)\\n else:\\n if self._invalid_validate:\\n self.assert_raises((ValueError,\\n jsonschema.exceptions.ValidationError),\\n self.import_cls.encode,\\n self._invalid_validate[0], self.typedef)\",\n \"def validate(cls, **kwargs: Any) -> None: # pragma no cover\",\n \"def validate(self):\\n raise NotImplementedError\",\n \"def validate(self):\\n raise NotImplementedError\",\n \"def __validate():\\n # TODO: implement\",\n \"def test_wrong_input(self):\\r\\n self.assertRaises(Exception, self.validate, (3, 2, 8, 8), (4, 2, 5, 5),\\r\\n 'valid', input=T.dmatrix())\\r\\n self.assertRaises(Exception, self.validate, (3, 2, 8, 8), (4, 2, 5, 5),\\r\\n 'valid', filters=T.dvector())\\r\\n self.assertRaises(Exception, self.validate, (3, 2, 8, 8), (4, 2, 5, 5),\\r\\n 'valid', input=T.dtensor3())\",\n \"def test_exception(self):\\n self.assertRaises(TypeError, lambda: self.init_model())\",\n \"def testValidate_Invalid(self):\\n values = {\\n messages.IntegerField: \\\"10\\\",\\n messages.FloatField: \\\"blah\\\",\\n messages.BooleanField: 0,\\n messages.BytesField: 10.20,\\n messages.StringField: 42,\\n }\\n\\n def action(field_class):\\n # Optional.\\n field = field_class(1)\\n self.assertRaises(messages.ValidationError,\\n field.validate,\\n values[field_class])\\n\\n # Required.\\n field = field_class(1, required=True)\\n self.assertRaises(messages.ValidationError,\\n field.validate,\\n values[field_class])\\n\\n # Repeated.\\n field = field_class(1, repeated=True)\\n self.assertRaises(messages.ValidationError,\\n field.validate,\\n [values[field_class]])\\n self.assertRaises(messages.ValidationError,\\n field.validate,\\n (values[field_class],))\\n self.ActionOnAllFieldClasses(action)\",\n \"def test_not_enough_inputs(self):\\n n = Node('a')\\n with self.assertRaises(ValidationError):\\n n.validate()\\n n.validate(False)\",\n \"def test_missing_required_field_raises_error():\\n with pytest.raises(ValidationError):\\n Entity()\",\n \"def test_init_invalid_retire_date(self):\\n # Whether this raises a ValueError or TypeError is an\\n # implementation detail delegated to `datetime`\\n with self.assertRaises((ValueError, TypeError)):\\n Person(\\n self.initial_year, self.name, self.birth_date,\\n retirement_date='invalid')\",\n \"def __validate(self):\\n pass\",\n \"def test_acc(self):\\n raise Exception(\\\" not implemented in base model\\\")\",\n \"def _validate(self):\\n pass\",\n \"def check_errors(self):\\n raise NotImplementedError(\\\"Implement it in a subclass.\\\")\",\n \"def validate(self):\\n ...\",\n \"def test_custom_validation_exceptions(self):\\n expected = {\\n \\\"errors\\\": [\\n {\\n \\\"status\\\": \\\"400\\\",\\n \\\"source\\\": {\\n \\\"pointer\\\": \\\"/data/attributes/email\\\",\\n },\\n \\\"detail\\\": \\\"Enter a valid email address.\\\",\\n \\\"code\\\": \\\"invalid\\\",\\n },\\n {\\n \\\"id\\\": \\\"armageddon101\\\",\\n \\\"detail\\\": \\\"Hey! You need a last name!\\\",\\n \\\"meta\\\": \\\"something\\\",\\n \\\"source\\\": {\\\"pointer\\\": \\\"/data/attributes/lastName\\\"},\\n },\\n ]\\n }\\n response = self.client.post(\\n \\\"/identities\\\",\\n {\\n \\\"data\\\": {\\n \\\"type\\\": \\\"users\\\",\\n \\\"attributes\\\": {\\n \\\"email\\\": \\\"bar\\\",\\n \\\"last_name\\\": \\\"alajflajaljalajlfjafljalj\\\",\\n },\\n }\\n },\\n )\\n\\n assert expected == response.json()\",\n \"def test_lt_invalid(self):\\n with self.assertRaises(TypeError):\\n self.instance < 12\",\n \"def test_errs(self):\\n b1 = BaseModel()\\n with self.assertRaises(AttributeError):\\n FileStorage.__objects\\n FileStorage.__File_path\\n\\n with self.assertRaises(TypeError):\\n models.storage.new()\\n models.storage.new(self, b1)\\n models.save(b1)\\n models.reload(b1)\\n models.all(b1)\",\n \"def test_002_import_exception(self):\\n m = schematics_flexible.BaseFlexible(\\n {'code': '07',\\n 'properties': {\\\"a\\\": \\\"this is test\\\"}},\\n store_handler=get_mock())\\n try:\\n m.validate()\\n except schematicsValidationError:\\n pass\\n else:\\n self.assertTrue(False,\\n 'Model must raise exception when import raise')\",\n \"def test_bad_curie():\\n with pytest.raises(ValidationError):\\n entity = Entity(id=\\\"this is not a curie\\\")\",\n \"def test_validation(self):\\n def test(**invalid_fields):\\n with self.assertRaises(AssertionError):\\n c = models.Citizen(**{'relatives': [], **invalid_fields})\\n\\n # Must throw errors in every case\\n test(citizen_id=-1, )\\n test(apartment='WRONG-STRING')\\n test(town='', )\\n test(street='', )\\n test(building='', )\\n test(name=None, )\\n test(birth_date='WRONG-STRING')\\n test(birth_date='31.02.2019')\\n test(relatives=['a'])\",\n \"def test_base_opt_validate():\\n opt = scheme._BaseOpt()\\n with pytest.raises(NotImplementedError):\\n opt.validate('foo', 'test-data')\",\n \"def test_error_expression(self):\\n error_expression = expression.InvalidExpression(\\\"an error message\\\")\\n # All three of \\\"penalty_expression\\\", \\\"constraint_expression\\\" and\\n # \\\"extra_constraints\\\" should raise.\\n with self.assertRaises(RuntimeError):\\n _ = error_expression.penalty_expression\\n with self.assertRaises(RuntimeError):\\n _ = error_expression.constraint_expression\\n with self.assertRaises(RuntimeError):\\n _ = error_expression.extra_constraints\",\n \"def test_trestle_validation_error() -> None:\\n msg = 'Custom validation error'\\n try:\\n raise TrestleValidationError(msg)\\n except TrestleValidationError as err:\\n assert str(err) == msg\\n assert err.msg == msg\",\n \"def test_constructor_wrong_options(self):\\n with self.assertRaises(TypeError):\\n base = BaseExporter(something_else=6)\",\n \"def test_call_invalid_input(self):\\r\\n with self.assertRaises(ValueError):\\r\\n self.estimator1(42, confidence_level=0)\",\n \"def validate(self):\",\n \"def validate(self):\",\n \"def test_foo(self):\\n foo = Foo(value=1)\\n with self.assertRaises(TypeError):\\n foo.foo()\",\n \"def test_from_object_fail(self):\\n class InvalidClass(object):\\n pass\\n Invalid_object = InvalidClass()\\n with self.assertRaises(TypeError):\\n BaseDataClass.from_object(Invalid_object)\",\n \"def test_minimal_validation(self, asset_class: Type[_PandasDataAsset]):\\n with pytest.raises(pydantic.ValidationError) as exc_info:\\n asset_class( # type: ignore[call-arg]\\n name=\\\"test\\\",\\n invalid_keyword_arg=\\\"bad\\\",\\n )\\n\\n errors_dict = exc_info.value.errors()\\n assert {\\n \\\"loc\\\": (\\\"invalid_keyword_arg\\\",),\\n \\\"msg\\\": \\\"extra fields not permitted\\\",\\n \\\"type\\\": \\\"value_error.extra\\\",\\n } == errors_dict[ # the extra keyword error will always be the last error\\n -1 # we don't care about any other errors for this test\\n ]\",\n \"def test_init_invalid_birth_date(self):\\n # Whether this raises a ValueError or TypeError is an\\n # implementation detail delegated to `datetime`\\n with self.assertRaises((ValueError, TypeError)):\\n Person(\\n self.initial_year, self.name, 'invalid',\\n retirement_date=self.retirement_date)\",\n \"def Invalid(\\r\\n self, s: str = \\\"\\\", e: Type[BaseException] = None, fail: bool = False\\r\\n) -> None:\\r\\n ...\",\n \"def check_validity(self):\",\n \"def __call__(self, *args, **kwargs):\\n if isinstance(self._exp, type) and issubclass(self._exp, Exception):\\n with pytest.raises(self._exp):\\n self._f(*args, **kwargs)\\n else:\\n assert self._exp == self._f(*args, **kwargs)\",\n \"def test_04_one_args(self):\\n with self.assertRaises(TypeError) as x:\\n r = Rectangle(7)\\n self.assertEqual(\\\"__init__() missing 1 required positional argument:\\\\\\n 'height'\\\", str(x.exception))\",\n \"def test_create_valiation(self):\\n with self.assertRaises(ValidationError) as test:\\n contact = Contact.objects.create(email='3232131')\\n contact.full_clean()\\n the_exception = dict(test.exception)\\n self.assertEqual(the_exception['name'], ['This field cannot be blank.'])\\n self.assertEqual(the_exception['email'], ['Enter a valid email address.'])\",\n \"def test_base_exception(self) -> None:\\n with pytest.raises(BaseException) as e:\\n 1 / 0\\n assert isinstance(e.value, ZeroDivisionError)\",\n \"def test_with_invalid_input(self):\\n for dataset_type in ['ruler', 'pencil', 'cheese']:\\n with self.assertRaises(ValueError) as exc:\\n check_dataset_type(dataset_type)\\n self.assertEqual(\\\"Dataset type not 'regular' or 'raw' is %s\\\" % dataset_type,\\n str(exc.exception))\",\n \"def test_property_invalid(self):\\n\\n self.assertRaises(DataObjectError,\\n setattr(self, \\\"foobar\\\", \\\"some value\\\")\\n )\",\n \"def test_001_validate_with_bad_properties(self):\\n m = schematics_flexible.BaseFlexible(\\n {'code': '06',\\n 'properties': {\\\"a\\\": \\\"this is test\\\"}},\\n store_handler=get_mock())\\n try:\\n m.validate()\\n except schematicsValidationError:\\n pass\\n else:\\n self.assertTrue(False,\\n 'Model must raise exception when validate raise')\",\n \"def test_new_invalid(self) -> None:\\n with pytest.raises(TypeError) as excinfo:\\n RunwayTestDefinition({}) # type: ignore\\n assert str(excinfo.value).startswith(\\\"expected data of type\\\")\",\n \"def test_get_other_typeerror_2(self):\\n v = versions.Version(name='foo', version='1.2.3')\\n self.assertRaises(TypeError, v._get_other, '1')\",\n \"def test_members_are_set_when_args_are_invalid(self):\\n\\n self.assertRaises(ValueError, Vec3, \\\"abc\\\", 6, \\\"q\\\")\",\n \"def testinvalidability(self):\\n self.assertRaises(AbilityError, AmuletAbility, 'Invalid')\\n self.assertRaises(AbilityError, AmuletAbility, '')\",\n \"def test_error(cls, err, data):\\n do_error_test(cls, err, data)\",\n \"def validate(self):\\n pass\",\n \"def validate(self):\\n pass\",\n \"def validate(self):\\n pass\",\n \"def validate(self):\\n pass\",\n \"def validate(self):\\n pass\",\n \"def validate(self):\\n pass\",\n \"def validate(self):\\n pass\",\n \"def validate(self):\\n pass\",\n \"def test_domain_validator(self):\\n id_stud = 1\\n nume_stud = \\\"Mircea Augustin\\\"\\n stud = Student(id_stud,nume_stud)\\n self.assertEqual(stud.get_id_stud(),id_stud)\\n self.assertEqual(stud.get_nume_stud(),nume_stud)\\n self.assertEqual(str(stud),\\\"1 | Mircea Augustin\\\")\\n stud2 = Student(id_stud,\\\"Horatiu Murdar\\\")\\n self.assertEqual(stud,stud2)\\n \\\"\\\"\\\"\\n test validator student\\n \\\"\\\"\\\"\\n validStud = ValidatorStudent()\\n stud = Student(1,\\\"Caine Rau\\\")\\n validStud.valideaza_stud(stud)\\n stud2 = Student(-1,\\\"\\\")\\n self.assertRaisesRegex(ValidError,\\\"Id student invalid!Nume student invalid!\\\",validStud.valideaza_stud,stud2)\\n \\\"\\\"\\\"\\n test domeniu pt disc\\n \\\"\\\"\\\"\\n id_disc = 1\\n nume_disc = \\\"Analiza\\\"\\n nume_prof = \\\"Berinde Stefan\\\"\\n disc = Disciplina(id_disc,nume_disc,nume_prof)\\n self.assertEqual(disc.get_id_disc(),id_disc)\\n self.assertEqual(disc.get_nume_disc(),nume_disc)\\n self.assertEqual(disc.get_nume_prof(),nume_prof)\\n self.assertEqual(str(disc),\\\"1 | Analiza | Berinde Stefan\\\")\\n disc2 = Disciplina(id_disc,\\\"Logica\\\",\\\"Pop\\\")\\n self.assertEqual(disc,disc2)\\n \\\"\\\"\\\"\\n test validare disc\\n \\\"\\\"\\\"\\n validDisc = ValidatorDisciplina()\\n id_disc = 1\\n nume_disc = \\\"Analiza\\\"\\n nume_prof = \\\"Berinde Stefan\\\"\\n disc = Disciplina(id_disc,nume_disc,nume_prof)\\n validDisc.valideaza_disc(disc)\\n disc_gresit = Disciplina(-1,\\\"\\\",\\\"\\\")\\n self.assertRaisesRegex(ValidError,\\\"Id disciplina invalid!Nume disciplina invalid!Nume profesor invalid!\\\",validDisc.valideaza_disc,disc_gresit)\\n \\\"\\\"\\\"\\n test domeniu pt note\\n \\\"\\\"\\\"\\n id_nota = 0\\n id_stud = 3\\n nume_stud = \\\"Mircea Augustin\\\"\\n stud = Student(id_stud,nume_stud)\\n id_disc = 2\\n nume_disc = \\\"Analiza\\\"\\n nume_prof = \\\"Berinde Stefan\\\"\\n disc = Disciplina(id_disc,nume_disc,nume_prof)\\n val_nota = 9.5\\n nota = Nota(id_nota,stud,disc,val_nota)\\n self.assertEqual(nota.get_id_nota(),id_nota)\\n self.assertEqual(nota.get_stud(),stud)\\n self.assertEqual(nota.get_disc(),disc)\\n self.assertEqual(nota.get_val_nota(),val_nota)\\n nota2 = Nota(id_nota,Student(0,\\\"a\\\"),Disciplina(0,\\\"a\\\",\\\"a\\\"),5.4)\\n self.assertEqual(nota,nota2)\\n \\\"\\\"\\\"\\n test validare pt note - BlackBox\\n \\\"\\\"\\\"\\n validNota = ValidatorNota()\\n stud = Student(0,\\\"a\\\")\\n disc = Disciplina(0,\\\"a\\\",\\\"a\\\")\\n validNota.valideaza_nota(Nota(3,Student(3,\\\"Chef Scarlatescu\\\"),Disciplina(2,\\\"Analiza\\\",\\\"Berinde Stefan\\\"),5.4))\\n validNota.valideaza_nota(Nota(0,Student(-1,\\\"a\\\"),Disciplina(0,\\\"\\\",\\\"a\\\"),1))\\n validNota.valideaza_nota(Nota(0,stud,disc,10))\\n self.assertRaisesRegex(ValidError,\\\"Id nota invalid! Valoare nota invalida!\\\",validNota.valideaza_nota, Nota(-1,stud,disc,0.9) )\\n self.assertRaisesRegex(ValidError,\\\"Id nota invalid! Valoare nota invalida!\\\",validNota.valideaza_nota, Nota(-50,stud,disc,0) )\\n self.assertRaisesRegex(ValidError,\\\"Valoare nota invalida!\\\",validNota.valideaza_nota, Nota(0,stud,disc,-1) )\\n self.assertRaisesRegex(ValidError,\\\"Valoare nota invalida!\\\",validNota.valideaza_nota, Nota(0,stud,disc,10.1) )\\n self.assertRaisesRegex(ValidError,\\\"Valoare nota invalida!\\\",validNota.valideaza_nota, Nota(0,stud,disc,50) )\",\n \"def test_to_python_method_validation_errors(self):\\n field = DecimalFractionField()\\n with self.assertRaises(ValidationError):\\n field.clean(\\\"abcd\\\")\\n\\n with self.assertRaises(ValidationError):\\n field.clean(\\\"1 1 1/3\\\")\\n\\n with self.assertRaises(ValidationError):\\n field.clean(\\\"1 1\\\")\",\n \"def test_validate_input_bad_input(self):\\r\\n self.assertRaises(ValueError, _validate_input,\\r\\n None, None, None, None, None)\\r\\n self.assertRaises(ValueError, _validate_input,\\r\\n self.dist_matrix_header, self.dist_matrix,\\r\\n self.mapping_header, self.mapping, None)\\r\\n self.assertRaises(ValueError, _validate_input,\\r\\n self.dist_matrix_header, 12,\\r\\n self.mapping_header, self.mapping, None)\\r\\n self.assertRaises(ValueError, _validate_input,\\r\\n self.dist_matrix_header, self.dist_matrix,\\r\\n self.mapping_header, self.mapping, 42)\\r\\n self.assertRaises(ValueError, _validate_input,\\r\\n self.dist_matrix_header, self.dist_matrix,\\r\\n self.mapping_header, self.mapping, \\\"aeiou\\\")\",\n \"def test_11_None_input(self):\\n with self.assertRaises(TypeError) as x:\\n r = Rectangle(None)\\n self.assertEqual(\\\"__init__() missing 1 required positional argument:\\\\\\n 'height'\\\", str(x.exception))\",\n \"def test_value_init17(self):\\n with self.assertRaises(TypeError) as err:\\n r1 = Rectangle(1, 2, 3, \\\"hi\\\")\\n msg = \\\"y must be an integer\\\"\\n self.assertEqual(str(err.exception), msg)\",\n \"def test_raising_exceptions(self):\\n with self.assertRaises(TypeError):\\n r = Rectangle(10, \\\"2\\\")\\n with self.assertRaises(TypeError):\\n r = Rectangle(10, 2.1)\\n with self.assertRaises(TypeError):\\n r = Rectangle(10, True, \\\"\\\")\\n with self.assertRaises(TypeError):\\n r = Rectangle(10, 10, 1.25)\\n with self.assertRaises(TypeError):\\n r = Rectangle(10, 10, \\\" \\\", True, False)\\n with self.assertRaises(TypeError):\\n r = Rectangle(10, None)\\n with self.assertRaises(TypeError):\\n r = Rectangle(\\\"2\\\", 10, 1, 1, \\\"str\\\")\\n with self.assertRaises(TypeError):\\n r = Rectangle(2.1, 10, 1, 1.5, 1)\\n with self.assertRaises(TypeError):\\n r = Rectangle(True, 10, 5, \\\"\\\", 10)\\n with self.assertRaises(TypeError):\\n r = Rectangle(False, 10)\\n with self.assertRaises(ValueError):\\n r = Rectangle(10, 0)\\n with self.assertRaises(ValueError):\\n r = Rectangle(0, 10)\\n with self.assertRaises(ValueError):\\n r = Rectangle(10, -1)\\n with self.assertRaises(ValueError):\\n r = Rectangle(-1, 10)\\n with self.assertRaises(ValueError):\\n r = Rectangle(0, 0)\\n with self.assertRaises(ValueError):\\n r = Rectangle(-1, -1)\\n with self.assertRaises(ValueError):\\n r = Rectangle(10, 5, 1, -1)\\n with self.assertRaises(ValueError):\\n r = Rectangle(10, 6, -2, 1)\\n with self.assertRaises(ValueError):\\n r = Rectangle(2, 2, -5, -5)\\n with self.assertRaises(ValueError):\\n r = Rectangle(10, 1, -1, 1, 1)\\n with self.assertRaises(ValueError):\\n r = Rectangle(10, 4, 1, -1, 10)\\n with self.assertRaises(TypeError):\\n r = Rectangle()\\n with self.assertRaises(TypeError):\\n r = Rectangle(10)\\n with self.assertRaises(TypeError):\\n r = Rectangle(10, 5, 1, 1, 1, 5)\",\n \"def validate(self, data):\\n raise NotImplementedError(\\\"Inherit this class and override this method.\\\")\",\n \"def test_invalid_version_fields(self):\\n self.assertRaises(ValueError, versions.Version, version='1234', name='foo')\",\n \"def test_that_field_required_validations_are_triggered_on_incorrect_attribute_setting(\\n self,\\n ):\\n person = Person(first_name=\\\"Johnny\\\", last_name=\\\"John\\\")\\n\\n with pytest.raises(ValidationError) as error:\\n person.first_name = \\\"\\\" # Simulate an error by force-resetting an attribute\\n\\n assert error.value.messages == {\\\"first_name\\\": [\\\"is required\\\"]}\",\n \"def test_invalid_instantiation(invalid_instance):\\n with pytest.raises(ValueError):\\n invalid_instance()\",\n \"def test_get_other_typeerror(self):\\n v = versions.Version(name='foo', version='1.2.3')\\n self.assertRaises(TypeError, v._get_other, 3.4)\",\n \"def __init__(self, message=\\\"\\\"):\\n super(ValidationError, self).__init__(message)\",\n \"def test_fails(self):\\n raise FoolishError(\\\"I am a broken test\\\")\",\n \"def test_other(self):\\n self.assertRaises(ValueError, isStringTrue, \\\"dog\\\")\\n return\",\n \"def test_constructor_bad_value(self):\\n self.assertRaises(line_format_errors.InputLineError,\\n lambda: D1Line(self.bad_line))\",\n \"def test_12_No_args(self):\\n with self.assertRaises(TypeError) as x:\\n r = Rectangle()\\n self.assertEqual(\\\"__init__() missing 2 required positional\\\\\\n arguments: 'width' and 'height'\\\", str(x.exception))\",\n \"def _check_validity(self):\\n pass\",\n \"def validate_result(self):\\n raise NotImplementedError\",\n \"def test_raises_when_init_has_superset_of_args(self):\\n\\n with pytest.raises(exceptions.APIImplementationError) as exc_info:\\n\\n class API(platform.PlatformAPI):\\n def __init__(self, base_url, token, org_name, user, other):\\n pass\\n\\n assert \\\"other\\\" in str(exc_info.value)\",\n \"def test_exceptions(self):\\n\\n with self.assertRaises(TypeError, msg=\\\"size must be an integer\\\"):\\n Square(6.5)\\n with self.assertRaises(TypeError, msg=\\\"size must be an integer\\\"):\\n Square(False)\\n with self.assertRaises(TypeError, msg=\\\"size must be an integer\\\"):\\n Square(6j)\\n with self.assertRaises(TypeError, msg=\\\"size must be an integer\\\"):\\n Square([4, 1])\\n with self.assertRaises(TypeError, msg=\\\"size must be an integer\\\"):\\n Square({\\\"Milk\\\": 1})\\n with self.assertRaises(TypeError, msg=\\\"size must be an integer\\\"):\\n Square((3, 9))\\n with self.assertRaises(TypeError, msg=\\\"x must be an integer\\\"):\\n Square(2, 3.5, 4)\\n with self.assertRaises(TypeError, msg=\\\"x must be an integer\\\"):\\n Square(2, True, 4)\\n with self.assertRaises(TypeError, msg=\\\"x must be an integer\\\"):\\n Square(2, 3j, 4)\\n with self.assertRaises(TypeError, msg=\\\"x must be an integer\\\"):\\n Square(2, \\\"3\\\", 4)\\n with self.assertRaises(TypeError, msg=\\\"x must be an integer\\\"):\\n Square(2, [3], 4)\\n with self.assertRaises(TypeError, msg=\\\"x must be an integer\\\"):\\n Square(2, {\\\"My\\\": 3}, 4)\\n with self.assertRaises(TypeError, msg=\\\"x must be an integer\\\"):\\n Square(2, (3, 3), 4)\\n with self.assertRaises(TypeError, msg=\\\"y must be an integer\\\"):\\n Square(2, 3, 4.2)\\n with self.assertRaises(TypeError, msg=\\\"y must be an integer\\\"):\\n Square(2, 3, False)\\n with self.assertRaises(TypeError, msg=\\\"y must be an integer\\\"):\\n Square(2, 3, 4j)\\n with self.assertRaises(TypeError, msg=\\\"y must be an integer\\\"):\\n Square(2, 3, \\\"4\\\")\\n with self.assertRaises(TypeError, msg=\\\"y must be an integer\\\"):\\n Square(2, 3, [4])\\n with self.assertRaises(TypeError, msg=\\\"y must be an integer\\\"):\\n Square(2, 3, {\\\"its\\\": 4})\\n with self.assertRaises(TypeError, msg=\\\"y must be an integer\\\"):\\n Square(2, 3, (4, 4))\\n with self.assertRaises(ValueError, msg=\\\"size must be > 0\\\"):\\n Square(0)\\n with self.assertRaises(ValueError, msg=\\\"size must be > 0\\\"):\\n Square(-2)\\n with self.assertRaises(ValueError, msg=\\\"x must be >= 0\\\"):\\n Square(1, -8, 9)\\n with self.assertRaises(ValueError, msg=\\\"y must be >= 0\\\"):\\n Square(1, 8, -9)\",\n \"def test04(self):\\n self.assertRaises(TypeError, robustApply, oneArgument, \\\"this\\\", blah=\\\"that\\\")\",\n \"def testinvalidsize(self):\\n self.assertRaises(AbilityError, AttributeAbility, size=0)\\n self.assertRaises(AbilityError, AttributeAbility, size=6)\",\n \"def test_value_init15(self):\\n with self.assertRaises(ValueError) as err:\\n r1 = Rectangle(0, 0)\\n msg = \\\"width must be > 0\\\"\\n self.assertEqual(str(err.exception), msg)\",\n \"def test_value_init6(self):\\n with self.assertRaises(TypeError) as err:\\n r1 = Rectangle(10, \\\"hi\\\")\\n msg = \\\"height must be an integer\\\"\\n self.assertEqual(str(err.exception), msg)\",\n \"def test_validate_on_invalid_data_type(self):\\n args = (self.bytes_a, 'invalid')\\n self.assertRaises(TypeError, objects.OpaqueObject, *args)\",\n \"def testinvalidattribute(self):\\n self.assertRaises(AbilityError, AttributeAbility, 'Invalid')\\n self.assertRaises(AbilityError, AttributeAbility, '', 3)\",\n \"def test_value_init12(self):\\n with self.assertRaises(ValueError) as err:\\n r1 = Rectangle(10, 1, 17, -9)\\n msg = \\\"y must be >= 0\\\"\\n self.assertEqual(str(err.exception), msg)\",\n \"def _assert_validation_error( # type: ignore[override]\\n self, expected_error_substring: str\\n ) -> None:\\n with self.assertRaisesRegex(\\n utils.ValidationError, expected_error_substring):\\n self.collection.validate()\",\n \"def test_value_init7(self):\\n with self.assertRaises(ValueError) as err:\\n r1 = Rectangle(-4, 5)\\n msg = \\\"width must be > 0\\\"\\n self.assertEqual(str(err.exception), msg)\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7366222","0.7237699","0.721509","0.7119311","0.7103784","0.70534474","0.7048264","0.6987562","0.6925039","0.6916672","0.6913254","0.6906676","0.68661255","0.68530154","0.68451655","0.68323594","0.68066764","0.6797967","0.6775788","0.67419225","0.67419225","0.6733247","0.6730697","0.6722662","0.6720216","0.66907567","0.66765404","0.66692656","0.66607714","0.66484046","0.66277206","0.66106933","0.66102284","0.6610196","0.6574951","0.65748227","0.6573513","0.65668887","0.65658957","0.65610874","0.6560925","0.65522444","0.6548679","0.6546936","0.65366346","0.65366346","0.6511592","0.6503953","0.6497619","0.648453","0.648115","0.6480178","0.6478114","0.646288","0.64555466","0.64552873","0.64551","0.6454287","0.6431127","0.6424193","0.6419743","0.6415004","0.6403812","0.6392456","0.63774633","0.63774633","0.63774633","0.63774633","0.63774633","0.63774633","0.63774633","0.63774633","0.63729966","0.6372462","0.6369305","0.6366909","0.6362629","0.6362034","0.63610125","0.6359107","0.63479984","0.63417596","0.6334898","0.63311476","0.6325517","0.6325169","0.6318713","0.63160026","0.63065916","0.63025564","0.63011307","0.6300085","0.62991714","0.6297665","0.62970793","0.6296993","0.6292317","0.62906206","0.6289713","0.6288218","0.62811404"],"string":"[\n \"0.7366222\",\n \"0.7237699\",\n \"0.721509\",\n \"0.7119311\",\n \"0.7103784\",\n \"0.70534474\",\n \"0.7048264\",\n \"0.6987562\",\n \"0.6925039\",\n \"0.6916672\",\n \"0.6913254\",\n \"0.6906676\",\n \"0.68661255\",\n \"0.68530154\",\n \"0.68451655\",\n \"0.68323594\",\n \"0.68066764\",\n \"0.6797967\",\n \"0.6775788\",\n \"0.67419225\",\n \"0.67419225\",\n \"0.6733247\",\n \"0.6730697\",\n \"0.6722662\",\n \"0.6720216\",\n \"0.66907567\",\n \"0.66765404\",\n \"0.66692656\",\n \"0.66607714\",\n \"0.66484046\",\n \"0.66277206\",\n \"0.66106933\",\n \"0.66102284\",\n \"0.6610196\",\n \"0.6574951\",\n \"0.65748227\",\n \"0.6573513\",\n \"0.65668887\",\n \"0.65658957\",\n \"0.65610874\",\n \"0.6560925\",\n \"0.65522444\",\n \"0.6548679\",\n \"0.6546936\",\n \"0.65366346\",\n \"0.65366346\",\n \"0.6511592\",\n \"0.6503953\",\n \"0.6497619\",\n \"0.648453\",\n \"0.648115\",\n \"0.6480178\",\n \"0.6478114\",\n \"0.646288\",\n \"0.64555466\",\n \"0.64552873\",\n \"0.64551\",\n \"0.6454287\",\n \"0.6431127\",\n \"0.6424193\",\n \"0.6419743\",\n \"0.6415004\",\n \"0.6403812\",\n \"0.6392456\",\n \"0.63774633\",\n \"0.63774633\",\n \"0.63774633\",\n \"0.63774633\",\n \"0.63774633\",\n \"0.63774633\",\n \"0.63774633\",\n \"0.63774633\",\n \"0.63729966\",\n \"0.6372462\",\n \"0.6369305\",\n \"0.6366909\",\n \"0.6362629\",\n \"0.6362034\",\n \"0.63610125\",\n \"0.6359107\",\n \"0.63479984\",\n \"0.63417596\",\n \"0.6334898\",\n \"0.63311476\",\n \"0.6325517\",\n \"0.6325169\",\n \"0.6318713\",\n \"0.63160026\",\n \"0.63065916\",\n \"0.63025564\",\n \"0.63011307\",\n \"0.6300085\",\n \"0.62991714\",\n \"0.6297665\",\n \"0.62970793\",\n \"0.6296993\",\n \"0.6292317\",\n \"0.62906206\",\n \"0.6289713\",\n \"0.6288218\",\n \"0.62811404\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":11395,"cells":{"query":{"kind":"string","value":"Testing task 226 class main logic"},"document":{"kind":"string","value":"def test_task226_main_logic(number1, number2, expected_value):\r\n assert algo.Task226.main_logic(number1, number2) == expected_value"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["def task():","def test_get_task_output(self):\n pass","def task(self):","def task(self):","def task():\n pass","def task():\n pass","def task():\n\n\tprint('Example task executed.')","def test_get_run(self):\n pass","def setUp(self):\n self.t = Task()","def setUp(self):\n self.t = Task()","def setUp(self):\n self.t = Task()\n self.t(\"add one mississippi\")\n self.t(\"add two mississippi\")","def run_task(self) -> Task:","def setUp(self):\n self.t = Task()\n self.t(\"add one\")","def tasks():","def test_task(self, mocker):\n\n tid = 289466\n site = \"mysite\"\n json = self.generate_task_dictionary(tid, state=\"error\")\n url = (\n \"https://cloudapi.acquia.com/v1/\"\n \"sites/prod:{site}/tasks/{tid}.json\".format(tid=tid, site=site)\n )\n\n mocker.register_uri(\"GET\", url, json=json)\n\n task = self.client.site(site).task(tid)\n self.assertEqual(task[\"id\"], tid)\n self.assertEqual(task[\"state\"], \"error\")","def task1(self):\n \n pass","def task5(self):\n\n pass","def runtest(self):","def test_solve_task(self):\n pass","def task2(self):\n\n pass","def task4(self):\n\n pass","def test_task_add():\n pytest.fail('Not implemented yet.')","def create_task():","def test_basic_execution(self):","def task3(self):\n\n pass","def task2_3():","def runTests(self):\n \n pass","def processTask(self):\n #Util.set_color(Util.FOREGROUND_YELLOW | Util.FOREGROUND_INTENSITY)\n #logging.info(\"cmd : %s\", self.ExecutionTask.get_cmd())\n #logging.info(\"param : %s\", self.ExecutionTask.get_param())\n #logging.info(\"ret : %s\", str(self.ExecutionTask.get_ret()))\n #logging.info(\"ipport : %s\", self.ExecutionTask.get_ipport())\n #Util.set_color(Util.FOREGROUND_WHITE)\n\n ##############################################################\n # Process for any commands without received messages.....\n ##############################################################\n if self.ExecutionTask.get_cmd() == 'PASS' or self.ExecutionTask.get_cmd() == 'FAIL':\n logging.debug(\"result is %s\", self.ExecutionTask.get_cmd())\n self.setStatus('STOP')\n self.setTestResult(self.ExecutionTask.get_cmd())\n return\n\n if self.ExecutionTask.get_cmd() == 'r_info':\n rinfo_result = self.ExecutionTask.get_param().split('!')\n\n if len(rinfo_result) > 1:\n msg = rinfo_result[1]\n logging.debug(\"%s\", msg)\n\n self.setStatus('STOP')\n self.setTestResult(rinfo_result[0])\n return\n\n if self.ExecutionTask.get_cmd() == 'ResultCheck':\n time.sleep(5)\n self.process_ResultCheck()\n return\n\n if self.ExecutionTask.get_cmd() == 'CheckThroughput':\n time.sleep(5)\n throughputChk = StreamHandler(self.test_mngr_initr)\n chk_result = throughputChk.processStreamResults(self.ExecutionTask.get_param())\n self.setCheckResult(chk_result)\n #if 'FAIL' in chk_result:\n # self.setStatus('STOP')\n return\n\n if self.ExecutionTask.get_cmd() == 'config_multi_subresults':\n self.process_config_multi_subresults()\n return\n\n ##############################################################\n # Process for any commands with received messages......\n ##############################################################\n status = \"\"\n retDict = self.ExecutionTask.get_ret()\n recvStr = \"\"\n if self.ExecutionTask.recv:\n recvStr = self.ExecutionTask.recv.rstrip('\\r\\n')\n #print \"recv : \" + recvStr\n \n if GlobalConfigFiles.curr_prog_name == \"WMMPS\" and \"sniffer_control_subtask\" in self.ExecutionTask.get_cmd():\n logging.debug('In WMMPS, before parsing the recvStr: %s' % recvStr)\n lines = re.split('\\n', recvStr)\n for line in lines:\n if re.search(\"RESULT\", line, re.I):\n if \"FAIL\" in line:\n self.setStatus('STOP')\n self.setTestResult('FAIL')\n logging.debug('set test result to FAIL')\n return\n if \"PASS\" in line:\n self.setTestResult('PASS')\n logging.debug('set test result to Pass')\n return\n return\n \n stitems = recvStr.split(',') \n if len(stitems) < 2:\n #logging.debug(\"Bypassing this cmd..\")\n return\n\n status = stitems[1]\n iDNB = TestScriptSymbolTable.get_value_from_sym_tab(\"iDNB\", TestScriptSymbolTable.test_script_sym_tab)\n iINV = TestScriptSymbolTable.get_value_from_sym_tab(\"iINV\", TestScriptSymbolTable.test_script_sym_tab) \n \n if iINV is None:\n iINV = 0\n \n if 'ERROR' in recvStr or 'INVALID' in recvStr and (iDNB == 0 or iDNB is None) and (iINV == 0 or iINV is None):\n #error case...\n logging.debug(\"Return ERROR or INVALID---> STOP process \")\n self.setStatus('STOP')\n self.setTestResult('FAIL')\n elif status != 'COMPLETE' and iDNB == 0 and iINV == 0:\n #incomplete case...(running?)\n logging.debug(\"Command %s not completed\", self.ExecutionTask.get_cmd())\n else:\n displayname = \"\"\n for tbd in self.test_mngr_initr.test_prog_mngr.test_prog.testbed_dev_list:\n if tbd.ctrlipaddr == self.ExecutionTask.get_ipport():\n displayname = tbd.displayname\n break\n \n if \"FAIL\" in recvStr and (iINV == 0 or iINV is None):\n if \"SNIFFER\" in displayname or \"sniffer\" in self.ExecutionTask.get_cmd():\n logging.info(\"Test Case Criteria Failure - Command returned FAIL\")\n self.setStatus('STOP')\n self.setTestResult('FAIL')\n\n elif self.ExecutionTask.get_cmd() == 'device_get_info':\n try:\n if displayname == '':\n self.tmsPacket.setDutDeviceInfo(recvStr)\n else:\n self.tmsPacket.setTestbedInfo(displayname, recvStr)\n\n #for validation\n self.setValidationInfo(displayname, recvStr)\n\n except OSError:\n logging.debug(\"exception -- device_get_info capi call\")\n elif self.ExecutionTask.get_cmd() == 'ca_get_version':\n self.setValidationInfo(displayname, recvStr)\n\n elif self.ExecutionTask.get_cmd() == 'sniffer_get_info':\n self.setValidationInfo('sniffer', recvStr)\n\n elif self.ExecutionTask.get_cmd() == 'sta_associate':\n time.sleep(10)\n\n if len(stitems) > 2:\n retParam = self.ExecutionTask.get_param().split(',')\n streamFlag = \"\"\n if len(retParam) > 4:\n streamFlag = retParam[3]\n\n if stitems[2] == 'streamID':\n streamHndler = StreamHandler(self.test_mngr_initr)\n logging.debug(\"stream config - streamID : %s\", stitems[3])\n if streamFlag == 'send':\n logging.debug(\"traffic config - send : streamInfo append\")\n streamPacket = streamInfo(\"%s\" % (stitems[3]), self.ExecutionTask.get_ipport(), -1, 'send',\n retParam[15], retParam[17], streamHndler.running_phase, streamHndler.RTPCount)\n streamHndler.add_streamInfo(streamPacket)\n streamHndler.RTPCount = streamHndler.RTPCount + 1\n\n elif streamFlag == 'receive':\n logging.debug(\"traffic config - receive : streamInfo append\")\n streamPacket = streamInfo(\"%s\" % (stitems[3]), self.ExecutionTask.get_ipport(), -1, 'receive',\n -1, -1, streamHndler.running_phase, -1)\n streamHndler.add_streamInfo(streamPacket)\n\n else:\n logging.debug(\"traffic config - else : \")\n\n\n\n if retParam[1] == 'Multicast':\n logging.debug(\"----MULTICAST----\")\n streamHndler.multicast = 1\n\n if self.ExecutionTask.get_cmd() != \"traffic_agent_send\":\n ret_val = \"%s\" %(stitems[3].strip())\n logging.debug(\"traffic config - ret_val : %s\", ret_val)\n setRetVal(getRetKey(retDict), ret_val)\n\n elif stitems[2].lower() == 'interfacetype':\n ret_val = (\"%s\" %(stitems[5]))\n setRetVal(getRetKey(retDict), ret_val)\n\n elif stitems[2].lower() == 'interfaceid':\n ret_val = stitems[3].split('_')[0]\n setRetVal(getRetKey(retDict), ret_val)\n\n elif self.ExecutionTask.get_cmd() == 'traffic_stop_ping':\n\n keyVal = retParam[1]\n #\"%s;%s\"%(retParam[1], self.ExecutionTask.get_ipport())\n setRetVal(keyVal, stitems[5])\n #print(\"%s = %s\" % (retParam[1], stitems[5]))\n pinginternalchk = TestScriptSymbolTable.get_value_from_sym_tab(\"PingInternalChk\", TestScriptSymbolTable.test_script_sym_tab)\n temp_key = getRetKey(self.ExecutionTask.get_ret())\n \n if \"$\" in temp_key:\n sent_reply = temp_key.split(',')\n #print \"SLIM==> ping result save...\"\n #print sent_reply[0]\n #print sent_reply[1]\n setRetVal(sent_reply[0], stitems[3])\n setRetVal(sent_reply[1], stitems[5]) \n\n setRetVal(\"$pingResp\", stitems[5])\n if pinginternalchk == '0':\n logging.debug(\"Ping Internal Check\")\n \n elif stitems[5] == '0':\n logging.debug (\"Test Case Criteria Failure - NO IP Connection -- Aborting the test\")\n self.setStatus('STOP')\n self.setTestResult('FAIL')\n else:\n if stitems[5] == '0':\n logging.debug (\"Test Case Criteria Failure - NO IP Connection -- Aborting the test\")\n self.setStatus('STOP')\n self.setTestResult('FAIL')\n else:\n if len(retDict) > 0:\n tempKey = getRetKey(retDict)\n temp_val = tempKey.split(',')\n count = 0\n item_len = len(stitems)\n for i in temp_val:\n if item_len > count + 3:\n setRetVal(i, stitems[3+count])\n count = count + 2\n\n if self.__status == 'STOP':\n logging.debug(\"generate final result if task stops.\")\n #self.generateFinalResult()\n else:\n pass\n #logging.debug(\"Continue---\")\n return","def run_task(self, cmd):\n # Not initialized here...must be overloaded from outside\n raise NotImplementedError()","def run_task(self, cmd):\n # Not initialized here...must be overloaded from outside\n raise NotImplementedError()","def generate_tasks(self, task):","def test_run_started(self):","def __init__(self):\n Task.__init__(self)","def setup_task(self, *args, **kwargs):\n pass","def task4_1(self):\n\n pass","def _test(self):\n pass","def _test(self):\n pass","def _test(self):\n pass","def test_create_run(self):\n pass","def __init__(self, task_type, task):\n self.task = task\n self.task_type = task_type","def run_test(self):\n raise NotImplementedError","def task_gen(self):\n pass","def task(self, name):\n pass","def setUpClass(cls):\n cls.t = Task()\n cls.t('add foo entry:2008-12-22 start:2008-12-22')\n cls.t('add bar entry:2009-04-17 start:2009-04-17')","def main():\n tng.api.runner()","def task(ctx, config):\n pass","def _test_run_with_task(self, task_class, action_name, expected_num_succeeded, expected_num_skipped=0):\r\n task_entry = self._create_input_entry()\r\n status = self._run_task_with_mock_celery(task_class, task_entry.id, task_entry.task_id)\r\n # check return value\r\n self.assertEquals(status.get('attempted'), expected_num_succeeded + expected_num_skipped)\r\n self.assertEquals(status.get('succeeded'), expected_num_succeeded)\r\n self.assertEquals(status.get('skipped'), expected_num_skipped)\r\n self.assertEquals(status.get('total'), expected_num_succeeded + expected_num_skipped)\r\n self.assertEquals(status.get('action_name'), action_name)\r\n self.assertGreater(status.get('duration_ms'), 0)\r\n # compare with entry in table:\r\n entry = InstructorTask.objects.get(id=task_entry.id)\r\n self.assertEquals(json.loads(entry.task_output), status)\r\n self.assertEquals(entry.task_state, SUCCESS)","def test(self):\n pass","def main():\n\n parser = argparse.ArgumentParser(description=\"generateTestStubs\")\n\n parser.add_argument(\"taskFile\",\n help=\"Path for assignment file.\")\n\n args = parser.parse_args()\n\n if not os.path.exists(args.taskFile):\n print(\"Task file does not exist.\")\n sys.exit(1)\n\n taskMgr = EEWebLPProject()\n taskMgr.initLP()\n\n #taskMgr.listProjects()\n #taskMgr.loadTree([\"project_id=8008922\"])\n tasks = taskMgr.getTasks([\"project_id=6890048\"],parent_id=8008922)\n\n fileByAssignee = taskMgr.getTaskOwners(args.taskFile)\n taskMgr.updateTaskOwners(fileByAssignee,tasks)","def run_task(data_dir, task_id):\n print(\"Train and test for task %d ...\" % task_id)\n\n print(\"We are going to use this\")\n \n\n # Parse data\n train_files = glob.glob('%s/qa3_*_train.txt' % (data_dir, task_id))\n test_files = glob.glob('%s/qa3_*_test.txt' % (data_dir, task_id))\n\n dictionary = {\"nil\": 0}\n train_story, train_questions, train_qstory = parse_babi_task(train_files, dictionary, False)\n test_story, test_questions, test_qstory = parse_babi_task(test_files, dictionary, False)\n\n general_config = BabiConfig(train_story, train_questions, dictionary)\n\n\n # #### R: this line build a empty model to train\n # memory, model, loss = build_model(general_config)\n\n # if general_config.linear_start:\n # train_linear_start(train_story, train_questions, train_qstory, memory, model, loss, general_config)\n # else:\n # train(train_story, train_questions, train_qstory, memory, model, loss, general_config)\n\n\n\n # memory, model, loss = build_model(general_config)\n\n # this line\n test(test_story, test_questions, test_qstory, memory, model, loss, general_config)","def _test(self):","def _test(self):","def _test(self):","def _test(self):","def _test(self):","def call(self, task, **options):\n pass","def test_task1_with_example_input():\n distance = task1(input_stream())\n assert distance == 25","def cb_test( self, ):\r\n # this shows how to run stuff in the helper -- call thru queue, post to queue\r\n self.post_to_queue( \"call\", self.helper_thread.test_test_ports , ( ) )","def run_starter(self, expect_to_fail=False):","def test_create_two_independent_tasks():\n task1 = Task(\"print book\",\"Fabio\",True,1)\n task2 = Task(\"buy book\", \"Elisa\", False, 2)\n\n assert task1.summary != task2.summary","def startTestRun(self):","def task_4_2_1():\n # TODO Task 4.2.1: Your code goes here\n pass","def run(self, test, env):\n\n raise NotImplementedError","def task_4_3_2():\n # TODO Task 4.3.2: Your code goes here\n pass","def test_54_import_tasks(self, mock):\r\n Fixtures.create()\r\n self.register()\r\n self.new_application()\r\n # Without tasks, there should be a template\r\n res = self.app.get('/app/sampleapp/tasks/import', follow_redirects=True)\r\n err_msg = \"There should be a CSV template\"\r\n assert \"template=csv\" in res.data, err_msg\r\n err_msg = \"There should be an Image template\"\r\n assert \"mode=image\" in res.data, err_msg\r\n err_msg = \"There should be a Map template\"\r\n assert \"mode=map\" in res.data, err_msg\r\n err_msg = \"There should be a PDF template\"\r\n assert \"mode=pdf\" in res.data, err_msg\r\n # With tasks\r\n self.new_task(1)\r\n res = self.app.get('/app/sampleapp/tasks/import', follow_redirects=True)\r\n err_msg = \"There should load directly the basic template\"\r\n err_msg = \"There should not be a CSV template\"\r\n assert \"template=basic\" not in res.data, err_msg\r\n err_msg = \"There should not be an Image template\"\r\n assert \"template=image\" not in res.data, err_msg\r\n err_msg = \"There should not be a Map template\"\r\n assert \"template=map\" not in res.data, err_msg\r\n err_msg = \"There should not be a PDF template\"\r\n assert \"template=pdf\" not in res.data, err_msg\r\n self.signout()\r\n\r\n self.signin(email=Fixtures.email_addr2, password=Fixtures.password)\r\n res = self.app.get('/app/sampleapp/tasks/import', follow_redirects=True)\r\n assert res.status_code == 403, res.status_code","def do_test(self, line):\n #hostnames = [\"US1004511WP\", \"DESKTOP-90N8EBG\"]\n hostnames = [\"DESKTOP-90N8EBG\"]\n #hostnames = [\"US1004511WP\"]\n #hostnames = [\"SPEEDYTURTLEW10\"]\n\n param = [\"--dest\", \"C:\\\\tools\\\\scripts\\\\leet_dev\"]\n pg = self._leet.get_plugin(\"get_collection\")\n #param = [\"--source\", \"C:\\Windows\\\\system32\\\\cmd.exe\", \"--dest\", \"C:\\\\tools\\\\scripts\\\\cb_test\"]\n #param = [\"--source\", \"C:\\\\song.txt\", \"--dest\", \"C:\\\\tools\\\\scripts\\\\leet_dev\"]\n #pg = self._leet.get_plugin(\"file_download\")\n # param = [\"--path\", \"C:\\\\maintenance\"]\n # pg = self._leet.get_plugin(\"dirlist\")\n pg.parse_parameters(param)\n\n self._leet.schedule_jobs(pg, hostnames)","def __init__(self):\n abstracttask.Task.__init__(self)\n self._ticket_id = ''# this is an implementation detail of jutda task tracker\n self.timespent = datetime.timedelta(0) # not editable permenently, but saves data from hours\n self.starttime = datetime.datetime.now() # ticket creation time in this implementation \n self.isappointment = False # always false for these\n self.followups = [] # not likely to be used, since other implementation doesn't have it.\n self._orig = None\n self.submitter_email = None","def task_4_3_1():\n # TODO Task 4.3.1: Your code goes here\n pass","def do_work(self):","def test_init_on_task_run(self):\n launcher = TaskLauncher(self.db, self.task_run, self.get_mock_assignment_data_array())\n self.assertEqual(self.db, launcher.db)\n self.assertEqual(self.task_run, launcher.task_run)\n self.assertEqual(len(launcher.assignments), 0)\n self.assertEqual(len(launcher.units), 0)\n self.assertEqual(launcher.provider_type, MockProvider.PROVIDER_TYPE)","def _service_task(self):\n pass","def task_stagnant(task):","def task_test(argv):\n run_tests(\"python2\", argv)\n run_tests(\"python3\", argv)","def setUp(self):\n self.tasks = list(map(lambda t: t.task_id, FCDAGDEV.tasks))","def run(self):\r\n self.dut.create_device_and_transport(self.config_module.config_data)\r\n self.logger.info(\"Run the Test Case\")","def task_4_3_3():\n # TODO Task 4.3.3: Your code goes here\n pass","def test_perform_host_action(self):\n pass","def test_T01():","def task_parse_results():\n pass","def setUp(self):\n self.tasks = list(map(lambda t: t.task_id, FCDAGPROD.tasks))","def _run(self):\n raise NotImplementedError","def _run(self):\n raise NotImplementedError","def run_tests(self):\n raise NotImplementedError","def task(self):\n print('errrrrrrrrrrrrrrorororrorororoor')","def _run(self):\n raise NotImplementedError","def test_a():\n result = SECOND_TASK.start(\"aca\")\n\n assert result.replace(\"*\", \"\").replace(\"_\", \"\").replace(\"#\", \"\").replace(\"^\", \"\") == \"aac\"","def main(aArgs, aTransmitToTaskHandler):\n\n global TASK_HANDLER_HOST\n global TASK_HANDLER_PORT\n\n # if the option --printList is passed, only generate the file\n # reftestList.txt\n if hasattr(aArgs, \"printList\"):\n printReftestList()\n exit(0)\n\n # if the option --printNotes is passed, only generate the\n # testsuiteNotes html page.\n if hasattr(aArgs, \"printNotes\"):\n printNotes()\n exit(0)\n\n # if the option --printListOfTests is passed, only generate a ListOfTests\n # from a file containing test URIs\n if hasattr(aArgs, \"printListOfTests\"):\n if not aArgs.printListOfTests:\n print(\"No input file!\", file=sys.stderr)\n exit(0)\n printListOfTests(aArgs.printListOfTests)\n exit(0)\n\n # create the date directory\n now = datetime.utcnow();\n directory = MATHJAX_WEB_PATH + \"results/\"\n if not os.path.exists(directory):\n os.makedirs(directory)\n\n # create the subdirectory\n if aArgs.output and re.match(\"^([0-9]|[a-z]|[A-Z]|-|/){1,50}/$\",\n aArgs.output):\n directory += aArgs.output\n else:\n directory += now.strftime(\"%Y-%m-%d/%H-%M-%S/\")\n\n if not os.path.exists(directory):\n os.makedirs(directory)\n\n # execute testing instances for all the config files\n configFileList = aArgs.config.split(\",\")\n\n for configFile in configFileList:\n\n configFile = configFile\n\n if (not os.path.isfile(configFile)):\n print(\"Warning: config file \" + configFile + \" not found!\",\n file=sys.stderr)\n continue\n\n # Load configuration file\n config = ConfigParser.ConfigParser()\n config.readfp(open(configFile))\n\n # framework section\n section = \"framework\"\n useGrid = getBooleanOption(config, section, \"useGrid\")\n host = config.get(section, \"host\")\n # host == \"default\" is handled below\n port = config.getint(section, \"port\")\n if (port == -1):\n port = SELENIUM_SERVER_PORT\n mathJaxPath = config.get(section, \"mathJaxPath\")\n if (mathJaxPath == \"default\"):\n mathJaxPath = DEFAULT_MATHJAX_PATH\n mathJaxTestPath = config.get(section, \"mathJaxTestPath\")\n if (mathJaxTestPath == \"default\"):\n mathJaxTestPath = MATHJAX_TEST_LOCAL_URI + \"testsuite/\"\n timeOut = config.getint(section, \"timeOut\")\n if (timeOut == -1):\n timeOut = DEFAULT_TIMEOUT\n timeOut = timeOut * 1000 # convert in ms\n useWebDriver = getBooleanOption(config, section, \"useWebDriver\")\n fullScreenMode = getBooleanOption(config, section, \"fullScreenMode\")\n formatOutput = getBooleanOption(config, section, \"formatOutput\")\n compressOutput = getBooleanOption(config, section, \"compressOutput\")\n\n # platform section\n section = \"platform\"\n operatingSystem = config.get(section, \"operatingSystem\")\n if (operatingSystem == \"default\"):\n operatingSystem = OS_LIST[0]\n if (host == \"default\"):\n host = HOST_LIST[HOST_LIST_OS.index(OS_LIST.index(operatingSystem))]\n browserList = config.get(section, \"browser\").split()\n browserVersionList = config.get(section, \"browserVersion\").split()\n browserModeList = config.get(section, \"browserMode\").split()\n browserPath = config.get(section, \"browserPath\")\n fontList = config.get(section, \"font\").split()\n outputJaxList = config.get(section, \"outputJax\").split()\n \n # testsuite section\n section = \"testsuite\"\n runSlowTests = getBooleanOption(config, section, \"runSlowTests\")\n runSkipTests = getBooleanOption(config, section, \"runSkipTests\")\n listOfTests = config.get(section, \"listOfTests\")\n startID = config.get(section, \"startID\")\n if (startID == \"default\"):\n startID = \"\"\n \n # When more than one browser is specified, browserPath is ignored.\n if (len(browserList) > 1 and browserPath != \"default\"):\n print(\"Warning: browserPath ignored\", file=sys.stderr)\n browserPath = \"default\"\n\n for browser in browserList:\n\n if (browser == \"default\"):\n browser = BROWSER_LIST[0]\n\n for font in fontList:\n\n if (font == \"default\"):\n font = FONT_LIST[0]\n\n for outputJax in outputJaxList:\n\n if (outputJax == \"default\"):\n outputJax = OUTPUT_JAX_LIST[0]\n\n for browserVersion in browserVersionList:\n\n # browserModeList is only relevant for MSIE\n if not(browser == \"MSIE\"):\n browserModeList2 = [\"default\"]\n else:\n browserModeList2 = browserModeList\n \n for browserMode in browserModeList2:\n \n # Create a Selenium instance\n selenium = \\\n seleniumMathJax.seleniumMathJax(useWebDriver,\n useGrid,\n host,\n port,\n mathJaxPath,\n mathJaxTestPath,\n operatingSystem,\n browser,\n browserVersion,\n browserMode,\n browserPath,\n font,\n outputJax,\n timeOut,\n fullScreenMode)\n \n if aTransmitToTaskHandler:\n taskHandler = [TASK_HANDLER_HOST,\n TASK_HANDLER_PORT,\n str(os.getpid())]\n else:\n taskHandler = None\n\n # Create the test suite\n suite = reftest.reftestSuite(taskHandler,\n runSlowTests,\n runSkipTests,\n listOfTests,\n startID)\n # use the specified file name\n if hasattr(aArgs, \"filename\"):\n filename = aArgs.filename\n else:\n filename = getOutputFileName(directory,\n selenium,\n suite)\n runTestingInstance(directory, selenium, suite,\n formatOutput, compressOutput,\n filename)\n # end browserMode\n # end browserVersion\n #end outputJax\n # end for font\n # end browser","def setUp(self):\n # Used to initialize objects that should be re-initialized or\n # re-created for each individual test\n self.t = Task()\n\n self.t.config(\"alias.from\", \"to\")","def test_task_name(self):\n from sosbeacon.event.message import get_contact_broadcast_task\n\n student_key = Mock()\n student_key.urlsafe.return_value = \"STUDENTKEY\"\n\n event_key = Mock()\n event_key.urlsafe.return_value = \"EVENTKEY\"\n\n message_key = Mock()\n message_key.urlsafe.return_value = \"MESSAGEKEY\"\n\n batch_id = \"BATCHID\"\n\n contact = {\n 'name': 'Johny Jones',\n 'methods': (\n {'type': 't', 'value': '1234567890'},\n {'type': 'e', 'value': 'johny@jones.com'},\n )\n }\n\n task = get_contact_broadcast_task(\n event_key, message_key, student_key, contact, batch_id)\n\n self.assertIn('STUDENTKEY', task.name)\n self.assertNotIn('EVENTKEY', task.name)\n self.assertIn('MESSAGEKEY', task.name)\n self.assertIn('BATCHID', task.name)\n self.assertNotIn('johny@jones.com', task.name)","def task1():\n logger.info(\"In API3 task1 function\")\n return \"task1 success!\"","def executor(self):","def run(self):\n \n pass","def test_script(self) -> None:\n main()","def RUN(self):","def test_task_list():\n # Fake pyramid request, useful for testing.\n request = testing.DummyRequest()\n\n pytest.fail('Not implemented yet.')","def test_let(self):","def test_incremental_tasks(self):\r\n self.create_2(sched='incremental')\r\n\r\n # Del previous TaskRuns\r\n self.del_task_runs()\r\n\r\n # Register\r\n self.register(fullname=self.user.fullname, name=self.user.username,\r\n password=self.user.password)\r\n self.register(fullname=\"Marie Doe\", name=\"mariedoe\", password=\"dr0wss4p\")\r\n self.signin()\r\n\r\n # Get the only task with no runs!\r\n res = self.app.get('api/app/1/newtask')\r\n data = json.loads(res.data)\r\n # Check that we received a clean Task\r\n assert data.get('info'), data\r\n assert not data.get('info').get('last_answer')\r\n\r\n # Submit an Answer for the assigned task\r\n tr = dict(app_id=data['app_id'], task_id=data['id'], info={'answer': 'No'})\r\n tr = json.dumps(tr)\r\n\r\n self.app.post('/api/taskrun', data=tr)\r\n # No more tasks available for this user!\r\n res = self.app.get('api/app/1/newtask')\r\n data = json.loads(res.data)\r\n assert not data\r\n\r\n #### Get the only task now with an answer as Anonimous!\r\n self.signout()\r\n res = self.app.get('api/app/1/newtask')\r\n data = json.loads(res.data)\r\n\r\n # Check that we received a Task with answer\r\n assert data.get('info'), data\r\n assert data.get('info').get('last_answer').get('answer') == 'No'\r\n\r\n # Submit a second Answer as Anonimous\r\n tr = dict(app_id=data['app_id'], task_id=data['id'],\r\n info={'answer': 'No No'})\r\n tr = json.dumps(tr)\r\n\r\n self.app.post('/api/taskrun', data=tr)\r\n\r\n #### Get the only task now with an answer as User2!\r\n self.signin(email=\"mariedoe@example.com\", password=\"dr0wss4p\")\r\n res = self.app.get('api/app/1/newtask')\r\n data = json.loads(res.data)\r\n\r\n # Check that we received a Task with answer\r\n assert data.get('info'), data\r\n assert data.get('info').get('last_answer').get('answer') == 'No No'","def test_task_instance(self) -> None:\n self.assertTrue(isinstance(self.test_task, Tasks))","def test_run_ended(self):","def _test_run_with_short_error_msg(self, task_class):\r\n task_entry = self._create_input_entry()\r\n self.define_option_problem(PROBLEM_URL_NAME)\r\n expected_message = \"x\" * 900\r\n with self.assertRaises(TestTaskFailure):\r\n self._run_task_with_mock_celery(task_class, task_entry.id, task_entry.task_id, expected_message)\r\n # compare with entry in table:\r\n entry = InstructorTask.objects.get(id=task_entry.id)\r\n self.assertEquals(entry.task_state, FAILURE)\r\n self.assertGreater(1023, len(entry.task_output))\r\n output = json.loads(entry.task_output)\r\n self.assertEquals(output['exception'], 'TestTaskFailure')\r\n self.assertEquals(output['message'], expected_message)\r\n self.assertEquals(output['traceback'][-3:], \"...\")","def main():\n # get arguments from command line\n args = parse_arguments()\n\n # checks on the output file\n # if args.stats_only:\n # assert args.output, \"The output file was not provided\"\n if args.output and os.path.exists(args.output):\n warnings.warn(\"Overwriting task file \" + args.output, UserWarning)\n os.remove(args.output)\n\n # initialize the task\n task = Task(\n args.database, args.on,\n across=args.across,\n by=args.by,\n filters=args.filters,\n regressors=args.regressors,\n verbose=args.verbose)\n\n if args.stats_only:\n task.print_stats()\n else:\n if args.tempdir and not os.path.exists(args.tempdir):\n os.makedirs(args.tempdir)\n\n # generate triplets and unique pairs\n task.generate_triplets(\n output=args.output,\n threshold=args.threshold,\n tmpdir=args.tempdir,\n seed=args.seed)"],"string":"[\n \"def task():\",\n \"def test_get_task_output(self):\\n pass\",\n \"def task(self):\",\n \"def task(self):\",\n \"def task():\\n pass\",\n \"def task():\\n pass\",\n \"def task():\\n\\n\\tprint('Example task executed.')\",\n \"def test_get_run(self):\\n pass\",\n \"def setUp(self):\\n self.t = Task()\",\n \"def setUp(self):\\n self.t = Task()\",\n \"def setUp(self):\\n self.t = Task()\\n self.t(\\\"add one mississippi\\\")\\n self.t(\\\"add two mississippi\\\")\",\n \"def run_task(self) -> Task:\",\n \"def setUp(self):\\n self.t = Task()\\n self.t(\\\"add one\\\")\",\n \"def tasks():\",\n \"def test_task(self, mocker):\\n\\n tid = 289466\\n site = \\\"mysite\\\"\\n json = self.generate_task_dictionary(tid, state=\\\"error\\\")\\n url = (\\n \\\"https://cloudapi.acquia.com/v1/\\\"\\n \\\"sites/prod:{site}/tasks/{tid}.json\\\".format(tid=tid, site=site)\\n )\\n\\n mocker.register_uri(\\\"GET\\\", url, json=json)\\n\\n task = self.client.site(site).task(tid)\\n self.assertEqual(task[\\\"id\\\"], tid)\\n self.assertEqual(task[\\\"state\\\"], \\\"error\\\")\",\n \"def task1(self):\\n \\n pass\",\n \"def task5(self):\\n\\n pass\",\n \"def runtest(self):\",\n \"def test_solve_task(self):\\n pass\",\n \"def task2(self):\\n\\n pass\",\n \"def task4(self):\\n\\n pass\",\n \"def test_task_add():\\n pytest.fail('Not implemented yet.')\",\n \"def create_task():\",\n \"def test_basic_execution(self):\",\n \"def task3(self):\\n\\n pass\",\n \"def task2_3():\",\n \"def runTests(self):\\n \\n pass\",\n \"def processTask(self):\\n #Util.set_color(Util.FOREGROUND_YELLOW | Util.FOREGROUND_INTENSITY)\\n #logging.info(\\\"cmd : %s\\\", self.ExecutionTask.get_cmd())\\n #logging.info(\\\"param : %s\\\", self.ExecutionTask.get_param())\\n #logging.info(\\\"ret : %s\\\", str(self.ExecutionTask.get_ret()))\\n #logging.info(\\\"ipport : %s\\\", self.ExecutionTask.get_ipport())\\n #Util.set_color(Util.FOREGROUND_WHITE)\\n\\n ##############################################################\\n # Process for any commands without received messages.....\\n ##############################################################\\n if self.ExecutionTask.get_cmd() == 'PASS' or self.ExecutionTask.get_cmd() == 'FAIL':\\n logging.debug(\\\"result is %s\\\", self.ExecutionTask.get_cmd())\\n self.setStatus('STOP')\\n self.setTestResult(self.ExecutionTask.get_cmd())\\n return\\n\\n if self.ExecutionTask.get_cmd() == 'r_info':\\n rinfo_result = self.ExecutionTask.get_param().split('!')\\n\\n if len(rinfo_result) > 1:\\n msg = rinfo_result[1]\\n logging.debug(\\\"%s\\\", msg)\\n\\n self.setStatus('STOP')\\n self.setTestResult(rinfo_result[0])\\n return\\n\\n if self.ExecutionTask.get_cmd() == 'ResultCheck':\\n time.sleep(5)\\n self.process_ResultCheck()\\n return\\n\\n if self.ExecutionTask.get_cmd() == 'CheckThroughput':\\n time.sleep(5)\\n throughputChk = StreamHandler(self.test_mngr_initr)\\n chk_result = throughputChk.processStreamResults(self.ExecutionTask.get_param())\\n self.setCheckResult(chk_result)\\n #if 'FAIL' in chk_result:\\n # self.setStatus('STOP')\\n return\\n\\n if self.ExecutionTask.get_cmd() == 'config_multi_subresults':\\n self.process_config_multi_subresults()\\n return\\n\\n ##############################################################\\n # Process for any commands with received messages......\\n ##############################################################\\n status = \\\"\\\"\\n retDict = self.ExecutionTask.get_ret()\\n recvStr = \\\"\\\"\\n if self.ExecutionTask.recv:\\n recvStr = self.ExecutionTask.recv.rstrip('\\\\r\\\\n')\\n #print \\\"recv : \\\" + recvStr\\n \\n if GlobalConfigFiles.curr_prog_name == \\\"WMMPS\\\" and \\\"sniffer_control_subtask\\\" in self.ExecutionTask.get_cmd():\\n logging.debug('In WMMPS, before parsing the recvStr: %s' % recvStr)\\n lines = re.split('\\\\n', recvStr)\\n for line in lines:\\n if re.search(\\\"RESULT\\\", line, re.I):\\n if \\\"FAIL\\\" in line:\\n self.setStatus('STOP')\\n self.setTestResult('FAIL')\\n logging.debug('set test result to FAIL')\\n return\\n if \\\"PASS\\\" in line:\\n self.setTestResult('PASS')\\n logging.debug('set test result to Pass')\\n return\\n return\\n \\n stitems = recvStr.split(',') \\n if len(stitems) < 2:\\n #logging.debug(\\\"Bypassing this cmd..\\\")\\n return\\n\\n status = stitems[1]\\n iDNB = TestScriptSymbolTable.get_value_from_sym_tab(\\\"iDNB\\\", TestScriptSymbolTable.test_script_sym_tab)\\n iINV = TestScriptSymbolTable.get_value_from_sym_tab(\\\"iINV\\\", TestScriptSymbolTable.test_script_sym_tab) \\n \\n if iINV is None:\\n iINV = 0\\n \\n if 'ERROR' in recvStr or 'INVALID' in recvStr and (iDNB == 0 or iDNB is None) and (iINV == 0 or iINV is None):\\n #error case...\\n logging.debug(\\\"Return ERROR or INVALID---> STOP process \\\")\\n self.setStatus('STOP')\\n self.setTestResult('FAIL')\\n elif status != 'COMPLETE' and iDNB == 0 and iINV == 0:\\n #incomplete case...(running?)\\n logging.debug(\\\"Command %s not completed\\\", self.ExecutionTask.get_cmd())\\n else:\\n displayname = \\\"\\\"\\n for tbd in self.test_mngr_initr.test_prog_mngr.test_prog.testbed_dev_list:\\n if tbd.ctrlipaddr == self.ExecutionTask.get_ipport():\\n displayname = tbd.displayname\\n break\\n \\n if \\\"FAIL\\\" in recvStr and (iINV == 0 or iINV is None):\\n if \\\"SNIFFER\\\" in displayname or \\\"sniffer\\\" in self.ExecutionTask.get_cmd():\\n logging.info(\\\"Test Case Criteria Failure - Command returned FAIL\\\")\\n self.setStatus('STOP')\\n self.setTestResult('FAIL')\\n\\n elif self.ExecutionTask.get_cmd() == 'device_get_info':\\n try:\\n if displayname == '':\\n self.tmsPacket.setDutDeviceInfo(recvStr)\\n else:\\n self.tmsPacket.setTestbedInfo(displayname, recvStr)\\n\\n #for validation\\n self.setValidationInfo(displayname, recvStr)\\n\\n except OSError:\\n logging.debug(\\\"exception -- device_get_info capi call\\\")\\n elif self.ExecutionTask.get_cmd() == 'ca_get_version':\\n self.setValidationInfo(displayname, recvStr)\\n\\n elif self.ExecutionTask.get_cmd() == 'sniffer_get_info':\\n self.setValidationInfo('sniffer', recvStr)\\n\\n elif self.ExecutionTask.get_cmd() == 'sta_associate':\\n time.sleep(10)\\n\\n if len(stitems) > 2:\\n retParam = self.ExecutionTask.get_param().split(',')\\n streamFlag = \\\"\\\"\\n if len(retParam) > 4:\\n streamFlag = retParam[3]\\n\\n if stitems[2] == 'streamID':\\n streamHndler = StreamHandler(self.test_mngr_initr)\\n logging.debug(\\\"stream config - streamID : %s\\\", stitems[3])\\n if streamFlag == 'send':\\n logging.debug(\\\"traffic config - send : streamInfo append\\\")\\n streamPacket = streamInfo(\\\"%s\\\" % (stitems[3]), self.ExecutionTask.get_ipport(), -1, 'send',\\n retParam[15], retParam[17], streamHndler.running_phase, streamHndler.RTPCount)\\n streamHndler.add_streamInfo(streamPacket)\\n streamHndler.RTPCount = streamHndler.RTPCount + 1\\n\\n elif streamFlag == 'receive':\\n logging.debug(\\\"traffic config - receive : streamInfo append\\\")\\n streamPacket = streamInfo(\\\"%s\\\" % (stitems[3]), self.ExecutionTask.get_ipport(), -1, 'receive',\\n -1, -1, streamHndler.running_phase, -1)\\n streamHndler.add_streamInfo(streamPacket)\\n\\n else:\\n logging.debug(\\\"traffic config - else : \\\")\\n\\n\\n\\n if retParam[1] == 'Multicast':\\n logging.debug(\\\"----MULTICAST----\\\")\\n streamHndler.multicast = 1\\n\\n if self.ExecutionTask.get_cmd() != \\\"traffic_agent_send\\\":\\n ret_val = \\\"%s\\\" %(stitems[3].strip())\\n logging.debug(\\\"traffic config - ret_val : %s\\\", ret_val)\\n setRetVal(getRetKey(retDict), ret_val)\\n\\n elif stitems[2].lower() == 'interfacetype':\\n ret_val = (\\\"%s\\\" %(stitems[5]))\\n setRetVal(getRetKey(retDict), ret_val)\\n\\n elif stitems[2].lower() == 'interfaceid':\\n ret_val = stitems[3].split('_')[0]\\n setRetVal(getRetKey(retDict), ret_val)\\n\\n elif self.ExecutionTask.get_cmd() == 'traffic_stop_ping':\\n\\n keyVal = retParam[1]\\n #\\\"%s;%s\\\"%(retParam[1], self.ExecutionTask.get_ipport())\\n setRetVal(keyVal, stitems[5])\\n #print(\\\"%s = %s\\\" % (retParam[1], stitems[5]))\\n pinginternalchk = TestScriptSymbolTable.get_value_from_sym_tab(\\\"PingInternalChk\\\", TestScriptSymbolTable.test_script_sym_tab)\\n temp_key = getRetKey(self.ExecutionTask.get_ret())\\n \\n if \\\"$\\\" in temp_key:\\n sent_reply = temp_key.split(',')\\n #print \\\"SLIM==> ping result save...\\\"\\n #print sent_reply[0]\\n #print sent_reply[1]\\n setRetVal(sent_reply[0], stitems[3])\\n setRetVal(sent_reply[1], stitems[5]) \\n\\n setRetVal(\\\"$pingResp\\\", stitems[5])\\n if pinginternalchk == '0':\\n logging.debug(\\\"Ping Internal Check\\\")\\n \\n elif stitems[5] == '0':\\n logging.debug (\\\"Test Case Criteria Failure - NO IP Connection -- Aborting the test\\\")\\n self.setStatus('STOP')\\n self.setTestResult('FAIL')\\n else:\\n if stitems[5] == '0':\\n logging.debug (\\\"Test Case Criteria Failure - NO IP Connection -- Aborting the test\\\")\\n self.setStatus('STOP')\\n self.setTestResult('FAIL')\\n else:\\n if len(retDict) > 0:\\n tempKey = getRetKey(retDict)\\n temp_val = tempKey.split(',')\\n count = 0\\n item_len = len(stitems)\\n for i in temp_val:\\n if item_len > count + 3:\\n setRetVal(i, stitems[3+count])\\n count = count + 2\\n\\n if self.__status == 'STOP':\\n logging.debug(\\\"generate final result if task stops.\\\")\\n #self.generateFinalResult()\\n else:\\n pass\\n #logging.debug(\\\"Continue---\\\")\\n return\",\n \"def run_task(self, cmd):\\n # Not initialized here...must be overloaded from outside\\n raise NotImplementedError()\",\n \"def run_task(self, cmd):\\n # Not initialized here...must be overloaded from outside\\n raise NotImplementedError()\",\n \"def generate_tasks(self, task):\",\n \"def test_run_started(self):\",\n \"def __init__(self):\\n Task.__init__(self)\",\n \"def setup_task(self, *args, **kwargs):\\n pass\",\n \"def task4_1(self):\\n\\n pass\",\n \"def _test(self):\\n pass\",\n \"def _test(self):\\n pass\",\n \"def _test(self):\\n pass\",\n \"def test_create_run(self):\\n pass\",\n \"def __init__(self, task_type, task):\\n self.task = task\\n self.task_type = task_type\",\n \"def run_test(self):\\n raise NotImplementedError\",\n \"def task_gen(self):\\n pass\",\n \"def task(self, name):\\n pass\",\n \"def setUpClass(cls):\\n cls.t = Task()\\n cls.t('add foo entry:2008-12-22 start:2008-12-22')\\n cls.t('add bar entry:2009-04-17 start:2009-04-17')\",\n \"def main():\\n tng.api.runner()\",\n \"def task(ctx, config):\\n pass\",\n \"def _test_run_with_task(self, task_class, action_name, expected_num_succeeded, expected_num_skipped=0):\\r\\n task_entry = self._create_input_entry()\\r\\n status = self._run_task_with_mock_celery(task_class, task_entry.id, task_entry.task_id)\\r\\n # check return value\\r\\n self.assertEquals(status.get('attempted'), expected_num_succeeded + expected_num_skipped)\\r\\n self.assertEquals(status.get('succeeded'), expected_num_succeeded)\\r\\n self.assertEquals(status.get('skipped'), expected_num_skipped)\\r\\n self.assertEquals(status.get('total'), expected_num_succeeded + expected_num_skipped)\\r\\n self.assertEquals(status.get('action_name'), action_name)\\r\\n self.assertGreater(status.get('duration_ms'), 0)\\r\\n # compare with entry in table:\\r\\n entry = InstructorTask.objects.get(id=task_entry.id)\\r\\n self.assertEquals(json.loads(entry.task_output), status)\\r\\n self.assertEquals(entry.task_state, SUCCESS)\",\n \"def test(self):\\n pass\",\n \"def main():\\n\\n parser = argparse.ArgumentParser(description=\\\"generateTestStubs\\\")\\n\\n parser.add_argument(\\\"taskFile\\\",\\n help=\\\"Path for assignment file.\\\")\\n\\n args = parser.parse_args()\\n\\n if not os.path.exists(args.taskFile):\\n print(\\\"Task file does not exist.\\\")\\n sys.exit(1)\\n\\n taskMgr = EEWebLPProject()\\n taskMgr.initLP()\\n\\n #taskMgr.listProjects()\\n #taskMgr.loadTree([\\\"project_id=8008922\\\"])\\n tasks = taskMgr.getTasks([\\\"project_id=6890048\\\"],parent_id=8008922)\\n\\n fileByAssignee = taskMgr.getTaskOwners(args.taskFile)\\n taskMgr.updateTaskOwners(fileByAssignee,tasks)\",\n \"def run_task(data_dir, task_id):\\n print(\\\"Train and test for task %d ...\\\" % task_id)\\n\\n print(\\\"We are going to use this\\\")\\n \\n\\n # Parse data\\n train_files = glob.glob('%s/qa3_*_train.txt' % (data_dir, task_id))\\n test_files = glob.glob('%s/qa3_*_test.txt' % (data_dir, task_id))\\n\\n dictionary = {\\\"nil\\\": 0}\\n train_story, train_questions, train_qstory = parse_babi_task(train_files, dictionary, False)\\n test_story, test_questions, test_qstory = parse_babi_task(test_files, dictionary, False)\\n\\n general_config = BabiConfig(train_story, train_questions, dictionary)\\n\\n\\n # #### R: this line build a empty model to train\\n # memory, model, loss = build_model(general_config)\\n\\n # if general_config.linear_start:\\n # train_linear_start(train_story, train_questions, train_qstory, memory, model, loss, general_config)\\n # else:\\n # train(train_story, train_questions, train_qstory, memory, model, loss, general_config)\\n\\n\\n\\n # memory, model, loss = build_model(general_config)\\n\\n # this line\\n test(test_story, test_questions, test_qstory, memory, model, loss, general_config)\",\n \"def _test(self):\",\n \"def _test(self):\",\n \"def _test(self):\",\n \"def _test(self):\",\n \"def _test(self):\",\n \"def call(self, task, **options):\\n pass\",\n \"def test_task1_with_example_input():\\n distance = task1(input_stream())\\n assert distance == 25\",\n \"def cb_test( self, ):\\r\\n # this shows how to run stuff in the helper -- call thru queue, post to queue\\r\\n self.post_to_queue( \\\"call\\\", self.helper_thread.test_test_ports , ( ) )\",\n \"def run_starter(self, expect_to_fail=False):\",\n \"def test_create_two_independent_tasks():\\n task1 = Task(\\\"print book\\\",\\\"Fabio\\\",True,1)\\n task2 = Task(\\\"buy book\\\", \\\"Elisa\\\", False, 2)\\n\\n assert task1.summary != task2.summary\",\n \"def startTestRun(self):\",\n \"def task_4_2_1():\\n # TODO Task 4.2.1: Your code goes here\\n pass\",\n \"def run(self, test, env):\\n\\n raise NotImplementedError\",\n \"def task_4_3_2():\\n # TODO Task 4.3.2: Your code goes here\\n pass\",\n \"def test_54_import_tasks(self, mock):\\r\\n Fixtures.create()\\r\\n self.register()\\r\\n self.new_application()\\r\\n # Without tasks, there should be a template\\r\\n res = self.app.get('/app/sampleapp/tasks/import', follow_redirects=True)\\r\\n err_msg = \\\"There should be a CSV template\\\"\\r\\n assert \\\"template=csv\\\" in res.data, err_msg\\r\\n err_msg = \\\"There should be an Image template\\\"\\r\\n assert \\\"mode=image\\\" in res.data, err_msg\\r\\n err_msg = \\\"There should be a Map template\\\"\\r\\n assert \\\"mode=map\\\" in res.data, err_msg\\r\\n err_msg = \\\"There should be a PDF template\\\"\\r\\n assert \\\"mode=pdf\\\" in res.data, err_msg\\r\\n # With tasks\\r\\n self.new_task(1)\\r\\n res = self.app.get('/app/sampleapp/tasks/import', follow_redirects=True)\\r\\n err_msg = \\\"There should load directly the basic template\\\"\\r\\n err_msg = \\\"There should not be a CSV template\\\"\\r\\n assert \\\"template=basic\\\" not in res.data, err_msg\\r\\n err_msg = \\\"There should not be an Image template\\\"\\r\\n assert \\\"template=image\\\" not in res.data, err_msg\\r\\n err_msg = \\\"There should not be a Map template\\\"\\r\\n assert \\\"template=map\\\" not in res.data, err_msg\\r\\n err_msg = \\\"There should not be a PDF template\\\"\\r\\n assert \\\"template=pdf\\\" not in res.data, err_msg\\r\\n self.signout()\\r\\n\\r\\n self.signin(email=Fixtures.email_addr2, password=Fixtures.password)\\r\\n res = self.app.get('/app/sampleapp/tasks/import', follow_redirects=True)\\r\\n assert res.status_code == 403, res.status_code\",\n \"def do_test(self, line):\\n #hostnames = [\\\"US1004511WP\\\", \\\"DESKTOP-90N8EBG\\\"]\\n hostnames = [\\\"DESKTOP-90N8EBG\\\"]\\n #hostnames = [\\\"US1004511WP\\\"]\\n #hostnames = [\\\"SPEEDYTURTLEW10\\\"]\\n\\n param = [\\\"--dest\\\", \\\"C:\\\\\\\\tools\\\\\\\\scripts\\\\\\\\leet_dev\\\"]\\n pg = self._leet.get_plugin(\\\"get_collection\\\")\\n #param = [\\\"--source\\\", \\\"C:\\\\Windows\\\\\\\\system32\\\\\\\\cmd.exe\\\", \\\"--dest\\\", \\\"C:\\\\\\\\tools\\\\\\\\scripts\\\\\\\\cb_test\\\"]\\n #param = [\\\"--source\\\", \\\"C:\\\\\\\\song.txt\\\", \\\"--dest\\\", \\\"C:\\\\\\\\tools\\\\\\\\scripts\\\\\\\\leet_dev\\\"]\\n #pg = self._leet.get_plugin(\\\"file_download\\\")\\n # param = [\\\"--path\\\", \\\"C:\\\\\\\\maintenance\\\"]\\n # pg = self._leet.get_plugin(\\\"dirlist\\\")\\n pg.parse_parameters(param)\\n\\n self._leet.schedule_jobs(pg, hostnames)\",\n \"def __init__(self):\\n abstracttask.Task.__init__(self)\\n self._ticket_id = ''# this is an implementation detail of jutda task tracker\\n self.timespent = datetime.timedelta(0) # not editable permenently, but saves data from hours\\n self.starttime = datetime.datetime.now() # ticket creation time in this implementation \\n self.isappointment = False # always false for these\\n self.followups = [] # not likely to be used, since other implementation doesn't have it.\\n self._orig = None\\n self.submitter_email = None\",\n \"def task_4_3_1():\\n # TODO Task 4.3.1: Your code goes here\\n pass\",\n \"def do_work(self):\",\n \"def test_init_on_task_run(self):\\n launcher = TaskLauncher(self.db, self.task_run, self.get_mock_assignment_data_array())\\n self.assertEqual(self.db, launcher.db)\\n self.assertEqual(self.task_run, launcher.task_run)\\n self.assertEqual(len(launcher.assignments), 0)\\n self.assertEqual(len(launcher.units), 0)\\n self.assertEqual(launcher.provider_type, MockProvider.PROVIDER_TYPE)\",\n \"def _service_task(self):\\n pass\",\n \"def task_stagnant(task):\",\n \"def task_test(argv):\\n run_tests(\\\"python2\\\", argv)\\n run_tests(\\\"python3\\\", argv)\",\n \"def setUp(self):\\n self.tasks = list(map(lambda t: t.task_id, FCDAGDEV.tasks))\",\n \"def run(self):\\r\\n self.dut.create_device_and_transport(self.config_module.config_data)\\r\\n self.logger.info(\\\"Run the Test Case\\\")\",\n \"def task_4_3_3():\\n # TODO Task 4.3.3: Your code goes here\\n pass\",\n \"def test_perform_host_action(self):\\n pass\",\n \"def test_T01():\",\n \"def task_parse_results():\\n pass\",\n \"def setUp(self):\\n self.tasks = list(map(lambda t: t.task_id, FCDAGPROD.tasks))\",\n \"def _run(self):\\n raise NotImplementedError\",\n \"def _run(self):\\n raise NotImplementedError\",\n \"def run_tests(self):\\n raise NotImplementedError\",\n \"def task(self):\\n print('errrrrrrrrrrrrrrorororrorororoor')\",\n \"def _run(self):\\n raise NotImplementedError\",\n \"def test_a():\\n result = SECOND_TASK.start(\\\"aca\\\")\\n\\n assert result.replace(\\\"*\\\", \\\"\\\").replace(\\\"_\\\", \\\"\\\").replace(\\\"#\\\", \\\"\\\").replace(\\\"^\\\", \\\"\\\") == \\\"aac\\\"\",\n \"def main(aArgs, aTransmitToTaskHandler):\\n\\n global TASK_HANDLER_HOST\\n global TASK_HANDLER_PORT\\n\\n # if the option --printList is passed, only generate the file\\n # reftestList.txt\\n if hasattr(aArgs, \\\"printList\\\"):\\n printReftestList()\\n exit(0)\\n\\n # if the option --printNotes is passed, only generate the\\n # testsuiteNotes html page.\\n if hasattr(aArgs, \\\"printNotes\\\"):\\n printNotes()\\n exit(0)\\n\\n # if the option --printListOfTests is passed, only generate a ListOfTests\\n # from a file containing test URIs\\n if hasattr(aArgs, \\\"printListOfTests\\\"):\\n if not aArgs.printListOfTests:\\n print(\\\"No input file!\\\", file=sys.stderr)\\n exit(0)\\n printListOfTests(aArgs.printListOfTests)\\n exit(0)\\n\\n # create the date directory\\n now = datetime.utcnow();\\n directory = MATHJAX_WEB_PATH + \\\"results/\\\"\\n if not os.path.exists(directory):\\n os.makedirs(directory)\\n\\n # create the subdirectory\\n if aArgs.output and re.match(\\\"^([0-9]|[a-z]|[A-Z]|-|/){1,50}/$\\\",\\n aArgs.output):\\n directory += aArgs.output\\n else:\\n directory += now.strftime(\\\"%Y-%m-%d/%H-%M-%S/\\\")\\n\\n if not os.path.exists(directory):\\n os.makedirs(directory)\\n\\n # execute testing instances for all the config files\\n configFileList = aArgs.config.split(\\\",\\\")\\n\\n for configFile in configFileList:\\n\\n configFile = configFile\\n\\n if (not os.path.isfile(configFile)):\\n print(\\\"Warning: config file \\\" + configFile + \\\" not found!\\\",\\n file=sys.stderr)\\n continue\\n\\n # Load configuration file\\n config = ConfigParser.ConfigParser()\\n config.readfp(open(configFile))\\n\\n # framework section\\n section = \\\"framework\\\"\\n useGrid = getBooleanOption(config, section, \\\"useGrid\\\")\\n host = config.get(section, \\\"host\\\")\\n # host == \\\"default\\\" is handled below\\n port = config.getint(section, \\\"port\\\")\\n if (port == -1):\\n port = SELENIUM_SERVER_PORT\\n mathJaxPath = config.get(section, \\\"mathJaxPath\\\")\\n if (mathJaxPath == \\\"default\\\"):\\n mathJaxPath = DEFAULT_MATHJAX_PATH\\n mathJaxTestPath = config.get(section, \\\"mathJaxTestPath\\\")\\n if (mathJaxTestPath == \\\"default\\\"):\\n mathJaxTestPath = MATHJAX_TEST_LOCAL_URI + \\\"testsuite/\\\"\\n timeOut = config.getint(section, \\\"timeOut\\\")\\n if (timeOut == -1):\\n timeOut = DEFAULT_TIMEOUT\\n timeOut = timeOut * 1000 # convert in ms\\n useWebDriver = getBooleanOption(config, section, \\\"useWebDriver\\\")\\n fullScreenMode = getBooleanOption(config, section, \\\"fullScreenMode\\\")\\n formatOutput = getBooleanOption(config, section, \\\"formatOutput\\\")\\n compressOutput = getBooleanOption(config, section, \\\"compressOutput\\\")\\n\\n # platform section\\n section = \\\"platform\\\"\\n operatingSystem = config.get(section, \\\"operatingSystem\\\")\\n if (operatingSystem == \\\"default\\\"):\\n operatingSystem = OS_LIST[0]\\n if (host == \\\"default\\\"):\\n host = HOST_LIST[HOST_LIST_OS.index(OS_LIST.index(operatingSystem))]\\n browserList = config.get(section, \\\"browser\\\").split()\\n browserVersionList = config.get(section, \\\"browserVersion\\\").split()\\n browserModeList = config.get(section, \\\"browserMode\\\").split()\\n browserPath = config.get(section, \\\"browserPath\\\")\\n fontList = config.get(section, \\\"font\\\").split()\\n outputJaxList = config.get(section, \\\"outputJax\\\").split()\\n \\n # testsuite section\\n section = \\\"testsuite\\\"\\n runSlowTests = getBooleanOption(config, section, \\\"runSlowTests\\\")\\n runSkipTests = getBooleanOption(config, section, \\\"runSkipTests\\\")\\n listOfTests = config.get(section, \\\"listOfTests\\\")\\n startID = config.get(section, \\\"startID\\\")\\n if (startID == \\\"default\\\"):\\n startID = \\\"\\\"\\n \\n # When more than one browser is specified, browserPath is ignored.\\n if (len(browserList) > 1 and browserPath != \\\"default\\\"):\\n print(\\\"Warning: browserPath ignored\\\", file=sys.stderr)\\n browserPath = \\\"default\\\"\\n\\n for browser in browserList:\\n\\n if (browser == \\\"default\\\"):\\n browser = BROWSER_LIST[0]\\n\\n for font in fontList:\\n\\n if (font == \\\"default\\\"):\\n font = FONT_LIST[0]\\n\\n for outputJax in outputJaxList:\\n\\n if (outputJax == \\\"default\\\"):\\n outputJax = OUTPUT_JAX_LIST[0]\\n\\n for browserVersion in browserVersionList:\\n\\n # browserModeList is only relevant for MSIE\\n if not(browser == \\\"MSIE\\\"):\\n browserModeList2 = [\\\"default\\\"]\\n else:\\n browserModeList2 = browserModeList\\n \\n for browserMode in browserModeList2:\\n \\n # Create a Selenium instance\\n selenium = \\\\\\n seleniumMathJax.seleniumMathJax(useWebDriver,\\n useGrid,\\n host,\\n port,\\n mathJaxPath,\\n mathJaxTestPath,\\n operatingSystem,\\n browser,\\n browserVersion,\\n browserMode,\\n browserPath,\\n font,\\n outputJax,\\n timeOut,\\n fullScreenMode)\\n \\n if aTransmitToTaskHandler:\\n taskHandler = [TASK_HANDLER_HOST,\\n TASK_HANDLER_PORT,\\n str(os.getpid())]\\n else:\\n taskHandler = None\\n\\n # Create the test suite\\n suite = reftest.reftestSuite(taskHandler,\\n runSlowTests,\\n runSkipTests,\\n listOfTests,\\n startID)\\n # use the specified file name\\n if hasattr(aArgs, \\\"filename\\\"):\\n filename = aArgs.filename\\n else:\\n filename = getOutputFileName(directory,\\n selenium,\\n suite)\\n runTestingInstance(directory, selenium, suite,\\n formatOutput, compressOutput,\\n filename)\\n # end browserMode\\n # end browserVersion\\n #end outputJax\\n # end for font\\n # end browser\",\n \"def setUp(self):\\n # Used to initialize objects that should be re-initialized or\\n # re-created for each individual test\\n self.t = Task()\\n\\n self.t.config(\\\"alias.from\\\", \\\"to\\\")\",\n \"def test_task_name(self):\\n from sosbeacon.event.message import get_contact_broadcast_task\\n\\n student_key = Mock()\\n student_key.urlsafe.return_value = \\\"STUDENTKEY\\\"\\n\\n event_key = Mock()\\n event_key.urlsafe.return_value = \\\"EVENTKEY\\\"\\n\\n message_key = Mock()\\n message_key.urlsafe.return_value = \\\"MESSAGEKEY\\\"\\n\\n batch_id = \\\"BATCHID\\\"\\n\\n contact = {\\n 'name': 'Johny Jones',\\n 'methods': (\\n {'type': 't', 'value': '1234567890'},\\n {'type': 'e', 'value': 'johny@jones.com'},\\n )\\n }\\n\\n task = get_contact_broadcast_task(\\n event_key, message_key, student_key, contact, batch_id)\\n\\n self.assertIn('STUDENTKEY', task.name)\\n self.assertNotIn('EVENTKEY', task.name)\\n self.assertIn('MESSAGEKEY', task.name)\\n self.assertIn('BATCHID', task.name)\\n self.assertNotIn('johny@jones.com', task.name)\",\n \"def task1():\\n logger.info(\\\"In API3 task1 function\\\")\\n return \\\"task1 success!\\\"\",\n \"def executor(self):\",\n \"def run(self):\\n \\n pass\",\n \"def test_script(self) -> None:\\n main()\",\n \"def RUN(self):\",\n \"def test_task_list():\\n # Fake pyramid request, useful for testing.\\n request = testing.DummyRequest()\\n\\n pytest.fail('Not implemented yet.')\",\n \"def test_let(self):\",\n \"def test_incremental_tasks(self):\\r\\n self.create_2(sched='incremental')\\r\\n\\r\\n # Del previous TaskRuns\\r\\n self.del_task_runs()\\r\\n\\r\\n # Register\\r\\n self.register(fullname=self.user.fullname, name=self.user.username,\\r\\n password=self.user.password)\\r\\n self.register(fullname=\\\"Marie Doe\\\", name=\\\"mariedoe\\\", password=\\\"dr0wss4p\\\")\\r\\n self.signin()\\r\\n\\r\\n # Get the only task with no runs!\\r\\n res = self.app.get('api/app/1/newtask')\\r\\n data = json.loads(res.data)\\r\\n # Check that we received a clean Task\\r\\n assert data.get('info'), data\\r\\n assert not data.get('info').get('last_answer')\\r\\n\\r\\n # Submit an Answer for the assigned task\\r\\n tr = dict(app_id=data['app_id'], task_id=data['id'], info={'answer': 'No'})\\r\\n tr = json.dumps(tr)\\r\\n\\r\\n self.app.post('/api/taskrun', data=tr)\\r\\n # No more tasks available for this user!\\r\\n res = self.app.get('api/app/1/newtask')\\r\\n data = json.loads(res.data)\\r\\n assert not data\\r\\n\\r\\n #### Get the only task now with an answer as Anonimous!\\r\\n self.signout()\\r\\n res = self.app.get('api/app/1/newtask')\\r\\n data = json.loads(res.data)\\r\\n\\r\\n # Check that we received a Task with answer\\r\\n assert data.get('info'), data\\r\\n assert data.get('info').get('last_answer').get('answer') == 'No'\\r\\n\\r\\n # Submit a second Answer as Anonimous\\r\\n tr = dict(app_id=data['app_id'], task_id=data['id'],\\r\\n info={'answer': 'No No'})\\r\\n tr = json.dumps(tr)\\r\\n\\r\\n self.app.post('/api/taskrun', data=tr)\\r\\n\\r\\n #### Get the only task now with an answer as User2!\\r\\n self.signin(email=\\\"mariedoe@example.com\\\", password=\\\"dr0wss4p\\\")\\r\\n res = self.app.get('api/app/1/newtask')\\r\\n data = json.loads(res.data)\\r\\n\\r\\n # Check that we received a Task with answer\\r\\n assert data.get('info'), data\\r\\n assert data.get('info').get('last_answer').get('answer') == 'No No'\",\n \"def test_task_instance(self) -> None:\\n self.assertTrue(isinstance(self.test_task, Tasks))\",\n \"def test_run_ended(self):\",\n \"def _test_run_with_short_error_msg(self, task_class):\\r\\n task_entry = self._create_input_entry()\\r\\n self.define_option_problem(PROBLEM_URL_NAME)\\r\\n expected_message = \\\"x\\\" * 900\\r\\n with self.assertRaises(TestTaskFailure):\\r\\n self._run_task_with_mock_celery(task_class, task_entry.id, task_entry.task_id, expected_message)\\r\\n # compare with entry in table:\\r\\n entry = InstructorTask.objects.get(id=task_entry.id)\\r\\n self.assertEquals(entry.task_state, FAILURE)\\r\\n self.assertGreater(1023, len(entry.task_output))\\r\\n output = json.loads(entry.task_output)\\r\\n self.assertEquals(output['exception'], 'TestTaskFailure')\\r\\n self.assertEquals(output['message'], expected_message)\\r\\n self.assertEquals(output['traceback'][-3:], \\\"...\\\")\",\n \"def main():\\n # get arguments from command line\\n args = parse_arguments()\\n\\n # checks on the output file\\n # if args.stats_only:\\n # assert args.output, \\\"The output file was not provided\\\"\\n if args.output and os.path.exists(args.output):\\n warnings.warn(\\\"Overwriting task file \\\" + args.output, UserWarning)\\n os.remove(args.output)\\n\\n # initialize the task\\n task = Task(\\n args.database, args.on,\\n across=args.across,\\n by=args.by,\\n filters=args.filters,\\n regressors=args.regressors,\\n verbose=args.verbose)\\n\\n if args.stats_only:\\n task.print_stats()\\n else:\\n if args.tempdir and not os.path.exists(args.tempdir):\\n os.makedirs(args.tempdir)\\n\\n # generate triplets and unique pairs\\n task.generate_triplets(\\n output=args.output,\\n threshold=args.threshold,\\n tmpdir=args.tempdir,\\n seed=args.seed)\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7679905","0.75751007","0.74822515","0.74822515","0.7291026","0.7291026","0.7206594","0.71457916","0.71280587","0.71280587","0.6997051","0.6974356","0.69725513","0.69159216","0.6897864","0.6865529","0.6863298","0.6853657","0.6784358","0.6762433","0.67399913","0.668037","0.66757566","0.6655913","0.66301185","0.6604063","0.65461344","0.6527429","0.65266144","0.65266144","0.648968","0.64441675","0.6440949","0.6439382","0.6438722","0.6396196","0.6396196","0.6396196","0.63947797","0.63925105","0.6378464","0.6367615","0.6355678","0.63545525","0.63545376","0.6348739","0.6348462","0.6341642","0.633449","0.631903","0.6318621","0.6318621","0.6318621","0.6318621","0.6318621","0.63154477","0.63087755","0.62828714","0.62633854","0.6247188","0.6244742","0.6233147","0.6232085","0.62306136","0.62116206","0.6207545","0.6201248","0.6200199","0.6189286","0.6189063","0.61785465","0.6177397","0.6163611","0.6151463","0.61450183","0.61403775","0.6137159","0.61328363","0.61314446","0.6128879","0.6128297","0.6128297","0.6124155","0.6118993","0.6116265","0.61136967","0.6110779","0.6109398","0.61068","0.61034024","0.6101792","0.6094802","0.60818094","0.60762703","0.60753775","0.6066011","0.6062757","0.60599256","0.60504395","0.60406214","0.6035153"],"string":"[\n \"0.7679905\",\n \"0.75751007\",\n \"0.74822515\",\n \"0.74822515\",\n \"0.7291026\",\n \"0.7291026\",\n \"0.7206594\",\n \"0.71457916\",\n \"0.71280587\",\n \"0.71280587\",\n \"0.6997051\",\n \"0.6974356\",\n \"0.69725513\",\n \"0.69159216\",\n \"0.6897864\",\n \"0.6865529\",\n \"0.6863298\",\n \"0.6853657\",\n \"0.6784358\",\n \"0.6762433\",\n \"0.67399913\",\n \"0.668037\",\n \"0.66757566\",\n \"0.6655913\",\n \"0.66301185\",\n \"0.6604063\",\n \"0.65461344\",\n \"0.6527429\",\n \"0.65266144\",\n \"0.65266144\",\n \"0.648968\",\n \"0.64441675\",\n \"0.6440949\",\n \"0.6439382\",\n \"0.6438722\",\n \"0.6396196\",\n \"0.6396196\",\n \"0.6396196\",\n \"0.63947797\",\n \"0.63925105\",\n \"0.6378464\",\n \"0.6367615\",\n \"0.6355678\",\n \"0.63545525\",\n \"0.63545376\",\n \"0.6348739\",\n \"0.6348462\",\n \"0.6341642\",\n \"0.633449\",\n \"0.631903\",\n \"0.6318621\",\n \"0.6318621\",\n \"0.6318621\",\n \"0.6318621\",\n \"0.6318621\",\n \"0.63154477\",\n \"0.63087755\",\n \"0.62828714\",\n \"0.62633854\",\n \"0.6247188\",\n \"0.6244742\",\n \"0.6233147\",\n \"0.6232085\",\n \"0.62306136\",\n \"0.62116206\",\n \"0.6207545\",\n \"0.6201248\",\n \"0.6200199\",\n \"0.6189286\",\n \"0.6189063\",\n \"0.61785465\",\n \"0.6177397\",\n \"0.6163611\",\n \"0.6151463\",\n \"0.61450183\",\n \"0.61403775\",\n \"0.6137159\",\n \"0.61328363\",\n \"0.61314446\",\n \"0.6128879\",\n \"0.6128297\",\n \"0.6128297\",\n \"0.6124155\",\n \"0.6118993\",\n \"0.6116265\",\n \"0.61136967\",\n \"0.6110779\",\n \"0.6109398\",\n \"0.61068\",\n \"0.61034024\",\n \"0.6101792\",\n \"0.6094802\",\n \"0.60818094\",\n \"0.60762703\",\n \"0.60753775\",\n \"0.6066011\",\n \"0.6062757\",\n \"0.60599256\",\n \"0.60504395\",\n \"0.60406214\",\n \"0.6035153\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":11396,"cells":{"query":{"kind":"string","value":"Testing base class with validation method for exceptions"},"document":{"kind":"string","value":"def test_task_with_two_int_validation_parameters_validate_exceptions_task559(data, expected_value):\r\n with pytest.raises(expected_value):\r\n algo.TaskWithOneIntValidationParameter.validate_data(data)"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["def test_validation(self):\n self.validationFails()","def test_should_not_be_callable(self):\n with self.assertRaises(NotImplementedError):\n BaseValidator()(\"any-value\")","def test_validate(self):\n pass","def test_validation(self):\r\n\r\n with self.assertRaises(ValidationError):\r\n List().validate({'blake':31, 'something_else':'that'})\r\n\r\n with self.assertRaises(ValidationError):\r\n List().validate('stringy')\r\n\r\n with self.assertRaises(ValidationError):\r\n List().validate(1)","def test_validation(self):\n\n with self.assertRaises(ValidationError):\n List().validate({'blake':31, 'something_else':'that'})\n\n with self.assertRaises(ValidationError):\n List().validate('stringy')\n\n with self.assertRaises(ValidationError):\n List().validate(1)","def test_base_validate_models():\n with pytest.raises(ValueError):\n base_validate_models([])\n\n assert [\"m\"] == base_validate_models([\"m\"])","def test_invalidargumentBaseModel(self):\n with self.assertRaises(NameError) as e:\n b1 = BaseModel(hi)\n self.assertEqual(str(e.exception), \"name 'hi' is not defined\")","def __validate__(self):","def test_class_errored(self, cls, exception):","def test_validation(self):\n\n with self.assertRaises(ValidationError):\n Dictionary().validate([1,2,3])\n\n with self.assertRaises(ValidationError):\n Dictionary().validate('stringy')\n\n with self.assertRaises(ValidationError):\n Dictionary().validate(1)","def test_validation(self):\r\n\r\n with self.assertRaises(ValidationError):\r\n Dictionary().validate([1,2,3])\r\n\r\n with self.assertRaises(ValidationError):\r\n Dictionary().validate('stringy')\r\n\r\n with self.assertRaises(ValidationError):\r\n Dictionary().validate(1)","def Validate(self):\n raise NotImplementedError","def test_validators():","def test_base(self):\n with pytest.raises(AttributeError) as exc:\n Fidelity(\"epoch\", 1, 2, 0)\n assert \"Base should be greater than or equal to 1\" == str(exc.value)","def validate(self, *args, **kwargs):\n raise NotImplementedError('Validate not implemented')","def validate(self):\n raise NotImplementedError()","def test_base_class_expection():\n with pytest.raises(TypeError):\n cardinal.CardinalPoints()","def test_encode_errors(self):\n if self._cls == 'MetaschemaType':\n if self._invalid_validate:\n self.assert_raises(NotImplementedError, self.import_cls.encode,\n self._invalid_validate[0], self.typedef)\n else:\n if self._invalid_validate:\n self.assert_raises((ValueError,\n jsonschema.exceptions.ValidationError),\n self.import_cls.encode,\n self._invalid_validate[0], self.typedef)","def validate(cls, **kwargs: Any) -> None: # pragma no cover","def validate(self):\n raise NotImplementedError","def validate(self):\n raise NotImplementedError","def __validate():\n # TODO: implement","def test_wrong_input(self):\r\n self.assertRaises(Exception, self.validate, (3, 2, 8, 8), (4, 2, 5, 5),\r\n 'valid', input=T.dmatrix())\r\n self.assertRaises(Exception, self.validate, (3, 2, 8, 8), (4, 2, 5, 5),\r\n 'valid', filters=T.dvector())\r\n self.assertRaises(Exception, self.validate, (3, 2, 8, 8), (4, 2, 5, 5),\r\n 'valid', input=T.dtensor3())","def test_exception(self):\n self.assertRaises(TypeError, lambda: self.init_model())","def testValidate_Invalid(self):\n values = {\n messages.IntegerField: \"10\",\n messages.FloatField: \"blah\",\n messages.BooleanField: 0,\n messages.BytesField: 10.20,\n messages.StringField: 42,\n }\n\n def action(field_class):\n # Optional.\n field = field_class(1)\n self.assertRaises(messages.ValidationError,\n field.validate,\n values[field_class])\n\n # Required.\n field = field_class(1, required=True)\n self.assertRaises(messages.ValidationError,\n field.validate,\n values[field_class])\n\n # Repeated.\n field = field_class(1, repeated=True)\n self.assertRaises(messages.ValidationError,\n field.validate,\n [values[field_class]])\n self.assertRaises(messages.ValidationError,\n field.validate,\n (values[field_class],))\n self.ActionOnAllFieldClasses(action)","def test_not_enough_inputs(self):\n n = Node('a')\n with self.assertRaises(ValidationError):\n n.validate()\n n.validate(False)","def test_missing_required_field_raises_error():\n with pytest.raises(ValidationError):\n Entity()","def test_init_invalid_retire_date(self):\n # Whether this raises a ValueError or TypeError is an\n # implementation detail delegated to `datetime`\n with self.assertRaises((ValueError, TypeError)):\n Person(\n self.initial_year, self.name, self.birth_date,\n retirement_date='invalid')","def __validate(self):\n pass","def test_acc(self):\n raise Exception(\" not implemented in base model\")","def _validate(self):\n pass","def check_errors(self):\n raise NotImplementedError(\"Implement it in a subclass.\")","def validate(self):\n ...","def test_custom_validation_exceptions(self):\n expected = {\n \"errors\": [\n {\n \"status\": \"400\",\n \"source\": {\n \"pointer\": \"/data/attributes/email\",\n },\n \"detail\": \"Enter a valid email address.\",\n \"code\": \"invalid\",\n },\n {\n \"id\": \"armageddon101\",\n \"detail\": \"Hey! You need a last name!\",\n \"meta\": \"something\",\n \"source\": {\"pointer\": \"/data/attributes/lastName\"},\n },\n ]\n }\n response = self.client.post(\n \"/identities\",\n {\n \"data\": {\n \"type\": \"users\",\n \"attributes\": {\n \"email\": \"bar\",\n \"last_name\": \"alajflajaljalajlfjafljalj\",\n },\n }\n },\n )\n\n assert expected == response.json()","def test_lt_invalid(self):\n with self.assertRaises(TypeError):\n self.instance < 12","def test_errs(self):\n b1 = BaseModel()\n with self.assertRaises(AttributeError):\n FileStorage.__objects\n FileStorage.__File_path\n\n with self.assertRaises(TypeError):\n models.storage.new()\n models.storage.new(self, b1)\n models.save(b1)\n models.reload(b1)\n models.all(b1)","def test_002_import_exception(self):\n m = schematics_flexible.BaseFlexible(\n {'code': '07',\n 'properties': {\"a\": \"this is test\"}},\n store_handler=get_mock())\n try:\n m.validate()\n except schematicsValidationError:\n pass\n else:\n self.assertTrue(False,\n 'Model must raise exception when import raise')","def test_bad_curie():\n with pytest.raises(ValidationError):\n entity = Entity(id=\"this is not a curie\")","def test_validation(self):\n def test(**invalid_fields):\n with self.assertRaises(AssertionError):\n c = models.Citizen(**{'relatives': [], **invalid_fields})\n\n # Must throw errors in every case\n test(citizen_id=-1, )\n test(apartment='WRONG-STRING')\n test(town='', )\n test(street='', )\n test(building='', )\n test(name=None, )\n test(birth_date='WRONG-STRING')\n test(birth_date='31.02.2019')\n test(relatives=['a'])","def test_base_opt_validate():\n opt = scheme._BaseOpt()\n with pytest.raises(NotImplementedError):\n opt.validate('foo', 'test-data')","def test_error_expression(self):\n error_expression = expression.InvalidExpression(\"an error message\")\n # All three of \"penalty_expression\", \"constraint_expression\" and\n # \"extra_constraints\" should raise.\n with self.assertRaises(RuntimeError):\n _ = error_expression.penalty_expression\n with self.assertRaises(RuntimeError):\n _ = error_expression.constraint_expression\n with self.assertRaises(RuntimeError):\n _ = error_expression.extra_constraints","def test_trestle_validation_error() -> None:\n msg = 'Custom validation error'\n try:\n raise TrestleValidationError(msg)\n except TrestleValidationError as err:\n assert str(err) == msg\n assert err.msg == msg","def test_constructor_wrong_options(self):\n with self.assertRaises(TypeError):\n base = BaseExporter(something_else=6)","def test_call_invalid_input(self):\r\n with self.assertRaises(ValueError):\r\n self.estimator1(42, confidence_level=0)","def validate(self):","def validate(self):","def test_foo(self):\n foo = Foo(value=1)\n with self.assertRaises(TypeError):\n foo.foo()","def test_from_object_fail(self):\n class InvalidClass(object):\n pass\n Invalid_object = InvalidClass()\n with self.assertRaises(TypeError):\n BaseDataClass.from_object(Invalid_object)","def test_minimal_validation(self, asset_class: Type[_PandasDataAsset]):\n with pytest.raises(pydantic.ValidationError) as exc_info:\n asset_class( # type: ignore[call-arg]\n name=\"test\",\n invalid_keyword_arg=\"bad\",\n )\n\n errors_dict = exc_info.value.errors()\n assert {\n \"loc\": (\"invalid_keyword_arg\",),\n \"msg\": \"extra fields not permitted\",\n \"type\": \"value_error.extra\",\n } == errors_dict[ # the extra keyword error will always be the last error\n -1 # we don't care about any other errors for this test\n ]","def test_init_invalid_birth_date(self):\n # Whether this raises a ValueError or TypeError is an\n # implementation detail delegated to `datetime`\n with self.assertRaises((ValueError, TypeError)):\n Person(\n self.initial_year, self.name, 'invalid',\n retirement_date=self.retirement_date)","def Invalid(\r\n self, s: str = \"\", e: Type[BaseException] = None, fail: bool = False\r\n) -> None:\r\n ...","def check_validity(self):","def __call__(self, *args, **kwargs):\n if isinstance(self._exp, type) and issubclass(self._exp, Exception):\n with pytest.raises(self._exp):\n self._f(*args, **kwargs)\n else:\n assert self._exp == self._f(*args, **kwargs)","def test_04_one_args(self):\n with self.assertRaises(TypeError) as x:\n r = Rectangle(7)\n self.assertEqual(\"__init__() missing 1 required positional argument:\\\n 'height'\", str(x.exception))","def test_create_valiation(self):\n with self.assertRaises(ValidationError) as test:\n contact = Contact.objects.create(email='3232131')\n contact.full_clean()\n the_exception = dict(test.exception)\n self.assertEqual(the_exception['name'], ['This field cannot be blank.'])\n self.assertEqual(the_exception['email'], ['Enter a valid email address.'])","def test_base_exception(self) -> None:\n with pytest.raises(BaseException) as e:\n 1 / 0\n assert isinstance(e.value, ZeroDivisionError)","def test_with_invalid_input(self):\n for dataset_type in ['ruler', 'pencil', 'cheese']:\n with self.assertRaises(ValueError) as exc:\n check_dataset_type(dataset_type)\n self.assertEqual(\"Dataset type not 'regular' or 'raw' is %s\" % dataset_type,\n str(exc.exception))","def test_property_invalid(self):\n\n self.assertRaises(DataObjectError,\n setattr(self, \"foobar\", \"some value\")\n )","def test_001_validate_with_bad_properties(self):\n m = schematics_flexible.BaseFlexible(\n {'code': '06',\n 'properties': {\"a\": \"this is test\"}},\n store_handler=get_mock())\n try:\n m.validate()\n except schematicsValidationError:\n pass\n else:\n self.assertTrue(False,\n 'Model must raise exception when validate raise')","def test_new_invalid(self) -> None:\n with pytest.raises(TypeError) as excinfo:\n RunwayTestDefinition({}) # type: ignore\n assert str(excinfo.value).startswith(\"expected data of type\")","def test_get_other_typeerror_2(self):\n v = versions.Version(name='foo', version='1.2.3')\n self.assertRaises(TypeError, v._get_other, '1')","def test_members_are_set_when_args_are_invalid(self):\n\n self.assertRaises(ValueError, Vec3, \"abc\", 6, \"q\")","def testinvalidability(self):\n self.assertRaises(AbilityError, AmuletAbility, 'Invalid')\n self.assertRaises(AbilityError, AmuletAbility, '')","def test_error(cls, err, data):\n do_error_test(cls, err, data)","def validate(self):\n pass","def validate(self):\n pass","def validate(self):\n pass","def validate(self):\n pass","def validate(self):\n pass","def validate(self):\n pass","def validate(self):\n pass","def validate(self):\n pass","def test_domain_validator(self):\n id_stud = 1\n nume_stud = \"Mircea Augustin\"\n stud = Student(id_stud,nume_stud)\n self.assertEqual(stud.get_id_stud(),id_stud)\n self.assertEqual(stud.get_nume_stud(),nume_stud)\n self.assertEqual(str(stud),\"1 | Mircea Augustin\")\n stud2 = Student(id_stud,\"Horatiu Murdar\")\n self.assertEqual(stud,stud2)\n \"\"\"\n test validator student\n \"\"\"\n validStud = ValidatorStudent()\n stud = Student(1,\"Caine Rau\")\n validStud.valideaza_stud(stud)\n stud2 = Student(-1,\"\")\n self.assertRaisesRegex(ValidError,\"Id student invalid!Nume student invalid!\",validStud.valideaza_stud,stud2)\n \"\"\"\n test domeniu pt disc\n \"\"\"\n id_disc = 1\n nume_disc = \"Analiza\"\n nume_prof = \"Berinde Stefan\"\n disc = Disciplina(id_disc,nume_disc,nume_prof)\n self.assertEqual(disc.get_id_disc(),id_disc)\n self.assertEqual(disc.get_nume_disc(),nume_disc)\n self.assertEqual(disc.get_nume_prof(),nume_prof)\n self.assertEqual(str(disc),\"1 | Analiza | Berinde Stefan\")\n disc2 = Disciplina(id_disc,\"Logica\",\"Pop\")\n self.assertEqual(disc,disc2)\n \"\"\"\n test validare disc\n \"\"\"\n validDisc = ValidatorDisciplina()\n id_disc = 1\n nume_disc = \"Analiza\"\n nume_prof = \"Berinde Stefan\"\n disc = Disciplina(id_disc,nume_disc,nume_prof)\n validDisc.valideaza_disc(disc)\n disc_gresit = Disciplina(-1,\"\",\"\")\n self.assertRaisesRegex(ValidError,\"Id disciplina invalid!Nume disciplina invalid!Nume profesor invalid!\",validDisc.valideaza_disc,disc_gresit)\n \"\"\"\n test domeniu pt note\n \"\"\"\n id_nota = 0\n id_stud = 3\n nume_stud = \"Mircea Augustin\"\n stud = Student(id_stud,nume_stud)\n id_disc = 2\n nume_disc = \"Analiza\"\n nume_prof = \"Berinde Stefan\"\n disc = Disciplina(id_disc,nume_disc,nume_prof)\n val_nota = 9.5\n nota = Nota(id_nota,stud,disc,val_nota)\n self.assertEqual(nota.get_id_nota(),id_nota)\n self.assertEqual(nota.get_stud(),stud)\n self.assertEqual(nota.get_disc(),disc)\n self.assertEqual(nota.get_val_nota(),val_nota)\n nota2 = Nota(id_nota,Student(0,\"a\"),Disciplina(0,\"a\",\"a\"),5.4)\n self.assertEqual(nota,nota2)\n \"\"\"\n test validare pt note - BlackBox\n \"\"\"\n validNota = ValidatorNota()\n stud = Student(0,\"a\")\n disc = Disciplina(0,\"a\",\"a\")\n validNota.valideaza_nota(Nota(3,Student(3,\"Chef Scarlatescu\"),Disciplina(2,\"Analiza\",\"Berinde Stefan\"),5.4))\n validNota.valideaza_nota(Nota(0,Student(-1,\"a\"),Disciplina(0,\"\",\"a\"),1))\n validNota.valideaza_nota(Nota(0,stud,disc,10))\n self.assertRaisesRegex(ValidError,\"Id nota invalid! Valoare nota invalida!\",validNota.valideaza_nota, Nota(-1,stud,disc,0.9) )\n self.assertRaisesRegex(ValidError,\"Id nota invalid! Valoare nota invalida!\",validNota.valideaza_nota, Nota(-50,stud,disc,0) )\n self.assertRaisesRegex(ValidError,\"Valoare nota invalida!\",validNota.valideaza_nota, Nota(0,stud,disc,-1) )\n self.assertRaisesRegex(ValidError,\"Valoare nota invalida!\",validNota.valideaza_nota, Nota(0,stud,disc,10.1) )\n self.assertRaisesRegex(ValidError,\"Valoare nota invalida!\",validNota.valideaza_nota, Nota(0,stud,disc,50) )","def test_to_python_method_validation_errors(self):\n field = DecimalFractionField()\n with self.assertRaises(ValidationError):\n field.clean(\"abcd\")\n\n with self.assertRaises(ValidationError):\n field.clean(\"1 1 1/3\")\n\n with self.assertRaises(ValidationError):\n field.clean(\"1 1\")","def test_validate_input_bad_input(self):\r\n self.assertRaises(ValueError, _validate_input,\r\n None, None, None, None, None)\r\n self.assertRaises(ValueError, _validate_input,\r\n self.dist_matrix_header, self.dist_matrix,\r\n self.mapping_header, self.mapping, None)\r\n self.assertRaises(ValueError, _validate_input,\r\n self.dist_matrix_header, 12,\r\n self.mapping_header, self.mapping, None)\r\n self.assertRaises(ValueError, _validate_input,\r\n self.dist_matrix_header, self.dist_matrix,\r\n self.mapping_header, self.mapping, 42)\r\n self.assertRaises(ValueError, _validate_input,\r\n self.dist_matrix_header, self.dist_matrix,\r\n self.mapping_header, self.mapping, \"aeiou\")","def test_11_None_input(self):\n with self.assertRaises(TypeError) as x:\n r = Rectangle(None)\n self.assertEqual(\"__init__() missing 1 required positional argument:\\\n 'height'\", str(x.exception))","def test_value_init17(self):\n with self.assertRaises(TypeError) as err:\n r1 = Rectangle(1, 2, 3, \"hi\")\n msg = \"y must be an integer\"\n self.assertEqual(str(err.exception), msg)","def test_raising_exceptions(self):\n with self.assertRaises(TypeError):\n r = Rectangle(10, \"2\")\n with self.assertRaises(TypeError):\n r = Rectangle(10, 2.1)\n with self.assertRaises(TypeError):\n r = Rectangle(10, True, \"\")\n with self.assertRaises(TypeError):\n r = Rectangle(10, 10, 1.25)\n with self.assertRaises(TypeError):\n r = Rectangle(10, 10, \" \", True, False)\n with self.assertRaises(TypeError):\n r = Rectangle(10, None)\n with self.assertRaises(TypeError):\n r = Rectangle(\"2\", 10, 1, 1, \"str\")\n with self.assertRaises(TypeError):\n r = Rectangle(2.1, 10, 1, 1.5, 1)\n with self.assertRaises(TypeError):\n r = Rectangle(True, 10, 5, \"\", 10)\n with self.assertRaises(TypeError):\n r = Rectangle(False, 10)\n with self.assertRaises(ValueError):\n r = Rectangle(10, 0)\n with self.assertRaises(ValueError):\n r = Rectangle(0, 10)\n with self.assertRaises(ValueError):\n r = Rectangle(10, -1)\n with self.assertRaises(ValueError):\n r = Rectangle(-1, 10)\n with self.assertRaises(ValueError):\n r = Rectangle(0, 0)\n with self.assertRaises(ValueError):\n r = Rectangle(-1, -1)\n with self.assertRaises(ValueError):\n r = Rectangle(10, 5, 1, -1)\n with self.assertRaises(ValueError):\n r = Rectangle(10, 6, -2, 1)\n with self.assertRaises(ValueError):\n r = Rectangle(2, 2, -5, -5)\n with self.assertRaises(ValueError):\n r = Rectangle(10, 1, -1, 1, 1)\n with self.assertRaises(ValueError):\n r = Rectangle(10, 4, 1, -1, 10)\n with self.assertRaises(TypeError):\n r = Rectangle()\n with self.assertRaises(TypeError):\n r = Rectangle(10)\n with self.assertRaises(TypeError):\n r = Rectangle(10, 5, 1, 1, 1, 5)","def validate(self, data):\n raise NotImplementedError(\"Inherit this class and override this method.\")","def test_invalid_version_fields(self):\n self.assertRaises(ValueError, versions.Version, version='1234', name='foo')","def test_that_field_required_validations_are_triggered_on_incorrect_attribute_setting(\n self,\n ):\n person = Person(first_name=\"Johnny\", last_name=\"John\")\n\n with pytest.raises(ValidationError) as error:\n person.first_name = \"\" # Simulate an error by force-resetting an attribute\n\n assert error.value.messages == {\"first_name\": [\"is required\"]}","def test_invalid_instantiation(invalid_instance):\n with pytest.raises(ValueError):\n invalid_instance()","def test_get_other_typeerror(self):\n v = versions.Version(name='foo', version='1.2.3')\n self.assertRaises(TypeError, v._get_other, 3.4)","def __init__(self, message=\"\"):\n super(ValidationError, self).__init__(message)","def test_fails(self):\n raise FoolishError(\"I am a broken test\")","def test_other(self):\n self.assertRaises(ValueError, isStringTrue, \"dog\")\n return","def test_constructor_bad_value(self):\n self.assertRaises(line_format_errors.InputLineError,\n lambda: D1Line(self.bad_line))","def test_12_No_args(self):\n with self.assertRaises(TypeError) as x:\n r = Rectangle()\n self.assertEqual(\"__init__() missing 2 required positional\\\n arguments: 'width' and 'height'\", str(x.exception))","def _check_validity(self):\n pass","def validate_result(self):\n raise NotImplementedError","def test_raises_when_init_has_superset_of_args(self):\n\n with pytest.raises(exceptions.APIImplementationError) as exc_info:\n\n class API(platform.PlatformAPI):\n def __init__(self, base_url, token, org_name, user, other):\n pass\n\n assert \"other\" in str(exc_info.value)","def test_exceptions(self):\n\n with self.assertRaises(TypeError, msg=\"size must be an integer\"):\n Square(6.5)\n with self.assertRaises(TypeError, msg=\"size must be an integer\"):\n Square(False)\n with self.assertRaises(TypeError, msg=\"size must be an integer\"):\n Square(6j)\n with self.assertRaises(TypeError, msg=\"size must be an integer\"):\n Square([4, 1])\n with self.assertRaises(TypeError, msg=\"size must be an integer\"):\n Square({\"Milk\": 1})\n with self.assertRaises(TypeError, msg=\"size must be an integer\"):\n Square((3, 9))\n with self.assertRaises(TypeError, msg=\"x must be an integer\"):\n Square(2, 3.5, 4)\n with self.assertRaises(TypeError, msg=\"x must be an integer\"):\n Square(2, True, 4)\n with self.assertRaises(TypeError, msg=\"x must be an integer\"):\n Square(2, 3j, 4)\n with self.assertRaises(TypeError, msg=\"x must be an integer\"):\n Square(2, \"3\", 4)\n with self.assertRaises(TypeError, msg=\"x must be an integer\"):\n Square(2, [3], 4)\n with self.assertRaises(TypeError, msg=\"x must be an integer\"):\n Square(2, {\"My\": 3}, 4)\n with self.assertRaises(TypeError, msg=\"x must be an integer\"):\n Square(2, (3, 3), 4)\n with self.assertRaises(TypeError, msg=\"y must be an integer\"):\n Square(2, 3, 4.2)\n with self.assertRaises(TypeError, msg=\"y must be an integer\"):\n Square(2, 3, False)\n with self.assertRaises(TypeError, msg=\"y must be an integer\"):\n Square(2, 3, 4j)\n with self.assertRaises(TypeError, msg=\"y must be an integer\"):\n Square(2, 3, \"4\")\n with self.assertRaises(TypeError, msg=\"y must be an integer\"):\n Square(2, 3, [4])\n with self.assertRaises(TypeError, msg=\"y must be an integer\"):\n Square(2, 3, {\"its\": 4})\n with self.assertRaises(TypeError, msg=\"y must be an integer\"):\n Square(2, 3, (4, 4))\n with self.assertRaises(ValueError, msg=\"size must be > 0\"):\n Square(0)\n with self.assertRaises(ValueError, msg=\"size must be > 0\"):\n Square(-2)\n with self.assertRaises(ValueError, msg=\"x must be >= 0\"):\n Square(1, -8, 9)\n with self.assertRaises(ValueError, msg=\"y must be >= 0\"):\n Square(1, 8, -9)","def test04(self):\n self.assertRaises(TypeError, robustApply, oneArgument, \"this\", blah=\"that\")","def testinvalidsize(self):\n self.assertRaises(AbilityError, AttributeAbility, size=0)\n self.assertRaises(AbilityError, AttributeAbility, size=6)","def test_value_init15(self):\n with self.assertRaises(ValueError) as err:\n r1 = Rectangle(0, 0)\n msg = \"width must be > 0\"\n self.assertEqual(str(err.exception), msg)","def test_value_init6(self):\n with self.assertRaises(TypeError) as err:\n r1 = Rectangle(10, \"hi\")\n msg = \"height must be an integer\"\n self.assertEqual(str(err.exception), msg)","def test_validate_on_invalid_data_type(self):\n args = (self.bytes_a, 'invalid')\n self.assertRaises(TypeError, objects.OpaqueObject, *args)","def testinvalidattribute(self):\n self.assertRaises(AbilityError, AttributeAbility, 'Invalid')\n self.assertRaises(AbilityError, AttributeAbility, '', 3)","def test_value_init12(self):\n with self.assertRaises(ValueError) as err:\n r1 = Rectangle(10, 1, 17, -9)\n msg = \"y must be >= 0\"\n self.assertEqual(str(err.exception), msg)","def _assert_validation_error( # type: ignore[override]\n self, expected_error_substring: str\n ) -> None:\n with self.assertRaisesRegex(\n utils.ValidationError, expected_error_substring):\n self.collection.validate()","def test_value_init7(self):\n with self.assertRaises(ValueError) as err:\n r1 = Rectangle(-4, 5)\n msg = \"width must be > 0\"\n self.assertEqual(str(err.exception), msg)"],"string":"[\n \"def test_validation(self):\\n self.validationFails()\",\n \"def test_should_not_be_callable(self):\\n with self.assertRaises(NotImplementedError):\\n BaseValidator()(\\\"any-value\\\")\",\n \"def test_validate(self):\\n pass\",\n \"def test_validation(self):\\r\\n\\r\\n with self.assertRaises(ValidationError):\\r\\n List().validate({'blake':31, 'something_else':'that'})\\r\\n\\r\\n with self.assertRaises(ValidationError):\\r\\n List().validate('stringy')\\r\\n\\r\\n with self.assertRaises(ValidationError):\\r\\n List().validate(1)\",\n \"def test_validation(self):\\n\\n with self.assertRaises(ValidationError):\\n List().validate({'blake':31, 'something_else':'that'})\\n\\n with self.assertRaises(ValidationError):\\n List().validate('stringy')\\n\\n with self.assertRaises(ValidationError):\\n List().validate(1)\",\n \"def test_base_validate_models():\\n with pytest.raises(ValueError):\\n base_validate_models([])\\n\\n assert [\\\"m\\\"] == base_validate_models([\\\"m\\\"])\",\n \"def test_invalidargumentBaseModel(self):\\n with self.assertRaises(NameError) as e:\\n b1 = BaseModel(hi)\\n self.assertEqual(str(e.exception), \\\"name 'hi' is not defined\\\")\",\n \"def __validate__(self):\",\n \"def test_class_errored(self, cls, exception):\",\n \"def test_validation(self):\\n\\n with self.assertRaises(ValidationError):\\n Dictionary().validate([1,2,3])\\n\\n with self.assertRaises(ValidationError):\\n Dictionary().validate('stringy')\\n\\n with self.assertRaises(ValidationError):\\n Dictionary().validate(1)\",\n \"def test_validation(self):\\r\\n\\r\\n with self.assertRaises(ValidationError):\\r\\n Dictionary().validate([1,2,3])\\r\\n\\r\\n with self.assertRaises(ValidationError):\\r\\n Dictionary().validate('stringy')\\r\\n\\r\\n with self.assertRaises(ValidationError):\\r\\n Dictionary().validate(1)\",\n \"def Validate(self):\\n raise NotImplementedError\",\n \"def test_validators():\",\n \"def test_base(self):\\n with pytest.raises(AttributeError) as exc:\\n Fidelity(\\\"epoch\\\", 1, 2, 0)\\n assert \\\"Base should be greater than or equal to 1\\\" == str(exc.value)\",\n \"def validate(self, *args, **kwargs):\\n raise NotImplementedError('Validate not implemented')\",\n \"def validate(self):\\n raise NotImplementedError()\",\n \"def test_base_class_expection():\\n with pytest.raises(TypeError):\\n cardinal.CardinalPoints()\",\n \"def test_encode_errors(self):\\n if self._cls == 'MetaschemaType':\\n if self._invalid_validate:\\n self.assert_raises(NotImplementedError, self.import_cls.encode,\\n self._invalid_validate[0], self.typedef)\\n else:\\n if self._invalid_validate:\\n self.assert_raises((ValueError,\\n jsonschema.exceptions.ValidationError),\\n self.import_cls.encode,\\n self._invalid_validate[0], self.typedef)\",\n \"def validate(cls, **kwargs: Any) -> None: # pragma no cover\",\n \"def validate(self):\\n raise NotImplementedError\",\n \"def validate(self):\\n raise NotImplementedError\",\n \"def __validate():\\n # TODO: implement\",\n \"def test_wrong_input(self):\\r\\n self.assertRaises(Exception, self.validate, (3, 2, 8, 8), (4, 2, 5, 5),\\r\\n 'valid', input=T.dmatrix())\\r\\n self.assertRaises(Exception, self.validate, (3, 2, 8, 8), (4, 2, 5, 5),\\r\\n 'valid', filters=T.dvector())\\r\\n self.assertRaises(Exception, self.validate, (3, 2, 8, 8), (4, 2, 5, 5),\\r\\n 'valid', input=T.dtensor3())\",\n \"def test_exception(self):\\n self.assertRaises(TypeError, lambda: self.init_model())\",\n \"def testValidate_Invalid(self):\\n values = {\\n messages.IntegerField: \\\"10\\\",\\n messages.FloatField: \\\"blah\\\",\\n messages.BooleanField: 0,\\n messages.BytesField: 10.20,\\n messages.StringField: 42,\\n }\\n\\n def action(field_class):\\n # Optional.\\n field = field_class(1)\\n self.assertRaises(messages.ValidationError,\\n field.validate,\\n values[field_class])\\n\\n # Required.\\n field = field_class(1, required=True)\\n self.assertRaises(messages.ValidationError,\\n field.validate,\\n values[field_class])\\n\\n # Repeated.\\n field = field_class(1, repeated=True)\\n self.assertRaises(messages.ValidationError,\\n field.validate,\\n [values[field_class]])\\n self.assertRaises(messages.ValidationError,\\n field.validate,\\n (values[field_class],))\\n self.ActionOnAllFieldClasses(action)\",\n \"def test_not_enough_inputs(self):\\n n = Node('a')\\n with self.assertRaises(ValidationError):\\n n.validate()\\n n.validate(False)\",\n \"def test_missing_required_field_raises_error():\\n with pytest.raises(ValidationError):\\n Entity()\",\n \"def test_init_invalid_retire_date(self):\\n # Whether this raises a ValueError or TypeError is an\\n # implementation detail delegated to `datetime`\\n with self.assertRaises((ValueError, TypeError)):\\n Person(\\n self.initial_year, self.name, self.birth_date,\\n retirement_date='invalid')\",\n \"def __validate(self):\\n pass\",\n \"def test_acc(self):\\n raise Exception(\\\" not implemented in base model\\\")\",\n \"def _validate(self):\\n pass\",\n \"def check_errors(self):\\n raise NotImplementedError(\\\"Implement it in a subclass.\\\")\",\n \"def validate(self):\\n ...\",\n \"def test_custom_validation_exceptions(self):\\n expected = {\\n \\\"errors\\\": [\\n {\\n \\\"status\\\": \\\"400\\\",\\n \\\"source\\\": {\\n \\\"pointer\\\": \\\"/data/attributes/email\\\",\\n },\\n \\\"detail\\\": \\\"Enter a valid email address.\\\",\\n \\\"code\\\": \\\"invalid\\\",\\n },\\n {\\n \\\"id\\\": \\\"armageddon101\\\",\\n \\\"detail\\\": \\\"Hey! You need a last name!\\\",\\n \\\"meta\\\": \\\"something\\\",\\n \\\"source\\\": {\\\"pointer\\\": \\\"/data/attributes/lastName\\\"},\\n },\\n ]\\n }\\n response = self.client.post(\\n \\\"/identities\\\",\\n {\\n \\\"data\\\": {\\n \\\"type\\\": \\\"users\\\",\\n \\\"attributes\\\": {\\n \\\"email\\\": \\\"bar\\\",\\n \\\"last_name\\\": \\\"alajflajaljalajlfjafljalj\\\",\\n },\\n }\\n },\\n )\\n\\n assert expected == response.json()\",\n \"def test_lt_invalid(self):\\n with self.assertRaises(TypeError):\\n self.instance < 12\",\n \"def test_errs(self):\\n b1 = BaseModel()\\n with self.assertRaises(AttributeError):\\n FileStorage.__objects\\n FileStorage.__File_path\\n\\n with self.assertRaises(TypeError):\\n models.storage.new()\\n models.storage.new(self, b1)\\n models.save(b1)\\n models.reload(b1)\\n models.all(b1)\",\n \"def test_002_import_exception(self):\\n m = schematics_flexible.BaseFlexible(\\n {'code': '07',\\n 'properties': {\\\"a\\\": \\\"this is test\\\"}},\\n store_handler=get_mock())\\n try:\\n m.validate()\\n except schematicsValidationError:\\n pass\\n else:\\n self.assertTrue(False,\\n 'Model must raise exception when import raise')\",\n \"def test_bad_curie():\\n with pytest.raises(ValidationError):\\n entity = Entity(id=\\\"this is not a curie\\\")\",\n \"def test_validation(self):\\n def test(**invalid_fields):\\n with self.assertRaises(AssertionError):\\n c = models.Citizen(**{'relatives': [], **invalid_fields})\\n\\n # Must throw errors in every case\\n test(citizen_id=-1, )\\n test(apartment='WRONG-STRING')\\n test(town='', )\\n test(street='', )\\n test(building='', )\\n test(name=None, )\\n test(birth_date='WRONG-STRING')\\n test(birth_date='31.02.2019')\\n test(relatives=['a'])\",\n \"def test_base_opt_validate():\\n opt = scheme._BaseOpt()\\n with pytest.raises(NotImplementedError):\\n opt.validate('foo', 'test-data')\",\n \"def test_error_expression(self):\\n error_expression = expression.InvalidExpression(\\\"an error message\\\")\\n # All three of \\\"penalty_expression\\\", \\\"constraint_expression\\\" and\\n # \\\"extra_constraints\\\" should raise.\\n with self.assertRaises(RuntimeError):\\n _ = error_expression.penalty_expression\\n with self.assertRaises(RuntimeError):\\n _ = error_expression.constraint_expression\\n with self.assertRaises(RuntimeError):\\n _ = error_expression.extra_constraints\",\n \"def test_trestle_validation_error() -> None:\\n msg = 'Custom validation error'\\n try:\\n raise TrestleValidationError(msg)\\n except TrestleValidationError as err:\\n assert str(err) == msg\\n assert err.msg == msg\",\n \"def test_constructor_wrong_options(self):\\n with self.assertRaises(TypeError):\\n base = BaseExporter(something_else=6)\",\n \"def test_call_invalid_input(self):\\r\\n with self.assertRaises(ValueError):\\r\\n self.estimator1(42, confidence_level=0)\",\n \"def validate(self):\",\n \"def validate(self):\",\n \"def test_foo(self):\\n foo = Foo(value=1)\\n with self.assertRaises(TypeError):\\n foo.foo()\",\n \"def test_from_object_fail(self):\\n class InvalidClass(object):\\n pass\\n Invalid_object = InvalidClass()\\n with self.assertRaises(TypeError):\\n BaseDataClass.from_object(Invalid_object)\",\n \"def test_minimal_validation(self, asset_class: Type[_PandasDataAsset]):\\n with pytest.raises(pydantic.ValidationError) as exc_info:\\n asset_class( # type: ignore[call-arg]\\n name=\\\"test\\\",\\n invalid_keyword_arg=\\\"bad\\\",\\n )\\n\\n errors_dict = exc_info.value.errors()\\n assert {\\n \\\"loc\\\": (\\\"invalid_keyword_arg\\\",),\\n \\\"msg\\\": \\\"extra fields not permitted\\\",\\n \\\"type\\\": \\\"value_error.extra\\\",\\n } == errors_dict[ # the extra keyword error will always be the last error\\n -1 # we don't care about any other errors for this test\\n ]\",\n \"def test_init_invalid_birth_date(self):\\n # Whether this raises a ValueError or TypeError is an\\n # implementation detail delegated to `datetime`\\n with self.assertRaises((ValueError, TypeError)):\\n Person(\\n self.initial_year, self.name, 'invalid',\\n retirement_date=self.retirement_date)\",\n \"def Invalid(\\r\\n self, s: str = \\\"\\\", e: Type[BaseException] = None, fail: bool = False\\r\\n) -> None:\\r\\n ...\",\n \"def check_validity(self):\",\n \"def __call__(self, *args, **kwargs):\\n if isinstance(self._exp, type) and issubclass(self._exp, Exception):\\n with pytest.raises(self._exp):\\n self._f(*args, **kwargs)\\n else:\\n assert self._exp == self._f(*args, **kwargs)\",\n \"def test_04_one_args(self):\\n with self.assertRaises(TypeError) as x:\\n r = Rectangle(7)\\n self.assertEqual(\\\"__init__() missing 1 required positional argument:\\\\\\n 'height'\\\", str(x.exception))\",\n \"def test_create_valiation(self):\\n with self.assertRaises(ValidationError) as test:\\n contact = Contact.objects.create(email='3232131')\\n contact.full_clean()\\n the_exception = dict(test.exception)\\n self.assertEqual(the_exception['name'], ['This field cannot be blank.'])\\n self.assertEqual(the_exception['email'], ['Enter a valid email address.'])\",\n \"def test_base_exception(self) -> None:\\n with pytest.raises(BaseException) as e:\\n 1 / 0\\n assert isinstance(e.value, ZeroDivisionError)\",\n \"def test_with_invalid_input(self):\\n for dataset_type in ['ruler', 'pencil', 'cheese']:\\n with self.assertRaises(ValueError) as exc:\\n check_dataset_type(dataset_type)\\n self.assertEqual(\\\"Dataset type not 'regular' or 'raw' is %s\\\" % dataset_type,\\n str(exc.exception))\",\n \"def test_property_invalid(self):\\n\\n self.assertRaises(DataObjectError,\\n setattr(self, \\\"foobar\\\", \\\"some value\\\")\\n )\",\n \"def test_001_validate_with_bad_properties(self):\\n m = schematics_flexible.BaseFlexible(\\n {'code': '06',\\n 'properties': {\\\"a\\\": \\\"this is test\\\"}},\\n store_handler=get_mock())\\n try:\\n m.validate()\\n except schematicsValidationError:\\n pass\\n else:\\n self.assertTrue(False,\\n 'Model must raise exception when validate raise')\",\n \"def test_new_invalid(self) -> None:\\n with pytest.raises(TypeError) as excinfo:\\n RunwayTestDefinition({}) # type: ignore\\n assert str(excinfo.value).startswith(\\\"expected data of type\\\")\",\n \"def test_get_other_typeerror_2(self):\\n v = versions.Version(name='foo', version='1.2.3')\\n self.assertRaises(TypeError, v._get_other, '1')\",\n \"def test_members_are_set_when_args_are_invalid(self):\\n\\n self.assertRaises(ValueError, Vec3, \\\"abc\\\", 6, \\\"q\\\")\",\n \"def testinvalidability(self):\\n self.assertRaises(AbilityError, AmuletAbility, 'Invalid')\\n self.assertRaises(AbilityError, AmuletAbility, '')\",\n \"def test_error(cls, err, data):\\n do_error_test(cls, err, data)\",\n \"def validate(self):\\n pass\",\n \"def validate(self):\\n pass\",\n \"def validate(self):\\n pass\",\n \"def validate(self):\\n pass\",\n \"def validate(self):\\n pass\",\n \"def validate(self):\\n pass\",\n \"def validate(self):\\n pass\",\n \"def validate(self):\\n pass\",\n \"def test_domain_validator(self):\\n id_stud = 1\\n nume_stud = \\\"Mircea Augustin\\\"\\n stud = Student(id_stud,nume_stud)\\n self.assertEqual(stud.get_id_stud(),id_stud)\\n self.assertEqual(stud.get_nume_stud(),nume_stud)\\n self.assertEqual(str(stud),\\\"1 | Mircea Augustin\\\")\\n stud2 = Student(id_stud,\\\"Horatiu Murdar\\\")\\n self.assertEqual(stud,stud2)\\n \\\"\\\"\\\"\\n test validator student\\n \\\"\\\"\\\"\\n validStud = ValidatorStudent()\\n stud = Student(1,\\\"Caine Rau\\\")\\n validStud.valideaza_stud(stud)\\n stud2 = Student(-1,\\\"\\\")\\n self.assertRaisesRegex(ValidError,\\\"Id student invalid!Nume student invalid!\\\",validStud.valideaza_stud,stud2)\\n \\\"\\\"\\\"\\n test domeniu pt disc\\n \\\"\\\"\\\"\\n id_disc = 1\\n nume_disc = \\\"Analiza\\\"\\n nume_prof = \\\"Berinde Stefan\\\"\\n disc = Disciplina(id_disc,nume_disc,nume_prof)\\n self.assertEqual(disc.get_id_disc(),id_disc)\\n self.assertEqual(disc.get_nume_disc(),nume_disc)\\n self.assertEqual(disc.get_nume_prof(),nume_prof)\\n self.assertEqual(str(disc),\\\"1 | Analiza | Berinde Stefan\\\")\\n disc2 = Disciplina(id_disc,\\\"Logica\\\",\\\"Pop\\\")\\n self.assertEqual(disc,disc2)\\n \\\"\\\"\\\"\\n test validare disc\\n \\\"\\\"\\\"\\n validDisc = ValidatorDisciplina()\\n id_disc = 1\\n nume_disc = \\\"Analiza\\\"\\n nume_prof = \\\"Berinde Stefan\\\"\\n disc = Disciplina(id_disc,nume_disc,nume_prof)\\n validDisc.valideaza_disc(disc)\\n disc_gresit = Disciplina(-1,\\\"\\\",\\\"\\\")\\n self.assertRaisesRegex(ValidError,\\\"Id disciplina invalid!Nume disciplina invalid!Nume profesor invalid!\\\",validDisc.valideaza_disc,disc_gresit)\\n \\\"\\\"\\\"\\n test domeniu pt note\\n \\\"\\\"\\\"\\n id_nota = 0\\n id_stud = 3\\n nume_stud = \\\"Mircea Augustin\\\"\\n stud = Student(id_stud,nume_stud)\\n id_disc = 2\\n nume_disc = \\\"Analiza\\\"\\n nume_prof = \\\"Berinde Stefan\\\"\\n disc = Disciplina(id_disc,nume_disc,nume_prof)\\n val_nota = 9.5\\n nota = Nota(id_nota,stud,disc,val_nota)\\n self.assertEqual(nota.get_id_nota(),id_nota)\\n self.assertEqual(nota.get_stud(),stud)\\n self.assertEqual(nota.get_disc(),disc)\\n self.assertEqual(nota.get_val_nota(),val_nota)\\n nota2 = Nota(id_nota,Student(0,\\\"a\\\"),Disciplina(0,\\\"a\\\",\\\"a\\\"),5.4)\\n self.assertEqual(nota,nota2)\\n \\\"\\\"\\\"\\n test validare pt note - BlackBox\\n \\\"\\\"\\\"\\n validNota = ValidatorNota()\\n stud = Student(0,\\\"a\\\")\\n disc = Disciplina(0,\\\"a\\\",\\\"a\\\")\\n validNota.valideaza_nota(Nota(3,Student(3,\\\"Chef Scarlatescu\\\"),Disciplina(2,\\\"Analiza\\\",\\\"Berinde Stefan\\\"),5.4))\\n validNota.valideaza_nota(Nota(0,Student(-1,\\\"a\\\"),Disciplina(0,\\\"\\\",\\\"a\\\"),1))\\n validNota.valideaza_nota(Nota(0,stud,disc,10))\\n self.assertRaisesRegex(ValidError,\\\"Id nota invalid! Valoare nota invalida!\\\",validNota.valideaza_nota, Nota(-1,stud,disc,0.9) )\\n self.assertRaisesRegex(ValidError,\\\"Id nota invalid! Valoare nota invalida!\\\",validNota.valideaza_nota, Nota(-50,stud,disc,0) )\\n self.assertRaisesRegex(ValidError,\\\"Valoare nota invalida!\\\",validNota.valideaza_nota, Nota(0,stud,disc,-1) )\\n self.assertRaisesRegex(ValidError,\\\"Valoare nota invalida!\\\",validNota.valideaza_nota, Nota(0,stud,disc,10.1) )\\n self.assertRaisesRegex(ValidError,\\\"Valoare nota invalida!\\\",validNota.valideaza_nota, Nota(0,stud,disc,50) )\",\n \"def test_to_python_method_validation_errors(self):\\n field = DecimalFractionField()\\n with self.assertRaises(ValidationError):\\n field.clean(\\\"abcd\\\")\\n\\n with self.assertRaises(ValidationError):\\n field.clean(\\\"1 1 1/3\\\")\\n\\n with self.assertRaises(ValidationError):\\n field.clean(\\\"1 1\\\")\",\n \"def test_validate_input_bad_input(self):\\r\\n self.assertRaises(ValueError, _validate_input,\\r\\n None, None, None, None, None)\\r\\n self.assertRaises(ValueError, _validate_input,\\r\\n self.dist_matrix_header, self.dist_matrix,\\r\\n self.mapping_header, self.mapping, None)\\r\\n self.assertRaises(ValueError, _validate_input,\\r\\n self.dist_matrix_header, 12,\\r\\n self.mapping_header, self.mapping, None)\\r\\n self.assertRaises(ValueError, _validate_input,\\r\\n self.dist_matrix_header, self.dist_matrix,\\r\\n self.mapping_header, self.mapping, 42)\\r\\n self.assertRaises(ValueError, _validate_input,\\r\\n self.dist_matrix_header, self.dist_matrix,\\r\\n self.mapping_header, self.mapping, \\\"aeiou\\\")\",\n \"def test_11_None_input(self):\\n with self.assertRaises(TypeError) as x:\\n r = Rectangle(None)\\n self.assertEqual(\\\"__init__() missing 1 required positional argument:\\\\\\n 'height'\\\", str(x.exception))\",\n \"def test_value_init17(self):\\n with self.assertRaises(TypeError) as err:\\n r1 = Rectangle(1, 2, 3, \\\"hi\\\")\\n msg = \\\"y must be an integer\\\"\\n self.assertEqual(str(err.exception), msg)\",\n \"def test_raising_exceptions(self):\\n with self.assertRaises(TypeError):\\n r = Rectangle(10, \\\"2\\\")\\n with self.assertRaises(TypeError):\\n r = Rectangle(10, 2.1)\\n with self.assertRaises(TypeError):\\n r = Rectangle(10, True, \\\"\\\")\\n with self.assertRaises(TypeError):\\n r = Rectangle(10, 10, 1.25)\\n with self.assertRaises(TypeError):\\n r = Rectangle(10, 10, \\\" \\\", True, False)\\n with self.assertRaises(TypeError):\\n r = Rectangle(10, None)\\n with self.assertRaises(TypeError):\\n r = Rectangle(\\\"2\\\", 10, 1, 1, \\\"str\\\")\\n with self.assertRaises(TypeError):\\n r = Rectangle(2.1, 10, 1, 1.5, 1)\\n with self.assertRaises(TypeError):\\n r = Rectangle(True, 10, 5, \\\"\\\", 10)\\n with self.assertRaises(TypeError):\\n r = Rectangle(False, 10)\\n with self.assertRaises(ValueError):\\n r = Rectangle(10, 0)\\n with self.assertRaises(ValueError):\\n r = Rectangle(0, 10)\\n with self.assertRaises(ValueError):\\n r = Rectangle(10, -1)\\n with self.assertRaises(ValueError):\\n r = Rectangle(-1, 10)\\n with self.assertRaises(ValueError):\\n r = Rectangle(0, 0)\\n with self.assertRaises(ValueError):\\n r = Rectangle(-1, -1)\\n with self.assertRaises(ValueError):\\n r = Rectangle(10, 5, 1, -1)\\n with self.assertRaises(ValueError):\\n r = Rectangle(10, 6, -2, 1)\\n with self.assertRaises(ValueError):\\n r = Rectangle(2, 2, -5, -5)\\n with self.assertRaises(ValueError):\\n r = Rectangle(10, 1, -1, 1, 1)\\n with self.assertRaises(ValueError):\\n r = Rectangle(10, 4, 1, -1, 10)\\n with self.assertRaises(TypeError):\\n r = Rectangle()\\n with self.assertRaises(TypeError):\\n r = Rectangle(10)\\n with self.assertRaises(TypeError):\\n r = Rectangle(10, 5, 1, 1, 1, 5)\",\n \"def validate(self, data):\\n raise NotImplementedError(\\\"Inherit this class and override this method.\\\")\",\n \"def test_invalid_version_fields(self):\\n self.assertRaises(ValueError, versions.Version, version='1234', name='foo')\",\n \"def test_that_field_required_validations_are_triggered_on_incorrect_attribute_setting(\\n self,\\n ):\\n person = Person(first_name=\\\"Johnny\\\", last_name=\\\"John\\\")\\n\\n with pytest.raises(ValidationError) as error:\\n person.first_name = \\\"\\\" # Simulate an error by force-resetting an attribute\\n\\n assert error.value.messages == {\\\"first_name\\\": [\\\"is required\\\"]}\",\n \"def test_invalid_instantiation(invalid_instance):\\n with pytest.raises(ValueError):\\n invalid_instance()\",\n \"def test_get_other_typeerror(self):\\n v = versions.Version(name='foo', version='1.2.3')\\n self.assertRaises(TypeError, v._get_other, 3.4)\",\n \"def __init__(self, message=\\\"\\\"):\\n super(ValidationError, self).__init__(message)\",\n \"def test_fails(self):\\n raise FoolishError(\\\"I am a broken test\\\")\",\n \"def test_other(self):\\n self.assertRaises(ValueError, isStringTrue, \\\"dog\\\")\\n return\",\n \"def test_constructor_bad_value(self):\\n self.assertRaises(line_format_errors.InputLineError,\\n lambda: D1Line(self.bad_line))\",\n \"def test_12_No_args(self):\\n with self.assertRaises(TypeError) as x:\\n r = Rectangle()\\n self.assertEqual(\\\"__init__() missing 2 required positional\\\\\\n arguments: 'width' and 'height'\\\", str(x.exception))\",\n \"def _check_validity(self):\\n pass\",\n \"def validate_result(self):\\n raise NotImplementedError\",\n \"def test_raises_when_init_has_superset_of_args(self):\\n\\n with pytest.raises(exceptions.APIImplementationError) as exc_info:\\n\\n class API(platform.PlatformAPI):\\n def __init__(self, base_url, token, org_name, user, other):\\n pass\\n\\n assert \\\"other\\\" in str(exc_info.value)\",\n \"def test_exceptions(self):\\n\\n with self.assertRaises(TypeError, msg=\\\"size must be an integer\\\"):\\n Square(6.5)\\n with self.assertRaises(TypeError, msg=\\\"size must be an integer\\\"):\\n Square(False)\\n with self.assertRaises(TypeError, msg=\\\"size must be an integer\\\"):\\n Square(6j)\\n with self.assertRaises(TypeError, msg=\\\"size must be an integer\\\"):\\n Square([4, 1])\\n with self.assertRaises(TypeError, msg=\\\"size must be an integer\\\"):\\n Square({\\\"Milk\\\": 1})\\n with self.assertRaises(TypeError, msg=\\\"size must be an integer\\\"):\\n Square((3, 9))\\n with self.assertRaises(TypeError, msg=\\\"x must be an integer\\\"):\\n Square(2, 3.5, 4)\\n with self.assertRaises(TypeError, msg=\\\"x must be an integer\\\"):\\n Square(2, True, 4)\\n with self.assertRaises(TypeError, msg=\\\"x must be an integer\\\"):\\n Square(2, 3j, 4)\\n with self.assertRaises(TypeError, msg=\\\"x must be an integer\\\"):\\n Square(2, \\\"3\\\", 4)\\n with self.assertRaises(TypeError, msg=\\\"x must be an integer\\\"):\\n Square(2, [3], 4)\\n with self.assertRaises(TypeError, msg=\\\"x must be an integer\\\"):\\n Square(2, {\\\"My\\\": 3}, 4)\\n with self.assertRaises(TypeError, msg=\\\"x must be an integer\\\"):\\n Square(2, (3, 3), 4)\\n with self.assertRaises(TypeError, msg=\\\"y must be an integer\\\"):\\n Square(2, 3, 4.2)\\n with self.assertRaises(TypeError, msg=\\\"y must be an integer\\\"):\\n Square(2, 3, False)\\n with self.assertRaises(TypeError, msg=\\\"y must be an integer\\\"):\\n Square(2, 3, 4j)\\n with self.assertRaises(TypeError, msg=\\\"y must be an integer\\\"):\\n Square(2, 3, \\\"4\\\")\\n with self.assertRaises(TypeError, msg=\\\"y must be an integer\\\"):\\n Square(2, 3, [4])\\n with self.assertRaises(TypeError, msg=\\\"y must be an integer\\\"):\\n Square(2, 3, {\\\"its\\\": 4})\\n with self.assertRaises(TypeError, msg=\\\"y must be an integer\\\"):\\n Square(2, 3, (4, 4))\\n with self.assertRaises(ValueError, msg=\\\"size must be > 0\\\"):\\n Square(0)\\n with self.assertRaises(ValueError, msg=\\\"size must be > 0\\\"):\\n Square(-2)\\n with self.assertRaises(ValueError, msg=\\\"x must be >= 0\\\"):\\n Square(1, -8, 9)\\n with self.assertRaises(ValueError, msg=\\\"y must be >= 0\\\"):\\n Square(1, 8, -9)\",\n \"def test04(self):\\n self.assertRaises(TypeError, robustApply, oneArgument, \\\"this\\\", blah=\\\"that\\\")\",\n \"def testinvalidsize(self):\\n self.assertRaises(AbilityError, AttributeAbility, size=0)\\n self.assertRaises(AbilityError, AttributeAbility, size=6)\",\n \"def test_value_init15(self):\\n with self.assertRaises(ValueError) as err:\\n r1 = Rectangle(0, 0)\\n msg = \\\"width must be > 0\\\"\\n self.assertEqual(str(err.exception), msg)\",\n \"def test_value_init6(self):\\n with self.assertRaises(TypeError) as err:\\n r1 = Rectangle(10, \\\"hi\\\")\\n msg = \\\"height must be an integer\\\"\\n self.assertEqual(str(err.exception), msg)\",\n \"def test_validate_on_invalid_data_type(self):\\n args = (self.bytes_a, 'invalid')\\n self.assertRaises(TypeError, objects.OpaqueObject, *args)\",\n \"def testinvalidattribute(self):\\n self.assertRaises(AbilityError, AttributeAbility, 'Invalid')\\n self.assertRaises(AbilityError, AttributeAbility, '', 3)\",\n \"def test_value_init12(self):\\n with self.assertRaises(ValueError) as err:\\n r1 = Rectangle(10, 1, 17, -9)\\n msg = \\\"y must be >= 0\\\"\\n self.assertEqual(str(err.exception), msg)\",\n \"def _assert_validation_error( # type: ignore[override]\\n self, expected_error_substring: str\\n ) -> None:\\n with self.assertRaisesRegex(\\n utils.ValidationError, expected_error_substring):\\n self.collection.validate()\",\n \"def test_value_init7(self):\\n with self.assertRaises(ValueError) as err:\\n r1 = Rectangle(-4, 5)\\n msg = \\\"width must be > 0\\\"\\n self.assertEqual(str(err.exception), msg)\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7366222","0.7237699","0.721509","0.7119311","0.7103784","0.70534474","0.7048264","0.6987562","0.6925039","0.6916672","0.6913254","0.6906676","0.68661255","0.68530154","0.68451655","0.68323594","0.68066764","0.6797967","0.6775788","0.67419225","0.67419225","0.6733247","0.6730697","0.6722662","0.6720216","0.66907567","0.66765404","0.66692656","0.66607714","0.66484046","0.66277206","0.66106933","0.66102284","0.6610196","0.6574951","0.65748227","0.6573513","0.65668887","0.65658957","0.65610874","0.6560925","0.65522444","0.6548679","0.6546936","0.65366346","0.65366346","0.6511592","0.6503953","0.6497619","0.648453","0.648115","0.6480178","0.6478114","0.646288","0.64555466","0.64552873","0.64551","0.6454287","0.6431127","0.6424193","0.6419743","0.6415004","0.6403812","0.6392456","0.63774633","0.63774633","0.63774633","0.63774633","0.63774633","0.63774633","0.63774633","0.63774633","0.63729966","0.6372462","0.6369305","0.6366909","0.6362629","0.6362034","0.63610125","0.6359107","0.63479984","0.63417596","0.6334898","0.63311476","0.6325517","0.6325169","0.6318713","0.63160026","0.63065916","0.63025564","0.63011307","0.6300085","0.62991714","0.6297665","0.62970793","0.6296993","0.6292317","0.62906206","0.6289713","0.6288218","0.62811404"],"string":"[\n \"0.7366222\",\n \"0.7237699\",\n \"0.721509\",\n \"0.7119311\",\n \"0.7103784\",\n \"0.70534474\",\n \"0.7048264\",\n \"0.6987562\",\n \"0.6925039\",\n \"0.6916672\",\n \"0.6913254\",\n \"0.6906676\",\n \"0.68661255\",\n \"0.68530154\",\n \"0.68451655\",\n \"0.68323594\",\n \"0.68066764\",\n \"0.6797967\",\n \"0.6775788\",\n \"0.67419225\",\n \"0.67419225\",\n \"0.6733247\",\n \"0.6730697\",\n \"0.6722662\",\n \"0.6720216\",\n \"0.66907567\",\n \"0.66765404\",\n \"0.66692656\",\n \"0.66607714\",\n \"0.66484046\",\n \"0.66277206\",\n \"0.66106933\",\n \"0.66102284\",\n \"0.6610196\",\n \"0.6574951\",\n \"0.65748227\",\n \"0.6573513\",\n \"0.65668887\",\n \"0.65658957\",\n \"0.65610874\",\n \"0.6560925\",\n \"0.65522444\",\n \"0.6548679\",\n \"0.6546936\",\n \"0.65366346\",\n \"0.65366346\",\n \"0.6511592\",\n \"0.6503953\",\n \"0.6497619\",\n \"0.648453\",\n \"0.648115\",\n \"0.6480178\",\n \"0.6478114\",\n \"0.646288\",\n \"0.64555466\",\n \"0.64552873\",\n \"0.64551\",\n \"0.6454287\",\n \"0.6431127\",\n \"0.6424193\",\n \"0.6419743\",\n \"0.6415004\",\n \"0.6403812\",\n \"0.6392456\",\n \"0.63774633\",\n \"0.63774633\",\n \"0.63774633\",\n \"0.63774633\",\n \"0.63774633\",\n \"0.63774633\",\n \"0.63774633\",\n \"0.63774633\",\n \"0.63729966\",\n \"0.6372462\",\n \"0.6369305\",\n \"0.6366909\",\n \"0.6362629\",\n \"0.6362034\",\n \"0.63610125\",\n \"0.6359107\",\n \"0.63479984\",\n \"0.63417596\",\n \"0.6334898\",\n \"0.63311476\",\n \"0.6325517\",\n \"0.6325169\",\n \"0.6318713\",\n \"0.63160026\",\n \"0.63065916\",\n \"0.63025564\",\n \"0.63011307\",\n \"0.6300085\",\n \"0.62991714\",\n \"0.6297665\",\n \"0.62970793\",\n \"0.6296993\",\n \"0.6292317\",\n \"0.62906206\",\n \"0.6289713\",\n \"0.6288218\",\n \"0.62811404\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":11397,"cells":{"query":{"kind":"string","value":"Testing eratosthenes function in task 559"},"document":{"kind":"string","value":"def test_task559_eratosthenes(number, expected_value):\r\n assert algo.Task559.eratosthenes(number) == expected_value"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["def eratosthenes(x):\n multiples = []\n for i in range(2, x+1):\n if i not in multiples:\n print (i)\n for j in range(i*i, x+1, i):\n multiples.append(j)","def main():\n doctest.testmod()\n print(eratosthenes(2))","def eratosthenes2(n):\n multiples = set()\n for i in range(2, n+1):\n if i not in multiples:\n yield i\n multiples.update(range(i*i, n+1, i))","def eratosthenes_np(limit):\n if isinstance(limit, (int, float)):\n limit = int(limit)\n else:\n raise ValueError\n mask = np.ones(limit+1, dtype=np.bool)\n mask[:2] = False\n for i in range(2, int(np.sqrt(limit))+1):\n if mask[i]:\n mask[i*i::i] = False\n return np.nonzero(mask)[0]","def eratosthenes_npo(limit):\n if isinstance(limit, (int, float)):\n limit = int(limit)\n else:\n raise ValueError\n mask = np.ones(limit//2, dtype=np.bool)\n for i in range(3, int(limit**0.5)+1, 2):\n if mask[i//2]:\n mask[i*i//2::i] = False\n return np.r_[2, 2*np.nonzero(mask)[0][1::]+1]","def eratosthenes(limit):\n if isinstance(limit, (int, float)) and limit == int(limit):\n limit = int(limit)\n else:\n raise ValueError\n primes = []\n mask = [1]*(limit+1)\n for i in range(2, limit+1):\n if mask[i]:\n primes.append(i)\n for j in range(i*i, limit+1, i):\n mask[j] = 0\n return np.asarray(primes)","def eratosthenes_mem(limit):\n if isinstance(limit, (int, float)) and limit == int(limit):\n limit = int(limit)\n else:\n raise ValueError\n primes = [2]\n multiples = [2]\n limit += 1\n for candidate in range(3, limit):\n if candidate not in multiples:\n primes.append(candidate)\n multiples.append(2*candidate)\n for i, m in enumerate(multiples):\n if m <= candidate:\n multiples[i] += primes[i]\n return np.asarray(primes)","def gen_eratosthenes():\n n=3\n yield 2\n while True:\n count = 2 #set count to 2 because if count=1; all numbers are divisible by 1, so it is not a case we need to check\n this = True\n while count < n/2 + 1: #set to n/2 + 1 so that the amount of times iterated is minimized.\n if n%count == 0: #i.e. if n is divisble by count, then n is not prime\n count = n #ends this loop; if n is not prime, there is no reason to continue the loop\n this = False\n count += 1\n if this == True: #i.e. if this == True, then we know that the while loop was completely executed and n has no divisors except 1 and n\n yield n #yield n since it went through the entire loop without finding divisors\n n += 1 #increment n to see if n+1 is prime. will continue incrimenting until another prime is found and yields it","def seive_of_eratosthenes(n):\n sieve = [ True for i in range(n+1) ]\n def markOff(pv):\n for i in range(pv+pv, n+1, pv):\n sieve[i] = False\n markOff(2)\n for i in range(3, n+1):\n if sieve[i]:\n markOff(i)\n return [ i for i in range(2, n+1) if sieve[i] ]","def EratosthenesSieve(N):\n numbers = [True] * (N+1)\n max_p = int(math.sqrt(N))\n for p in (i for i in range(2, max_p+1) if numbers[i]):\n for q in range(p*p, N+1, p):\n numbers[q] = False\n return [i for i in range(2, N+1) if numbers[i]]","def EratosthenesSieve(N):\n numbers = [True] * (N + 1)\n max_p = int(math.sqrt(N))\n for p in (i for i in range(2, max_p + 1) if numbers[i]):\n for q in range(p * p, N + 1, p):\n numbers[q] = False\n return [i for i in range(2, N + 1) if numbers[i]]","def test_15(self):\n\t self.assertTrue(prime_generator(15), [2, 3, 5, 7, 11, 13])","def eratosthenes(n):\n assert n>1 #asserting n be a positive integer\n prime_list = []\n for i in range(2,n+1): #fills prime_list with all integers 2 <= i <= n\n prime_list.append(i)\n multiple = 2 #set to 2 because if set to 1 it will remove all elements from the list\n while multiple <= n/multiple:\n count = 2 #set to 2 because if set to 1 it will remove the prime itself from the list\n while count <= n/multiple:\n if count*multiple in prime_list: #checks if count*multiple is in list. needed because it could have already been removed\n prime_list.remove(count*multiple) #removes count*multiple\n count = count + 1\n multiple = multiple + 1\n #print(prime_list) #for testing only\n return prime_list","def sieve_of_eratosthenes(n):\n res = [2]\n i = 3\n marked = set()\n while i <= n**.5:\n if i not in marked:\n res.append(i)\n j = 0\n while j <= n/i:\n marked.add(i + j*i)\n j += 1\n i += 2\n while i <= n:\n if i not in marked:\n res.append(i)\n i += 2\n return res","def gen_prime():\n\n n = 100\n if n == 2:\n return [2]\n elif n < 2:\n return []\n s = range(3, n + 1, 2)\n mroot = n ** 0.5\n half = (n + 1) / 2 - 1\n i = 0\n m = 3\n while m <= mroot:\n if s[i]:\n j = (m * m - 3) / 2\n s[j] = 0\n while j < half:\n s[j] = 0\n j += m\n i = i + 1\n m = 2 * i + 3\n primes = [2] + [x for x in s if x]\n return (primes[random.randint(1, len(primes) - 1)])","def es_primo(n):\n \n for i in range(2, n):\n if n % i == 0:\n return False\n return True","def eratosthenes(upperbound: int) -> list:\n if upperbound < 0 or type(upperbound) != int:\n raise ValueError(\"The value is not valid. The upperbound should be a positive integer.\")\n numbers = list(range(2, upperbound + 1)) # create a list between 0 and the upperbound inclusive\n counter = 0 # begin the counter at 2 as 1 and zero are not prime numbers\n while numbers[counter] < upperbound ** (1/2): # loop thru numbers until it reaches the square root of upperbound\n numbers = remove_multiples(numbers, numbers[counter]) # update numbers by removing multiples of current number\n counter += 1 # move on to the next number to check\n return numbers","def solution(n: int = 2000000) -> int:\n\n return sum(takewhile(lambda x: x < n, prime_generator()))","def test_prime_12(self):\n\t self.assertTrue(prime_generator(12), [2, 3, 5, 7, 11])","def eratosthenes_sieve(n):\r\n\tnumbers = [True for i in range(n + 1)]\r\n\t\r\n\tp = 2\r\n\twhile (p**2 <= n):\r\n\t\tif numbers[p]:\r\n\t\t\tfor i in range(p**2, n + 1, p):\r\n\t\t\t\tnumbers[i] = False\r\n\t\tp += 1\r\n\t\t\r\n\tprimes = compress(range(2, n + 1),numbers[2:])\r\n\treturn list(primes)","def main() -> int:\n\n a = None\n for n, g in enumerate(gen_primes(100000, 1000000)):\n repeat, indices = check_if_has_3_repeated_digits(str(g))\n if repeat:\n a = check_for_family_of_primes(repeat, indices, list(str(g)))\n if len(a) > 7 and min(a) > 100000:\n EULER_LOGGER.debug(f\"{a}\")\n a = min([int(i) for i in a])\n break\n\n return a","def test_rand_func2(self):\n for i in range(0, 100000):\n num = random.randint(0, 32535143990)\n func2_comp(num)","def primes(m):\n if m <= 2:\n return ()\n sieve = [True] * m\n for i in sixn(m):\n if sieve[i]:\n yield i\n for mult in range(i * i, m, i):\n sieve[mult] = False","def esprimo(n):\n toret = False\n if x == 2:\n toret = True\n elif x % 2 == 0:\n toret = False\n else:\n for i in range(3, x, 2):\n if x % i == 0:\n break\n else:\n toret = True\n # Se ejecuta cuando no se rompe el bucle\n\n return toret","def test_prime_10(self):\n\t self.assertTrue(prime_generator(10), [2, 3, 5, 7])","def primfact(e):\n for n in range(2, e):\n for x in range(2, n):\n if n % x == 0:\n break\n else:\n print n,","def test_stress(self):\n primorial100 = 4711930799906184953162487834760260422020574773409675520188634839616415335845034221205289256705544681972439104097777157991804380284218315038719444943990492579030720635990538452312528339864352999310398481791730017201031090\n for i in range(10000):\n self.assertEqual(primorial(100), primorial100)","def primes():\n yield 2\n candidate = 3\n while True:\n for i in range(3, int(sqrt(candidate)) + 1, 2):\n if (candidate % i) == 0:\n break\n else:\n yield candidate\n candidate += 2","def primes():\n yield 2\n candidate = 3\n while True:\n for i in range(3, int(sqrt(candidate)) + 1, 2):\n if (candidate % i) == 0:\n break\n else:\n yield candidate\n candidate += 2","def rand_prime(k=10): \n i = random.randint(2**(k-2),2**(k-1))\n i,l=2*i+1,0\n while True:\n j = 3\n l +=1\n while i%j!=0:\n j += 1\n if i == j:\n return i\n #return i,len(bin(i)[2:]),l\n i += 2","def monte_carlo_trials(nb_trials, nb_ok, lock):\n\n # First perform the trials\n # Do not use shared resource because other processes doesn't need to know\n # about computation step\n nb_in_quarter_results = 0\n for i in range(nb_trials):\n x = random.uniform(0, 1)\n y = random.uniform(0, 1)\n if x * x + y * y <= 1.0:\n nb_in_quarter_results += 1\n\n # Finally update shared resource\n # Do it only once, then processes doesn't struggle with each other to\n # update it\n with lock:\n nb_ok.value += nb_in_quarter_results","def gen_primes():\n\n n = 1\n while True:\n while not isPrime(n):\n n += 1\n\n yield n\n n += 1","def task3(nums):\n if len(nums) < 2:\n return nums\n pivot = random.choice(nums)\n l_nums = [n for n in nums if n < pivot]\n e_nums = [pivot] * nums.count(pivot)\n r_nums = [n for n in nums if n > pivot]\n return task3(l_nums) + e_nums + task3(r_nums)","def primes():\n yield 2\n found_primes = [2]\n a = 3\n while True:\n for p in found_primes:\n if p**2 > a:\n found_primes.append(a)\n yield a\n a += 2\n break\n elif a % p == 0:\n a += 2\n break","def problem077():\n\n cond = lambda n: num_prime_sum_ways(n) > 5000\n ans = next(filter(cond, itertools.count(2)))\n return ans","def gen_primes():\n\tyield 2\n\tyield 3\n\tprime_list = [2, 3]\n\twhile 1:\n\t\tnext = prime_list[-1] + 2\n\t\ti = 0\n\t\twhile i < len(prime_list):\n\t\t\tif next%prime_list[i] == 0:\n\t\t\t\tnext+=2\n\t\t\t\ti=0\n\t\t\telse:\n\t\t\t\ti+=1\n\t\tprime_list.append(next)\n\t\tyield next","def primes():\n yield 2\n found = []\n for i in itertools.count(start=3, step=2):\n for p in found:\n if i % p == 0:\n break\n else:\n yield i\n found.append(i)","def main(n=20):\n return functools.reduce(lcm, range(1, 20))","def test_prime_2(self):\n\t self.assertTrue(prime_generator(2), [2])","def isPrime(n, s=50):\n from random import randrange\n for x in primes:\n if x < n:\n if n % x == 0:\n return False\n for j in range(1, s + 1):\n a = randrange(1, n)\n if witness(a, n):\n return False\n return True","def sieve_of_eratosthenes(n: int) -> List[int]:\n\n prime = [True for i in range(n+1)] #initiate array named prime with all value True, ie everynumber [0,n] are prime\n p = 2\n while (p * p <= n):\n # If prime[p] is not\n # changed, then it is a prime\n if (prime[p] == True): #if any number is prime then its multiple must be composite\n # Update all multiples of p to be not prime \n for i in range(p * p, n+1, p):\n prime[i] = False\n p += 1\n\n\n '''\n till here the status of code is:\n 0:prime\n 1:prime\n 2:prime\n 3:prime\n 5:prime\n 7:prime\n 11:prime\n .\n .\n .\n\n But 0 and 1 are not prime, so we will have to count numbers from 2\n '''\n\n return [i for i, p in enumerate(prime[2:], 2) if p]","def sim_alternating():\n catches = 0\n for _ in range(100000):\n j = np.random.uniform()*1000\n # j = np.random.exponential(500)\n t_i = 0\n i = 0\n while t_i < j+100:\n if i % 2 == 0:\n t_i += 10\n else:\n t_i += 20\n if j < t_i and t_i < j+1:\n catches += 1\n i += 1\n print(catches/100000)","def test_12():\n assert primes(12) == [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61]","def twentyone():\r\n \r\n notamicable = []\r\n isamicable = []\r\n \r\n for i in range(10000):\r\n if i not in notamicable and i not in isamicable:\r\n a = i\r\n b = amicable(findDivisors(a))\r\n c = amicable(findDivisors(b))\r\n if a == c and not a == b:\r\n isamicable.append(a)\r\n isamicable.append(b)\r\n else:\r\n notamicable.append(a)\r\n notamicable.append(b)\r\n \r\n print isamicable\r\n t = 0\r\n for v in isamicable:\r\n t += v\r\n return t","def primes():\n yield 1\n primes = []\n for n in itertools.count(2):\n if not any(n % p == 0 for p in primes):\n # No divisor found among previous primes\n yield n\n primes.append(n)","def primos(x):\n def esprimo(n):\n \"\"\"\n Determines whether a natural number is a prime number\n :param n: Agiven natural number\n :return: True if prime, False otherwise\n \"\"\"\n toret = False\n if x == 2:\n toret = True\n elif x % 2 == 0:\n toret = False\n else:\n for i in range(3, x, 2):\n if x % i == 0:\n break\n else:\n toret = True\n # Se ejecuta cuando no se rompe el bucle\n\n return toret\n\n toret = []\n for i in range(0, x):\n if esprimo(i):\n toret.append(i)\n\n return toret","def trial_div(n: int) -> bool:\n if n == 1:\n return False\n i = 2\n while i**2 <= n:\n if n % i == 0:\n return False\n i += 1\n return True","def prime():\n number = random.randint(1, 100)\n if len(primfacs(number)) == 1:\n return number, 'yes'\n return number, 'no'","def isprime(n):\n if n!=int(n):\n return False\n n=int(n)\n #Miller-Rabin test for prime\n if n==0 or n==1 or n==4 or n==6 or n==8 or n==9:\n return False\n\n if n==2 or n==3 or n==5 or n==7:\n return True\n s = 0\n d = n-1\n while d%2==0:\n d>>=1\n s+=1\n assert(2**s * d == n-1)\n\n def trial_composite(a):\n if pow(a, d, n) == 1:\n return False\n for i in range(s):\n if pow(a, 2**i * d, n) == n-1:\n return False\n return True\n\n for i in range(8):#number of trials\n a = random.randrange(2, n)\n if trial_composite(a):\n return False\n\n return True","def quick_test():\n if PERIOD < 2:\n return False\n if SIZE % PERIOD != 0:\n return False\n return True","def gen_primes(N):\n primes = set()\n for n in range(2, N):\n if all(n % p > 0 for p in primes):\n primes.add(n)\n yield n","def genPrimes(n):\n assert n>1\n p = gen_eratosthenes()\n prime_list = []\n prime_list.append(next(p))\n while n > prime_list[len(prime_list)-1]: #while input is less than the last term in the prime list\n prime_list.append(next(p)) #adds next term from generator\n if n < prime_list[len(prime_list)-1]: #deletes last term\n del prime_list[len(prime_list)-1]\n #print(prime_list) #for testing only\n return prime_list","def findPrime(n, other=1):\n from random import randrange\n beg = 1\n beg <<= n\n end = beg << 1\n f = False\n while (not f) or x == other:\n x = randrange(beg, end)\n f = isPrime(x)\n return x","def eratosthenes_sieve(iterable):\n iterable_set = set(iterable)\n mx = max(iterable)\n lst = [ x for x in range(2, mx)]\n for num in lst:\n tmp = 2\n while tmp < mx:\n iterable_set.discard(num * tmp)\n tmp += 1\n return iterable_set","def sieve(upper=10**5):\n nums = [True] * (upper + 1)\n nums[0] = False\n nums[1] = False\n for i in range(2, upper + 1):\n if not nums[i]: continue\n for j in range(i * 2, upper + 1, i):\n nums[j] = False\n return nums","def test_primes_under_1000000(self):\n self.assertEqual(len(sieve(100)), 25)\n self.assertEqual(len(sieve(1000)), 168)\n self.assertEqual(len(sieve(10000)), 1229)\n self.assertEqual(len(sieve(100000)), 9592)\n self.assertEqual(len(sieve(1000000)), 78498)","def primes(n):\n sieve = [True]*n\n for p in range(2, n):\n if sieve[p]:\n yield p\n for i in range(p*p, n, p):\n sieve[i] = False","def primes(count):\n\n prime_nums = [2]\n prime = 3\n\n for i in range(1, count):\n\n while prime not in [3, 5, 7] and (\n prime % 3 == 0 or prime % 5 == 0 or prime % 7 == 0\n ):\n prime += 2\n\n prime_nums.append(prime)\n prime += 2\n\n return prime_nums","def sieve(n):\n\n results = [1 for _ in range(n+1)]\n results[0], results[1] = 0, 0\n results = [0,0] + [1]*(n - 1)\n len(results)\n div = 2\n\n for i,num in enumerate(results):\n if num:\n k = i * 2\n while k <= n:\n seive[k] = 0\n k+= i\n return [x for (x,y) in enumerate(results) if y]\n\n while div <= n // 2 + 1:\n for i in range(div * div, n+1, div):\n if results[i] == 0:\n continue\n else:\n results[i] = 0\n div += 1\n\n #return sum(results)\n return [i for i in range(len(results)) if results[i] == 1]","def func(args):\n l, r, n = args\n import random\n\n return sum([random.randint(l, r) for _ in range(n)]) / n","def is_prime(n, k=10):\n if n == 2 or n == 3:\n return True\n if not n & 1 or n < 2:\n return False\n m = n - 1\n s = 1\n d = m >> 1\n while not d & 1:\n s += 1\n d >>= 1\n for i in range(k):\n a = randint(2, n - 2)\n x = expmod(a, d, n)\n if x == 1 or x == n - 1:\n continue\n for r in range(1, s):\n x = x * x % n\n if x == 1:\n return False\n if x == n - 1:\n break\n else:\n return False\n return True","def primes(n):\n\tsieve = [True] * n\n\tyield 2\n\tfor i in xrange(3,int(n**0.5)+1,2):\n\t\tif sieve[i]:\n\t\t\tyield i\n\t\t\tsieve[i*i::2*i] = [False]*((n-i*i-1)/(2*i)+1)\n\tfor i in xrange(i+2,n,2):\n\t\tif sieve[i]: yield i","def sieveOfEra():\n D = {}\n yield 2\n for q in itertools.islice(itertools.count(3), 0, None, 2):\n p = D.pop(q, None)\n if p is None:\n D[q*q] = q\n yield q\n else:\n x = p + q\n while x in D or not (x&1):\n x += p \n D[x] = p","def generate():\n j = [2]\n i = 3\n while i:\n if is_prime(i):\n j.append(i)\n yield [j, j[-1]]\n i += 2","def test_never_same():\n g = RG.larger_random()\n hundred_calls = set([next(g) for _ in range(20)])\n assert len(hundred_calls) == 20","def test_handcrafted_examples(self):\n for i in range(1000):\n self.assertEqual(perfectd(0), True)\n self.assertEqual(prime(0), False)\n self.assertEqual(prime(2), True)\n self.assertEqual(prime(7), True)\n self.assertEqual(prime(15), False)\n self.assertEqual(perfectd(6), True)\n self.assertEqual(perfectd(15), False)","def is_prime(n):\n assert n > 3\n k = int(log2(n))\n m = n - 1\n d = 0\n while(m % 2 == 0):\n m //= 2\n d += 1\n for _ in range(k):\n a = randint(2, n - 2)\n x = pow(a, m, n)\n if x == 1 or x == n - 1:\n continue\n for _ in range(d - 1):\n x = pow(x, 2, n)\n if x == 1:\n return 0\n if x == n - 1:\n break\n if x != n - 1:\n return 0\n return 1","def snt(n):\r\n f = True\r\n for j in range(2, n):\r\n if n % j == 0:\r\n f = False\r\n break\r\n return f","def start_prime_test():","def generate_prime(size: int) -> int:\n while True:\n num = random.randrange(2 ** (size - 1), 2 ** (size))\n if is_prime(num):\n return num","def test_v2_runtime(self):\r\n\r\n start_time = time.time()\r\n\r\n for n in range(1, 30000):\r\n prime_numbers_v2(n)\r\n\r\n elapsed_time = round(time.time() - start_time, 3)\r\n\r\n print(f\"v2, time required: {elapsed_time}\")","def sim_alternating_exp():\n catches = 0\n for _ in range(100000):\n j = np.random.uniform()*1000\n # j = np.random.exponential(500)\n t_i = 0\n i = 0\n while t_i < j+100:\n if i % 2 == 1:\n t_i += np.random.exponential(10)\n else:\n t_i += np.random.exponential(20)\n if j < t_i and t_i < j+1:\n catches += 1\n i += 1\n print(catches/100000)","def problem1():\n return sum(i for i in range(1000) if i % 3 == 0 or i % 5 == 0)","def main():\n prime = gen_prime(1, 100000)\n print(prime)","def test_prime(n):\n if SIEVE[n]:\n return True\n else:\n return False","def maybe_prime(n: int, k: int = 3) -> bool:\n if n < 2:\n return False\n for p in small_primes:\n if n < p * p:\n return True\n if n % p == 0:\n return False\n r, s = 0, n - 1\n while s % 2 == 0:\n r += 1\n s //= 2\n for _ in range(k):\n a = randrange(2, n - 1)\n x = pow(a, s, n)\n if x == 1 or x == n - 1:\n continue\n for _ in range(r - 1):\n x = pow(x, 2, n)\n if x == n - 1:\n break\n else:\n return False\n return True","def problem2():\n\n def _fib_iter(n=4000000):\n \"\"\" Generator for fibonacci numbers less than n \"\"\"\n fib1 = 1\n fib2 = 2\n # Yield the first two fibonacci numbers\n yield fib1\n yield fib2\n fib_next = fib1 + fib2\n while fib_next < n:\n # iteratively gen\n yield fib_next\n fib1 = fib2\n fib2 = fib_next\n fib_next = fib1 + fib2\n\n return sum(i for i in _fib_iter() if i % 2 == 0)","def prime_numbers(upto):\n sieve = BitArray(upto + 1, 1)\n for number in xrange(2, upto + 1):\n if not sieve[number]:\n continue\n yield number\n for multiple in xrange(number ** 2, upto + 1, number):\n sieve[multiple] = 0\n return","def _generate_prime(self, root):\n self._prime = [tone + root for tone in list(range(12))]\n random.shuffle(self._prime)","def prime_gen():\n for i in memo_primes: yield i\n x = memo_primes[-1] + 1\n \n while True:\n if prime_with(x, memo_primes):\n yield x\n memo_primes.append(x)\n x += 1","def erato(n):\n sieve = [0, 0, 1] + [1, 0] * (n//2) # [0 0 1 1 0 1 0...]\n\n prime = 3 # initial odd prime\n\n while prime**2 <= n:\n for i in range(prime**2, n+1, prime*2): \n sieve[i] = 0 # step through sieve by prime*2\n\n prime += 1 + sieve[prime+1:].index(1) # get next prime\n\n # filter includes corresponding integers where sieve = 1\n\n return filter(lambda i, sieve=sieve: sieve[i], range(n+1))","def test_run_sim_1():\n rnd = rand.Arrivals(36, 41)\n sim.run_sim(3, 2, 5, 6, 22, rnd)","def Ballie_PSW_test(n, max_trivial_trials=100):\n for i in range(max_trivial_trials):\n if primes[i] == n:\n return True\n if n % primes[i] == 0:\n return False\n if primes[i] ** 2 >= n:\n return True\n if not fermat_strong_test(n, 2):\n return False\n if not lucas_selfridge_test(n):\n return False\n return True","def generate_prime(bits): \n while True:\n possible = mpz(2)**(bits-1) + mpz_urandomb(rand, bits-1)\n if is_prime(possible):\n return possible","def primes(count):\n\n prime_numbers = [2]\n next_num = 3 \n\n def is_prime(next_num):\n if next_num % 2 == 0:\n return False \n \n for i in range(3, next_num, 2):\n if next_num % i == 0:\n return False \n return True \n\n while count > len(prime_numbers): \n if is_prime(next_num): \n prime_numbers.append(next_num)\n next_num += 1\n\n return prime_numbers","def is_prime(n, number_of_tests=5):\n passes = 0\n prime = True #assume prime\n for i in xrange(number_of_tests):\n passes += 1\n random_int = random.randint(2, n-1)\n test = pow(random_int, n-1, n)\n if test != 1:\n prime = False\n break\n if prime:\n return 0\n else:\n return passes","def sieve(n):\n s = [True] * (n + 1)\n for i in range(2, isqrt(n) + 1):\n if s[i]:\n for j in range(i + i, n + 1, i):\n s[j] = False\n return [i for i in range(2, n + 1) if s[i]]","def fair_sharing(n=2,*args,**kwargs):\n import itertools\n if n < 1:\n raise ValueError('Require n >= 1')\n if n == 1:\n yield from itertools.repeat(0)\n if n == 2:\n for k in itertools.count():\n yield bin(k).count('1') & 1\n yield from _fair_sharing_array(*args,n=n,**kwargs)","def McNuggets(n):\n # Your Code Here\n for c in xrange( n/20+2):\n for b in xrange( (n-20*c)/9+2):\n for a in xrange ((n-20*c-9*b)/6 +2):\n if (6*a + 9*b + 20*c) == n :\n return True\n return False","def evansPrimes(n):\n assert n>1\n primes = []\n for i in range(1,n+1):\n sums = 0\n for j in range(1,i):\n sums += evansMod(i,j)*j\n if sums == 1:\n primes.append(i)\n #print(primes) #for testing only\n return primes","def primeSieve(n):\n result = []\n sieve = array.array('i', (True for i in range(0, n+1)))\n for k in range(2, n+1):\n if sieve[k]:\n result.append(k)\n i = k * k\n while i <= n:\n sieve[i] = False\n i += k\n return result","def get_primes_over(limit):\n candidate = 1000000\n count = 0\n while count < limit:\n if is_prime(candidate):\n yield candidate\n count += 1\n candidate += 1\n else:\n candidate += 1","def prjEuler():\r\n a = 1\r\n for a in range( 1, 1000 ):\r\n for b in range( 1, 1000 ):\r\n if( ( sqrt( ( a ** 2 ) + ( b ** 2 ) ) % 1 ) == 0 ):\r\n if( ( a + b + ( sqrt( ( a ** 2 ) + ( b ** 2 ) ) ) ) == 1000 ):\r\n print \"The product is %d\" % ( a * b * ( sqrt( ( a ** 2 ) + ( b ** 2 ) ) ) )\r\n return\r\n \r\n return","def eratosthen(max):\n all = list(range(0, max + 1))\n # exclude 1 as not prime number\n all[1] = 0\n\n i = 2\n while i < max:\n if all[i] != 0:\n j = i + i\n while j <= max:\n all[j] = 0\n j = j + i\n i += 1\n\n # collapse to unique values\n numbers = set(all)\n numbers.remove(0)\n\n return numbers","def gen_primes(limit=10000):\n\n candidates = set(range(2, limit))\n primes = []\n\n while len(candidates) > 0:\n prime = min(candidates)\n primes.append(prime)\n for number in range(prime, limit, prime):\n candidates.discard(number)\n\n return primes","def task_10_generator_of_simple_numbers() -> Generator[int, None, None]:\n def is_num_simple(n):\n \"\"\"\n Return: True if n is a simple number or False if it is not\n \"\"\"\n for i in range(n, 1, -1):\n if n % i == 0 and i < n and n != 1:\n return False\n return True\n\n # generator part\n n = 2\n while n < 200:\n if is_num_simple(n):\n yield n\n n = n + 1","def test_v3_runtime(self):\r\n\r\n start_time = time.time()\r\n\r\n for n in range(1, 30000):\r\n prime_numbers_v3(n)\r\n\r\n elapsed_time = round(time.time() - start_time, 3)\r\n\r\n print(f\"v3, time required: {elapsed_time}\")","def n_primes(n):\n primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59,\n 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127,\n 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193,\n 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269,\n 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349,\n 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431,\n 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503,\n 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599,\n 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673,\n 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761,\n 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857,\n 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947,\n 953, 967, 971, 977, 983, 991, 997][:n]\n\n if len(primes) < n:\n big_number = 2000\n while 'Not enough primes':\n primes = primes_from_2_to(big_number)[:n]\n if len(primes) == n:\n break\n big_number += 1000\n\n return primes","def main():\n limit = 1000\n max_primes = 0\n max_b, max_c = 0, 0\n is_prime = sieve_of_eratosthenes_bool(limit * 100)\n primes = sieve_of_eratosthenes(limit)\n for c in primes:\n for b in range(-c, limit, 2):\n for n in count(1):\n res = n * n + b * n + c\n if res < 1 or not is_prime[res]:\n if max_primes < n:\n max_primes = n\n max_b, max_c = b, c\n print(max_primes, max_b, max_c, end='\\n')\n break\n print(max_b, max_c, max_b * max_c)","def prime_numbers(x: int):\n A = [True] * x\n A[0] = A[1] = False\n for i in range(2, x, 1):\n if is_simple_number(i):\n for m in range(2 * i, x, i):\n A[m] = False\n n = 0\n for k in range(x):\n print(k, \"is prime\" if A[k] else \"is not prime\")\n if A[k]:\n n += 1\n\n B = [0] * n\n n = 0\n for k in range(x):\n if A[k]:\n B[n] = k\n n += 1\n return B"],"string":"[\n \"def eratosthenes(x):\\n multiples = []\\n for i in range(2, x+1):\\n if i not in multiples:\\n print (i)\\n for j in range(i*i, x+1, i):\\n multiples.append(j)\",\n \"def main():\\n doctest.testmod()\\n print(eratosthenes(2))\",\n \"def eratosthenes2(n):\\n multiples = set()\\n for i in range(2, n+1):\\n if i not in multiples:\\n yield i\\n multiples.update(range(i*i, n+1, i))\",\n \"def eratosthenes_np(limit):\\n if isinstance(limit, (int, float)):\\n limit = int(limit)\\n else:\\n raise ValueError\\n mask = np.ones(limit+1, dtype=np.bool)\\n mask[:2] = False\\n for i in range(2, int(np.sqrt(limit))+1):\\n if mask[i]:\\n mask[i*i::i] = False\\n return np.nonzero(mask)[0]\",\n \"def eratosthenes_npo(limit):\\n if isinstance(limit, (int, float)):\\n limit = int(limit)\\n else:\\n raise ValueError\\n mask = np.ones(limit//2, dtype=np.bool)\\n for i in range(3, int(limit**0.5)+1, 2):\\n if mask[i//2]:\\n mask[i*i//2::i] = False\\n return np.r_[2, 2*np.nonzero(mask)[0][1::]+1]\",\n \"def eratosthenes(limit):\\n if isinstance(limit, (int, float)) and limit == int(limit):\\n limit = int(limit)\\n else:\\n raise ValueError\\n primes = []\\n mask = [1]*(limit+1)\\n for i in range(2, limit+1):\\n if mask[i]:\\n primes.append(i)\\n for j in range(i*i, limit+1, i):\\n mask[j] = 0\\n return np.asarray(primes)\",\n \"def eratosthenes_mem(limit):\\n if isinstance(limit, (int, float)) and limit == int(limit):\\n limit = int(limit)\\n else:\\n raise ValueError\\n primes = [2]\\n multiples = [2]\\n limit += 1\\n for candidate in range(3, limit):\\n if candidate not in multiples:\\n primes.append(candidate)\\n multiples.append(2*candidate)\\n for i, m in enumerate(multiples):\\n if m <= candidate:\\n multiples[i] += primes[i]\\n return np.asarray(primes)\",\n \"def gen_eratosthenes():\\n n=3\\n yield 2\\n while True:\\n count = 2 #set count to 2 because if count=1; all numbers are divisible by 1, so it is not a case we need to check\\n this = True\\n while count < n/2 + 1: #set to n/2 + 1 so that the amount of times iterated is minimized.\\n if n%count == 0: #i.e. if n is divisble by count, then n is not prime\\n count = n #ends this loop; if n is not prime, there is no reason to continue the loop\\n this = False\\n count += 1\\n if this == True: #i.e. if this == True, then we know that the while loop was completely executed and n has no divisors except 1 and n\\n yield n #yield n since it went through the entire loop without finding divisors\\n n += 1 #increment n to see if n+1 is prime. will continue incrimenting until another prime is found and yields it\",\n \"def seive_of_eratosthenes(n):\\n sieve = [ True for i in range(n+1) ]\\n def markOff(pv):\\n for i in range(pv+pv, n+1, pv):\\n sieve[i] = False\\n markOff(2)\\n for i in range(3, n+1):\\n if sieve[i]:\\n markOff(i)\\n return [ i for i in range(2, n+1) if sieve[i] ]\",\n \"def EratosthenesSieve(N):\\n numbers = [True] * (N+1)\\n max_p = int(math.sqrt(N))\\n for p in (i for i in range(2, max_p+1) if numbers[i]):\\n for q in range(p*p, N+1, p):\\n numbers[q] = False\\n return [i for i in range(2, N+1) if numbers[i]]\",\n \"def EratosthenesSieve(N):\\n numbers = [True] * (N + 1)\\n max_p = int(math.sqrt(N))\\n for p in (i for i in range(2, max_p + 1) if numbers[i]):\\n for q in range(p * p, N + 1, p):\\n numbers[q] = False\\n return [i for i in range(2, N + 1) if numbers[i]]\",\n \"def test_15(self):\\n\\t self.assertTrue(prime_generator(15), [2, 3, 5, 7, 11, 13])\",\n \"def eratosthenes(n):\\n assert n>1 #asserting n be a positive integer\\n prime_list = []\\n for i in range(2,n+1): #fills prime_list with all integers 2 <= i <= n\\n prime_list.append(i)\\n multiple = 2 #set to 2 because if set to 1 it will remove all elements from the list\\n while multiple <= n/multiple:\\n count = 2 #set to 2 because if set to 1 it will remove the prime itself from the list\\n while count <= n/multiple:\\n if count*multiple in prime_list: #checks if count*multiple is in list. needed because it could have already been removed\\n prime_list.remove(count*multiple) #removes count*multiple\\n count = count + 1\\n multiple = multiple + 1\\n #print(prime_list) #for testing only\\n return prime_list\",\n \"def sieve_of_eratosthenes(n):\\n res = [2]\\n i = 3\\n marked = set()\\n while i <= n**.5:\\n if i not in marked:\\n res.append(i)\\n j = 0\\n while j <= n/i:\\n marked.add(i + j*i)\\n j += 1\\n i += 2\\n while i <= n:\\n if i not in marked:\\n res.append(i)\\n i += 2\\n return res\",\n \"def gen_prime():\\n\\n n = 100\\n if n == 2:\\n return [2]\\n elif n < 2:\\n return []\\n s = range(3, n + 1, 2)\\n mroot = n ** 0.5\\n half = (n + 1) / 2 - 1\\n i = 0\\n m = 3\\n while m <= mroot:\\n if s[i]:\\n j = (m * m - 3) / 2\\n s[j] = 0\\n while j < half:\\n s[j] = 0\\n j += m\\n i = i + 1\\n m = 2 * i + 3\\n primes = [2] + [x for x in s if x]\\n return (primes[random.randint(1, len(primes) - 1)])\",\n \"def es_primo(n):\\n \\n for i in range(2, n):\\n if n % i == 0:\\n return False\\n return True\",\n \"def eratosthenes(upperbound: int) -> list:\\n if upperbound < 0 or type(upperbound) != int:\\n raise ValueError(\\\"The value is not valid. The upperbound should be a positive integer.\\\")\\n numbers = list(range(2, upperbound + 1)) # create a list between 0 and the upperbound inclusive\\n counter = 0 # begin the counter at 2 as 1 and zero are not prime numbers\\n while numbers[counter] < upperbound ** (1/2): # loop thru numbers until it reaches the square root of upperbound\\n numbers = remove_multiples(numbers, numbers[counter]) # update numbers by removing multiples of current number\\n counter += 1 # move on to the next number to check\\n return numbers\",\n \"def solution(n: int = 2000000) -> int:\\n\\n return sum(takewhile(lambda x: x < n, prime_generator()))\",\n \"def test_prime_12(self):\\n\\t self.assertTrue(prime_generator(12), [2, 3, 5, 7, 11])\",\n \"def eratosthenes_sieve(n):\\r\\n\\tnumbers = [True for i in range(n + 1)]\\r\\n\\t\\r\\n\\tp = 2\\r\\n\\twhile (p**2 <= n):\\r\\n\\t\\tif numbers[p]:\\r\\n\\t\\t\\tfor i in range(p**2, n + 1, p):\\r\\n\\t\\t\\t\\tnumbers[i] = False\\r\\n\\t\\tp += 1\\r\\n\\t\\t\\r\\n\\tprimes = compress(range(2, n + 1),numbers[2:])\\r\\n\\treturn list(primes)\",\n \"def main() -> int:\\n\\n a = None\\n for n, g in enumerate(gen_primes(100000, 1000000)):\\n repeat, indices = check_if_has_3_repeated_digits(str(g))\\n if repeat:\\n a = check_for_family_of_primes(repeat, indices, list(str(g)))\\n if len(a) > 7 and min(a) > 100000:\\n EULER_LOGGER.debug(f\\\"{a}\\\")\\n a = min([int(i) for i in a])\\n break\\n\\n return a\",\n \"def test_rand_func2(self):\\n for i in range(0, 100000):\\n num = random.randint(0, 32535143990)\\n func2_comp(num)\",\n \"def primes(m):\\n if m <= 2:\\n return ()\\n sieve = [True] * m\\n for i in sixn(m):\\n if sieve[i]:\\n yield i\\n for mult in range(i * i, m, i):\\n sieve[mult] = False\",\n \"def esprimo(n):\\n toret = False\\n if x == 2:\\n toret = True\\n elif x % 2 == 0:\\n toret = False\\n else:\\n for i in range(3, x, 2):\\n if x % i == 0:\\n break\\n else:\\n toret = True\\n # Se ejecuta cuando no se rompe el bucle\\n\\n return toret\",\n \"def test_prime_10(self):\\n\\t self.assertTrue(prime_generator(10), [2, 3, 5, 7])\",\n \"def primfact(e):\\n for n in range(2, e):\\n for x in range(2, n):\\n if n % x == 0:\\n break\\n else:\\n print n,\",\n \"def test_stress(self):\\n primorial100 = 4711930799906184953162487834760260422020574773409675520188634839616415335845034221205289256705544681972439104097777157991804380284218315038719444943990492579030720635990538452312528339864352999310398481791730017201031090\\n for i in range(10000):\\n self.assertEqual(primorial(100), primorial100)\",\n \"def primes():\\n yield 2\\n candidate = 3\\n while True:\\n for i in range(3, int(sqrt(candidate)) + 1, 2):\\n if (candidate % i) == 0:\\n break\\n else:\\n yield candidate\\n candidate += 2\",\n \"def primes():\\n yield 2\\n candidate = 3\\n while True:\\n for i in range(3, int(sqrt(candidate)) + 1, 2):\\n if (candidate % i) == 0:\\n break\\n else:\\n yield candidate\\n candidate += 2\",\n \"def rand_prime(k=10): \\n i = random.randint(2**(k-2),2**(k-1))\\n i,l=2*i+1,0\\n while True:\\n j = 3\\n l +=1\\n while i%j!=0:\\n j += 1\\n if i == j:\\n return i\\n #return i,len(bin(i)[2:]),l\\n i += 2\",\n \"def monte_carlo_trials(nb_trials, nb_ok, lock):\\n\\n # First perform the trials\\n # Do not use shared resource because other processes doesn't need to know\\n # about computation step\\n nb_in_quarter_results = 0\\n for i in range(nb_trials):\\n x = random.uniform(0, 1)\\n y = random.uniform(0, 1)\\n if x * x + y * y <= 1.0:\\n nb_in_quarter_results += 1\\n\\n # Finally update shared resource\\n # Do it only once, then processes doesn't struggle with each other to\\n # update it\\n with lock:\\n nb_ok.value += nb_in_quarter_results\",\n \"def gen_primes():\\n\\n n = 1\\n while True:\\n while not isPrime(n):\\n n += 1\\n\\n yield n\\n n += 1\",\n \"def task3(nums):\\n if len(nums) < 2:\\n return nums\\n pivot = random.choice(nums)\\n l_nums = [n for n in nums if n < pivot]\\n e_nums = [pivot] * nums.count(pivot)\\n r_nums = [n for n in nums if n > pivot]\\n return task3(l_nums) + e_nums + task3(r_nums)\",\n \"def primes():\\n yield 2\\n found_primes = [2]\\n a = 3\\n while True:\\n for p in found_primes:\\n if p**2 > a:\\n found_primes.append(a)\\n yield a\\n a += 2\\n break\\n elif a % p == 0:\\n a += 2\\n break\",\n \"def problem077():\\n\\n cond = lambda n: num_prime_sum_ways(n) > 5000\\n ans = next(filter(cond, itertools.count(2)))\\n return ans\",\n \"def gen_primes():\\n\\tyield 2\\n\\tyield 3\\n\\tprime_list = [2, 3]\\n\\twhile 1:\\n\\t\\tnext = prime_list[-1] + 2\\n\\t\\ti = 0\\n\\t\\twhile i < len(prime_list):\\n\\t\\t\\tif next%prime_list[i] == 0:\\n\\t\\t\\t\\tnext+=2\\n\\t\\t\\t\\ti=0\\n\\t\\t\\telse:\\n\\t\\t\\t\\ti+=1\\n\\t\\tprime_list.append(next)\\n\\t\\tyield next\",\n \"def primes():\\n yield 2\\n found = []\\n for i in itertools.count(start=3, step=2):\\n for p in found:\\n if i % p == 0:\\n break\\n else:\\n yield i\\n found.append(i)\",\n \"def main(n=20):\\n return functools.reduce(lcm, range(1, 20))\",\n \"def test_prime_2(self):\\n\\t self.assertTrue(prime_generator(2), [2])\",\n \"def isPrime(n, s=50):\\n from random import randrange\\n for x in primes:\\n if x < n:\\n if n % x == 0:\\n return False\\n for j in range(1, s + 1):\\n a = randrange(1, n)\\n if witness(a, n):\\n return False\\n return True\",\n \"def sieve_of_eratosthenes(n: int) -> List[int]:\\n\\n prime = [True for i in range(n+1)] #initiate array named prime with all value True, ie everynumber [0,n] are prime\\n p = 2\\n while (p * p <= n):\\n # If prime[p] is not\\n # changed, then it is a prime\\n if (prime[p] == True): #if any number is prime then its multiple must be composite\\n # Update all multiples of p to be not prime \\n for i in range(p * p, n+1, p):\\n prime[i] = False\\n p += 1\\n\\n\\n '''\\n till here the status of code is:\\n 0:prime\\n 1:prime\\n 2:prime\\n 3:prime\\n 5:prime\\n 7:prime\\n 11:prime\\n .\\n .\\n .\\n\\n But 0 and 1 are not prime, so we will have to count numbers from 2\\n '''\\n\\n return [i for i, p in enumerate(prime[2:], 2) if p]\",\n \"def sim_alternating():\\n catches = 0\\n for _ in range(100000):\\n j = np.random.uniform()*1000\\n # j = np.random.exponential(500)\\n t_i = 0\\n i = 0\\n while t_i < j+100:\\n if i % 2 == 0:\\n t_i += 10\\n else:\\n t_i += 20\\n if j < t_i and t_i < j+1:\\n catches += 1\\n i += 1\\n print(catches/100000)\",\n \"def test_12():\\n assert primes(12) == [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61]\",\n \"def twentyone():\\r\\n \\r\\n notamicable = []\\r\\n isamicable = []\\r\\n \\r\\n for i in range(10000):\\r\\n if i not in notamicable and i not in isamicable:\\r\\n a = i\\r\\n b = amicable(findDivisors(a))\\r\\n c = amicable(findDivisors(b))\\r\\n if a == c and not a == b:\\r\\n isamicable.append(a)\\r\\n isamicable.append(b)\\r\\n else:\\r\\n notamicable.append(a)\\r\\n notamicable.append(b)\\r\\n \\r\\n print isamicable\\r\\n t = 0\\r\\n for v in isamicable:\\r\\n t += v\\r\\n return t\",\n \"def primes():\\n yield 1\\n primes = []\\n for n in itertools.count(2):\\n if not any(n % p == 0 for p in primes):\\n # No divisor found among previous primes\\n yield n\\n primes.append(n)\",\n \"def primos(x):\\n def esprimo(n):\\n \\\"\\\"\\\"\\n Determines whether a natural number is a prime number\\n :param n: Agiven natural number\\n :return: True if prime, False otherwise\\n \\\"\\\"\\\"\\n toret = False\\n if x == 2:\\n toret = True\\n elif x % 2 == 0:\\n toret = False\\n else:\\n for i in range(3, x, 2):\\n if x % i == 0:\\n break\\n else:\\n toret = True\\n # Se ejecuta cuando no se rompe el bucle\\n\\n return toret\\n\\n toret = []\\n for i in range(0, x):\\n if esprimo(i):\\n toret.append(i)\\n\\n return toret\",\n \"def trial_div(n: int) -> bool:\\n if n == 1:\\n return False\\n i = 2\\n while i**2 <= n:\\n if n % i == 0:\\n return False\\n i += 1\\n return True\",\n \"def prime():\\n number = random.randint(1, 100)\\n if len(primfacs(number)) == 1:\\n return number, 'yes'\\n return number, 'no'\",\n \"def isprime(n):\\n if n!=int(n):\\n return False\\n n=int(n)\\n #Miller-Rabin test for prime\\n if n==0 or n==1 or n==4 or n==6 or n==8 or n==9:\\n return False\\n\\n if n==2 or n==3 or n==5 or n==7:\\n return True\\n s = 0\\n d = n-1\\n while d%2==0:\\n d>>=1\\n s+=1\\n assert(2**s * d == n-1)\\n\\n def trial_composite(a):\\n if pow(a, d, n) == 1:\\n return False\\n for i in range(s):\\n if pow(a, 2**i * d, n) == n-1:\\n return False\\n return True\\n\\n for i in range(8):#number of trials\\n a = random.randrange(2, n)\\n if trial_composite(a):\\n return False\\n\\n return True\",\n \"def quick_test():\\n if PERIOD < 2:\\n return False\\n if SIZE % PERIOD != 0:\\n return False\\n return True\",\n \"def gen_primes(N):\\n primes = set()\\n for n in range(2, N):\\n if all(n % p > 0 for p in primes):\\n primes.add(n)\\n yield n\",\n \"def genPrimes(n):\\n assert n>1\\n p = gen_eratosthenes()\\n prime_list = []\\n prime_list.append(next(p))\\n while n > prime_list[len(prime_list)-1]: #while input is less than the last term in the prime list\\n prime_list.append(next(p)) #adds next term from generator\\n if n < prime_list[len(prime_list)-1]: #deletes last term\\n del prime_list[len(prime_list)-1]\\n #print(prime_list) #for testing only\\n return prime_list\",\n \"def findPrime(n, other=1):\\n from random import randrange\\n beg = 1\\n beg <<= n\\n end = beg << 1\\n f = False\\n while (not f) or x == other:\\n x = randrange(beg, end)\\n f = isPrime(x)\\n return x\",\n \"def eratosthenes_sieve(iterable):\\n iterable_set = set(iterable)\\n mx = max(iterable)\\n lst = [ x for x in range(2, mx)]\\n for num in lst:\\n tmp = 2\\n while tmp < mx:\\n iterable_set.discard(num * tmp)\\n tmp += 1\\n return iterable_set\",\n \"def sieve(upper=10**5):\\n nums = [True] * (upper + 1)\\n nums[0] = False\\n nums[1] = False\\n for i in range(2, upper + 1):\\n if not nums[i]: continue\\n for j in range(i * 2, upper + 1, i):\\n nums[j] = False\\n return nums\",\n \"def test_primes_under_1000000(self):\\n self.assertEqual(len(sieve(100)), 25)\\n self.assertEqual(len(sieve(1000)), 168)\\n self.assertEqual(len(sieve(10000)), 1229)\\n self.assertEqual(len(sieve(100000)), 9592)\\n self.assertEqual(len(sieve(1000000)), 78498)\",\n \"def primes(n):\\n sieve = [True]*n\\n for p in range(2, n):\\n if sieve[p]:\\n yield p\\n for i in range(p*p, n, p):\\n sieve[i] = False\",\n \"def primes(count):\\n\\n prime_nums = [2]\\n prime = 3\\n\\n for i in range(1, count):\\n\\n while prime not in [3, 5, 7] and (\\n prime % 3 == 0 or prime % 5 == 0 or prime % 7 == 0\\n ):\\n prime += 2\\n\\n prime_nums.append(prime)\\n prime += 2\\n\\n return prime_nums\",\n \"def sieve(n):\\n\\n results = [1 for _ in range(n+1)]\\n results[0], results[1] = 0, 0\\n results = [0,0] + [1]*(n - 1)\\n len(results)\\n div = 2\\n\\n for i,num in enumerate(results):\\n if num:\\n k = i * 2\\n while k <= n:\\n seive[k] = 0\\n k+= i\\n return [x for (x,y) in enumerate(results) if y]\\n\\n while div <= n // 2 + 1:\\n for i in range(div * div, n+1, div):\\n if results[i] == 0:\\n continue\\n else:\\n results[i] = 0\\n div += 1\\n\\n #return sum(results)\\n return [i for i in range(len(results)) if results[i] == 1]\",\n \"def func(args):\\n l, r, n = args\\n import random\\n\\n return sum([random.randint(l, r) for _ in range(n)]) / n\",\n \"def is_prime(n, k=10):\\n if n == 2 or n == 3:\\n return True\\n if not n & 1 or n < 2:\\n return False\\n m = n - 1\\n s = 1\\n d = m >> 1\\n while not d & 1:\\n s += 1\\n d >>= 1\\n for i in range(k):\\n a = randint(2, n - 2)\\n x = expmod(a, d, n)\\n if x == 1 or x == n - 1:\\n continue\\n for r in range(1, s):\\n x = x * x % n\\n if x == 1:\\n return False\\n if x == n - 1:\\n break\\n else:\\n return False\\n return True\",\n \"def primes(n):\\n\\tsieve = [True] * n\\n\\tyield 2\\n\\tfor i in xrange(3,int(n**0.5)+1,2):\\n\\t\\tif sieve[i]:\\n\\t\\t\\tyield i\\n\\t\\t\\tsieve[i*i::2*i] = [False]*((n-i*i-1)/(2*i)+1)\\n\\tfor i in xrange(i+2,n,2):\\n\\t\\tif sieve[i]: yield i\",\n \"def sieveOfEra():\\n D = {}\\n yield 2\\n for q in itertools.islice(itertools.count(3), 0, None, 2):\\n p = D.pop(q, None)\\n if p is None:\\n D[q*q] = q\\n yield q\\n else:\\n x = p + q\\n while x in D or not (x&1):\\n x += p \\n D[x] = p\",\n \"def generate():\\n j = [2]\\n i = 3\\n while i:\\n if is_prime(i):\\n j.append(i)\\n yield [j, j[-1]]\\n i += 2\",\n \"def test_never_same():\\n g = RG.larger_random()\\n hundred_calls = set([next(g) for _ in range(20)])\\n assert len(hundred_calls) == 20\",\n \"def test_handcrafted_examples(self):\\n for i in range(1000):\\n self.assertEqual(perfectd(0), True)\\n self.assertEqual(prime(0), False)\\n self.assertEqual(prime(2), True)\\n self.assertEqual(prime(7), True)\\n self.assertEqual(prime(15), False)\\n self.assertEqual(perfectd(6), True)\\n self.assertEqual(perfectd(15), False)\",\n \"def is_prime(n):\\n assert n > 3\\n k = int(log2(n))\\n m = n - 1\\n d = 0\\n while(m % 2 == 0):\\n m //= 2\\n d += 1\\n for _ in range(k):\\n a = randint(2, n - 2)\\n x = pow(a, m, n)\\n if x == 1 or x == n - 1:\\n continue\\n for _ in range(d - 1):\\n x = pow(x, 2, n)\\n if x == 1:\\n return 0\\n if x == n - 1:\\n break\\n if x != n - 1:\\n return 0\\n return 1\",\n \"def snt(n):\\r\\n f = True\\r\\n for j in range(2, n):\\r\\n if n % j == 0:\\r\\n f = False\\r\\n break\\r\\n return f\",\n \"def start_prime_test():\",\n \"def generate_prime(size: int) -> int:\\n while True:\\n num = random.randrange(2 ** (size - 1), 2 ** (size))\\n if is_prime(num):\\n return num\",\n \"def test_v2_runtime(self):\\r\\n\\r\\n start_time = time.time()\\r\\n\\r\\n for n in range(1, 30000):\\r\\n prime_numbers_v2(n)\\r\\n\\r\\n elapsed_time = round(time.time() - start_time, 3)\\r\\n\\r\\n print(f\\\"v2, time required: {elapsed_time}\\\")\",\n \"def sim_alternating_exp():\\n catches = 0\\n for _ in range(100000):\\n j = np.random.uniform()*1000\\n # j = np.random.exponential(500)\\n t_i = 0\\n i = 0\\n while t_i < j+100:\\n if i % 2 == 1:\\n t_i += np.random.exponential(10)\\n else:\\n t_i += np.random.exponential(20)\\n if j < t_i and t_i < j+1:\\n catches += 1\\n i += 1\\n print(catches/100000)\",\n \"def problem1():\\n return sum(i for i in range(1000) if i % 3 == 0 or i % 5 == 0)\",\n \"def main():\\n prime = gen_prime(1, 100000)\\n print(prime)\",\n \"def test_prime(n):\\n if SIEVE[n]:\\n return True\\n else:\\n return False\",\n \"def maybe_prime(n: int, k: int = 3) -> bool:\\n if n < 2:\\n return False\\n for p in small_primes:\\n if n < p * p:\\n return True\\n if n % p == 0:\\n return False\\n r, s = 0, n - 1\\n while s % 2 == 0:\\n r += 1\\n s //= 2\\n for _ in range(k):\\n a = randrange(2, n - 1)\\n x = pow(a, s, n)\\n if x == 1 or x == n - 1:\\n continue\\n for _ in range(r - 1):\\n x = pow(x, 2, n)\\n if x == n - 1:\\n break\\n else:\\n return False\\n return True\",\n \"def problem2():\\n\\n def _fib_iter(n=4000000):\\n \\\"\\\"\\\" Generator for fibonacci numbers less than n \\\"\\\"\\\"\\n fib1 = 1\\n fib2 = 2\\n # Yield the first two fibonacci numbers\\n yield fib1\\n yield fib2\\n fib_next = fib1 + fib2\\n while fib_next < n:\\n # iteratively gen\\n yield fib_next\\n fib1 = fib2\\n fib2 = fib_next\\n fib_next = fib1 + fib2\\n\\n return sum(i for i in _fib_iter() if i % 2 == 0)\",\n \"def prime_numbers(upto):\\n sieve = BitArray(upto + 1, 1)\\n for number in xrange(2, upto + 1):\\n if not sieve[number]:\\n continue\\n yield number\\n for multiple in xrange(number ** 2, upto + 1, number):\\n sieve[multiple] = 0\\n return\",\n \"def _generate_prime(self, root):\\n self._prime = [tone + root for tone in list(range(12))]\\n random.shuffle(self._prime)\",\n \"def prime_gen():\\n for i in memo_primes: yield i\\n x = memo_primes[-1] + 1\\n \\n while True:\\n if prime_with(x, memo_primes):\\n yield x\\n memo_primes.append(x)\\n x += 1\",\n \"def erato(n):\\n sieve = [0, 0, 1] + [1, 0] * (n//2) # [0 0 1 1 0 1 0...]\\n\\n prime = 3 # initial odd prime\\n\\n while prime**2 <= n:\\n for i in range(prime**2, n+1, prime*2): \\n sieve[i] = 0 # step through sieve by prime*2\\n\\n prime += 1 + sieve[prime+1:].index(1) # get next prime\\n\\n # filter includes corresponding integers where sieve = 1\\n\\n return filter(lambda i, sieve=sieve: sieve[i], range(n+1))\",\n \"def test_run_sim_1():\\n rnd = rand.Arrivals(36, 41)\\n sim.run_sim(3, 2, 5, 6, 22, rnd)\",\n \"def Ballie_PSW_test(n, max_trivial_trials=100):\\n for i in range(max_trivial_trials):\\n if primes[i] == n:\\n return True\\n if n % primes[i] == 0:\\n return False\\n if primes[i] ** 2 >= n:\\n return True\\n if not fermat_strong_test(n, 2):\\n return False\\n if not lucas_selfridge_test(n):\\n return False\\n return True\",\n \"def generate_prime(bits): \\n while True:\\n possible = mpz(2)**(bits-1) + mpz_urandomb(rand, bits-1)\\n if is_prime(possible):\\n return possible\",\n \"def primes(count):\\n\\n prime_numbers = [2]\\n next_num = 3 \\n\\n def is_prime(next_num):\\n if next_num % 2 == 0:\\n return False \\n \\n for i in range(3, next_num, 2):\\n if next_num % i == 0:\\n return False \\n return True \\n\\n while count > len(prime_numbers): \\n if is_prime(next_num): \\n prime_numbers.append(next_num)\\n next_num += 1\\n\\n return prime_numbers\",\n \"def is_prime(n, number_of_tests=5):\\n passes = 0\\n prime = True #assume prime\\n for i in xrange(number_of_tests):\\n passes += 1\\n random_int = random.randint(2, n-1)\\n test = pow(random_int, n-1, n)\\n if test != 1:\\n prime = False\\n break\\n if prime:\\n return 0\\n else:\\n return passes\",\n \"def sieve(n):\\n s = [True] * (n + 1)\\n for i in range(2, isqrt(n) + 1):\\n if s[i]:\\n for j in range(i + i, n + 1, i):\\n s[j] = False\\n return [i for i in range(2, n + 1) if s[i]]\",\n \"def fair_sharing(n=2,*args,**kwargs):\\n import itertools\\n if n < 1:\\n raise ValueError('Require n >= 1')\\n if n == 1:\\n yield from itertools.repeat(0)\\n if n == 2:\\n for k in itertools.count():\\n yield bin(k).count('1') & 1\\n yield from _fair_sharing_array(*args,n=n,**kwargs)\",\n \"def McNuggets(n):\\n # Your Code Here\\n for c in xrange( n/20+2):\\n for b in xrange( (n-20*c)/9+2):\\n for a in xrange ((n-20*c-9*b)/6 +2):\\n if (6*a + 9*b + 20*c) == n :\\n return True\\n return False\",\n \"def evansPrimes(n):\\n assert n>1\\n primes = []\\n for i in range(1,n+1):\\n sums = 0\\n for j in range(1,i):\\n sums += evansMod(i,j)*j\\n if sums == 1:\\n primes.append(i)\\n #print(primes) #for testing only\\n return primes\",\n \"def primeSieve(n):\\n result = []\\n sieve = array.array('i', (True for i in range(0, n+1)))\\n for k in range(2, n+1):\\n if sieve[k]:\\n result.append(k)\\n i = k * k\\n while i <= n:\\n sieve[i] = False\\n i += k\\n return result\",\n \"def get_primes_over(limit):\\n candidate = 1000000\\n count = 0\\n while count < limit:\\n if is_prime(candidate):\\n yield candidate\\n count += 1\\n candidate += 1\\n else:\\n candidate += 1\",\n \"def prjEuler():\\r\\n a = 1\\r\\n for a in range( 1, 1000 ):\\r\\n for b in range( 1, 1000 ):\\r\\n if( ( sqrt( ( a ** 2 ) + ( b ** 2 ) ) % 1 ) == 0 ):\\r\\n if( ( a + b + ( sqrt( ( a ** 2 ) + ( b ** 2 ) ) ) ) == 1000 ):\\r\\n print \\\"The product is %d\\\" % ( a * b * ( sqrt( ( a ** 2 ) + ( b ** 2 ) ) ) )\\r\\n return\\r\\n \\r\\n return\",\n \"def eratosthen(max):\\n all = list(range(0, max + 1))\\n # exclude 1 as not prime number\\n all[1] = 0\\n\\n i = 2\\n while i < max:\\n if all[i] != 0:\\n j = i + i\\n while j <= max:\\n all[j] = 0\\n j = j + i\\n i += 1\\n\\n # collapse to unique values\\n numbers = set(all)\\n numbers.remove(0)\\n\\n return numbers\",\n \"def gen_primes(limit=10000):\\n\\n candidates = set(range(2, limit))\\n primes = []\\n\\n while len(candidates) > 0:\\n prime = min(candidates)\\n primes.append(prime)\\n for number in range(prime, limit, prime):\\n candidates.discard(number)\\n\\n return primes\",\n \"def task_10_generator_of_simple_numbers() -> Generator[int, None, None]:\\n def is_num_simple(n):\\n \\\"\\\"\\\"\\n Return: True if n is a simple number or False if it is not\\n \\\"\\\"\\\"\\n for i in range(n, 1, -1):\\n if n % i == 0 and i < n and n != 1:\\n return False\\n return True\\n\\n # generator part\\n n = 2\\n while n < 200:\\n if is_num_simple(n):\\n yield n\\n n = n + 1\",\n \"def test_v3_runtime(self):\\r\\n\\r\\n start_time = time.time()\\r\\n\\r\\n for n in range(1, 30000):\\r\\n prime_numbers_v3(n)\\r\\n\\r\\n elapsed_time = round(time.time() - start_time, 3)\\r\\n\\r\\n print(f\\\"v3, time required: {elapsed_time}\\\")\",\n \"def n_primes(n):\\n primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59,\\n 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127,\\n 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193,\\n 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269,\\n 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349,\\n 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431,\\n 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503,\\n 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599,\\n 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673,\\n 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761,\\n 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857,\\n 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947,\\n 953, 967, 971, 977, 983, 991, 997][:n]\\n\\n if len(primes) < n:\\n big_number = 2000\\n while 'Not enough primes':\\n primes = primes_from_2_to(big_number)[:n]\\n if len(primes) == n:\\n break\\n big_number += 1000\\n\\n return primes\",\n \"def main():\\n limit = 1000\\n max_primes = 0\\n max_b, max_c = 0, 0\\n is_prime = sieve_of_eratosthenes_bool(limit * 100)\\n primes = sieve_of_eratosthenes(limit)\\n for c in primes:\\n for b in range(-c, limit, 2):\\n for n in count(1):\\n res = n * n + b * n + c\\n if res < 1 or not is_prime[res]:\\n if max_primes < n:\\n max_primes = n\\n max_b, max_c = b, c\\n print(max_primes, max_b, max_c, end='\\\\n')\\n break\\n print(max_b, max_c, max_b * max_c)\",\n \"def prime_numbers(x: int):\\n A = [True] * x\\n A[0] = A[1] = False\\n for i in range(2, x, 1):\\n if is_simple_number(i):\\n for m in range(2 * i, x, i):\\n A[m] = False\\n n = 0\\n for k in range(x):\\n print(k, \\\"is prime\\\" if A[k] else \\\"is not prime\\\")\\n if A[k]:\\n n += 1\\n\\n B = [0] * n\\n n = 0\\n for k in range(x):\\n if A[k]:\\n B[n] = k\\n n += 1\\n return B\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7555729","0.7525924","0.7279653","0.7068233","0.6793754","0.6754159","0.6716757","0.66996837","0.66710955","0.657833","0.6571549","0.6510445","0.64366025","0.6392734","0.62452984","0.62227535","0.6184394","0.6181353","0.61811525","0.61747223","0.616319","0.6157256","0.6116748","0.60148513","0.60068923","0.5995163","0.5969272","0.5963861","0.5963861","0.5959063","0.594908","0.59316087","0.5915916","0.5915522","0.5908919","0.5904568","0.59016526","0.58806586","0.5878912","0.5867991","0.58497745","0.5846809","0.58431876","0.582945","0.58014405","0.57962984","0.5790245","0.57802063","0.5761709","0.57435757","0.5733826","0.57177436","0.57117313","0.57098615","0.5687511","0.5686871","0.5681809","0.56793123","0.56700385","0.5666593","0.56647706","0.5664741","0.56560755","0.5655249","0.5651433","0.56473964","0.5642156","0.56278414","0.5626678","0.56080097","0.5602497","0.55965805","0.55816966","0.5573422","0.5570344","0.55665797","0.5566303","0.5565255","0.5564496","0.5563051","0.55629456","0.5549515","0.5547522","0.5545157","0.5543165","0.5542842","0.5535554","0.5526593","0.55257636","0.5524958","0.55245495","0.5519487","0.5509056","0.550897","0.5506196","0.5501521","0.54852337","0.54818374","0.5481731","0.54793745"],"string":"[\n \"0.7555729\",\n \"0.7525924\",\n \"0.7279653\",\n \"0.7068233\",\n \"0.6793754\",\n \"0.6754159\",\n \"0.6716757\",\n \"0.66996837\",\n \"0.66710955\",\n \"0.657833\",\n \"0.6571549\",\n \"0.6510445\",\n \"0.64366025\",\n \"0.6392734\",\n \"0.62452984\",\n \"0.62227535\",\n \"0.6184394\",\n \"0.6181353\",\n \"0.61811525\",\n \"0.61747223\",\n \"0.616319\",\n \"0.6157256\",\n \"0.6116748\",\n \"0.60148513\",\n \"0.60068923\",\n \"0.5995163\",\n \"0.5969272\",\n \"0.5963861\",\n \"0.5963861\",\n \"0.5959063\",\n \"0.594908\",\n \"0.59316087\",\n \"0.5915916\",\n \"0.5915522\",\n \"0.5908919\",\n \"0.5904568\",\n \"0.59016526\",\n \"0.58806586\",\n \"0.5878912\",\n \"0.5867991\",\n \"0.58497745\",\n \"0.5846809\",\n \"0.58431876\",\n \"0.582945\",\n \"0.58014405\",\n \"0.57962984\",\n \"0.5790245\",\n \"0.57802063\",\n \"0.5761709\",\n \"0.57435757\",\n \"0.5733826\",\n \"0.57177436\",\n \"0.57117313\",\n \"0.57098615\",\n \"0.5687511\",\n \"0.5686871\",\n \"0.5681809\",\n \"0.56793123\",\n \"0.56700385\",\n \"0.5666593\",\n \"0.56647706\",\n \"0.5664741\",\n \"0.56560755\",\n \"0.5655249\",\n \"0.5651433\",\n \"0.56473964\",\n \"0.5642156\",\n \"0.56278414\",\n \"0.5626678\",\n \"0.56080097\",\n \"0.5602497\",\n \"0.55965805\",\n \"0.55816966\",\n \"0.5573422\",\n \"0.5570344\",\n \"0.55665797\",\n \"0.5566303\",\n \"0.5565255\",\n \"0.5564496\",\n \"0.5563051\",\n \"0.55629456\",\n \"0.5549515\",\n \"0.5547522\",\n \"0.5545157\",\n \"0.5543165\",\n \"0.5542842\",\n \"0.5535554\",\n \"0.5526593\",\n \"0.55257636\",\n \"0.5524958\",\n \"0.55245495\",\n \"0.5519487\",\n \"0.5509056\",\n \"0.550897\",\n \"0.5506196\",\n \"0.5501521\",\n \"0.54852337\",\n \"0.54818374\",\n \"0.5481731\",\n \"0.54793745\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.7610841"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":11398,"cells":{"query":{"kind":"string","value":"Testing mersen_numbers function in task 559"},"document":{"kind":"string","value":"def test_task559_mersen_number(number, expected_value):\r\n assert algo.Task559.mersen_numbers(number) == expected_value"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["def test_numbers(number):\n print(\"\\nRunning test_numbers with {}\".format(number))","def test_numbers(self):\n \n result = gen_expansion(sym.pi, 2)\n self.assertEqual(result, '14')\n result = gen_expansion(sym.exp(1), 2)\n self.assertEqual(result, '72')","def test_anglicize100to999():\n print('Testing anglicize100to999')\n\n result = funcs.anglicize100to999(100)\n introcs.assert_equals(\"one hundred\", result)\n\n result = funcs.anglicize100to999(301)\n introcs.assert_equals(\"three hundred one\", result)\n\n result = funcs.anglicize100to999(999)\n introcs.assert_equals(\"nine hundred ninety nine\", result)","def getMantisse(number):\n mantisse = number / np.power(10, np.floor(np.log10(number)))\n return(mantisse)","def rabin_miller(n, target=128):\n ###############\n ## Start your code here\n return True\n ## End of your code\n ###############","def numerize():\n pass","def demo_a_number(random_number):","def test_inverse(self):\n from sosbeacon.utils import number_decode\n from sosbeacon.utils import number_encode\n\n for number in range(0, 500000, 339):\n encoded = number_encode(number)\n decoded = number_decode(encoded)\n self.assertEqual(number, decoded)","def test_hackerrank_sample1(self):\n result = find_digits(12)\n self.assertEquals(result, 2)","def run_suite():\n\n # test case 54\n twilio.run(\"+528451020032\", \"+12074264782\")\n # test case 55\n twilio.run(\"+528451020032\", \"+12074264782\")\n # test case 58\n twilio.run(\"+528451020031\", \"+12074264782\")\n # test case 59\n twilio.run(\"+528451020032\", \"+12074264781\")\n # test case 62\n twilio.run(\"+528451020032\", \"\")\n # test case 63\n twilio.run(\"\", \"+12074264782\")\n # test case 64\n twilio.run(\"\", \"\")\n # test case 65\n twilio.run(\"+528461043690\", \"+12074264782\")\n # test case 68\n twilio.run(\"+528451020032\", \"+12074264782\")\n # test case 69\n twilio.run(\"+528451020032\", \"+12074264782\")\n # test case 70\n twilio.run(\"+528451020032\", \"+12074264782\")\n # test case 75\n twilio.run(\"+524494934471\", \"+12074264782\")\n # test case 76\n twilio.run(\"+524494934471\", \"+12074264782\")\n # test case 79\n twilio.run(\"+524494934473\", \"+12074264782\")\n # test case 80\n twilio.run(\"+524494934471\", \"+12074264781\")\n # test case 83\n twilio.run(\"+524494934471\", \"\")\n # test case 84\n twilio.run(\"\", \"+12074264782\")\n # test case 85\n twilio.run(\"\", \"\")\n # test case 86\n twilio.run(\"+528451020323\", \"+12074264782\")\n # test case 89\n twilio.run(\"+524494934471\", \"+12074264782\")\n # test case 90\n twilio.run(\"+524494934471\", \"+12074264782\")\n # test case 91\n twilio.run(\"+524494934471\", \"+12074264782\")","def test_number_to_string(doctest):","def test_getnumber(self):\n convert = cnv()\n\n convert.setnum('einhundertdreiundzwanzig')\n self.assertEqual(convert.getnum(), 123)","def test_convert_word_with_numbers():\n for word in [\"1\", \"a1\", \"1a\"]:\n assert convert(word) == word","def thirteen():\r\n \r\n numbers = [37107287533902102798797998220837590246510135740250,\r\n 46376937677490009712648124896970078050417018260538,\r\n 74324986199524741059474233309513058123726617309629,\r\n 91942213363574161572522430563301811072406154908250,\r\n 23067588207539346171171980310421047513778063246676,\r\n 89261670696623633820136378418383684178734361726757,\r\n 28112879812849979408065481931592621691275889832738,\r\n 44274228917432520321923589422876796487670272189318,\r\n 47451445736001306439091167216856844588711603153276,\r\n 70386486105843025439939619828917593665686757934951,\r\n 62176457141856560629502157223196586755079324193331,\r\n 64906352462741904929101432445813822663347944758178,\r\n 92575867718337217661963751590579239728245598838407,\r\n 58203565325359399008402633568948830189458628227828,\r\n 80181199384826282014278194139940567587151170094390,\r\n 35398664372827112653829987240784473053190104293586,\r\n 86515506006295864861532075273371959191420517255829,\r\n 71693888707715466499115593487603532921714970056938,\r\n 54370070576826684624621495650076471787294438377604,\r\n 53282654108756828443191190634694037855217779295145,\r\n 36123272525000296071075082563815656710885258350721,\r\n 45876576172410976447339110607218265236877223636045,\r\n 17423706905851860660448207621209813287860733969412,\r\n 81142660418086830619328460811191061556940512689692,\r\n 51934325451728388641918047049293215058642563049483,\r\n 62467221648435076201727918039944693004732956340691,\r\n 15732444386908125794514089057706229429197107928209,\r\n 55037687525678773091862540744969844508330393682126,\r\n 18336384825330154686196124348767681297534375946515,\r\n 80386287592878490201521685554828717201219257766954,\r\n 78182833757993103614740356856449095527097864797581,\r\n 16726320100436897842553539920931837441497806860984,\r\n 48403098129077791799088218795327364475675590848030,\r\n 87086987551392711854517078544161852424320693150332,\r\n 59959406895756536782107074926966537676326235447210,\r\n 69793950679652694742597709739166693763042633987085,\r\n 41052684708299085211399427365734116182760315001271,\r\n 65378607361501080857009149939512557028198746004375,\r\n 35829035317434717326932123578154982629742552737307,\r\n 94953759765105305946966067683156574377167401875275,\r\n 88902802571733229619176668713819931811048770190271,\r\n 25267680276078003013678680992525463401061632866526,\r\n 36270218540497705585629946580636237993140746255962,\r\n 24074486908231174977792365466257246923322810917141,\r\n 91430288197103288597806669760892938638285025333403,\r\n 34413065578016127815921815005561868836468420090470,\r\n 23053081172816430487623791969842487255036638784583,\r\n 11487696932154902810424020138335124462181441773470,\r\n 63783299490636259666498587618221225225512486764533,\r\n 67720186971698544312419572409913959008952310058822,\r\n 95548255300263520781532296796249481641953868218774,\r\n 76085327132285723110424803456124867697064507995236,\r\n 37774242535411291684276865538926205024910326572967,\r\n 23701913275725675285653248258265463092207058596522,\r\n 29798860272258331913126375147341994889534765745501,\r\n 18495701454879288984856827726077713721403798879715,\r\n 38298203783031473527721580348144513491373226651381,\r\n 34829543829199918180278916522431027392251122869539,\r\n 40957953066405232632538044100059654939159879593635,\r\n 29746152185502371307642255121183693803580388584903,\r\n 41698116222072977186158236678424689157993532961922,\r\n 62467957194401269043877107275048102390895523597457,\r\n 23189706772547915061505504953922979530901129967519,\r\n 86188088225875314529584099251203829009407770775672,\r\n 11306739708304724483816533873502340845647058077308,\r\n 82959174767140363198008187129011875491310547126581,\r\n 97623331044818386269515456334926366572897563400500,\r\n 42846280183517070527831839425882145521227251250327,\r\n 55121603546981200581762165212827652751691296897789,\r\n 32238195734329339946437501907836945765883352399886,\r\n 75506164965184775180738168837861091527357929701337,\r\n 62177842752192623401942399639168044983993173312731,\r\n 32924185707147349566916674687634660915035914677504,\r\n 99518671430235219628894890102423325116913619626622,\r\n 73267460800591547471830798392868535206946944540724,\r\n 76841822524674417161514036427982273348055556214818,\r\n 97142617910342598647204516893989422179826088076852,\r\n 87783646182799346313767754307809363333018982642090,\r\n 10848802521674670883215120185883543223812876952786,\r\n 71329612474782464538636993009049310363619763878039,\r\n 62184073572399794223406235393808339651327408011116,\r\n 66627891981488087797941876876144230030984490851411,\r\n 60661826293682836764744779239180335110989069790714,\r\n 85786944089552990653640447425576083659976645795096,\r\n 66024396409905389607120198219976047599490197230297,\r\n 64913982680032973156037120041377903785566085089252,\r\n 16730939319872750275468906903707539413042652315011,\r\n 94809377245048795150954100921645863754710598436791,\r\n 78639167021187492431995700641917969777599028300699,\r\n 15368713711936614952811305876380278410754449733078,\r\n 40789923115535562561142322423255033685442488917353,\r\n 44889911501440648020369068063960672322193204149535,\r\n 41503128880339536053299340368006977710650566631954,\r\n 81234880673210146739058568557934581403627822703280,\r\n 82616570773948327592232845941706525094512325230608,\r\n 22918802058777319719839450180888072429661980811197,\r\n 77158542502016545090413245809786882778948721859617,\r\n 72107838435069186155435662884062257473692284509516,\r\n 20849603980134001723930671666823555245252804609722,\r\n 53503534226472524250874054075591789781264330331690]\r\n \r\n sum = 0\r\n \r\n for n in numbers:\r\n sum += n\r\n \r\n return int(str(sum)[:10])","def test_setnumber(self):\n convert1 = cnv()\n\n convert1.setnum('einhundertdreiundzwanzig')\n self.assertEqual(convert1.numstring, 'einhundertdreiundzwanzig')","def test_big_numbers(self):\n arr, result = [535555555555, 5500000000000000000000000,\n 10, 15, 35, 0, -2, -67, -55], []\n fizz_buzz(arr, result)\n self.assertEqual(result, ['fizz', 'fizz', 'fizz', 'fizzbuzz',\n 'fizz', 'fizzbuzz', -2, -67, 'fizz'])","def getNumber():","def test_numbers(number):\n assert number ** 2 == number ** 2","def solve(number):\n if number == 0:\n return \"INSOMNIA\"\n else:\n total_digits = 10 # there are 10 digits [0-9]\n digits_seen = set()\n multiplier = 0\n while len(digits_seen) < total_digits:\n multiplier += 1\n digits_in_n = {int(i) for i in str(multiplier*number)}\n digits_seen = digits_seen.union(digits_in_n)\n return multiplier*number","def test_build_number(converted_tests):\n submission = SubmissionBuilder(\"t\", \"b\", converted_tests).build()\n assert submission.get(\"number\") == \"b\", submission","def test_anglicize1000():\n print('Testing anglicize1000')\n\n result = funcs.anglicize1000(1)\n introcs.assert_equals(\"one\", result)\n\n result = funcs.anglicize1000(19)\n introcs.assert_equals(\"nineteen\", result)\n\n result = funcs.anglicize1000(20)\n introcs.assert_equals(\"twenty\", result)\n\n result = funcs.anglicize1000(35)\n introcs.assert_equals(\"thirty five\", result)\n\n result = funcs.anglicize1000(50)\n introcs.assert_equals(\"fifty\", result)\n\n result = funcs.anglicize1000(99)\n introcs.assert_equals(\"ninety nine\", result)\n\n result = funcs.anglicize1000(100)\n introcs.assert_equals(\"one hundred\", result)\n\n result = funcs.anglicize1000(301)\n introcs.assert_equals(\"three hundred one\", result)\n\n result = funcs.anglicize1000(999)\n introcs.assert_equals(\"nine hundred ninety nine\", result)","def numbers2words():\n\tmy_num = None\n\twhile my_num != \"0\":\n\t\tmy_num = input(\"Please enter a number greater than 0 and less than 1 trillion: \")\n\t\tprint(name_num(int(my_num.replace(\",\",\"\"))))","def test_add_numbers(self):\n self.assertEqual(addNums(3, 8), 11)","def test_non_numberic_validation(self):","def test_non_numberic_validation(self):","def multiply_numbers(first_number, second_number):","def test_ok_mm_primer(self):\r\n primers = ['AAAA', 'GGGG']\r\n self.assertEqual(ok_mm_primer('AAAA', primers, 0), True)\r\n self.assertEqual(ok_mm_primer('AAAA', primers, 3), True)\r\n self.assertEqual(ok_mm_primer('CCCC', primers, 0), False)\r\n self.assertEqual(ok_mm_primer('CCCA', primers, 3), True)\r\n self.assertEqual(ok_mm_primer('CCCA', primers, 2), False)\r\n self.assertEqual(ok_mm_primer('CCGG', primers, 2), True)\r\n self.assertEqual(ok_mm_primer('CCGA', primers, 2), False)","def test_converter_number_system(self):\n \n input_values = [0,0,2,'97']\n\n output = []\n expected_result = \"Result: 97 Dec equals to 61 Hex\"\n\n def mock_input(s):\n output.append(s)\n return input_values.pop(0)\n\n mp2.input = mock_input\n mp2.print = lambda s:output.append(s)\n mp2.main()\n self.assertEqual(output[-1],expected_result)","def test_number(self):\n\n tokens = list(Lexer(\"123 123.456 .456 .123 .\").generate_tokens())\n answer = [Token(TokenType.NUMBER, 123),\n Token(TokenType.NUMBER, 123.456),\n Token(TokenType.NUMBER, 0.456),\n Token(TokenType.NUMBER, 0.123),\n Token(TokenType.NUMBER, 0.0)]\n self.assertEqual(tokens, answer)","def evaluate_number(number : int)->int:\n if type(number) == int and number >1 and number < 100:\n num = total_numbers = porc = 0\n while porc < number:\n num = num + 1\n clasificate = is_bouncy(str(num))\n result = evaluate(clasificate , num)\n if result:\n total_numbers = total_numbers + 1\n porc = total_numbers * 100 / num\n return num\n return 0","def millify(n):\n if math.isnan(n):\n return n\n millnames = ['', ' K', ' M', ' B', ' T']\n n = float(n)\n millidx = max(0,min(len(millnames)-1,int(math.floor(0 if n == 0 else math.log10(abs(n))/3))))\n return '{:.2f}{}'.format(n / 10**(3 * millidx), millnames[millidx])","def test_domino_with_15_numbers():\n assert compute(15) == 56, \"Not ok\"","def test_get_digits():\n assert(get_digits(333) != (0, 0, 0))\n assert(get_digits(333) == (3, 3, 3))\n assert(get_digits(100) == (1, 0, 0))\n assert(get_digits(571) == (5, 7, 1))\n assert(get_digits(0) == (0, 0, 0))\n assert(get_digits(999) == (9, 9, 9))\n print(\"All unit tests passed\")","def test_hackerrank_sample2(self):\n result = find_digits(1012)\n self.assertEquals(result, 3)","def test_michaelis_menten_fit(self):\n res = michaelis_menten_fit([22])\n self.assertFloatEqual(res,1.0,eps=.01)\n res = michaelis_menten_fit([42])\n self.assertFloatEqual(res,1.0,eps=.01)\n res = michaelis_menten_fit([34],num_repeats=3,params_guess=[13,13])\n self.assertFloatEqual(res,1.0,eps=.01)\n res = michaelis_menten_fit([70,70],num_repeats=5)\n self.assertFloatEqual(res,2.0,eps=.01)","def eight():\r\n \r\n number = \"73167176531330624919225119674426574742355349194934\\\r\n96983520312774506326239578318016984801869478851843\\\r\n85861560789112949495459501737958331952853208805511\\\r\n12540698747158523863050715693290963295227443043557\\\r\n66896648950445244523161731856403098711121722383113\\\r\n62229893423380308135336276614282806444486645238749\\\r\n30358907296290491560440772390713810515859307960866\\\r\n70172427121883998797908792274921901699720888093776\\\r\n65727333001053367881220235421809751254540594752243\\\r\n52584907711670556013604839586446706324415722155397\\\r\n53697817977846174064955149290862569321978468622482\\\r\n83972241375657056057490261407972968652414535100474\\\r\n82166370484403199890008895243450658541227588666881\\\r\n16427171479924442928230863465674813919123162824586\\\r\n17866458359124566529476545682848912883142607690042\\\r\n24219022671055626321111109370544217506941658960408\\\r\n07198403850962455444362981230987879927244284909188\\\r\n84580156166097919133875499200524063689912560717606\\\r\n05886116467109405077541002256983155200055935729725\\\r\n71636269561882670428252483600823257530420752963450\"\r\n\r\n greatest = 0\r\n \r\n i = 0\r\n while i < len(number) - 12:\r\n product = 1\r\n for j in range(13):\r\n product *= int(number[i + j])\r\n #j += 1\r\n if product > greatest:\r\n greatest = product\r\n i += 1\r\n \r\n return greatest","def test01getNumber(self):\n self.assertEqual( calc.getNumber(), 1234 )","def mock_workers(task, num_workers):\n results = [\n [{\n \"name\": \"tweet\",\n \"value\": \"%d. Trump Trump everywhere not a Hillary to see.\" % x\n }] for x in range(num_workers)]\n return results","def main():\n result = 0\n for n in range(1, 1001):\n result += n**n\n\n result = str(result)\n answer = result[len(result)-10::]\n\n print \"answer: \" + answer","def prepare_numbers(numbers):\n \n numb = []\n for item in numbers:\n numb.append(int(item))\n return numb","def test_suite():\r\n test(num_even_digits(123456) == 3)\r\n test(num_even_digits(2468) == 4)\r\n test(num_even_digits(1357) == 0)\r\n test(num_even_digits(0) == 1)","def mccarthy_ninety_one(number):\n if number > 100:\n print('M(%d) since %d is greater than 100' % (number - 10, number))\n return number - 10\n else:\n print('M(M(%d)) since %d is less than or equal to 100' % (number + 11, number))\n return mccarthy_ninety_one(mccarthy_ninety_one(number + 11))","def numbers():\n for number in range(1, 76):\n yield number","def evaluate_my_number(guess, random_number):","def english(number):\r\n if number == 0:\r\n return 'zero'\r\n word = ''\r\n for step in itertools.count():\r\n number, rest = divmod(number, 1000)\r\n word = format_num(en3(rest), step) + word\r\n if number == 0:\r\n return word.strip()","def num_generator(num):\n\n num = str(num)\n if len(num) == 1:\n return '0'+num\n elif len(num) == 2:\n return num\n else:\n print('There was a problem with the number generator')","def millify(n, precision=0):\n millnames = [\"\", \" Thousand\", \" Million\", \" Billion\", \" Trillion\"]\n n = float(n)\n millidx = max(\n 0,\n min(\n len(millnames) - 1, int(math.floor(0 if n == 0 else math.log10(abs(n)) / 3))\n ),\n )\n if precision == 0:\n return \"{:.0f}{}\".format(n / 10 ** (3 * millidx), millnames[millidx])\n elif precision == 1:\n return \"{:.1f}{}\".format(n / 10 ** (3 * millidx), millnames[millidx])\n elif precision == 2:\n return \"{:.2f}{}\".format(n / 10 ** (3 * millidx), millnames[millidx])\n else:\n return \"{:.0f}{}\".format(n / 10 ** (3 * millidx), millnames[millidx])","def test_milsplit(self):\n convert5 = cnv()\n # normal case\n self.assertEqual(\n convert5.milsplit('einemilliondreihundertvierundzwanzigtausendsiebenhundertneunundachtzig'),\n 1324789)\n # case nothing behind\n self.assertEqual(convert5.milsplit('fünfundzwanzigmillionen'), 25000000)\n # case nothing in front\n self.assertEqual(convert5.milsplit('millionundzwei'), 1000002)\n # case nothing in front nothing behind\n self.assertEqual(convert5.milsplit('million'), 1000000)","def task_factorial():\n # set range of factorials here\n lo, hi = 0, 11\n user_digit = get_int(lo, hi) \n solution = n_factorial(user_digit) \n print(\"The factorial of %d is %d\" % (user_digit, solution))","def test_domino_with_9_numbers():\n assert compute(9) == 20, \"Not ok\"","def convert_to_numerals(number):\n assert number < 4000\n expression = factorize(int(number), ROMAN_NUMERALS)\n result = list(numeral(f) * c for c, f in normalize(expression))\n return \"\".join(result)","def run_numbers():\n if run_nos:\n # Get task names\n tasks = []\n for rn in dcm_dict.keys():\n tasks.append(dcm_dict[rn]['task_name'])\n # Assign run numbers\n for tsk in set(tasks):\n n_runs = sum(i == tsk for i in tasks)\n if n_runs == 1:\n for rn in dcm_dict.keys():\n if dcm_dict[rn]['task_name'] == tsk:\n # Add in the 'task' prefix required by BIDS format if missing from name\n if not tsk[0:4] == 'task':\n dcm_dict[rn]['out_name'] = 'task-'+tsk+'_run-01'\n else:\n dcm_dict[rn]['out_name'] = tsk+'_run-01'\n elif n_runs > 1:\n task_runs = []\n run_times = []\n for rn in dcm_dict.keys():\n if dcm_dict[rn]['task_name'] == tsk:\n task_runs.append(rn)\n run_times.append(dcm_dict[rn]['start_time'].timestamp())\n idx_order = sorted(range(len(run_times)), key=lambda k: run_times[k])\n for i in idx_order:\n if not tsk[0:4] == 'task':\n dcm_dict[task_runs[i]]['out_name'] = 'task-'+tsk+'_run-0'+str(i+1)\n else:\n dcm_dict[task_runs[i]]['out_name'] = tsk+'_run-0'+str(i+1)\n else:\n for rn in dcm_dict.keys():\n dcm_dict[rn]['out_name'] = dcm_dict[rn]['task_name']","def task4_add_repeatedly(num):\n while len(str(num)) != 1:\n num = sum([int(i) for i in str(num)])\n return num","def monotoneIncreasingDigits(N):\n sN = str(N)\n backn = 0\n res = []\n for i in range(len(sN)):\n if i == 0:\n res.append(sN[i])\n continue\n num = int(sN[i])\n lastn = int(sN[i-1])\n if num > lastn:\n res.append(sN[i])\n backn = 0\n elif num == lastn:\n res.append(sN[i])\n backn += 1\n else:\n if backn == 0:\n l = int(res.pop())\n res.append(str(l-1))\n else:\n for j in range(backn):\n res[i-j-1] = '9'\n res[i-backn-1] = str(int(res[i-backn-1])-1)\n for j in range(i, len(sN)):\n res.append('9')\n break\n res = int(''.join(res))\n return res","def worker(nums, outdict):\n print(threading.current_thread().name)\n print (\"pid:\", os.getpid())\n for n in nums:\n outdict[n] = factorize_naive(n)","def _replace_numbers(self, data_item):\n\t\tnumber_pattern = re.compile(\"\\d+,\\d+|\\d+\\.\\d+|\\d+|\\d+\\.\\d+%?|\\d+%?\")\n\t\tnums = []\n\t\tinput_seq = []\n\t\t\n\t\tword_tokens = data_item.problem.strip().split()\n\n\t\t# Looking for numbers.\n\t\tfor word_token in word_tokens:\n\t\t\tnumbers_match = re.search(number_pattern, word_token)\n\t\t\tif numbers_match is not None:\n\t\t\t\t# If there are digits in the token, we need to replace them.\n\t\t\t\tif numbers_match.start() > 0:\n\t\t\t\t\tinput_seq.append(word_token[:numbers_match.start()])\n\n\t\t\t\tnum = word_token[numbers_match.start(): numbers_match.end()]\n\n\t\t\t\tnums.append(num) #.replace(\",\", \"\"))\n\t\t\t\tinput_seq.append(DataProcessor.NUM_REPLACER)\n\t\t\t\tif numbers_match.end() < len(word_token):\n\t\t\t\t\tinput_seq.append(word_token[numbers_match.end():])\n\t\t\telse:\n\t\t\t\t# There are no digits in the token, we can safely append it to the input sequence.\n\t\t\t\tinput_seq.append(word_token)\n\n\t\treturn nums, input_seq","def multiply(numbers):\n \n result = numbers[0]\n for n in numbers[1:]:\n result = n * result\n return result","def transfer_nums(self, data, is_test=False):\n\t\tprint(\"Transfer numbers...\")\n\t\tskipped = 0\n\n\t\tpairs = []\n\t\tgenerate_nums = []\n\t\tgenerate_nums_dict = {}\n\t\tcopy_nums = 0\n\n\t\tfor data_item in data:\n\t\t\tskip = False\n\t\t\t# if data_item.no_expression:\n\t\t\t# \tskipped += 1\n\t\t\t# \tcontinue\n\n\t\t\tfor var_num in data_item.var_nums:\n\t\t\t\tif len(var_num) != 1:\n\t\t\t\t\tskip = True\n\t\t\tif skip:\n\t\t\t\tskipped += 1\n\t\t\t\tcontinue\n\n\t\t\tself.var_nums += data_item.var_nums\n\n\t\t\tnums, input_seq = self._replace_numbers(data_item)\n\n\t\t\tif copy_nums < len(nums):\n\t\t\t\tcopy_nums = len(nums)\n\n\t\t\tnums, nums_fraction = self._get_nums_from_fractions(nums)\n\n\t\t\tequations = data_item.equation\n\t\t\tdef seg_and_tag(st):\n\t\t\t\tres = []\n\t\t\t\tfor n in nums_fraction:\n\t\t\t\t\tif n in st:\n\t\t\t\t\t\tp_start = st.find(n)\n\t\t\t\t\t\tp_end = p_start + len(n)\n\t\t\t\t\t\tif p_start > 0:\n\t\t\t\t\t\t\tres += seg_and_tag(st[:p_start])\n\t\t\t\t\t\tif nums.count(n) == 1:\n\t\t\t\t\t\t\tres.append(\"N\"+str(nums.index(n)))\n\t\t\t\t\t\telif nums.count(n) > 1:\n\t\t\t\t\t\t\tres.append(\"N\"+str(nums.index(n)))\n\t\t\t\t\t\telse:\n\t\t\t\t\t\t\tres.append(n)\n\t\t\t\t\t\tif p_end < len(st):\n\t\t\t\t\t\t\tres += seg_and_tag(st[p_end:])\n\t\t\t\t\t\treturn res\n\n\t\t\t\tpos_st = re.search(\"\\d+\\.\\d+%?|\\d+%?\", st)\n\t\t\t\tif pos_st:\n\t\t\t\t\tp_start = pos_st.start()\n\t\t\t\t\tp_end = pos_st.end()\n\t\t\t\t\tif p_start > 0:\n\t\t\t\t\t\tres += seg_and_tag(st[:p_start])\n\t\t\t\t\tst_num = st[p_start:p_end]\n\t\t\t\t\tif nums.count(st_num) == 1:\n\t\t\t\t\t\tres.append(\"N\"+str(nums.index(st_num)))\n\t\t\t\t\telif nums.count(st_num) > 1:\n\t\t\t\t\t\tres.append(\"N\"+str(nums.index(st_num)))\n\t\t\t\t\telse:\n\t\t\t\t\t\tres.append(st_num)\n\t\t\t\t\tif p_end < len(st):\n\t\t\t\t\t\tres += seg_and_tag(st[p_end:])\n\t\t\t\t\treturn res\n\t\t\t\tfor ss in st:\n\t\t\t\t\tres.append(ss)\n\t\t\t\treturn res\n\n\t\t\ttry:\n\t\t\t\tout_seq = seg_and_tag(equations)\n\t\t\t\tnew_out_seq = []\n\t\t\t\tfor seq in out_seq:\n\t\t\t\t\tif seq == ' ' or seq == '':\n\t\t\t\t\t\tcontinue\n\t\t\t\t\tif seq == ';':\n\t\t\t\t\t\tnew_out_seq.append('SEP')\n\t\t\t\t\t\tcontinue\n\t\t\t\t\tnew_out_seq.append(seq)\n\t\t\t\tout_seq = new_out_seq\n\t\t\texcept:\n\t\t\t\tout_seq = data_item.solution\n\n\t\t\tfor s in out_seq: # tag the num which is generated\n\t\t\t\tif s[0].isdigit() and s not in generate_nums and s not in nums:\n\t\t\t\t\tgenerate_nums.append(s)\n\t\t\t\t\tgenerate_nums_dict[s] = 0\n\t\t\t\tif s in generate_nums and s not in nums:\n\t\t\t\t\tgenerate_nums_dict[s] = generate_nums_dict[s] + 1\n\n\n\t\t\tnum_pos = []\n\t\t\tgroup_nums = []\n\t\t\tfor i, token in enumerate(input_seq):\n\t\t\t\tif token == DataProcessor.NUM_REPLACER:\n\t\t\t\t\tnum_pos.append(i)\n\t\t\t\t\tif i > 0:\n\t\t\t\t\t\tgroup_nums.append(i - 1)\n\t\t\t\t\tgroup_nums.append(i)\n\t\t\t\t\tif i < len(input_seq) - 1:\n\t\t\t\t\t\tgroup_nums.append(i + 1)\n\n\t\t\tif len(nums) != len(num_pos):\n\t\t\t\tskipped += 1\n\t\t\t\tcontinue\n\n\t\t\tpairs.append(\n\t\t\t\tMATHBatchItem(\n\t\t\t\t\tinput_seq,\n\t\t\t\t\tout_seq,\n\t\t\t\t\tnums,\n\t\t\t\t\tnum_pos,\n\t\t\t\t\t[],\n\t\t\t\t\tgroup_nums,\n\t\t\t\t\tanswers=data_item.solution,\n\t\t\t\t\tfilename=data_item.filename,\n\t\t\t\t)\n\t\t\t)\n\n\t\ttemp_g = []\n\t\tfor g in generate_nums:\n\t\t\tif generate_nums_dict[g] >= 5:\n\t\t\t\ttemp_g.append(g)\n\n\t\tprint('Skipped in transfer_num ', skipped)\n\n\t\tself.var_nums = list(set(self.var_nums))\n\n\t\treturn pairs, temp_g, copy_nums","def numbers():\n return '<pre>' + '\\n'.join(phone_numbers) + '</pre>'","def compute(num):\n # 567 / 9 = 63, 235 / 47 = 5\n num = (num * 63 + 7492) * 5 - 498\n if num < 0: # modulus won't give correct result if number is negative\n num *= -1\n res = (num // 10) % 10\n return res","def test_string_to_number(doctest):\n assert doctest","def generate_msisdn(self, num):\n msisdn = []\n for _ in range(num):\n msisdn.append(self.fake.msisdn())\n return msisdn","def test_generation(self):\n generator = math_helpers.pentagonal_number_generator()\n first_ten_pentagonal_numbers = [next(generator) for _ in range(10)]\n canonical_values = [1, 5, 12, 22, 35, 51, 70, 92, 117, 145]\n self.assertEqual(canonical_values, first_ten_pentagonal_numbers)","def test_convertsent(self):\n convert6 = cnv()\n\n convert6.setnum(\"also haben wir hundertunddrei nein hundert 4 tausend\")\n self.assertEqual(convert6.getnum(), 104000)\n\n convert6.setnum(\"also ein haben wir hundertunddrei nein tausend\")\n self.assertEqual(convert6.getnum(), 1000)\n\n convert6.setnum(\" \")\n self.assertEqual(convert6.getnum(), 0)\n\n convert6.setnum(\"fünfundzwanzig\")\n self.assertEqual(convert6.getnum(), 25)\n\n convert6.setnum(\"albert ein\")\n self.assertEqual(convert6.getnum(), 1)","def test_tens():\n print('Testing tens')\n result = funcs.tens(2)\n introcs.assert_equals(\"twenty\", result)\n\n result = funcs.tens(3)\n introcs.assert_equals(\"thirty\", result)\n\n result = funcs.tens(4)\n introcs.assert_equals(\"forty\", result)\n\n result = funcs.tens(5)\n introcs.assert_equals(\"fifty\", result)\n\n result = funcs.tens(6)\n introcs.assert_equals(\"sixty\", result)\n\n result = funcs.tens(7)\n introcs.assert_equals(\"seventy\", result)\n\n result = funcs.tens(8)\n introcs.assert_equals(\"eighty\", result)\n\n result = funcs.tens(9)\n introcs.assert_equals(\"ninety\", result)","def fn(n):\n if not n: return []\n elif n < 20: return [mp[n]]\n elif n < 100: return [mp[n//10*10]] + fn(n%10)\n else: return [mp[n//100], \"Hundred\"] + fn(n%100)","def test_fixnum_special(doctest):","def SetMoneda(num, simbolo=\"US$\", n_decimales=2):\n #con abs, nos aseguramos que los dec. sea un positivo.\n n_decimales = abs(n_decimales)\n \n #se redondea a los decimales idicados.\n num = round(num, n_decimales)\n\n #se divide el entero del decimal y obtenemos los string\n num, dec = str(num).split(\".\")\n\n #si el num tiene menos decimales que los que se quieren mostrar,\n #se completan los faltantes con ceros.\n dec += \"0\" * (n_decimales - len(dec))\n \n #se invierte el num, para facilitar la adicion de comas.\n num = num[::-1]\n \n #se crea una lista con las cifras de miles como elementos.\n l = [num[pos:pos+3][::-1] for pos in range(0,50,3) if (num[pos:pos+3])]\n l.reverse()\n \n #se pasa la lista a string, uniendo sus elementos con comas.\n num = str.join(\",\", l)\n \n #si el numero es negativo, se quita una coma sobrante.\n try:\n if num[0:2] == \"-,\":\n num = \"-%s\" % num[2:]\n except IndexError:\n pass\n \n #si no se especifican decimales, se retorna un numero entero.\n if not n_decimales:\n return \"%s %s\" % (simbolo, num)\n \n return \"%s %s.%s\" % (simbolo, num, dec)","def sixteen():\r\n \r\n number = str(pow(2, 1000))\r\n sum = 0\r\n \r\n for i in number:\r\n sum += int(i)\r\n \r\n return sum","def lessthan_5(num_list):","def fn(n):\n digits = [int(x) for x in str(n)]\n for i in reversed(range(len(digits)//2+1)): \n if digits[i] < 9: break \n else: return 10*n + 11\n digits[i] = digits[~i] = digits[i] + 1\n for ii in range(i): \n digits[~ii] = digits[ii]\n for ii in range(i+1, len(digits)//2+1): \n digits[ii] = digits[~ii] = 0\n return int(\"\".join(map(str, digits)))","def multiplicaciones(): #906609 tiene que darme\n ultimo_palindromo = 0\n total = 0\n for primer_numero in range(100, 1000):\n for segundo_numero in range(100, 1000):\n #total se encarga de hacer la multiplicacion entre los numeros\n total = primer_numero * segundo_numero\n # llamamos a la funcion que verifica si la multiplicacion que envia es un palindromo\n if obtener_palindromo(total):\n #luego de verificar que la multiplicacion era palindromo pasamos a evaluarla hasta llegar al ultimo palindromo\n #entre 100 y 1000\n if ultimo_palindromo < total:\n ultimo_palindromo = total\n return ultimo_palindromo","def main():\r\n lst = list(map(int, list(str(NUMBER))))\r\n product = 0\r\n\r\n for i in range(len(lst)):\r\n\r\n if i + 13 >= len(lst):\r\n break\r\n\r\n thirteen = lst[i:i + 13]\r\n\r\n if prod(thirteen) > product:\r\n product = prod(thirteen)\r\n\r\n print(f'{\" × \".join(list(map(str, thirteen)))} = {product}')","def spelledout_numbers_to_numbers(self, s):\n\t\tnumbers_1to9 = 'one two three four five six seven eight nine'.split() \n\t\tmappings_1to9 = {t[0]: str(t[1]) \n\t\t\t\t\t\t\t for t in zip(numbers_1to9, range(1,10))}\n\t\t\n\t\tmappings_10to19 = {t[0]: str(t[1]) \n\t\t\t\t\t\t\t for t in zip(\"\"\"ten eleven twelve thirteen fourteen fifteen \n\t\t\t\t\t\t\t\t\t\t\t sixteen seventeen eighteen nineteen\"\"\".split(), range(10,20))}\n\t\t\n\t\tnumbers_20to90 = 'twenty thirty forty fifty sixty seventy eighty ninety'.split()\n\t\tmappings_20to90 = {t[0]: str(t[1]) \n\t\t\t\t\t\t\t for t in zip(numbers_20to90, range(20,100,10))}\n\t\t\n\t\t# produce numbers like twenty one, fifty seven, etc.\n\t\tnumbers_21to99 = [' '.join([s,p]) for s in numbers_20to90 for p in numbers_1to9]\n\t\t\n\t\t\"\"\"\n\t\tcreate an ordered dictionary mapping spelled numbers to numbers in\n\t\tdigits; note that the order is important because we want to search\n\t\tfor spelled numbers starting from the compound ones like twenty two,\n\t\tthen try to find the rest\n\t\t\"\"\"\n\t\t\n\t\tod = OrderedDict({t[0]:t[1] \n\t\t\t\t\t\t\tfor t in zip(numbers_21to99, \n\t\t\t\t\t\t\t\t\t\t # create a list [21,22,..,29,31,..,39,41,..,99]\n\t\t\t\t\t\t\t\t\t\t [_ for _ in chain.from_iterable([[str(_) for _ in range(int(d)*10 + 1,int(d+1)*10)] \n\t\t\t\t\t\t\t\t\t\t\t for d in range(2,10)])])})\n\t\tod.update(mappings_20to90)\n\t\tod.update(mappings_10to19)\n\t\tod.update(mappings_1to9)\n\t\t\n\t\tfor w_ in od:\n\t\t\t s = re.sub(r'\\b' + w_ + r'\\b', od[w_], s)\n\t\t\n\t\treturn s","def post_process(result):\n result = result.replace(' ', '')\n\n digits = re.findall('(\\d)', result)\n words = re.findall('(\\D+)', result)\n if digits:\n if len(digits) == NUM_OF_DIGITS:\n return ''.join(digits), SUCCESS_RATE ** len(digits)\n elif len(digits) < NUM_OF_DIGITS and words:\n try:\n digits_from_words = [replace_similar_sound(word) for word in words]\n for (i, (word, digit)) in enumerate(zip(words, digits_from_words)):\n if digit:\n digits.insert(result.index(word), digit)\n result = result.replace(word, digit)\n return ''.join(digits), SUCCESS_RATE ** len(digits)\n except Exception:\n pass\n return randomize_difference(digits, NUM_OF_DIGITS - len(digits))","def test_task559_eratosthenes(number, expected_value):\r\n assert algo.Task559.eratosthenes(number) == expected_value","def test_datetimenumber2mjd():\n\tdt = [datetime(1978,11,14),datetime(1988,4,22)]\n\tmjd_true = [43826,47273]\n\tmjd_test = date_functions.datetimenumber2mjd( dt )\n\n\tassert mjd_test[0] == mjd_true[0]\n\tassert mjd_test[1] == mjd_true[1]","def make_g_number():\n return fake.bothify(text='??#########')","def evalute_number(dialed):\n if (len(dialed) == 11 or len(dialed) == 10) and str(dialed).startswith(\"0\"):\n # UK Number\n return \"+44%s\" % (dialed[1:])\n elif len(dialed) == 6:\n # Local Fishguard numbers\n return \"+441348%s\" % (dialed)\n return None","def test_number_compare(self):\n self.assertEqual(functions.number_compare(1, 1), \"Numbers are equal\")\n self.assertEqual(functions.number_compare(1, 0), \"First is greater\")\n self.assertEqual(functions.number_compare(2, 4), \"Second is greater\")","async def number(self, ctx, number: int) -> None:\n number_user = self.bot.numbers.search.num_to_user(number)\n nation_and_countries = self.bot.numbers.checks.nation_and_countries(number)\n\n countries = \"\\n\".join([f\"• {country[0]}\" for country in nation_and_countries[\"countries\"]])\n await ctx.send(\n \"\",\n embed=NumEmbed(\n title=\"NGB - Number Search\",\n colour=0x00C9CC,\n fields={\n \"Number\": f\"#{number}\",\n \"Number User\": f\"u/{number_user}\" if number_user is not None else \"No One\" if number != 404 else \"Error 404\\nNot Found\",\n \"Nation\": nation_and_countries[\"nation\"][0],\n \"Odd/Even\": self.bot.numbers.checks.parity(number),\n \"Eligible Countries\": countries,\n },\n user=ctx.author,\n ),\n )","def TransformBase(base:int, number:list, digts:int) -> int :\n i = 0\n res = 0\n while ( i < digts):\n index = digts - i - 1\n number[index] = int(number[index]) * (base ** i) \n res += number[index]\n i += 1\n return res","def mul_numbers(a: int, b: int) -> int:\n return a * b","def test_generate_mine_sequence(self):\n mine_list = utils.generate_mine_sequence(1)\n self.assertEqual(len(mine_list), utils.MINE_COUNT)","def testFtoK(self):\r\n for integer, numeral in self.ftokvalues:\r\n result = conversions_refactored.convert('Fahrenheit', 'Kelvin', integer) \r\n self.assertEqual(numeral, result, msg='Incorrect result, calculation error')","def say_chunk(num):\n output_string_list = []\n num_string = str(num)\n\n units = ['zero', 'one', 'two', 'three', 'four', 'five',\n 'six', 'seven', 'eight', 'nine']\n teens = ['ten', 'eleven', 'twelve', 'thirteen', 'fourteen', 'fifteen',\n 'sixteen', 'seventeen', 'eighteen', 'nineteen']\n tens = ['twenty', 'thirty', 'forty', 'fifty', 'sixty', 'seventy', 'eighty', 'ninety']\n\n # singles\n if num < 10:\n output_string_list.append(units[num])\n\n # teens\n elif 10 <= num <= 19:\n output_string_list.append(teens[int(num) % 10])\n\n # tens\n elif 20 <= num <= 99:\n num_str = str(num)\n modifier = int(num_str[0])\n if int(num_str[1]):\n output_string_list.append(\"{}-{}\".format(tens[modifier - 2], units[int(num) % 10]))\n else:\n output_string_list.append(tens[modifier - 2])\n\n # hundreds\n elif 100 <= num <= 999:\n output_string_list.append(units[int(num_string[0])])\n output_string_list.append('hundred')\n\n num = int(num_string[1:])\n if num:\n output_string_list.append('and')\n num_string = str(num)\n modifier = int(num_string[0])\n\n if int(num_string[1]):\n output_string_list.append(\"{}-{}\".format(tens[modifier - 2], units[int(num_string[1:]) % 10]))\n else:\n output_string_list.append(tens[modifier - 2])\n\n return ' '.join(output_string_list)","def test_margalef(self):\n self.assertEqual(margalef(self.TestData), 8/log(22))","def SetMoneda(num, simbolo=\"$\", n_decimales=2):\n #con abs, nos aseguramos que los dec. sea un positivo.\n n_decimales = abs(n_decimales)\n\n #se redondea a los decimales idicados.\n num = round(num, n_decimales)\n\n #se divide el entero del decimal y obtenemos los string\n num, dec = str(num).split(\".\")\n\n #si el num tiene menos decimales que los que se quieren mostrar,\n #se completan los faltantes con ceros.\n dec += \"0\" * (n_decimales - len(dec))\n\n #se invierte el num, para facilitar la adicion de comas.\n num = num[::-1]\n\n #se crea una lista con las cifras de miles como elementos.\n l = [num[pos:pos+3][::-1] for pos in range(0,50,3) if (num[pos:pos+3])]\n l.reverse()\n\n #se pasa la lista a string, uniendo sus elementos con comas.\n num = str.join(\",\", l)\n\n #si el numero es negativo, se quita una coma sobrante.\n try:\n if num[0:2] == \"-,\":\n num = \"-%s\" % num[2:]\n except IndexError:\n pass\n\n #si no se especifican decimales, se retorna un numero entero.\n if not n_decimales:\n return \"%s %s\" % (simbolo, num)\n\n return \"%s %s.%s\" % (simbolo, num, dec)","def amstrong(num) :\r\n sum = 0\r\n temp = num\r\n order=len(str(num))\r\n while num > 0 :\r\n r = num % 10\r\n sum += r ** order\r\n num //= 10\r\n\r\n if sum == temp :\r\n print(f\"{sum} is Amstrong Number\")\r\n else :\r\n print(\"Number is not Amstrong Number\")","def is_armstrong_number(number: int) -> bool:\n result = 0\n num_str = str(number)\n for i in num_str:\n result += int(i) ** len(num_str)\n return result == number","def replace_million(text):\n for match in re.finditer(r'(£|\\$)([0-9]+(\\.|,))?[0-9]+(m|M) ', text):\n match_text = match.group(0)\n new_text = match_text.replace('m', ' million').replace('M', ' million')\n text = text.replace(match_text, new_text)\n for match in re.finditer(r'(£|\\$)([0-9]+(\\.|,))?[0-9]+( |-)(m|M) ', text):\n match_text = match.group(0)\n new_text = match_text.replace('m', 'million').replace('M', 'million')\n text = text.replace(match_text, new_text)\n return text","def create_phone_number(n):","def auto_number(tokens: List[TOKEN], local_dict: DICT, global_dict: DICT):\n result: List[TOKEN] = []\n\n for toknum, tokval in tokens:\n if toknum == NUMBER:\n number = tokval\n postfix = []\n\n if number.endswith(('j', 'J')):\n number = number[:-1]\n postfix = [(OP, '*'), (NAME, 'I')]\n\n if '.' in number or (('e' in number or 'E' in number) and\n not (number.startswith(('0x', '0X')))):\n seq = [(NAME, 'Float'), (OP, '('),\n (NUMBER, repr(str(number))), (OP, ')')]\n else:\n seq = [(NAME, 'Integer'), (OP, '('), (\n NUMBER, number), (OP, ')')]\n\n result.extend(seq + postfix)\n else:\n result.append((toknum, tokval))\n\n return result","def mod(numbers):\n result = numbers[0]\n for i in numbers[1:]:\n result = result % i\n return result","def _extract_whole_number_with_text_nl(tokens, short_scale, ordinals):\n multiplies, string_num_ordinal, string_num_scale = \\\n _initialize_number_data_nl(short_scale)\n\n number_words = [] # type: [Token]\n val = False\n prev_val = None\n next_val = None\n to_sum = []\n for idx, token in enumerate(tokens):\n current_val = None\n if next_val:\n next_val = None\n continue\n\n word = token.word\n if word in _ARTICLES_NL or word in _NEGATIVES_NL:\n number_words.append(token)\n continue\n\n prev_word = tokens[idx - 1].word if idx > 0 else \"\"\n next_word = tokens[idx + 1].word if idx + 1 < len(tokens) else \"\"\n\n if word not in string_num_scale and \\\n word not in _STRING_NUM_NL and \\\n word not in _SUMS_NL and \\\n word not in multiplies and \\\n not (ordinals and word in string_num_ordinal) and \\\n not is_numeric(word) and \\\n not is_fractional_nl(word, short_scale=short_scale) and \\\n not look_for_fractions(word.split('/')):\n words_only = [token.word for token in number_words]\n if number_words and not all([w in _ARTICLES_NL |\n _NEGATIVES_NL for w in words_only]):\n break\n else:\n number_words = []\n continue\n elif word not in multiplies \\\n and prev_word not in multiplies \\\n and prev_word not in _SUMS_NL \\\n and not (ordinals and prev_word in string_num_ordinal) \\\n and prev_word not in _NEGATIVES_NL \\\n and prev_word not in _ARTICLES_NL:\n number_words = [token]\n elif prev_word in _SUMS_NL and word in _SUMS_NL:\n number_words = [token]\n else:\n number_words.append(token)\n\n # is this word already a number ?\n if is_numeric(word):\n if word.isdigit(): # doesn't work with decimals\n val = int(word)\n else:\n val = float(word)\n current_val = val\n\n # is this word the name of a number ?\n if word in _STRING_NUM_NL:\n val = _STRING_NUM_NL.get(word)\n current_val = val\n elif word in string_num_scale:\n val = string_num_scale.get(word)\n current_val = val\n elif ordinals and word in string_num_ordinal:\n val = string_num_ordinal[word]\n current_val = val\n\n # is the prev word an ordinal number and current word is one?\n # second one, third one\n if ordinals and prev_word in string_num_ordinal and val == 1:\n val = prev_val\n\n # is the prev word a number and should we sum it?\n # twenty two, fifty six\n if prev_word in _SUMS_NL and val and val < 10:\n val = prev_val + val\n\n # is the prev word a number and should we multiply it?\n # twenty hundred, six hundred\n if word in multiplies:\n if not prev_val:\n prev_val = 1\n val = prev_val * val\n\n # is this a spoken fraction?\n # half cup\n if val is False:\n val = is_fractional_nl(word, short_scale=short_scale)\n current_val = val\n\n # 2 fifths\n if not ordinals:\n next_val = is_fractional_nl(next_word, short_scale=short_scale)\n if next_val:\n if not val:\n val = 1\n val = val * next_val\n number_words.append(tokens[idx + 1])\n\n # is this a negative number?\n if val and prev_word and prev_word in _NEGATIVES_NL:\n val = 0 - val\n\n # let's make sure it isn't a fraction\n if not val:\n # look for fractions like \"2/3\"\n aPieces = word.split('/')\n if look_for_fractions(aPieces):\n val = float(aPieces[0]) / float(aPieces[1])\n current_val = val\n\n else:\n if prev_word in _SUMS_NL and word not in _SUMS_NL and current_val >= 10:\n # Backtrack - we've got numbers we can't sum.\n number_words.pop()\n val = prev_val\n break\n prev_val = val\n\n # handle long numbers\n # six hundred sixty six\n # two million five hundred thousand\n if word in multiplies and next_word not in multiplies:\n to_sum.append(val)\n val = 0\n prev_val = 0\n\n if val is not None and to_sum:\n val += sum(to_sum)\n\n return val, number_words","def test_convert_amounts(self):\n pass","def _digits(self, num):\n digits = str(num)\n for digit in digits:\n yield int(digit)","def _replace_numbers(words):\n p = inflect.engine()\n new_words = []\n for word in words:\n if word.isdigit():\n try:\n new_word = p.number_to_words(word)\n new_words.append(new_word)\n except:\n pass\n else:\n new_words.append(word)\n return new_words","def test_address__normalize_phone_number__1():\n assert '+491234567890' == normalize_phone_number('+491234567890', '+49')","def prjEuler():\r\n #Constants\r\n NUMSTRING = ( \"73167176531330624919225119674426574742355349194934\"\r\n \"96983520312774506326239578318016984801869478851843\"\r\n \"85861560789112949495459501737958331952853208805511\"\r\n \"12540698747158523863050715693290963295227443043557\"\r\n \"66896648950445244523161731856403098711121722383113\"\r\n \"62229893423380308135336276614282806444486645238749\"\r\n \"30358907296290491560440772390713810515859307960866\"\r\n \"70172427121883998797908792274921901699720888093776\"\r\n \"65727333001053367881220235421809751254540594752243\"\r\n \"52584907711670556013604839586446706324415722155397\"\r\n \"53697817977846174064955149290862569321978468622482\"\r\n \"83972241375657056057490261407972968652414535100474\"\r\n \"82166370484403199890008895243450658541227588666881\"\r\n \"16427171479924442928230863465674813919123162824586\"\r\n \"17866458359124566529476545682848912883142607690042\"\r\n \"24219022671055626321111109370544217506941658960408\"\r\n \"07198403850962455444362981230987879927244284909188\"\r\n \"84580156166097919133875499200524063689912560717606\"\r\n \"05886116467109405077541002256983155200055935729725\"\r\n \"71636269561882670428252483600823257530420752963450\" )\r\n \r\n #defined items\r\n greatest_prod = 1\r\n euler_queue = fiveQueue()\r\n \r\n #code\r\n for numIter in NUMSTRING:\r\n if( euler_queue.push( numIter ) ):\r\n temp_prod = euler_queue.product()\r\n if( temp_prod > greatest_prod ):\r\n greatest_prod = temp_prod\r\n \r\n print \"The greatest product is %d\" % greatest_prod\r\n return"],"string":"[\n \"def test_numbers(number):\\n print(\\\"\\\\nRunning test_numbers with {}\\\".format(number))\",\n \"def test_numbers(self):\\n \\n result = gen_expansion(sym.pi, 2)\\n self.assertEqual(result, '14')\\n result = gen_expansion(sym.exp(1), 2)\\n self.assertEqual(result, '72')\",\n \"def test_anglicize100to999():\\n print('Testing anglicize100to999')\\n\\n result = funcs.anglicize100to999(100)\\n introcs.assert_equals(\\\"one hundred\\\", result)\\n\\n result = funcs.anglicize100to999(301)\\n introcs.assert_equals(\\\"three hundred one\\\", result)\\n\\n result = funcs.anglicize100to999(999)\\n introcs.assert_equals(\\\"nine hundred ninety nine\\\", result)\",\n \"def getMantisse(number):\\n mantisse = number / np.power(10, np.floor(np.log10(number)))\\n return(mantisse)\",\n \"def rabin_miller(n, target=128):\\n ###############\\n ## Start your code here\\n return True\\n ## End of your code\\n ###############\",\n \"def numerize():\\n pass\",\n \"def demo_a_number(random_number):\",\n \"def test_inverse(self):\\n from sosbeacon.utils import number_decode\\n from sosbeacon.utils import number_encode\\n\\n for number in range(0, 500000, 339):\\n encoded = number_encode(number)\\n decoded = number_decode(encoded)\\n self.assertEqual(number, decoded)\",\n \"def test_hackerrank_sample1(self):\\n result = find_digits(12)\\n self.assertEquals(result, 2)\",\n \"def run_suite():\\n\\n # test case 54\\n twilio.run(\\\"+528451020032\\\", \\\"+12074264782\\\")\\n # test case 55\\n twilio.run(\\\"+528451020032\\\", \\\"+12074264782\\\")\\n # test case 58\\n twilio.run(\\\"+528451020031\\\", \\\"+12074264782\\\")\\n # test case 59\\n twilio.run(\\\"+528451020032\\\", \\\"+12074264781\\\")\\n # test case 62\\n twilio.run(\\\"+528451020032\\\", \\\"\\\")\\n # test case 63\\n twilio.run(\\\"\\\", \\\"+12074264782\\\")\\n # test case 64\\n twilio.run(\\\"\\\", \\\"\\\")\\n # test case 65\\n twilio.run(\\\"+528461043690\\\", \\\"+12074264782\\\")\\n # test case 68\\n twilio.run(\\\"+528451020032\\\", \\\"+12074264782\\\")\\n # test case 69\\n twilio.run(\\\"+528451020032\\\", \\\"+12074264782\\\")\\n # test case 70\\n twilio.run(\\\"+528451020032\\\", \\\"+12074264782\\\")\\n # test case 75\\n twilio.run(\\\"+524494934471\\\", \\\"+12074264782\\\")\\n # test case 76\\n twilio.run(\\\"+524494934471\\\", \\\"+12074264782\\\")\\n # test case 79\\n twilio.run(\\\"+524494934473\\\", \\\"+12074264782\\\")\\n # test case 80\\n twilio.run(\\\"+524494934471\\\", \\\"+12074264781\\\")\\n # test case 83\\n twilio.run(\\\"+524494934471\\\", \\\"\\\")\\n # test case 84\\n twilio.run(\\\"\\\", \\\"+12074264782\\\")\\n # test case 85\\n twilio.run(\\\"\\\", \\\"\\\")\\n # test case 86\\n twilio.run(\\\"+528451020323\\\", \\\"+12074264782\\\")\\n # test case 89\\n twilio.run(\\\"+524494934471\\\", \\\"+12074264782\\\")\\n # test case 90\\n twilio.run(\\\"+524494934471\\\", \\\"+12074264782\\\")\\n # test case 91\\n twilio.run(\\\"+524494934471\\\", \\\"+12074264782\\\")\",\n \"def test_number_to_string(doctest):\",\n \"def test_getnumber(self):\\n convert = cnv()\\n\\n convert.setnum('einhundertdreiundzwanzig')\\n self.assertEqual(convert.getnum(), 123)\",\n \"def test_convert_word_with_numbers():\\n for word in [\\\"1\\\", \\\"a1\\\", \\\"1a\\\"]:\\n assert convert(word) == word\",\n \"def thirteen():\\r\\n \\r\\n numbers = [37107287533902102798797998220837590246510135740250,\\r\\n 46376937677490009712648124896970078050417018260538,\\r\\n 74324986199524741059474233309513058123726617309629,\\r\\n 91942213363574161572522430563301811072406154908250,\\r\\n 23067588207539346171171980310421047513778063246676,\\r\\n 89261670696623633820136378418383684178734361726757,\\r\\n 28112879812849979408065481931592621691275889832738,\\r\\n 44274228917432520321923589422876796487670272189318,\\r\\n 47451445736001306439091167216856844588711603153276,\\r\\n 70386486105843025439939619828917593665686757934951,\\r\\n 62176457141856560629502157223196586755079324193331,\\r\\n 64906352462741904929101432445813822663347944758178,\\r\\n 92575867718337217661963751590579239728245598838407,\\r\\n 58203565325359399008402633568948830189458628227828,\\r\\n 80181199384826282014278194139940567587151170094390,\\r\\n 35398664372827112653829987240784473053190104293586,\\r\\n 86515506006295864861532075273371959191420517255829,\\r\\n 71693888707715466499115593487603532921714970056938,\\r\\n 54370070576826684624621495650076471787294438377604,\\r\\n 53282654108756828443191190634694037855217779295145,\\r\\n 36123272525000296071075082563815656710885258350721,\\r\\n 45876576172410976447339110607218265236877223636045,\\r\\n 17423706905851860660448207621209813287860733969412,\\r\\n 81142660418086830619328460811191061556940512689692,\\r\\n 51934325451728388641918047049293215058642563049483,\\r\\n 62467221648435076201727918039944693004732956340691,\\r\\n 15732444386908125794514089057706229429197107928209,\\r\\n 55037687525678773091862540744969844508330393682126,\\r\\n 18336384825330154686196124348767681297534375946515,\\r\\n 80386287592878490201521685554828717201219257766954,\\r\\n 78182833757993103614740356856449095527097864797581,\\r\\n 16726320100436897842553539920931837441497806860984,\\r\\n 48403098129077791799088218795327364475675590848030,\\r\\n 87086987551392711854517078544161852424320693150332,\\r\\n 59959406895756536782107074926966537676326235447210,\\r\\n 69793950679652694742597709739166693763042633987085,\\r\\n 41052684708299085211399427365734116182760315001271,\\r\\n 65378607361501080857009149939512557028198746004375,\\r\\n 35829035317434717326932123578154982629742552737307,\\r\\n 94953759765105305946966067683156574377167401875275,\\r\\n 88902802571733229619176668713819931811048770190271,\\r\\n 25267680276078003013678680992525463401061632866526,\\r\\n 36270218540497705585629946580636237993140746255962,\\r\\n 24074486908231174977792365466257246923322810917141,\\r\\n 91430288197103288597806669760892938638285025333403,\\r\\n 34413065578016127815921815005561868836468420090470,\\r\\n 23053081172816430487623791969842487255036638784583,\\r\\n 11487696932154902810424020138335124462181441773470,\\r\\n 63783299490636259666498587618221225225512486764533,\\r\\n 67720186971698544312419572409913959008952310058822,\\r\\n 95548255300263520781532296796249481641953868218774,\\r\\n 76085327132285723110424803456124867697064507995236,\\r\\n 37774242535411291684276865538926205024910326572967,\\r\\n 23701913275725675285653248258265463092207058596522,\\r\\n 29798860272258331913126375147341994889534765745501,\\r\\n 18495701454879288984856827726077713721403798879715,\\r\\n 38298203783031473527721580348144513491373226651381,\\r\\n 34829543829199918180278916522431027392251122869539,\\r\\n 40957953066405232632538044100059654939159879593635,\\r\\n 29746152185502371307642255121183693803580388584903,\\r\\n 41698116222072977186158236678424689157993532961922,\\r\\n 62467957194401269043877107275048102390895523597457,\\r\\n 23189706772547915061505504953922979530901129967519,\\r\\n 86188088225875314529584099251203829009407770775672,\\r\\n 11306739708304724483816533873502340845647058077308,\\r\\n 82959174767140363198008187129011875491310547126581,\\r\\n 97623331044818386269515456334926366572897563400500,\\r\\n 42846280183517070527831839425882145521227251250327,\\r\\n 55121603546981200581762165212827652751691296897789,\\r\\n 32238195734329339946437501907836945765883352399886,\\r\\n 75506164965184775180738168837861091527357929701337,\\r\\n 62177842752192623401942399639168044983993173312731,\\r\\n 32924185707147349566916674687634660915035914677504,\\r\\n 99518671430235219628894890102423325116913619626622,\\r\\n 73267460800591547471830798392868535206946944540724,\\r\\n 76841822524674417161514036427982273348055556214818,\\r\\n 97142617910342598647204516893989422179826088076852,\\r\\n 87783646182799346313767754307809363333018982642090,\\r\\n 10848802521674670883215120185883543223812876952786,\\r\\n 71329612474782464538636993009049310363619763878039,\\r\\n 62184073572399794223406235393808339651327408011116,\\r\\n 66627891981488087797941876876144230030984490851411,\\r\\n 60661826293682836764744779239180335110989069790714,\\r\\n 85786944089552990653640447425576083659976645795096,\\r\\n 66024396409905389607120198219976047599490197230297,\\r\\n 64913982680032973156037120041377903785566085089252,\\r\\n 16730939319872750275468906903707539413042652315011,\\r\\n 94809377245048795150954100921645863754710598436791,\\r\\n 78639167021187492431995700641917969777599028300699,\\r\\n 15368713711936614952811305876380278410754449733078,\\r\\n 40789923115535562561142322423255033685442488917353,\\r\\n 44889911501440648020369068063960672322193204149535,\\r\\n 41503128880339536053299340368006977710650566631954,\\r\\n 81234880673210146739058568557934581403627822703280,\\r\\n 82616570773948327592232845941706525094512325230608,\\r\\n 22918802058777319719839450180888072429661980811197,\\r\\n 77158542502016545090413245809786882778948721859617,\\r\\n 72107838435069186155435662884062257473692284509516,\\r\\n 20849603980134001723930671666823555245252804609722,\\r\\n 53503534226472524250874054075591789781264330331690]\\r\\n \\r\\n sum = 0\\r\\n \\r\\n for n in numbers:\\r\\n sum += n\\r\\n \\r\\n return int(str(sum)[:10])\",\n \"def test_setnumber(self):\\n convert1 = cnv()\\n\\n convert1.setnum('einhundertdreiundzwanzig')\\n self.assertEqual(convert1.numstring, 'einhundertdreiundzwanzig')\",\n \"def test_big_numbers(self):\\n arr, result = [535555555555, 5500000000000000000000000,\\n 10, 15, 35, 0, -2, -67, -55], []\\n fizz_buzz(arr, result)\\n self.assertEqual(result, ['fizz', 'fizz', 'fizz', 'fizzbuzz',\\n 'fizz', 'fizzbuzz', -2, -67, 'fizz'])\",\n \"def getNumber():\",\n \"def test_numbers(number):\\n assert number ** 2 == number ** 2\",\n \"def solve(number):\\n if number == 0:\\n return \\\"INSOMNIA\\\"\\n else:\\n total_digits = 10 # there are 10 digits [0-9]\\n digits_seen = set()\\n multiplier = 0\\n while len(digits_seen) < total_digits:\\n multiplier += 1\\n digits_in_n = {int(i) for i in str(multiplier*number)}\\n digits_seen = digits_seen.union(digits_in_n)\\n return multiplier*number\",\n \"def test_build_number(converted_tests):\\n submission = SubmissionBuilder(\\\"t\\\", \\\"b\\\", converted_tests).build()\\n assert submission.get(\\\"number\\\") == \\\"b\\\", submission\",\n \"def test_anglicize1000():\\n print('Testing anglicize1000')\\n\\n result = funcs.anglicize1000(1)\\n introcs.assert_equals(\\\"one\\\", result)\\n\\n result = funcs.anglicize1000(19)\\n introcs.assert_equals(\\\"nineteen\\\", result)\\n\\n result = funcs.anglicize1000(20)\\n introcs.assert_equals(\\\"twenty\\\", result)\\n\\n result = funcs.anglicize1000(35)\\n introcs.assert_equals(\\\"thirty five\\\", result)\\n\\n result = funcs.anglicize1000(50)\\n introcs.assert_equals(\\\"fifty\\\", result)\\n\\n result = funcs.anglicize1000(99)\\n introcs.assert_equals(\\\"ninety nine\\\", result)\\n\\n result = funcs.anglicize1000(100)\\n introcs.assert_equals(\\\"one hundred\\\", result)\\n\\n result = funcs.anglicize1000(301)\\n introcs.assert_equals(\\\"three hundred one\\\", result)\\n\\n result = funcs.anglicize1000(999)\\n introcs.assert_equals(\\\"nine hundred ninety nine\\\", result)\",\n \"def numbers2words():\\n\\tmy_num = None\\n\\twhile my_num != \\\"0\\\":\\n\\t\\tmy_num = input(\\\"Please enter a number greater than 0 and less than 1 trillion: \\\")\\n\\t\\tprint(name_num(int(my_num.replace(\\\",\\\",\\\"\\\"))))\",\n \"def test_add_numbers(self):\\n self.assertEqual(addNums(3, 8), 11)\",\n \"def test_non_numberic_validation(self):\",\n \"def test_non_numberic_validation(self):\",\n \"def multiply_numbers(first_number, second_number):\",\n \"def test_ok_mm_primer(self):\\r\\n primers = ['AAAA', 'GGGG']\\r\\n self.assertEqual(ok_mm_primer('AAAA', primers, 0), True)\\r\\n self.assertEqual(ok_mm_primer('AAAA', primers, 3), True)\\r\\n self.assertEqual(ok_mm_primer('CCCC', primers, 0), False)\\r\\n self.assertEqual(ok_mm_primer('CCCA', primers, 3), True)\\r\\n self.assertEqual(ok_mm_primer('CCCA', primers, 2), False)\\r\\n self.assertEqual(ok_mm_primer('CCGG', primers, 2), True)\\r\\n self.assertEqual(ok_mm_primer('CCGA', primers, 2), False)\",\n \"def test_converter_number_system(self):\\n \\n input_values = [0,0,2,'97']\\n\\n output = []\\n expected_result = \\\"Result: 97 Dec equals to 61 Hex\\\"\\n\\n def mock_input(s):\\n output.append(s)\\n return input_values.pop(0)\\n\\n mp2.input = mock_input\\n mp2.print = lambda s:output.append(s)\\n mp2.main()\\n self.assertEqual(output[-1],expected_result)\",\n \"def test_number(self):\\n\\n tokens = list(Lexer(\\\"123 123.456 .456 .123 .\\\").generate_tokens())\\n answer = [Token(TokenType.NUMBER, 123),\\n Token(TokenType.NUMBER, 123.456),\\n Token(TokenType.NUMBER, 0.456),\\n Token(TokenType.NUMBER, 0.123),\\n Token(TokenType.NUMBER, 0.0)]\\n self.assertEqual(tokens, answer)\",\n \"def evaluate_number(number : int)->int:\\n if type(number) == int and number >1 and number < 100:\\n num = total_numbers = porc = 0\\n while porc < number:\\n num = num + 1\\n clasificate = is_bouncy(str(num))\\n result = evaluate(clasificate , num)\\n if result:\\n total_numbers = total_numbers + 1\\n porc = total_numbers * 100 / num\\n return num\\n return 0\",\n \"def millify(n):\\n if math.isnan(n):\\n return n\\n millnames = ['', ' K', ' M', ' B', ' T']\\n n = float(n)\\n millidx = max(0,min(len(millnames)-1,int(math.floor(0 if n == 0 else math.log10(abs(n))/3))))\\n return '{:.2f}{}'.format(n / 10**(3 * millidx), millnames[millidx])\",\n \"def test_domino_with_15_numbers():\\n assert compute(15) == 56, \\\"Not ok\\\"\",\n \"def test_get_digits():\\n assert(get_digits(333) != (0, 0, 0))\\n assert(get_digits(333) == (3, 3, 3))\\n assert(get_digits(100) == (1, 0, 0))\\n assert(get_digits(571) == (5, 7, 1))\\n assert(get_digits(0) == (0, 0, 0))\\n assert(get_digits(999) == (9, 9, 9))\\n print(\\\"All unit tests passed\\\")\",\n \"def test_hackerrank_sample2(self):\\n result = find_digits(1012)\\n self.assertEquals(result, 3)\",\n \"def test_michaelis_menten_fit(self):\\n res = michaelis_menten_fit([22])\\n self.assertFloatEqual(res,1.0,eps=.01)\\n res = michaelis_menten_fit([42])\\n self.assertFloatEqual(res,1.0,eps=.01)\\n res = michaelis_menten_fit([34],num_repeats=3,params_guess=[13,13])\\n self.assertFloatEqual(res,1.0,eps=.01)\\n res = michaelis_menten_fit([70,70],num_repeats=5)\\n self.assertFloatEqual(res,2.0,eps=.01)\",\n \"def eight():\\r\\n \\r\\n number = \\\"73167176531330624919225119674426574742355349194934\\\\\\r\\n96983520312774506326239578318016984801869478851843\\\\\\r\\n85861560789112949495459501737958331952853208805511\\\\\\r\\n12540698747158523863050715693290963295227443043557\\\\\\r\\n66896648950445244523161731856403098711121722383113\\\\\\r\\n62229893423380308135336276614282806444486645238749\\\\\\r\\n30358907296290491560440772390713810515859307960866\\\\\\r\\n70172427121883998797908792274921901699720888093776\\\\\\r\\n65727333001053367881220235421809751254540594752243\\\\\\r\\n52584907711670556013604839586446706324415722155397\\\\\\r\\n53697817977846174064955149290862569321978468622482\\\\\\r\\n83972241375657056057490261407972968652414535100474\\\\\\r\\n82166370484403199890008895243450658541227588666881\\\\\\r\\n16427171479924442928230863465674813919123162824586\\\\\\r\\n17866458359124566529476545682848912883142607690042\\\\\\r\\n24219022671055626321111109370544217506941658960408\\\\\\r\\n07198403850962455444362981230987879927244284909188\\\\\\r\\n84580156166097919133875499200524063689912560717606\\\\\\r\\n05886116467109405077541002256983155200055935729725\\\\\\r\\n71636269561882670428252483600823257530420752963450\\\"\\r\\n\\r\\n greatest = 0\\r\\n \\r\\n i = 0\\r\\n while i < len(number) - 12:\\r\\n product = 1\\r\\n for j in range(13):\\r\\n product *= int(number[i + j])\\r\\n #j += 1\\r\\n if product > greatest:\\r\\n greatest = product\\r\\n i += 1\\r\\n \\r\\n return greatest\",\n \"def test01getNumber(self):\\n self.assertEqual( calc.getNumber(), 1234 )\",\n \"def mock_workers(task, num_workers):\\n results = [\\n [{\\n \\\"name\\\": \\\"tweet\\\",\\n \\\"value\\\": \\\"%d. Trump Trump everywhere not a Hillary to see.\\\" % x\\n }] for x in range(num_workers)]\\n return results\",\n \"def main():\\n result = 0\\n for n in range(1, 1001):\\n result += n**n\\n\\n result = str(result)\\n answer = result[len(result)-10::]\\n\\n print \\\"answer: \\\" + answer\",\n \"def prepare_numbers(numbers):\\n \\n numb = []\\n for item in numbers:\\n numb.append(int(item))\\n return numb\",\n \"def test_suite():\\r\\n test(num_even_digits(123456) == 3)\\r\\n test(num_even_digits(2468) == 4)\\r\\n test(num_even_digits(1357) == 0)\\r\\n test(num_even_digits(0) == 1)\",\n \"def mccarthy_ninety_one(number):\\n if number > 100:\\n print('M(%d) since %d is greater than 100' % (number - 10, number))\\n return number - 10\\n else:\\n print('M(M(%d)) since %d is less than or equal to 100' % (number + 11, number))\\n return mccarthy_ninety_one(mccarthy_ninety_one(number + 11))\",\n \"def numbers():\\n for number in range(1, 76):\\n yield number\",\n \"def evaluate_my_number(guess, random_number):\",\n \"def english(number):\\r\\n if number == 0:\\r\\n return 'zero'\\r\\n word = ''\\r\\n for step in itertools.count():\\r\\n number, rest = divmod(number, 1000)\\r\\n word = format_num(en3(rest), step) + word\\r\\n if number == 0:\\r\\n return word.strip()\",\n \"def num_generator(num):\\n\\n num = str(num)\\n if len(num) == 1:\\n return '0'+num\\n elif len(num) == 2:\\n return num\\n else:\\n print('There was a problem with the number generator')\",\n \"def millify(n, precision=0):\\n millnames = [\\\"\\\", \\\" Thousand\\\", \\\" Million\\\", \\\" Billion\\\", \\\" Trillion\\\"]\\n n = float(n)\\n millidx = max(\\n 0,\\n min(\\n len(millnames) - 1, int(math.floor(0 if n == 0 else math.log10(abs(n)) / 3))\\n ),\\n )\\n if precision == 0:\\n return \\\"{:.0f}{}\\\".format(n / 10 ** (3 * millidx), millnames[millidx])\\n elif precision == 1:\\n return \\\"{:.1f}{}\\\".format(n / 10 ** (3 * millidx), millnames[millidx])\\n elif precision == 2:\\n return \\\"{:.2f}{}\\\".format(n / 10 ** (3 * millidx), millnames[millidx])\\n else:\\n return \\\"{:.0f}{}\\\".format(n / 10 ** (3 * millidx), millnames[millidx])\",\n \"def test_milsplit(self):\\n convert5 = cnv()\\n # normal case\\n self.assertEqual(\\n convert5.milsplit('einemilliondreihundertvierundzwanzigtausendsiebenhundertneunundachtzig'),\\n 1324789)\\n # case nothing behind\\n self.assertEqual(convert5.milsplit('fünfundzwanzigmillionen'), 25000000)\\n # case nothing in front\\n self.assertEqual(convert5.milsplit('millionundzwei'), 1000002)\\n # case nothing in front nothing behind\\n self.assertEqual(convert5.milsplit('million'), 1000000)\",\n \"def task_factorial():\\n # set range of factorials here\\n lo, hi = 0, 11\\n user_digit = get_int(lo, hi) \\n solution = n_factorial(user_digit) \\n print(\\\"The factorial of %d is %d\\\" % (user_digit, solution))\",\n \"def test_domino_with_9_numbers():\\n assert compute(9) == 20, \\\"Not ok\\\"\",\n \"def convert_to_numerals(number):\\n assert number < 4000\\n expression = factorize(int(number), ROMAN_NUMERALS)\\n result = list(numeral(f) * c for c, f in normalize(expression))\\n return \\\"\\\".join(result)\",\n \"def run_numbers():\\n if run_nos:\\n # Get task names\\n tasks = []\\n for rn in dcm_dict.keys():\\n tasks.append(dcm_dict[rn]['task_name'])\\n # Assign run numbers\\n for tsk in set(tasks):\\n n_runs = sum(i == tsk for i in tasks)\\n if n_runs == 1:\\n for rn in dcm_dict.keys():\\n if dcm_dict[rn]['task_name'] == tsk:\\n # Add in the 'task' prefix required by BIDS format if missing from name\\n if not tsk[0:4] == 'task':\\n dcm_dict[rn]['out_name'] = 'task-'+tsk+'_run-01'\\n else:\\n dcm_dict[rn]['out_name'] = tsk+'_run-01'\\n elif n_runs > 1:\\n task_runs = []\\n run_times = []\\n for rn in dcm_dict.keys():\\n if dcm_dict[rn]['task_name'] == tsk:\\n task_runs.append(rn)\\n run_times.append(dcm_dict[rn]['start_time'].timestamp())\\n idx_order = sorted(range(len(run_times)), key=lambda k: run_times[k])\\n for i in idx_order:\\n if not tsk[0:4] == 'task':\\n dcm_dict[task_runs[i]]['out_name'] = 'task-'+tsk+'_run-0'+str(i+1)\\n else:\\n dcm_dict[task_runs[i]]['out_name'] = tsk+'_run-0'+str(i+1)\\n else:\\n for rn in dcm_dict.keys():\\n dcm_dict[rn]['out_name'] = dcm_dict[rn]['task_name']\",\n \"def task4_add_repeatedly(num):\\n while len(str(num)) != 1:\\n num = sum([int(i) for i in str(num)])\\n return num\",\n \"def monotoneIncreasingDigits(N):\\n sN = str(N)\\n backn = 0\\n res = []\\n for i in range(len(sN)):\\n if i == 0:\\n res.append(sN[i])\\n continue\\n num = int(sN[i])\\n lastn = int(sN[i-1])\\n if num > lastn:\\n res.append(sN[i])\\n backn = 0\\n elif num == lastn:\\n res.append(sN[i])\\n backn += 1\\n else:\\n if backn == 0:\\n l = int(res.pop())\\n res.append(str(l-1))\\n else:\\n for j in range(backn):\\n res[i-j-1] = '9'\\n res[i-backn-1] = str(int(res[i-backn-1])-1)\\n for j in range(i, len(sN)):\\n res.append('9')\\n break\\n res = int(''.join(res))\\n return res\",\n \"def worker(nums, outdict):\\n print(threading.current_thread().name)\\n print (\\\"pid:\\\", os.getpid())\\n for n in nums:\\n outdict[n] = factorize_naive(n)\",\n \"def _replace_numbers(self, data_item):\\n\\t\\tnumber_pattern = re.compile(\\\"\\\\d+,\\\\d+|\\\\d+\\\\.\\\\d+|\\\\d+|\\\\d+\\\\.\\\\d+%?|\\\\d+%?\\\")\\n\\t\\tnums = []\\n\\t\\tinput_seq = []\\n\\t\\t\\n\\t\\tword_tokens = data_item.problem.strip().split()\\n\\n\\t\\t# Looking for numbers.\\n\\t\\tfor word_token in word_tokens:\\n\\t\\t\\tnumbers_match = re.search(number_pattern, word_token)\\n\\t\\t\\tif numbers_match is not None:\\n\\t\\t\\t\\t# If there are digits in the token, we need to replace them.\\n\\t\\t\\t\\tif numbers_match.start() > 0:\\n\\t\\t\\t\\t\\tinput_seq.append(word_token[:numbers_match.start()])\\n\\n\\t\\t\\t\\tnum = word_token[numbers_match.start(): numbers_match.end()]\\n\\n\\t\\t\\t\\tnums.append(num) #.replace(\\\",\\\", \\\"\\\"))\\n\\t\\t\\t\\tinput_seq.append(DataProcessor.NUM_REPLACER)\\n\\t\\t\\t\\tif numbers_match.end() < len(word_token):\\n\\t\\t\\t\\t\\tinput_seq.append(word_token[numbers_match.end():])\\n\\t\\t\\telse:\\n\\t\\t\\t\\t# There are no digits in the token, we can safely append it to the input sequence.\\n\\t\\t\\t\\tinput_seq.append(word_token)\\n\\n\\t\\treturn nums, input_seq\",\n \"def multiply(numbers):\\n \\n result = numbers[0]\\n for n in numbers[1:]:\\n result = n * result\\n return result\",\n \"def transfer_nums(self, data, is_test=False):\\n\\t\\tprint(\\\"Transfer numbers...\\\")\\n\\t\\tskipped = 0\\n\\n\\t\\tpairs = []\\n\\t\\tgenerate_nums = []\\n\\t\\tgenerate_nums_dict = {}\\n\\t\\tcopy_nums = 0\\n\\n\\t\\tfor data_item in data:\\n\\t\\t\\tskip = False\\n\\t\\t\\t# if data_item.no_expression:\\n\\t\\t\\t# \\tskipped += 1\\n\\t\\t\\t# \\tcontinue\\n\\n\\t\\t\\tfor var_num in data_item.var_nums:\\n\\t\\t\\t\\tif len(var_num) != 1:\\n\\t\\t\\t\\t\\tskip = True\\n\\t\\t\\tif skip:\\n\\t\\t\\t\\tskipped += 1\\n\\t\\t\\t\\tcontinue\\n\\n\\t\\t\\tself.var_nums += data_item.var_nums\\n\\n\\t\\t\\tnums, input_seq = self._replace_numbers(data_item)\\n\\n\\t\\t\\tif copy_nums < len(nums):\\n\\t\\t\\t\\tcopy_nums = len(nums)\\n\\n\\t\\t\\tnums, nums_fraction = self._get_nums_from_fractions(nums)\\n\\n\\t\\t\\tequations = data_item.equation\\n\\t\\t\\tdef seg_and_tag(st):\\n\\t\\t\\t\\tres = []\\n\\t\\t\\t\\tfor n in nums_fraction:\\n\\t\\t\\t\\t\\tif n in st:\\n\\t\\t\\t\\t\\t\\tp_start = st.find(n)\\n\\t\\t\\t\\t\\t\\tp_end = p_start + len(n)\\n\\t\\t\\t\\t\\t\\tif p_start > 0:\\n\\t\\t\\t\\t\\t\\t\\tres += seg_and_tag(st[:p_start])\\n\\t\\t\\t\\t\\t\\tif nums.count(n) == 1:\\n\\t\\t\\t\\t\\t\\t\\tres.append(\\\"N\\\"+str(nums.index(n)))\\n\\t\\t\\t\\t\\t\\telif nums.count(n) > 1:\\n\\t\\t\\t\\t\\t\\t\\tres.append(\\\"N\\\"+str(nums.index(n)))\\n\\t\\t\\t\\t\\t\\telse:\\n\\t\\t\\t\\t\\t\\t\\tres.append(n)\\n\\t\\t\\t\\t\\t\\tif p_end < len(st):\\n\\t\\t\\t\\t\\t\\t\\tres += seg_and_tag(st[p_end:])\\n\\t\\t\\t\\t\\t\\treturn res\\n\\n\\t\\t\\t\\tpos_st = re.search(\\\"\\\\d+\\\\.\\\\d+%?|\\\\d+%?\\\", st)\\n\\t\\t\\t\\tif pos_st:\\n\\t\\t\\t\\t\\tp_start = pos_st.start()\\n\\t\\t\\t\\t\\tp_end = pos_st.end()\\n\\t\\t\\t\\t\\tif p_start > 0:\\n\\t\\t\\t\\t\\t\\tres += seg_and_tag(st[:p_start])\\n\\t\\t\\t\\t\\tst_num = st[p_start:p_end]\\n\\t\\t\\t\\t\\tif nums.count(st_num) == 1:\\n\\t\\t\\t\\t\\t\\tres.append(\\\"N\\\"+str(nums.index(st_num)))\\n\\t\\t\\t\\t\\telif nums.count(st_num) > 1:\\n\\t\\t\\t\\t\\t\\tres.append(\\\"N\\\"+str(nums.index(st_num)))\\n\\t\\t\\t\\t\\telse:\\n\\t\\t\\t\\t\\t\\tres.append(st_num)\\n\\t\\t\\t\\t\\tif p_end < len(st):\\n\\t\\t\\t\\t\\t\\tres += seg_and_tag(st[p_end:])\\n\\t\\t\\t\\t\\treturn res\\n\\t\\t\\t\\tfor ss in st:\\n\\t\\t\\t\\t\\tres.append(ss)\\n\\t\\t\\t\\treturn res\\n\\n\\t\\t\\ttry:\\n\\t\\t\\t\\tout_seq = seg_and_tag(equations)\\n\\t\\t\\t\\tnew_out_seq = []\\n\\t\\t\\t\\tfor seq in out_seq:\\n\\t\\t\\t\\t\\tif seq == ' ' or seq == '':\\n\\t\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t\\tif seq == ';':\\n\\t\\t\\t\\t\\t\\tnew_out_seq.append('SEP')\\n\\t\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t\\tnew_out_seq.append(seq)\\n\\t\\t\\t\\tout_seq = new_out_seq\\n\\t\\t\\texcept:\\n\\t\\t\\t\\tout_seq = data_item.solution\\n\\n\\t\\t\\tfor s in out_seq: # tag the num which is generated\\n\\t\\t\\t\\tif s[0].isdigit() and s not in generate_nums and s not in nums:\\n\\t\\t\\t\\t\\tgenerate_nums.append(s)\\n\\t\\t\\t\\t\\tgenerate_nums_dict[s] = 0\\n\\t\\t\\t\\tif s in generate_nums and s not in nums:\\n\\t\\t\\t\\t\\tgenerate_nums_dict[s] = generate_nums_dict[s] + 1\\n\\n\\n\\t\\t\\tnum_pos = []\\n\\t\\t\\tgroup_nums = []\\n\\t\\t\\tfor i, token in enumerate(input_seq):\\n\\t\\t\\t\\tif token == DataProcessor.NUM_REPLACER:\\n\\t\\t\\t\\t\\tnum_pos.append(i)\\n\\t\\t\\t\\t\\tif i > 0:\\n\\t\\t\\t\\t\\t\\tgroup_nums.append(i - 1)\\n\\t\\t\\t\\t\\tgroup_nums.append(i)\\n\\t\\t\\t\\t\\tif i < len(input_seq) - 1:\\n\\t\\t\\t\\t\\t\\tgroup_nums.append(i + 1)\\n\\n\\t\\t\\tif len(nums) != len(num_pos):\\n\\t\\t\\t\\tskipped += 1\\n\\t\\t\\t\\tcontinue\\n\\n\\t\\t\\tpairs.append(\\n\\t\\t\\t\\tMATHBatchItem(\\n\\t\\t\\t\\t\\tinput_seq,\\n\\t\\t\\t\\t\\tout_seq,\\n\\t\\t\\t\\t\\tnums,\\n\\t\\t\\t\\t\\tnum_pos,\\n\\t\\t\\t\\t\\t[],\\n\\t\\t\\t\\t\\tgroup_nums,\\n\\t\\t\\t\\t\\tanswers=data_item.solution,\\n\\t\\t\\t\\t\\tfilename=data_item.filename,\\n\\t\\t\\t\\t)\\n\\t\\t\\t)\\n\\n\\t\\ttemp_g = []\\n\\t\\tfor g in generate_nums:\\n\\t\\t\\tif generate_nums_dict[g] >= 5:\\n\\t\\t\\t\\ttemp_g.append(g)\\n\\n\\t\\tprint('Skipped in transfer_num ', skipped)\\n\\n\\t\\tself.var_nums = list(set(self.var_nums))\\n\\n\\t\\treturn pairs, temp_g, copy_nums\",\n \"def numbers():\\n return '<pre>' + '\\\\n'.join(phone_numbers) + '</pre>'\",\n \"def compute(num):\\n # 567 / 9 = 63, 235 / 47 = 5\\n num = (num * 63 + 7492) * 5 - 498\\n if num < 0: # modulus won't give correct result if number is negative\\n num *= -1\\n res = (num // 10) % 10\\n return res\",\n \"def test_string_to_number(doctest):\\n assert doctest\",\n \"def generate_msisdn(self, num):\\n msisdn = []\\n for _ in range(num):\\n msisdn.append(self.fake.msisdn())\\n return msisdn\",\n \"def test_generation(self):\\n generator = math_helpers.pentagonal_number_generator()\\n first_ten_pentagonal_numbers = [next(generator) for _ in range(10)]\\n canonical_values = [1, 5, 12, 22, 35, 51, 70, 92, 117, 145]\\n self.assertEqual(canonical_values, first_ten_pentagonal_numbers)\",\n \"def test_convertsent(self):\\n convert6 = cnv()\\n\\n convert6.setnum(\\\"also haben wir hundertunddrei nein hundert 4 tausend\\\")\\n self.assertEqual(convert6.getnum(), 104000)\\n\\n convert6.setnum(\\\"also ein haben wir hundertunddrei nein tausend\\\")\\n self.assertEqual(convert6.getnum(), 1000)\\n\\n convert6.setnum(\\\" \\\")\\n self.assertEqual(convert6.getnum(), 0)\\n\\n convert6.setnum(\\\"fünfundzwanzig\\\")\\n self.assertEqual(convert6.getnum(), 25)\\n\\n convert6.setnum(\\\"albert ein\\\")\\n self.assertEqual(convert6.getnum(), 1)\",\n \"def test_tens():\\n print('Testing tens')\\n result = funcs.tens(2)\\n introcs.assert_equals(\\\"twenty\\\", result)\\n\\n result = funcs.tens(3)\\n introcs.assert_equals(\\\"thirty\\\", result)\\n\\n result = funcs.tens(4)\\n introcs.assert_equals(\\\"forty\\\", result)\\n\\n result = funcs.tens(5)\\n introcs.assert_equals(\\\"fifty\\\", result)\\n\\n result = funcs.tens(6)\\n introcs.assert_equals(\\\"sixty\\\", result)\\n\\n result = funcs.tens(7)\\n introcs.assert_equals(\\\"seventy\\\", result)\\n\\n result = funcs.tens(8)\\n introcs.assert_equals(\\\"eighty\\\", result)\\n\\n result = funcs.tens(9)\\n introcs.assert_equals(\\\"ninety\\\", result)\",\n \"def fn(n):\\n if not n: return []\\n elif n < 20: return [mp[n]]\\n elif n < 100: return [mp[n//10*10]] + fn(n%10)\\n else: return [mp[n//100], \\\"Hundred\\\"] + fn(n%100)\",\n \"def test_fixnum_special(doctest):\",\n \"def SetMoneda(num, simbolo=\\\"US$\\\", n_decimales=2):\\n #con abs, nos aseguramos que los dec. sea un positivo.\\n n_decimales = abs(n_decimales)\\n \\n #se redondea a los decimales idicados.\\n num = round(num, n_decimales)\\n\\n #se divide el entero del decimal y obtenemos los string\\n num, dec = str(num).split(\\\".\\\")\\n\\n #si el num tiene menos decimales que los que se quieren mostrar,\\n #se completan los faltantes con ceros.\\n dec += \\\"0\\\" * (n_decimales - len(dec))\\n \\n #se invierte el num, para facilitar la adicion de comas.\\n num = num[::-1]\\n \\n #se crea una lista con las cifras de miles como elementos.\\n l = [num[pos:pos+3][::-1] for pos in range(0,50,3) if (num[pos:pos+3])]\\n l.reverse()\\n \\n #se pasa la lista a string, uniendo sus elementos con comas.\\n num = str.join(\\\",\\\", l)\\n \\n #si el numero es negativo, se quita una coma sobrante.\\n try:\\n if num[0:2] == \\\"-,\\\":\\n num = \\\"-%s\\\" % num[2:]\\n except IndexError:\\n pass\\n \\n #si no se especifican decimales, se retorna un numero entero.\\n if not n_decimales:\\n return \\\"%s %s\\\" % (simbolo, num)\\n \\n return \\\"%s %s.%s\\\" % (simbolo, num, dec)\",\n \"def sixteen():\\r\\n \\r\\n number = str(pow(2, 1000))\\r\\n sum = 0\\r\\n \\r\\n for i in number:\\r\\n sum += int(i)\\r\\n \\r\\n return sum\",\n \"def lessthan_5(num_list):\",\n \"def fn(n):\\n digits = [int(x) for x in str(n)]\\n for i in reversed(range(len(digits)//2+1)): \\n if digits[i] < 9: break \\n else: return 10*n + 11\\n digits[i] = digits[~i] = digits[i] + 1\\n for ii in range(i): \\n digits[~ii] = digits[ii]\\n for ii in range(i+1, len(digits)//2+1): \\n digits[ii] = digits[~ii] = 0\\n return int(\\\"\\\".join(map(str, digits)))\",\n \"def multiplicaciones(): #906609 tiene que darme\\n ultimo_palindromo = 0\\n total = 0\\n for primer_numero in range(100, 1000):\\n for segundo_numero in range(100, 1000):\\n #total se encarga de hacer la multiplicacion entre los numeros\\n total = primer_numero * segundo_numero\\n # llamamos a la funcion que verifica si la multiplicacion que envia es un palindromo\\n if obtener_palindromo(total):\\n #luego de verificar que la multiplicacion era palindromo pasamos a evaluarla hasta llegar al ultimo palindromo\\n #entre 100 y 1000\\n if ultimo_palindromo < total:\\n ultimo_palindromo = total\\n return ultimo_palindromo\",\n \"def main():\\r\\n lst = list(map(int, list(str(NUMBER))))\\r\\n product = 0\\r\\n\\r\\n for i in range(len(lst)):\\r\\n\\r\\n if i + 13 >= len(lst):\\r\\n break\\r\\n\\r\\n thirteen = lst[i:i + 13]\\r\\n\\r\\n if prod(thirteen) > product:\\r\\n product = prod(thirteen)\\r\\n\\r\\n print(f'{\\\" × \\\".join(list(map(str, thirteen)))} = {product}')\",\n \"def spelledout_numbers_to_numbers(self, s):\\n\\t\\tnumbers_1to9 = 'one two three four five six seven eight nine'.split() \\n\\t\\tmappings_1to9 = {t[0]: str(t[1]) \\n\\t\\t\\t\\t\\t\\t\\t for t in zip(numbers_1to9, range(1,10))}\\n\\t\\t\\n\\t\\tmappings_10to19 = {t[0]: str(t[1]) \\n\\t\\t\\t\\t\\t\\t\\t for t in zip(\\\"\\\"\\\"ten eleven twelve thirteen fourteen fifteen \\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t sixteen seventeen eighteen nineteen\\\"\\\"\\\".split(), range(10,20))}\\n\\t\\t\\n\\t\\tnumbers_20to90 = 'twenty thirty forty fifty sixty seventy eighty ninety'.split()\\n\\t\\tmappings_20to90 = {t[0]: str(t[1]) \\n\\t\\t\\t\\t\\t\\t\\t for t in zip(numbers_20to90, range(20,100,10))}\\n\\t\\t\\n\\t\\t# produce numbers like twenty one, fifty seven, etc.\\n\\t\\tnumbers_21to99 = [' '.join([s,p]) for s in numbers_20to90 for p in numbers_1to9]\\n\\t\\t\\n\\t\\t\\\"\\\"\\\"\\n\\t\\tcreate an ordered dictionary mapping spelled numbers to numbers in\\n\\t\\tdigits; note that the order is important because we want to search\\n\\t\\tfor spelled numbers starting from the compound ones like twenty two,\\n\\t\\tthen try to find the rest\\n\\t\\t\\\"\\\"\\\"\\n\\t\\t\\n\\t\\tod = OrderedDict({t[0]:t[1] \\n\\t\\t\\t\\t\\t\\t\\tfor t in zip(numbers_21to99, \\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t # create a list [21,22,..,29,31,..,39,41,..,99]\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t [_ for _ in chain.from_iterable([[str(_) for _ in range(int(d)*10 + 1,int(d+1)*10)] \\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t for d in range(2,10)])])})\\n\\t\\tod.update(mappings_20to90)\\n\\t\\tod.update(mappings_10to19)\\n\\t\\tod.update(mappings_1to9)\\n\\t\\t\\n\\t\\tfor w_ in od:\\n\\t\\t\\t s = re.sub(r'\\\\b' + w_ + r'\\\\b', od[w_], s)\\n\\t\\t\\n\\t\\treturn s\",\n \"def post_process(result):\\n result = result.replace(' ', '')\\n\\n digits = re.findall('(\\\\d)', result)\\n words = re.findall('(\\\\D+)', result)\\n if digits:\\n if len(digits) == NUM_OF_DIGITS:\\n return ''.join(digits), SUCCESS_RATE ** len(digits)\\n elif len(digits) < NUM_OF_DIGITS and words:\\n try:\\n digits_from_words = [replace_similar_sound(word) for word in words]\\n for (i, (word, digit)) in enumerate(zip(words, digits_from_words)):\\n if digit:\\n digits.insert(result.index(word), digit)\\n result = result.replace(word, digit)\\n return ''.join(digits), SUCCESS_RATE ** len(digits)\\n except Exception:\\n pass\\n return randomize_difference(digits, NUM_OF_DIGITS - len(digits))\",\n \"def test_task559_eratosthenes(number, expected_value):\\r\\n assert algo.Task559.eratosthenes(number) == expected_value\",\n \"def test_datetimenumber2mjd():\\n\\tdt = [datetime(1978,11,14),datetime(1988,4,22)]\\n\\tmjd_true = [43826,47273]\\n\\tmjd_test = date_functions.datetimenumber2mjd( dt )\\n\\n\\tassert mjd_test[0] == mjd_true[0]\\n\\tassert mjd_test[1] == mjd_true[1]\",\n \"def make_g_number():\\n return fake.bothify(text='??#########')\",\n \"def evalute_number(dialed):\\n if (len(dialed) == 11 or len(dialed) == 10) and str(dialed).startswith(\\\"0\\\"):\\n # UK Number\\n return \\\"+44%s\\\" % (dialed[1:])\\n elif len(dialed) == 6:\\n # Local Fishguard numbers\\n return \\\"+441348%s\\\" % (dialed)\\n return None\",\n \"def test_number_compare(self):\\n self.assertEqual(functions.number_compare(1, 1), \\\"Numbers are equal\\\")\\n self.assertEqual(functions.number_compare(1, 0), \\\"First is greater\\\")\\n self.assertEqual(functions.number_compare(2, 4), \\\"Second is greater\\\")\",\n \"async def number(self, ctx, number: int) -> None:\\n number_user = self.bot.numbers.search.num_to_user(number)\\n nation_and_countries = self.bot.numbers.checks.nation_and_countries(number)\\n\\n countries = \\\"\\\\n\\\".join([f\\\"• {country[0]}\\\" for country in nation_and_countries[\\\"countries\\\"]])\\n await ctx.send(\\n \\\"\\\",\\n embed=NumEmbed(\\n title=\\\"NGB - Number Search\\\",\\n colour=0x00C9CC,\\n fields={\\n \\\"Number\\\": f\\\"#{number}\\\",\\n \\\"Number User\\\": f\\\"u/{number_user}\\\" if number_user is not None else \\\"No One\\\" if number != 404 else \\\"Error 404\\\\nNot Found\\\",\\n \\\"Nation\\\": nation_and_countries[\\\"nation\\\"][0],\\n \\\"Odd/Even\\\": self.bot.numbers.checks.parity(number),\\n \\\"Eligible Countries\\\": countries,\\n },\\n user=ctx.author,\\n ),\\n )\",\n \"def TransformBase(base:int, number:list, digts:int) -> int :\\n i = 0\\n res = 0\\n while ( i < digts):\\n index = digts - i - 1\\n number[index] = int(number[index]) * (base ** i) \\n res += number[index]\\n i += 1\\n return res\",\n \"def mul_numbers(a: int, b: int) -> int:\\n return a * b\",\n \"def test_generate_mine_sequence(self):\\n mine_list = utils.generate_mine_sequence(1)\\n self.assertEqual(len(mine_list), utils.MINE_COUNT)\",\n \"def testFtoK(self):\\r\\n for integer, numeral in self.ftokvalues:\\r\\n result = conversions_refactored.convert('Fahrenheit', 'Kelvin', integer) \\r\\n self.assertEqual(numeral, result, msg='Incorrect result, calculation error')\",\n \"def say_chunk(num):\\n output_string_list = []\\n num_string = str(num)\\n\\n units = ['zero', 'one', 'two', 'three', 'four', 'five',\\n 'six', 'seven', 'eight', 'nine']\\n teens = ['ten', 'eleven', 'twelve', 'thirteen', 'fourteen', 'fifteen',\\n 'sixteen', 'seventeen', 'eighteen', 'nineteen']\\n tens = ['twenty', 'thirty', 'forty', 'fifty', 'sixty', 'seventy', 'eighty', 'ninety']\\n\\n # singles\\n if num < 10:\\n output_string_list.append(units[num])\\n\\n # teens\\n elif 10 <= num <= 19:\\n output_string_list.append(teens[int(num) % 10])\\n\\n # tens\\n elif 20 <= num <= 99:\\n num_str = str(num)\\n modifier = int(num_str[0])\\n if int(num_str[1]):\\n output_string_list.append(\\\"{}-{}\\\".format(tens[modifier - 2], units[int(num) % 10]))\\n else:\\n output_string_list.append(tens[modifier - 2])\\n\\n # hundreds\\n elif 100 <= num <= 999:\\n output_string_list.append(units[int(num_string[0])])\\n output_string_list.append('hundred')\\n\\n num = int(num_string[1:])\\n if num:\\n output_string_list.append('and')\\n num_string = str(num)\\n modifier = int(num_string[0])\\n\\n if int(num_string[1]):\\n output_string_list.append(\\\"{}-{}\\\".format(tens[modifier - 2], units[int(num_string[1:]) % 10]))\\n else:\\n output_string_list.append(tens[modifier - 2])\\n\\n return ' '.join(output_string_list)\",\n \"def test_margalef(self):\\n self.assertEqual(margalef(self.TestData), 8/log(22))\",\n \"def SetMoneda(num, simbolo=\\\"$\\\", n_decimales=2):\\n #con abs, nos aseguramos que los dec. sea un positivo.\\n n_decimales = abs(n_decimales)\\n\\n #se redondea a los decimales idicados.\\n num = round(num, n_decimales)\\n\\n #se divide el entero del decimal y obtenemos los string\\n num, dec = str(num).split(\\\".\\\")\\n\\n #si el num tiene menos decimales que los que se quieren mostrar,\\n #se completan los faltantes con ceros.\\n dec += \\\"0\\\" * (n_decimales - len(dec))\\n\\n #se invierte el num, para facilitar la adicion de comas.\\n num = num[::-1]\\n\\n #se crea una lista con las cifras de miles como elementos.\\n l = [num[pos:pos+3][::-1] for pos in range(0,50,3) if (num[pos:pos+3])]\\n l.reverse()\\n\\n #se pasa la lista a string, uniendo sus elementos con comas.\\n num = str.join(\\\",\\\", l)\\n\\n #si el numero es negativo, se quita una coma sobrante.\\n try:\\n if num[0:2] == \\\"-,\\\":\\n num = \\\"-%s\\\" % num[2:]\\n except IndexError:\\n pass\\n\\n #si no se especifican decimales, se retorna un numero entero.\\n if not n_decimales:\\n return \\\"%s %s\\\" % (simbolo, num)\\n\\n return \\\"%s %s.%s\\\" % (simbolo, num, dec)\",\n \"def amstrong(num) :\\r\\n sum = 0\\r\\n temp = num\\r\\n order=len(str(num))\\r\\n while num > 0 :\\r\\n r = num % 10\\r\\n sum += r ** order\\r\\n num //= 10\\r\\n\\r\\n if sum == temp :\\r\\n print(f\\\"{sum} is Amstrong Number\\\")\\r\\n else :\\r\\n print(\\\"Number is not Amstrong Number\\\")\",\n \"def is_armstrong_number(number: int) -> bool:\\n result = 0\\n num_str = str(number)\\n for i in num_str:\\n result += int(i) ** len(num_str)\\n return result == number\",\n \"def replace_million(text):\\n for match in re.finditer(r'(£|\\\\$)([0-9]+(\\\\.|,))?[0-9]+(m|M) ', text):\\n match_text = match.group(0)\\n new_text = match_text.replace('m', ' million').replace('M', ' million')\\n text = text.replace(match_text, new_text)\\n for match in re.finditer(r'(£|\\\\$)([0-9]+(\\\\.|,))?[0-9]+( |-)(m|M) ', text):\\n match_text = match.group(0)\\n new_text = match_text.replace('m', 'million').replace('M', 'million')\\n text = text.replace(match_text, new_text)\\n return text\",\n \"def create_phone_number(n):\",\n \"def auto_number(tokens: List[TOKEN], local_dict: DICT, global_dict: DICT):\\n result: List[TOKEN] = []\\n\\n for toknum, tokval in tokens:\\n if toknum == NUMBER:\\n number = tokval\\n postfix = []\\n\\n if number.endswith(('j', 'J')):\\n number = number[:-1]\\n postfix = [(OP, '*'), (NAME, 'I')]\\n\\n if '.' in number or (('e' in number or 'E' in number) and\\n not (number.startswith(('0x', '0X')))):\\n seq = [(NAME, 'Float'), (OP, '('),\\n (NUMBER, repr(str(number))), (OP, ')')]\\n else:\\n seq = [(NAME, 'Integer'), (OP, '('), (\\n NUMBER, number), (OP, ')')]\\n\\n result.extend(seq + postfix)\\n else:\\n result.append((toknum, tokval))\\n\\n return result\",\n \"def mod(numbers):\\n result = numbers[0]\\n for i in numbers[1:]:\\n result = result % i\\n return result\",\n \"def _extract_whole_number_with_text_nl(tokens, short_scale, ordinals):\\n multiplies, string_num_ordinal, string_num_scale = \\\\\\n _initialize_number_data_nl(short_scale)\\n\\n number_words = [] # type: [Token]\\n val = False\\n prev_val = None\\n next_val = None\\n to_sum = []\\n for idx, token in enumerate(tokens):\\n current_val = None\\n if next_val:\\n next_val = None\\n continue\\n\\n word = token.word\\n if word in _ARTICLES_NL or word in _NEGATIVES_NL:\\n number_words.append(token)\\n continue\\n\\n prev_word = tokens[idx - 1].word if idx > 0 else \\\"\\\"\\n next_word = tokens[idx + 1].word if idx + 1 < len(tokens) else \\\"\\\"\\n\\n if word not in string_num_scale and \\\\\\n word not in _STRING_NUM_NL and \\\\\\n word not in _SUMS_NL and \\\\\\n word not in multiplies and \\\\\\n not (ordinals and word in string_num_ordinal) and \\\\\\n not is_numeric(word) and \\\\\\n not is_fractional_nl(word, short_scale=short_scale) and \\\\\\n not look_for_fractions(word.split('/')):\\n words_only = [token.word for token in number_words]\\n if number_words and not all([w in _ARTICLES_NL |\\n _NEGATIVES_NL for w in words_only]):\\n break\\n else:\\n number_words = []\\n continue\\n elif word not in multiplies \\\\\\n and prev_word not in multiplies \\\\\\n and prev_word not in _SUMS_NL \\\\\\n and not (ordinals and prev_word in string_num_ordinal) \\\\\\n and prev_word not in _NEGATIVES_NL \\\\\\n and prev_word not in _ARTICLES_NL:\\n number_words = [token]\\n elif prev_word in _SUMS_NL and word in _SUMS_NL:\\n number_words = [token]\\n else:\\n number_words.append(token)\\n\\n # is this word already a number ?\\n if is_numeric(word):\\n if word.isdigit(): # doesn't work with decimals\\n val = int(word)\\n else:\\n val = float(word)\\n current_val = val\\n\\n # is this word the name of a number ?\\n if word in _STRING_NUM_NL:\\n val = _STRING_NUM_NL.get(word)\\n current_val = val\\n elif word in string_num_scale:\\n val = string_num_scale.get(word)\\n current_val = val\\n elif ordinals and word in string_num_ordinal:\\n val = string_num_ordinal[word]\\n current_val = val\\n\\n # is the prev word an ordinal number and current word is one?\\n # second one, third one\\n if ordinals and prev_word in string_num_ordinal and val == 1:\\n val = prev_val\\n\\n # is the prev word a number and should we sum it?\\n # twenty two, fifty six\\n if prev_word in _SUMS_NL and val and val < 10:\\n val = prev_val + val\\n\\n # is the prev word a number and should we multiply it?\\n # twenty hundred, six hundred\\n if word in multiplies:\\n if not prev_val:\\n prev_val = 1\\n val = prev_val * val\\n\\n # is this a spoken fraction?\\n # half cup\\n if val is False:\\n val = is_fractional_nl(word, short_scale=short_scale)\\n current_val = val\\n\\n # 2 fifths\\n if not ordinals:\\n next_val = is_fractional_nl(next_word, short_scale=short_scale)\\n if next_val:\\n if not val:\\n val = 1\\n val = val * next_val\\n number_words.append(tokens[idx + 1])\\n\\n # is this a negative number?\\n if val and prev_word and prev_word in _NEGATIVES_NL:\\n val = 0 - val\\n\\n # let's make sure it isn't a fraction\\n if not val:\\n # look for fractions like \\\"2/3\\\"\\n aPieces = word.split('/')\\n if look_for_fractions(aPieces):\\n val = float(aPieces[0]) / float(aPieces[1])\\n current_val = val\\n\\n else:\\n if prev_word in _SUMS_NL and word not in _SUMS_NL and current_val >= 10:\\n # Backtrack - we've got numbers we can't sum.\\n number_words.pop()\\n val = prev_val\\n break\\n prev_val = val\\n\\n # handle long numbers\\n # six hundred sixty six\\n # two million five hundred thousand\\n if word in multiplies and next_word not in multiplies:\\n to_sum.append(val)\\n val = 0\\n prev_val = 0\\n\\n if val is not None and to_sum:\\n val += sum(to_sum)\\n\\n return val, number_words\",\n \"def test_convert_amounts(self):\\n pass\",\n \"def _digits(self, num):\\n digits = str(num)\\n for digit in digits:\\n yield int(digit)\",\n \"def _replace_numbers(words):\\n p = inflect.engine()\\n new_words = []\\n for word in words:\\n if word.isdigit():\\n try:\\n new_word = p.number_to_words(word)\\n new_words.append(new_word)\\n except:\\n pass\\n else:\\n new_words.append(word)\\n return new_words\",\n \"def test_address__normalize_phone_number__1():\\n assert '+491234567890' == normalize_phone_number('+491234567890', '+49')\",\n \"def prjEuler():\\r\\n #Constants\\r\\n NUMSTRING = ( \\\"73167176531330624919225119674426574742355349194934\\\"\\r\\n \\\"96983520312774506326239578318016984801869478851843\\\"\\r\\n \\\"85861560789112949495459501737958331952853208805511\\\"\\r\\n \\\"12540698747158523863050715693290963295227443043557\\\"\\r\\n \\\"66896648950445244523161731856403098711121722383113\\\"\\r\\n \\\"62229893423380308135336276614282806444486645238749\\\"\\r\\n \\\"30358907296290491560440772390713810515859307960866\\\"\\r\\n \\\"70172427121883998797908792274921901699720888093776\\\"\\r\\n \\\"65727333001053367881220235421809751254540594752243\\\"\\r\\n \\\"52584907711670556013604839586446706324415722155397\\\"\\r\\n \\\"53697817977846174064955149290862569321978468622482\\\"\\r\\n \\\"83972241375657056057490261407972968652414535100474\\\"\\r\\n \\\"82166370484403199890008895243450658541227588666881\\\"\\r\\n \\\"16427171479924442928230863465674813919123162824586\\\"\\r\\n \\\"17866458359124566529476545682848912883142607690042\\\"\\r\\n \\\"24219022671055626321111109370544217506941658960408\\\"\\r\\n \\\"07198403850962455444362981230987879927244284909188\\\"\\r\\n \\\"84580156166097919133875499200524063689912560717606\\\"\\r\\n \\\"05886116467109405077541002256983155200055935729725\\\"\\r\\n \\\"71636269561882670428252483600823257530420752963450\\\" )\\r\\n \\r\\n #defined items\\r\\n greatest_prod = 1\\r\\n euler_queue = fiveQueue()\\r\\n \\r\\n #code\\r\\n for numIter in NUMSTRING:\\r\\n if( euler_queue.push( numIter ) ):\\r\\n temp_prod = euler_queue.product()\\r\\n if( temp_prod > greatest_prod ):\\r\\n greatest_prod = temp_prod\\r\\n \\r\\n print \\\"The greatest product is %d\\\" % greatest_prod\\r\\n return\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.5994305","0.58658266","0.5729014","0.56989163","0.5615644","0.5593863","0.5531031","0.55126804","0.54742104","0.5439089","0.543804","0.54284734","0.54218674","0.54073083","0.5352614","0.5331817","0.53211087","0.5284186","0.5279782","0.52637136","0.5258012","0.5257852","0.52443284","0.52387244","0.52387244","0.5237288","0.52255994","0.5213397","0.5212256","0.5209041","0.52024186","0.51943666","0.5186797","0.51795","0.5176868","0.5161958","0.5149659","0.5144373","0.51204026","0.511943","0.5116492","0.51111174","0.5105995","0.51057494","0.5097097","0.50963956","0.5094593","0.5094066","0.5085461","0.5083743","0.50816727","0.508017","0.5077793","0.5072505","0.50667584","0.50638944","0.5062934","0.50583524","0.50573987","0.50562364","0.50519866","0.5040259","0.5031166","0.50250113","0.5017843","0.50164765","0.5015329","0.5010922","0.5003208","0.49992406","0.4994235","0.49860764","0.49823177","0.49799806","0.49730253","0.49698472","0.4967046","0.49632078","0.4949675","0.49469772","0.4941293","0.4939674","0.49336576","0.49200052","0.49157485","0.49157187","0.49156418","0.491476","0.49128783","0.4912088","0.49106154","0.490873","0.49058458","0.48986468","0.48909763","0.48889533","0.48885956","0.4883054","0.48828712","0.48819673"],"string":"[\n \"0.5994305\",\n \"0.58658266\",\n \"0.5729014\",\n \"0.56989163\",\n \"0.5615644\",\n \"0.5593863\",\n \"0.5531031\",\n \"0.55126804\",\n \"0.54742104\",\n \"0.5439089\",\n \"0.543804\",\n \"0.54284734\",\n \"0.54218674\",\n \"0.54073083\",\n \"0.5352614\",\n \"0.5331817\",\n \"0.53211087\",\n \"0.5284186\",\n \"0.5279782\",\n \"0.52637136\",\n \"0.5258012\",\n \"0.5257852\",\n \"0.52443284\",\n \"0.52387244\",\n \"0.52387244\",\n \"0.5237288\",\n \"0.52255994\",\n \"0.5213397\",\n \"0.5212256\",\n \"0.5209041\",\n \"0.52024186\",\n \"0.51943666\",\n \"0.5186797\",\n \"0.51795\",\n \"0.5176868\",\n \"0.5161958\",\n \"0.5149659\",\n \"0.5144373\",\n \"0.51204026\",\n \"0.511943\",\n \"0.5116492\",\n \"0.51111174\",\n \"0.5105995\",\n \"0.51057494\",\n \"0.5097097\",\n \"0.50963956\",\n \"0.5094593\",\n \"0.5094066\",\n \"0.5085461\",\n \"0.5083743\",\n \"0.50816727\",\n \"0.508017\",\n \"0.5077793\",\n \"0.5072505\",\n \"0.50667584\",\n \"0.50638944\",\n \"0.5062934\",\n \"0.50583524\",\n \"0.50573987\",\n \"0.50562364\",\n \"0.50519866\",\n \"0.5040259\",\n \"0.5031166\",\n \"0.50250113\",\n \"0.5017843\",\n \"0.50164765\",\n \"0.5015329\",\n \"0.5010922\",\n \"0.5003208\",\n \"0.49992406\",\n \"0.4994235\",\n \"0.49860764\",\n \"0.49823177\",\n \"0.49799806\",\n \"0.49730253\",\n \"0.49698472\",\n \"0.4967046\",\n \"0.49632078\",\n \"0.4949675\",\n \"0.49469772\",\n \"0.4941293\",\n \"0.4939674\",\n \"0.49336576\",\n \"0.49200052\",\n \"0.49157485\",\n \"0.49157187\",\n \"0.49156418\",\n \"0.491476\",\n \"0.49128783\",\n \"0.4912088\",\n \"0.49106154\",\n \"0.490873\",\n \"0.49058458\",\n \"0.48986468\",\n \"0.48909763\",\n \"0.48889533\",\n \"0.48885956\",\n \"0.4883054\",\n \"0.48828712\",\n \"0.48819673\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.7466113"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":11399,"cells":{"query":{"kind":"string","value":"Testing task 559 class main logic"},"document":{"kind":"string","value":"def test_task559_main_logic(number, expected_value):\r\n assert algo.Task559.main_logic(number) == expected_value"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["def task5(self):\n\n pass","def task():","def task4(self):\n\n pass","def runtest(self):","def test_get_run(self):\n pass","def task(self):","def task(self):","def task4_1(self):\n\n pass","def task1(self):\n \n pass","def task3(self):\n\n pass","def test_solve_task(self):\n pass","def runTests(self):\n \n pass","def test_basic_execution(self):","def _test(self):\n pass","def _test(self):\n pass","def _test(self):\n pass","def test_5():","def task2(self):\n\n pass","def setUp(self):\n self.t = Task()\n self.t(\"add one mississippi\")\n self.t(\"add two mississippi\")","def setUp(self):\n self.t = Task()","def setUp(self):\n self.t = Task()","def test_get_task_output(self):\n pass","def test(self):\n pass","def _test(self):","def _test(self):","def _test(self):","def _test(self):","def _test(self):","def test_4():","def task():\n pass","def task():\n pass","def test_T01():","def tasks():","def task2_3():","def startTestRun(self):","def run_test(self):\n raise NotImplementedError","def setUp(self):\n self.t = Task()\n self.t(\"add one\")","def task_4_3_1():\n # TODO Task 4.3.1: Your code goes here\n pass","def test_run_started(self):","def test_create_run(self):\n pass","def task_4_3_2():\n # TODO Task 4.3.2: Your code goes here\n pass","def task():\n\n\tprint('Example task executed.')","def task_4_2_1():\n # TODO Task 4.2.1: Your code goes here\n pass","def main():\n run_test_all()","def test_T4():","def test_T4():","def task_4_3_3():\n # TODO Task 4.3.3: Your code goes here\n pass","def tests():","def main(self):\r\n pass","def test_3():","def main():\n\n parser = argparse.ArgumentParser(description=\"generateTestStubs\")\n\n parser.add_argument(\"taskFile\",\n help=\"Path for assignment file.\")\n\n args = parser.parse_args()\n\n if not os.path.exists(args.taskFile):\n print(\"Task file does not exist.\")\n sys.exit(1)\n\n taskMgr = EEWebLPProject()\n taskMgr.initLP()\n\n #taskMgr.listProjects()\n #taskMgr.loadTree([\"project_id=8008922\"])\n tasks = taskMgr.getTasks([\"project_id=6890048\"],parent_id=8008922)\n\n fileByAssignee = taskMgr.getTaskOwners(args.taskFile)\n taskMgr.updateTaskOwners(fileByAssignee,tasks)","def unitary_test():","def main(self):","def RUN(self):","def __main() :\n launchTests()","def test_script(self) -> None:\n main()","def test(self):","def test(self):","def main(cls):\n raise NotImplementedError","def test_main(self):\n results = main(0.1, files)\n # 1\n self.assertEqual(results, \"All Done Successfully\")\n results = main(0.1, get_files_bad_file_path())\n # 2\n self.assertIn(\"skipping to next\", results)\n results = main(0.1, get_files_bad_type())\n # 3\n self.assertIn(\"skipping to next\", results)\n results = main(0.1, get_files_bad_name_table())\n # 4\n self.assertIn(\"closing app. . .\", results)","def run_tests(self):\n raise NotImplementedError","def test_T3():","def test_T3():","def test(self):\n # -- Test --\n\n # (1)\n\n # (2)\n\n # (3)\n\n # (4)\n # -- Test --","def main():\n tng.api.runner()","def test_T1():","def test_T1():","def run_starter(self, expect_to_fail=False):","def run(self):\n \n pass","def getTestResults():","def run(self):","def run(self):","def run(self):","def run(self):","def run(self):","def run(self):","def run(self):","def run(self):","def run(self):","def run(self):","def main():\n\n # Run all the requirements for part A\n ##############################\n # Question 3\n # runs naive A*\n question_3()\n\n ##############################\n # Question 5\n # runs online A*\n question_5()\n\n ##############################\n # Question 7\n # runs online A* on fine grid\n question_7()\n\n\n # Run all the requirements for part B\n ##############################\n # Question 9\n question_9()\n\n ##############################\n # Question 10\n question_10()\n\n ##############################\n # Question 1\n question_11()","def test_T2():","def test_T2():","def trial(self):\n pass","def main():\n pass","def run(self):\n pass","def run(self):\n pass","def run(self):\n pass","def run(self):\n pass","def run(self):\n pass","def run(self):\n pass","def run(self):\n pass","def run(self):\n pass","def run(self):\n pass","def run(self):\n pass","def run(self):\n pass","def run(self):\n pass","def run(self):\n pass","def run(self):\n pass","def run(self):\n pass","def test():"],"string":"[\n \"def task5(self):\\n\\n pass\",\n \"def task():\",\n \"def task4(self):\\n\\n pass\",\n \"def runtest(self):\",\n \"def test_get_run(self):\\n pass\",\n \"def task(self):\",\n \"def task(self):\",\n \"def task4_1(self):\\n\\n pass\",\n \"def task1(self):\\n \\n pass\",\n \"def task3(self):\\n\\n pass\",\n \"def test_solve_task(self):\\n pass\",\n \"def runTests(self):\\n \\n pass\",\n \"def test_basic_execution(self):\",\n \"def _test(self):\\n pass\",\n \"def _test(self):\\n pass\",\n \"def _test(self):\\n pass\",\n \"def test_5():\",\n \"def task2(self):\\n\\n pass\",\n \"def setUp(self):\\n self.t = Task()\\n self.t(\\\"add one mississippi\\\")\\n self.t(\\\"add two mississippi\\\")\",\n \"def setUp(self):\\n self.t = Task()\",\n \"def setUp(self):\\n self.t = Task()\",\n \"def test_get_task_output(self):\\n pass\",\n \"def test(self):\\n pass\",\n \"def _test(self):\",\n \"def _test(self):\",\n \"def _test(self):\",\n \"def _test(self):\",\n \"def _test(self):\",\n \"def test_4():\",\n \"def task():\\n pass\",\n \"def task():\\n pass\",\n \"def test_T01():\",\n \"def tasks():\",\n \"def task2_3():\",\n \"def startTestRun(self):\",\n \"def run_test(self):\\n raise NotImplementedError\",\n \"def setUp(self):\\n self.t = Task()\\n self.t(\\\"add one\\\")\",\n \"def task_4_3_1():\\n # TODO Task 4.3.1: Your code goes here\\n pass\",\n \"def test_run_started(self):\",\n \"def test_create_run(self):\\n pass\",\n \"def task_4_3_2():\\n # TODO Task 4.3.2: Your code goes here\\n pass\",\n \"def task():\\n\\n\\tprint('Example task executed.')\",\n \"def task_4_2_1():\\n # TODO Task 4.2.1: Your code goes here\\n pass\",\n \"def main():\\n run_test_all()\",\n \"def test_T4():\",\n \"def test_T4():\",\n \"def task_4_3_3():\\n # TODO Task 4.3.3: Your code goes here\\n pass\",\n \"def tests():\",\n \"def main(self):\\r\\n pass\",\n \"def test_3():\",\n \"def main():\\n\\n parser = argparse.ArgumentParser(description=\\\"generateTestStubs\\\")\\n\\n parser.add_argument(\\\"taskFile\\\",\\n help=\\\"Path for assignment file.\\\")\\n\\n args = parser.parse_args()\\n\\n if not os.path.exists(args.taskFile):\\n print(\\\"Task file does not exist.\\\")\\n sys.exit(1)\\n\\n taskMgr = EEWebLPProject()\\n taskMgr.initLP()\\n\\n #taskMgr.listProjects()\\n #taskMgr.loadTree([\\\"project_id=8008922\\\"])\\n tasks = taskMgr.getTasks([\\\"project_id=6890048\\\"],parent_id=8008922)\\n\\n fileByAssignee = taskMgr.getTaskOwners(args.taskFile)\\n taskMgr.updateTaskOwners(fileByAssignee,tasks)\",\n \"def unitary_test():\",\n \"def main(self):\",\n \"def RUN(self):\",\n \"def __main() :\\n launchTests()\",\n \"def test_script(self) -> None:\\n main()\",\n \"def test(self):\",\n \"def test(self):\",\n \"def main(cls):\\n raise NotImplementedError\",\n \"def test_main(self):\\n results = main(0.1, files)\\n # 1\\n self.assertEqual(results, \\\"All Done Successfully\\\")\\n results = main(0.1, get_files_bad_file_path())\\n # 2\\n self.assertIn(\\\"skipping to next\\\", results)\\n results = main(0.1, get_files_bad_type())\\n # 3\\n self.assertIn(\\\"skipping to next\\\", results)\\n results = main(0.1, get_files_bad_name_table())\\n # 4\\n self.assertIn(\\\"closing app. . .\\\", results)\",\n \"def run_tests(self):\\n raise NotImplementedError\",\n \"def test_T3():\",\n \"def test_T3():\",\n \"def test(self):\\n # -- Test --\\n\\n # (1)\\n\\n # (2)\\n\\n # (3)\\n\\n # (4)\\n # -- Test --\",\n \"def main():\\n tng.api.runner()\",\n \"def test_T1():\",\n \"def test_T1():\",\n \"def run_starter(self, expect_to_fail=False):\",\n \"def run(self):\\n \\n pass\",\n \"def getTestResults():\",\n \"def run(self):\",\n \"def run(self):\",\n \"def run(self):\",\n \"def run(self):\",\n \"def run(self):\",\n \"def run(self):\",\n \"def run(self):\",\n \"def run(self):\",\n \"def run(self):\",\n \"def run(self):\",\n \"def main():\\n\\n # Run all the requirements for part A\\n ##############################\\n # Question 3\\n # runs naive A*\\n question_3()\\n\\n ##############################\\n # Question 5\\n # runs online A*\\n question_5()\\n\\n ##############################\\n # Question 7\\n # runs online A* on fine grid\\n question_7()\\n\\n\\n # Run all the requirements for part B\\n ##############################\\n # Question 9\\n question_9()\\n\\n ##############################\\n # Question 10\\n question_10()\\n\\n ##############################\\n # Question 1\\n question_11()\",\n \"def test_T2():\",\n \"def test_T2():\",\n \"def trial(self):\\n pass\",\n \"def main():\\n pass\",\n \"def run(self):\\n pass\",\n \"def run(self):\\n pass\",\n \"def run(self):\\n pass\",\n \"def run(self):\\n pass\",\n \"def run(self):\\n pass\",\n \"def run(self):\\n pass\",\n \"def run(self):\\n pass\",\n \"def run(self):\\n pass\",\n \"def run(self):\\n pass\",\n \"def run(self):\\n pass\",\n \"def run(self):\\n pass\",\n \"def run(self):\\n pass\",\n \"def run(self):\\n pass\",\n \"def run(self):\\n pass\",\n \"def run(self):\\n pass\",\n \"def test():\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.76807034","0.73960394","0.7371841","0.7336318","0.73260546","0.7267288","0.7267288","0.71438813","0.71006924","0.70854497","0.70318955","0.698589","0.69634557","0.6915204","0.6915204","0.6915204","0.6888586","0.6873803","0.68686956","0.6868453","0.6868453","0.68631154","0.68509454","0.68484646","0.68484646","0.68484646","0.68484646","0.68484646","0.6821522","0.682018","0.682018","0.6719307","0.6715385","0.67096424","0.6694167","0.6670687","0.6668512","0.6664362","0.666427","0.66464454","0.664327","0.6629647","0.66277987","0.6626604","0.6623784","0.6623784","0.6622619","0.6613387","0.66116416","0.65824383","0.6575558","0.6573728","0.6571596","0.65696764","0.655421","0.65400255","0.65362364","0.65362364","0.65202","0.65060997","0.6505708","0.65039414","0.65039414","0.6482167","0.64710903","0.6467682","0.6467682","0.6465163","0.6464672","0.64554137","0.6437943","0.6437943","0.6437943","0.6437943","0.6437943","0.6437943","0.6437943","0.6437943","0.6437943","0.6437943","0.6437313","0.639389","0.639389","0.6388613","0.63846517","0.63784623","0.63784623","0.63784623","0.63784623","0.63784623","0.63784623","0.63784623","0.63784623","0.63784623","0.63784623","0.63784623","0.63784623","0.63784623","0.63784623","0.63784623","0.6374898"],"string":"[\n \"0.76807034\",\n \"0.73960394\",\n \"0.7371841\",\n \"0.7336318\",\n \"0.73260546\",\n \"0.7267288\",\n \"0.7267288\",\n \"0.71438813\",\n \"0.71006924\",\n \"0.70854497\",\n \"0.70318955\",\n \"0.698589\",\n \"0.69634557\",\n \"0.6915204\",\n \"0.6915204\",\n \"0.6915204\",\n \"0.6888586\",\n \"0.6873803\",\n \"0.68686956\",\n \"0.6868453\",\n \"0.6868453\",\n \"0.68631154\",\n \"0.68509454\",\n \"0.68484646\",\n \"0.68484646\",\n \"0.68484646\",\n \"0.68484646\",\n \"0.68484646\",\n \"0.6821522\",\n \"0.682018\",\n \"0.682018\",\n \"0.6719307\",\n \"0.6715385\",\n \"0.67096424\",\n \"0.6694167\",\n \"0.6670687\",\n \"0.6668512\",\n \"0.6664362\",\n \"0.666427\",\n \"0.66464454\",\n \"0.664327\",\n \"0.6629647\",\n \"0.66277987\",\n \"0.6626604\",\n \"0.6623784\",\n \"0.6623784\",\n \"0.6622619\",\n \"0.6613387\",\n \"0.66116416\",\n \"0.65824383\",\n \"0.6575558\",\n \"0.6573728\",\n \"0.6571596\",\n \"0.65696764\",\n \"0.655421\",\n \"0.65400255\",\n \"0.65362364\",\n \"0.65362364\",\n \"0.65202\",\n \"0.65060997\",\n \"0.6505708\",\n \"0.65039414\",\n \"0.65039414\",\n \"0.6482167\",\n \"0.64710903\",\n \"0.6467682\",\n \"0.6467682\",\n \"0.6465163\",\n \"0.6464672\",\n \"0.64554137\",\n \"0.6437943\",\n \"0.6437943\",\n \"0.6437943\",\n \"0.6437943\",\n \"0.6437943\",\n \"0.6437943\",\n \"0.6437943\",\n \"0.6437943\",\n \"0.6437943\",\n \"0.6437943\",\n \"0.6437313\",\n \"0.639389\",\n \"0.639389\",\n \"0.6388613\",\n \"0.63846517\",\n \"0.63784623\",\n \"0.63784623\",\n \"0.63784623\",\n \"0.63784623\",\n \"0.63784623\",\n \"0.63784623\",\n \"0.63784623\",\n \"0.63784623\",\n \"0.63784623\",\n \"0.63784623\",\n \"0.63784623\",\n \"0.63784623\",\n \"0.63784623\",\n \"0.63784623\",\n \"0.63784623\",\n \"0.6374898\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}}],"truncated":false,"partial":true},"paginationData":{"pageIndex":113,"numItemsPerPage":100,"numTotalItems":95772,"offset":11300,"length":100}},"jwt":"eyJhbGciOiJFZERTQSIsImtpZCI6IjVHZDBvd0g5MTM2eDZjc1FvbE1zcktNWUZoRVFoUm5PVVVybEpjOUhaUEEifQ.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc4NTkxNjgyNCwianRpIjoiN2ZlNDZmNzUtNWY3Mi00YWQ2LWJlMmEtYTg0ZjgzMWNkZTkxIiwic3ViIjoiL2RhdGFzZXRzL25vbWljLWFpL2Nvcm5zdGFjay1weXRob24tdjEiLCJleHAiOjE3ODU5MjA0MjQsImlzcyI6Imh0dHBzOi8vaHVnZ2luZ2ZhY2UuY28ifQ.onbluwY5W4qaKWGoRkdVI8J5DN7PRqHbvH2spzjmeM8LSl_ZuFXGuvuEqiUQHfGBjGwKOa3C1mVzRVRs2EqqAg","displayUrls":true,"splitSizeSummaries":[{"config":"default","split":"train","numRows":95772,"numBytesParquet":1928375891}]},"discussionsStats":{"closed":1,"open":1,"total":2},"fullWidth":true,"hasGatedAccess":true,"hasFullAccess":true,"isEmbedded":false,"savedQueries":{"community":[],"user":[]}}">
query stringlengths 9 3.4k | document stringlengths 9 87.4k | metadata dict | negatives listlengths 4 101 | negative_scores listlengths 4 101 | document_score stringlengths 3 10 | document_rank stringclasses 102
values |
|---|---|---|---|---|---|---|
Delete all the processed files. | def clean():
clean_flatbuffer_binaries()
clean_webp_textures() | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def cleanup_files(self):\n\n self.backup_files()\n self.delete_files()",
"def teardown():\n for filename in files_to_delete:\n delete_file(filename)",
"def deleteAllFiles(self, flush=True): \n \n if flush: \n self.flush(False) \n \n for filePath i... | [
"0.8073947",
"0.79849833",
"0.77544034",
"0.76999974",
"0.7654225",
"0.7631646",
"0.75604534",
"0.753863",
"0.753267",
"0.74747413",
"0.74153626",
"0.7402632",
"0.74007124",
"0.737596",
"0.73452044",
"0.7335899",
"0.72531056",
"0.72057813",
"0.7180837",
"0.71535826",
"0.71242... | 0.0 | -1 |
Prints an error message to stderr for BuildErrors. | def handle_build_error(error):
sys.stderr.write('Error running command `%s`. Returned %s.\n' % (
' '.join(error.argv), str(error.error_code))) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def error(message):\n print(message, file=sys.stderr)",
"def perror(message):\n print(message, file=sys.stderr)",
"def error(*args, **kwargs): # pragma: nocover\n kwargs['file'] = sys.stderr\n print(\"\\n\\tERROR:\", *args, **kwargs)\n if args and args[0].startswith(\"[Errno 2] No such file or ... | [
"0.70509905",
"0.6726131",
"0.6711041",
"0.6696196",
"0.6692284",
"0.6691786",
"0.6670899",
"0.6622568",
"0.65966165",
"0.65933764",
"0.65801626",
"0.65647084",
"0.65214205",
"0.65149754",
"0.6462072",
"0.6449125",
"0.6441902",
"0.64412487",
"0.64282566",
"0.6401715",
"0.6378... | 0.7691449 | 0 |
Builds or cleans the assets needed for the game. To build all assets, either call this script without any arguments. Or alternatively, call it with the argument 'all'. To just convert the flatbuffer json files, call it with 'flatbuffers'. Likewise to convert the png files to webp files, call it with 'webp'. To clean al... | def main(argv):
target = argv[1] if len(argv) >= 2 else 'all'
if target not in ('all', 'flatbuffers', 'webp', 'clean'):
sys.stderr.write('No rule to build target %s.\n' % target)
if target in ('all', 'flatbuffers'):
try:
generate_flatbuffer_binaries()
except BuildError as error:
handle_bu... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def main():\n # Create / clean output dir\n if os.path.isdir(OUT_DIR):\n shutil.rmtree(OUT_DIR)\n os.mkdir(OUT_DIR)\n\n # Write all assets to the directory\n for fname, bb in create_assets().items():\n filename = os.path.join(OUT_DIR, fname)\n dirname = os.path.dirname(filename)... | [
"0.6964526",
"0.66298175",
"0.6555965",
"0.6412335",
"0.63683194",
"0.62495744",
"0.6218879",
"0.61988807",
"0.5852595",
"0.5839395",
"0.57132334",
"0.56508654",
"0.56002307",
"0.55775255",
"0.5536666",
"0.5529399",
"0.5503569",
"0.54786825",
"0.5461011",
"0.54588944",
"0.541... | 0.6148051 | 8 |
Run this step of the test case | def run(self):
config = self.config
section = config['isomip_plus']
nx = section.getint('nx')
nx_thin_film = section.getint('nx_thin_film')
ny = section.getint('ny')
dc = section.getfloat('dc')
thin_film_present = self.thin_film_present
# Add xOffset to r... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def TestOneStep(self):\n pass",
"def runtest(self):",
"def run_one_step(self):\n pass",
"def startTestRun(self):",
"def runTests(self):\n \n pass",
"def run_test(self):\n raise NotImplementedError",
"def do_step(self) -> None:",
"def test_run_started(self):",
"def tes... | [
"0.8038066",
"0.78981537",
"0.76758826",
"0.76324797",
"0.76222134",
"0.7562166",
"0.7524746",
"0.7261119",
"0.721741",
"0.71878743",
"0.71847486",
"0.71788085",
"0.71688485",
"0.71360976",
"0.7106595",
"0.7101748",
"0.7101748",
"0.7101748",
"0.7101748",
"0.7101748",
"0.71017... | 0.0 | -1 |
Trace streamlines from the VAR files and integrate quantity 'intQ' along them. | def tracers(traceField = 'bb', hMin = 2e-3, hMax = 2e4, lMax = 500, tol = 1e-2,
interpolation = 'weighted', trace_sub = 1, intQ = [''], varfile = 'VAR0',
ti = -1, tf = -1,
integration = 'simple', datadir = 'data/', destination = 'tracers.dat', nproc = 1):
# returns t... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def main ():\n\n # interval ends\n a,b = -1.0, +1.0\n\n # List of trapezium counts\n NVals = numpy.logspace (1, 8, base=10.0, num=6, dtype=numpy.int)\n\n # List of implementations\n intFuncList = [ \n (integral.trapintPython, \"python.txt\")\n#\t\t (integral.trapintNumPy, \"numpy... | [
"0.5122127",
"0.5042279",
"0.50375813",
"0.50055116",
"0.49259466",
"0.49082893",
"0.49023333",
"0.48582718",
"0.4848228",
"0.48448798",
"0.48392555",
"0.48325005",
"0.48325005",
"0.48318058",
"0.48191267",
"0.48185733",
"0.48029333",
"0.478208",
"0.47781596",
"0.47741887",
"... | 0.5018485 | 3 |
Reads the tracer files and composes a color map. | def read_tracers(datadir = 'data/', fileName = 'tracers.dat', zlim = [], head_size = 3, post = False):
class data_struct:
def __init__(self):
self.xi = []
self.yi = []
self.xf = []
self.yf = []
self.zf = []
self.l = []
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def readColourMap (self):\r\n \r\n num = self.bih_vals [bih_ColorsUsed]\r\n\r\n if num > 0:\r\n self.colourmap = [BLACK_FOUR] * num\r\n \r\n for i in range (0, num):\r\n self.colourmap [i] = self.the_file.read (4)",
"def ListColorMaps(self):\n ... | [
"0.60259837",
"0.5459343",
"0.5394355",
"0.53032047",
"0.52739567",
"0.5265471",
"0.52411604",
"0.5181697",
"0.5113824",
"0.5103776",
"0.50683075",
"0.504613",
"0.50393397",
"0.4961276",
"0.49567044",
"0.4953596",
"0.4949384",
"0.49407956",
"0.49344715",
"0.4923586",
"0.49077... | 0.5387882 | 3 |
Plots the color mapping together with the fixed points. Creates a movie file. | def tracer_movie(datadir = 'data/', tracerFile = 'tracers.dat',
fixedFile = 'fixed_points.dat', zlim = [],
head_size = 3, hm = 1,
imageDir = './', movieFile = 'fixed_points.mpg',
fps = 5.0, bitrate = 1800):
import pylab as plt
# read the ... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def show(self, view = None, save = False, savename = None, cmap = None):\n\n # define the style\n if cmap == None:\n style = PlotStyle(cmap_name = 'macplus')\n else:\n style = PlotStyle(cmap_name = cmap)\n \n # default is skymap\n if view == None:... | [
"0.66461504",
"0.6347427",
"0.6157591",
"0.6120898",
"0.6077686",
"0.60383564",
"0.6011217",
"0.59548956",
"0.59487545",
"0.594416",
"0.58821493",
"0.5876597",
"0.5861647",
"0.58368415",
"0.58342564",
"0.58336323",
"0.5828103",
"0.5826117",
"0.5800824",
"0.57943434",
"0.57858... | 0.72189265 | 0 |
Plots an image and the projections (sums) of it on the x, y axes. | def plot_image_and_proj(image, title="", **kwargs):
fig = plt.figure()
gs = gridspec.GridSpec(3, 2, width_ratios=[3, 1], height_ratios=[0.2, 3, 1])
ax0 = plt.subplot(gs[1,0])
plt.title(title)
ims = plt.imshow(image, aspect="auto", **kwargs)
ax2 = plt.subplot(gs[2,0], sharex=ax0, )
plt.... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def show(image):\n fig = pyplot.figure()\n ax = fig.add_subplot(1,1,1)\n imgplot = ax.imshow(image, cmap=mpl.cm.Greys)\n imgplot.set_interpolation('nearest')\n ax.xaxis.set_ticks_position('top')\n ax.yaxis.set_ticks_position('left')\n pyplot.show()",
"def show(image):\n fig = pyplot.figur... | [
"0.6885412",
"0.6744014",
"0.6729617",
"0.6729617",
"0.6729617",
"0.66539717",
"0.6561349",
"0.6445221",
"0.64222753",
"0.6366756",
"0.62954986",
"0.62783086",
"0.6277011",
"0.6251577",
"0.623828",
"0.62100685",
"0.62035716",
"0.6173411",
"0.6167177",
"0.61653167",
"0.6155882... | 0.7413701 | 0 |
rebins a numpy array. | def rebin(a, *args):
shape = a.shape
lenShape = len(shape)
factor = np.asarray(shape) / np.asarray(args)
#print factor
evList = ['a.reshape('] + ['args[%d],factor[%d],' % (i, i) for i in range(lenShape)] + [')'] + ['.mean(%d)' % (i + 1) for i in range(lenShape)]
return eval(''.join(evList)) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def rebin(array, dimensions=None, scale=None):\n if dimensions is not None:\n if isinstance(dimensions, float):\n dimensions = [int(dimensions)] * len(array.shape)\n elif isinstance(dimensions, int):\n dimensions = [dimensions] * len(array.shape)\n elif len(dimensions)... | [
"0.7262481",
"0.65253717",
"0.65092903",
"0.64562315",
"0.63404644",
"0.633843",
"0.6212981",
"0.62020236",
"0.6028213",
"0.5951686",
"0.5910494",
"0.5862693",
"0.57666206",
"0.57557595",
"0.57353413",
"0.5715855",
"0.5715112",
"0.5693231",
"0.5686959",
"0.56741536",
"0.56739... | 0.5666983 | 22 |
Request data for a list of block hashes. | def send_get_data(self, block_hashes):
msg = msg_getdata()
for x in block_hashes:
msg.inv.append(CInv(MSG_BLOCK, x))
self.send_message(msg) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def get_blocks():\n chain_to_send = blockchain\n blocklist = \"\"\n for i in range(len(chain_to_send)):\n block = chain_to_send[i]\n block_index = str(block.index)\n block_timestamp = str(block.timestamp)\n block_data = str(block.data)\n block_hash = block.hash\n ... | [
"0.6409231",
"0.6145271",
"0.6124917",
"0.59927475",
"0.5951528",
"0.5827728",
"0.5783262",
"0.57184494",
"0.56973565",
"0.56766754",
"0.5650549",
"0.5647434",
"0.5635516",
"0.56190014",
"0.5569193",
"0.5569193",
"0.55531555",
"0.55520594",
"0.55443203",
"0.5535596",
"0.55184... | 0.70251316 | 0 |
Test whether the last headers announcements received are right. Headers may be announced across more than one message. | def check_last_headers_announcement(self, headers):
test_function = lambda: (len(self.recent_headers_announced) >= len(headers))
self.wait_until(test_function)
with p2p_lock:
assert_equal(self.recent_headers_announced, headers)
self.block_announced = False
sel... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def has_bad_headers(self):\n\n headers = [self.sender, self.reply_to] + self.recipients\n for header in headers:\n if _has_newline(header):\n return True\n\n if self.subject:\n if _has_newline(self.subject):\n for linenum, line in enumerate(s... | [
"0.65723264",
"0.61208695",
"0.6049333",
"0.6003903",
"0.59692436",
"0.5896339",
"0.5871474",
"0.5851515",
"0.57597494",
"0.57581687",
"0.57434636",
"0.57434636",
"0.573652",
"0.57329977",
"0.5717457",
"0.5645279",
"0.55954987",
"0.55861056",
"0.55829144",
"0.555257",
"0.5521... | 0.8560445 | 0 |
Test whether the last announcement received had the right inv. inv should be a list of block hashes. | def check_last_inv_announcement(self, inv):
test_function = lambda: self.block_announced
self.wait_until(test_function)
with p2p_lock:
compare_inv = []
if "inv" in self.last_message:
compare_inv = [x.hash for x in self.last_message["inv"].inv]
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def InventoryReceived(self, inventory):\n if inventory.Hash.ToBytes() in self._MissedBlocks:\n self._MissedBlocks.remove(inventory.Hash.ToBytes())\n\n if inventory is MinerTransaction:\n return False\n\n if type(inventory) is Block:\n if BC.Default() is None:\n... | [
"0.61076456",
"0.5824365",
"0.5646299",
"0.5420734",
"0.5327307",
"0.5240005",
"0.5224036",
"0.5191901",
"0.51852673",
"0.5120963",
"0.51135236",
"0.51021546",
"0.506925",
"0.5056993",
"0.50302124",
"0.49842632",
"0.4932219",
"0.4904889",
"0.49018604",
"0.48957723",
"0.487126... | 0.87524366 | 0 |
Mine count blocks and return the new tip. | def mine_blocks(self, count):
# Clear out block announcements from each p2p listener
[x.clear_block_announcements() for x in self.nodes[0].p2ps]
self.generatetoaddress(self.nodes[0], count, self.nodes[0].get_deterministic_priv_key().address)
return int(self.nodes[0].getbestblockhash(), ... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def num_blocks(self): # -> int:\n ...",
"def getblocknumber(self):\n return self.getblockcount()",
"def calculate_tip(meal_base, tip_rate):",
"def getblockcount(self):\n return self.proxy.getblockcount()",
"def parent_block_count(self):\n return self.block_count",
"def parent_... | [
"0.5717195",
"0.5667572",
"0.56337124",
"0.5575411",
"0.5538822",
"0.55174536",
"0.54982716",
"0.5473228",
"0.53758806",
"0.5342303",
"0.53158927",
"0.5282329",
"0.521116",
"0.52065545",
"0.52049637",
"0.5188872",
"0.5170571",
"0.5148232",
"0.5138396",
"0.50767654",
"0.507296... | 0.6711444 | 0 |
Mine a reorg that invalidates length blocks (replacing them with length+1 blocks). | def mine_reorg(self, length):
# make sure all invalidated blocks are node0's
self.generatetoaddress(self.nodes[0], length, self.nodes[0].get_deterministic_priv_key().address)
for x in self.nodes[0].p2ps:
x.wait_for_block_announcement(int(self.nodes[0].getbestblockhash(), 16))
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def simple_reorg(self, height, shift=0):\n hashes = []\n fee_delta = 1000000\n orig_len = self.rpc.getblockcount()\n old_hash = self.rpc.getblockhash(height)\n if height + shift > orig_len:\n final_len = height + shift\n else:\n final_len = 1 + orig_l... | [
"0.57378554",
"0.5465236",
"0.5457202",
"0.5445514",
"0.54246277",
"0.5282873",
"0.52699226",
"0.5255896",
"0.5254636",
"0.52333164",
"0.51682156",
"0.5163101",
"0.51473725",
"0.5139157",
"0.5117177",
"0.5074714",
"0.5061125",
"0.50600505",
"0.50330913",
"0.50164944",
"0.5009... | 0.749667 | 0 |
Runs the whole wikipedia search, together with lyrics finding. | def run_wiki(self):
if self._GUI:
self._run_wiki_gui()
else:
self._run_wiki_nogui() | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"async def wikipedia(self, ctx, *args):\n if args[0] == 'random':\n search_string = wp.random()\n else:\n search_string = ' '.join(args)\n try:\n page = wp.page(search_string)\n await ctx.send(page.url)\n self.logger.info(misolog.format_log... | [
"0.67166257",
"0.6488033",
"0.6475075",
"0.64746183",
"0.64621586",
"0.6325236",
"0.63031155",
"0.6220119",
"0.6122326",
"0.6061428",
"0.6002297",
"0.5992761",
"0.5969819",
"0.59484017",
"0.5912623",
"0.58962756",
"0.5869023",
"0.58089393",
"0.58037156",
"0.5797445",
"0.57879... | 0.62240905 | 7 |
Runs wikipedia search with specifics of the GUI mode. | def _run_wiki_gui(self):
# download wikipedia page and track progress
for message in self._get_preload_progress():
self._log.info(message)
# get error messages
error_msg = self.get_wiki()
if error_msg:
self._log.exception(error_msg)
return
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def run_wiki(self):\n if self._GUI:\n self._run_wiki_gui()\n else:\n self._run_wiki_nogui()",
"def _run_wiki_nogui(self):\n # start wikipedia page download\n self._log_print(msg_WHITE=\"Accessing Wikipedia...\")\n\n # download wikipedia page and track prog... | [
"0.76001346",
"0.6732584",
"0.66468334",
"0.64920026",
"0.637046",
"0.6308497",
"0.62137115",
"0.61376846",
"0.59760535",
"0.58787346",
"0.58726466",
"0.5860763",
"0.57994395",
"0.5774797",
"0.575818",
"0.5740816",
"0.57193905",
"0.5642093",
"0.55962086",
"0.55757457",
"0.556... | 0.66015536 | 3 |
Runs wikipedia search with specifics of the CLI mode. | def _run_wiki_nogui(self):
# start wikipedia page download
self._log_print(msg_WHITE="Accessing Wikipedia...")
# download wikipedia page and track progress
for message in self._get_preload_progress():
if "Searching for" in message:
print(f"Searching for: {GRE... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def main():\r\n\tlang = get_arguments()\r\n\twiki_analyzer(lang)",
"def run_wiki(self):\n if self._GUI:\n self._run_wiki_gui()\n else:\n self._run_wiki_nogui()",
"async def wikipedia(self, ctx, *args):\n if args[0] == 'random':\n search_string = wp.random()... | [
"0.69756997",
"0.67441213",
"0.6535245",
"0.64060724",
"0.63568765",
"0.6059705",
"0.6055238",
"0.6047968",
"0.6033085",
"0.60146636",
"0.5997462",
"0.59583163",
"0.5935665",
"0.59245986",
"0.5850023",
"0.57979184",
"0.5791227",
"0.57871526",
"0.57797074",
"0.57765484",
"0.57... | 0.58614343 | 14 |
Runs only the lyrics search. | def run_lyrics(self):
if self._GUI:
self._run_lyrics_gui()
else:
self._run_lyrics_nogui() | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def _run_lyrics_gui(self):\n self._log.info(\"Searching for lyrics\")\n\n self.save_lyrics(find=True)\n Action(\"load\", load=True)\n\n self._log.info(\"Done\")",
"def _run_lyrics_nogui(self):\n self.read_files()\n\n # find lyrics\n self._log_print(msg_GREEN=\"Sea... | [
"0.7195334",
"0.6765707",
"0.625291",
"0.5987377",
"0.595524",
"0.5927061",
"0.5899226",
"0.5836227",
"0.5817641",
"0.5816498",
"0.579893",
"0.574689",
"0.57248443",
"0.56937945",
"0.56414646",
"0.56008506",
"0.5592254",
"0.55891544",
"0.55754983",
"0.5552696",
"0.5535671",
... | 0.67778045 | 1 |
Runs only lyrics search with specifics of the GUI mode. | def _run_lyrics_gui(self):
self._log.info("Searching for lyrics")
self.save_lyrics(find=True)
Action("load", load=True)
self._log.info("Done") | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def run_lyrics(self):\n if self._GUI:\n self._run_lyrics_gui()\n else:\n self._run_lyrics_nogui()",
"def _run_lyrics_nogui(self):\n self.read_files()\n\n # find lyrics\n self._log_print(msg_GREEN=\"Searching for lyrics\")\n\n self.save_lyrics()\n\n ... | [
"0.7300415",
"0.66114295",
"0.60927004",
"0.5863751",
"0.57411414",
"0.5515903",
"0.54406303",
"0.54393154",
"0.54014164",
"0.53518796",
"0.53172654",
"0.5292283",
"0.52921987",
"0.52903503",
"0.52819675",
"0.52603555",
"0.5241229",
"0.5237763",
"0.5199213",
"0.5194571",
"0.5... | 0.7690281 | 0 |
Runs only lyrics search with specifics of the CLI mode. | def _run_lyrics_nogui(self):
self.read_files()
# find lyrics
self._log_print(msg_GREEN="Searching for lyrics")
self.save_lyrics()
if not self.write_tags():
self._log_print(msg_WHITE="Cannot write tags because there are no "
"coresponding... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def run_lyrics(self):\n if self._GUI:\n self._run_lyrics_gui()\n else:\n self._run_lyrics_nogui()",
"def _run_lyrics_gui(self):\n self._log.info(\"Searching for lyrics\")\n\n self.save_lyrics(find=True)\n Action(\"load\", load=True)\n\n self._log.in... | [
"0.6299983",
"0.61536944",
"0.5727433",
"0.56997216",
"0.5563074",
"0.5563074",
"0.5563074",
"0.5563074",
"0.5563074",
"0.5563074",
"0.5563074",
"0.5563074",
"0.5563074",
"0.5563074",
"0.5563074",
"0.5563074",
"0.5563074",
"0.5563074",
"0.5563074",
"0.5563074",
"0.5563074",
... | 0.57702047 | 2 |
Redirects the input to sandard print function and to logger. | def _log_print(self, msg_GREEN: str = "", msg_WHITE: str = "",
level: str = "INFO"):
if msg_GREEN != "":
print(GREEN + "\n" + msg_GREEN)
if msg_WHITE != "":
print(msg_WHITE)
if self.with_log:
msg_GREEN = msg_GREEN + msg_WHITE
i... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def log(self, *args):\n self.log_stdout(*args)\n print(*args, file=self.general_log_file.file)\n self.general_log_file.flush()",
"def logd(*args,**kwargs):\n print(*args,**kwargs)",
"def logi(*args,**kwargs):\n print(*args,**kwargs)",
"def print_to_log(self, output):\n print... | [
"0.61365193",
"0.5962254",
"0.5897776",
"0.5858442",
"0.5809685",
"0.58020663",
"0.57541764",
"0.57420594",
"0.57316464",
"0.57227707",
"0.5666022",
"0.56396466",
"0.5610015",
"0.559532",
"0.55662394",
"0.55633086",
"0.5562591",
"0.55440575",
"0.55145746",
"0.5485701",
"0.544... | 0.0 | -1 |
Instantiates and returns the list of permissions that this view requires. | def get_permissions(self):
from rest_framework.permissions import IsAuthenticated, IsAdminUser
if self.action =='retrieve' or self.action == 'update':
permission_classes = [IsAuthenticated]
else:
permission_classes = [IsAdminUser]
return [permission() for permissi... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def get_permissions(self):\n if self.action == 'list':\n permission_classes = [IsAuthenticated]\n else:\n permission_classes = [IsAdminUser]\n return [permission() for permission in permission_classes]",
"def get_permissions(self):\n if self.action in ['list', 'r... | [
"0.77929497",
"0.7738158",
"0.76905394",
"0.7635271",
"0.7618894",
"0.7523193",
"0.7523193",
"0.7523193",
"0.7497525",
"0.74957764",
"0.74865115",
"0.7463958",
"0.7431705",
"0.7407442",
"0.7388661",
"0.73826563",
"0.73599124",
"0.73599124",
"0.7338907",
"0.73276186",
"0.73226... | 0.7412355 | 13 |
Performs check of Batch Job Definition resources. | def validate_batch_jobdef(jobdef_name, jobdef_meta):
jobdef_config = [
{
'field_name': 'job_definition_name',
'field_value': jobdef_name,
'prefix': '',
'validators': [
_validate_required_field
]
},
{
'fie... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def check(job, logger, **kwargs):\n resources = Resource.objects.filter(\n attributes__field__name=\"health_check_config\",\n lifecycle='ACTIVE'\n ).distinct()\n set_progress(\n f\"Will run health checks for {resources.count()} resource(s): \"\n f\"{[resource.name for resource ... | [
"0.62273604",
"0.6216369",
"0.6215212",
"0.6123421",
"0.5834572",
"0.5767516",
"0.57664996",
"0.57414484",
"0.5740669",
"0.5720601",
"0.5710162",
"0.5699154",
"0.56262213",
"0.56172216",
"0.560389",
"0.5580481",
"0.5572657",
"0.55699986",
"0.5552269",
"0.55290383",
"0.5528586... | 0.5939888 | 4 |
Performs check of Batch Job Definition container properties. | def _validate_container_properties(container_properties, prefix=None):
if not prefix:
prefix = 'container_properties'
container_config = [
{
'field_name': 'image',
'field_value': container_properties.get('image'),
'prefix': prefix,
'required_type'... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def validate_batch_jobdef(jobdef_name, jobdef_meta):\n jobdef_config = [\n {\n 'field_name': 'job_definition_name',\n 'field_value': jobdef_name,\n 'prefix': '',\n 'validators': [\n _validate_required_field\n ]\n },\n {\n... | [
"0.5902173",
"0.5750896",
"0.56742275",
"0.5597777",
"0.5589587",
"0.54979694",
"0.5465641",
"0.5424713",
"0.5351139",
"0.53396976",
"0.5328847",
"0.53148127",
"0.5310186",
"0.52777135",
"0.5270606",
"0.5264659",
"0.526109",
"0.52511007",
"0.5231011",
"0.52110624",
"0.5206256... | 0.5885001 | 1 |
Performs check of Batch Job Definition node properties. | def _validate_node_properties(node_properties):
prefix = "node_properties"
node_config = [
{
'field_name': 'num_nodes',
'field_value': node_properties.get('num_nodes'),
'prefix': prefix,
'required_type': int,
'validators': [
_v... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def do_check(self):\n res = self.entity.do_check(self.context)\n if res:\n return self.RES_OK, 'Node check succeeded.'\n else:\n return self.RES_ERROR, 'Node check failed.'",
"def testJobProperties(databases):\n\n def checkProperties(config):\n jobId = 'job0'\... | [
"0.5726081",
"0.5479812",
"0.5411448",
"0.54105157",
"0.5342148",
"0.533808",
"0.53298527",
"0.53278095",
"0.52813226",
"0.5255622",
"0.52098536",
"0.51880246",
"0.5187591",
"0.51826173",
"0.51661396",
"0.5164461",
"0.5122845",
"0.50707555",
"0.50669897",
"0.5056435",
"0.4971... | 0.52965343 | 8 |
Checks whether a field contains value from options list. | def _validate_options_field(field_name, field_value, field_options, prefix='compute_resources', required=True,
**kwargs):
if prefix:
field_name = prefix + '__' + field_name
if not required and not field_value:
return
if required and not field_value:
raise... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def has_field(self, field):\n return field in self.extra_fields",
"def validate_list(self, field: str, valid_options: List[str]):\n val = getattr(self, field)\n if isinstance(val, list):\n for v in val:\n if v not in valid_options:\n raise ConfigE... | [
"0.6772843",
"0.6770741",
"0.65378916",
"0.6467454",
"0.64476067",
"0.642903",
"0.6388305",
"0.63799673",
"0.6366266",
"0.6352894",
"0.62737393",
"0.62451977",
"0.6222812",
"0.61857563",
"0.61797684",
"0.6174338",
"0.6145381",
"0.61405945",
"0.6127393",
"0.6114891",
"0.608521... | 0.58903366 | 33 |
Checks whether a field is not empty. | def _validate_required_field(field_name, field_value, prefix='', **kwargs):
if prefix:
field_name = prefix + '__' + field_name
if not field_value:
raise AssertionError(
"Missing required Job Definition field: {0}".format(field_name)
) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def fields_not_empty(self, request, fields):\r\n for field in fields:\r\n if request.form.get(field) == \"\":\r\n return True",
"def is_field_empty(*args):\n for field in args:\n if field == \"\" or field is None:\n return True\n return False\n retu... | [
"0.8196847",
"0.8190954",
"0.7810049",
"0.76465976",
"0.74038506",
"0.7305314",
"0.71583134",
"0.7110507",
"0.70736223",
"0.7062157",
"0.702601",
"0.7011126",
"0.6952208",
"0.6849574",
"0.684919",
"0.6829089",
"0.6820689",
"0.67973214",
"0.67973214",
"0.6735313",
"0.668302",
... | 0.0 | -1 |
Class to create sqlalchemy engine that creates a connection to the postgresql database | def __init__(self):
with open('config.json') as config:
data = json.load(config)
password = self.decode_password(data['db']['password'])
db_conn_string = 'postgresql://' + data['db']['username'] + ':' + password + '@' + \
data['db']['hostname'] + ':' + data['db'... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def create_engine(self):\n connection_string = f'postgresql://{self.user}:{self.password}@{self.host}/{self.database_name}'\n return create_engine(connection_string)",
"def postgres_engine():\n return create_engine(\n \"postgresql+psycopg2://postgres:postgres@localhost:5432/postgres\"\n ... | [
"0.85938287",
"0.81512064",
"0.7748867",
"0.7690821",
"0.76155734",
"0.75913906",
"0.75913906",
"0.75913906",
"0.75913906",
"0.7512063",
"0.75113755",
"0.75113755",
"0.75113755",
"0.75113755",
"0.75113755",
"0.74599236",
"0.74490184",
"0.7440237",
"0.7433673",
"0.7428703",
"0... | 0.7128721 | 37 |
Create a new DB table for the DataFrame | def create_db_dataframe(self, df, table_name):
try:
print("-I- Writing " + table_name + " with DataFrame")
df.to_sql(name=table_name, con=self.engine, if_exists='replace', index=True)
print("-I- Write complete.")
except Exception as e:
print("-W- " + str(e... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def test_create_from_dataframe(self):\n self.insert()\n data = self.tbl.select()\n data.index.name = None\n tbl = Table.create(':memory:', \"Foo_2\", data, verbose=True,\n primary_key='id', autoincrement=True)\n self.check(self.idata, tbl.select())",
"... | [
"0.77422994",
"0.7363433",
"0.7361235",
"0.73389554",
"0.7315704",
"0.7284163",
"0.7265219",
"0.71784484",
"0.71592116",
"0.7123823",
"0.7109681",
"0.7104714",
"0.7104014",
"0.70893764",
"0.7065188",
"0.7056585",
"0.70464426",
"0.7045202",
"0.7043078",
"0.70418227",
"0.703520... | 0.7874062 | 0 |
Appends DataFrame to the specified table | def append_db_dataframe(self, df, table_name):
try:
print("-I- Appending " + table_name + " with DataFrame")
df.to_sql(name=table_name, con=self.engine, if_exists='append', index=True)
print("-I- Append complete.")
except Exception as e:
print("-W- " + str... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def append_data(self, table_name, df):\n\t\tself.__check_colnames(table_name, df)\n\t\tif self.__dbfile is not None:\n\t\t\tdf.to_sql(table_name, self._conn, index=False, if_exists=\"append\")",
"def append_table(self, table):\n if not table:\n return\n\n indexes = []\n for idx in... | [
"0.7775088",
"0.7292738",
"0.71129256",
"0.6842862",
"0.67572284",
"0.65789384",
"0.6511594",
"0.6447779",
"0.6344674",
"0.6329825",
"0.6316417",
"0.63103884",
"0.63037944",
"0.62382275",
"0.6213505",
"0.6189217",
"0.6157169",
"0.6135792",
"0.60964775",
"0.60880053",
"0.60660... | 0.7644748 | 1 |
Fetch table rows as DataFrame from DB | def fetch_db_dataframe(self, table_name):
try:
df = pd.read_sql("SELECT * from " + table_name, self.engine)
print("-I- Completed read of DataFrame from " + table_name)
return df
except Exception as e:
print("-W- " + str(e)) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def get_df_from_db(self, query):\n cursor = self.conn.cursor()\n cursor.execute(query)\n data = cursor.fetchall()\n col_des = cursor.description\n col_des = [tuple([x[0].split('.')[1] if '.' in x[0] else x[0]] + list(x[1:])) for x in col_des]\n col_name = [col_des[i][0] fo... | [
"0.77204275",
"0.7645398",
"0.7582545",
"0.75139314",
"0.7212028",
"0.71883446",
"0.7178315",
"0.71595347",
"0.7121151",
"0.71134925",
"0.7097488",
"0.7083992",
"0.70649976",
"0.70540386",
"0.70290405",
"0.7011723",
"0.6963181",
"0.6963087",
"0.6963087",
"0.6942861",
"0.69389... | 0.7459254 | 4 |
Function to drop a table from database | def delete_table(self, table_name):
try:
conn = self.engine.connect()
conn.execute("DROP table " + table_name)
print("-I- Deleted table " + table_name)
except Exception as e:
print("-W- " + str(e)) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def drop_table(database, table):\n sql = \"\"\"DROP TABLE %s\"\"\" % table\n print \"Dropping Table %s from the Database %s\" % (table, database)\n execute_and_commit_sql(database, sql)\n return None",
"def drop_table(self, tablename):\n # print \"table dropped\"\n # return\n que... | [
"0.8561063",
"0.8105781",
"0.80805856",
"0.80335814",
"0.80307484",
"0.80158985",
"0.7943399",
"0.7852007",
"0.7827041",
"0.7801511",
"0.77916324",
"0.7746427",
"0.7729509",
"0.7694827",
"0.7643605",
"0.7637667",
"0.7588141",
"0.7575856",
"0.75757736",
"0.7534007",
"0.7496094... | 0.74913865 | 22 |
Set up method to run before each test path. This method is what we will test against. | def setUp(self):
# Below creating the new contact object to test.
self.new_contact = Contact(
"James", "Muriuki", "0712345678", "james@moringaschool.com") | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def setUp(self):\n test_env_setup()",
"def setUp(self):\n\n BaseTest.setUp(self)",
"def before_run_tests(cls):\n pass",
"def setUp(self):\n MainTests.setUp(self)",
"def setUp(self):\r\n # nothing to do, all tests use different things\r\n pass",
"def setUp(self):\... | [
"0.7800788",
"0.7673815",
"0.76113003",
"0.7583631",
"0.7572131",
"0.7566645",
"0.75313616",
"0.7520116",
"0.7492312",
"0.7445783",
"0.7420635",
"0.7420635",
"0.7404525",
"0.7404525",
"0.7394234",
"0.73852617",
"0.7367745",
"0.7367745",
"0.7335178",
"0.7313432",
"0.7313432",
... | 0.0 | -1 |
tearDown method that does clean up after each test case has run. | def tearDown(self):
# Here the tearDown() method assigns the contact_list in the Contact class empty. This helps us get accurate test results everytime have a new test case
Contact.contact_list = [] | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def tearDown(self):\n pass\n # teardown called after each test\n # e.g. maybe write test results to some text file",
"def tearDown(self):\n\n BaseTest.tearDown(self)",
"def tearDown(self):\r\n testing.tearDown()",
"def tearDown(self):\n test_env_teardown()",
"def t... | [
"0.902119",
"0.85692024",
"0.8544352",
"0.85033065",
"0.8487935",
"0.8463634",
"0.8455392",
"0.83962137",
"0.83711165",
"0.83711165",
"0.83711165",
"0.8367389",
"0.835362",
"0.8340901",
"0.8315141",
"0.8311377",
"0.8311377",
"0.82752293",
"0.82752293",
"0.8262432",
"0.8262432... | 0.0 | -1 |
has to be called test_init. This is to test if the object is initialized properly. | def test_init(self):
# the self.assertEqual() checks fofr an expected result
# We are checking if the name and description of our new object is what we actually put
self.assertEqual(self.new_contact.first_name, "James")
self.assertEqual(self.new_contact.last_name, "Muriuki")
self... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def test_01_Init(self):\n pass",
"def test_constructor(self):\n pass",
"def test_init(self):\n DummyCryptographicObject()",
"def test_init_default(self):\n self._test_init_default()",
"def _init(self):\n pass",
"def test_init(self):\n self.assertIsNotNone(Databas... | [
"0.83787113",
"0.8083209",
"0.79607624",
"0.77785724",
"0.771468",
"0.76992875",
"0.769153",
"0.7689209",
"0.7689209",
"0.7689209",
"0.7689209",
"0.7689209",
"0.7689209",
"0.7689209",
"0.7689209",
"0.7661461",
"0.76603156",
"0.7660213",
"0.76516056",
"0.76247585",
"0.76247585... | 0.7438927 | 38 |
test_save_contact test case to test if the contact object is saved into the contact list | def test_save_contact(self):
# .save_contact() is the save to contact function.
# Test would check if an addition has been made to our contact list
self.new_contact.save_contact()
self.assertEqual(len(Contact.contact_list), 1) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def test_save_contact(self):\n self.new_contact.save_contact() # saving the new contact\n self.assertEqual(len(Contact.contact_list), 1)",
"def test_save_multiple_contacts(self):\n self.new_contact.save_contact() # saving the new contact\n test_contact = Contact(\"Test\", \"User\", ... | [
"0.90264815",
"0.8396352",
"0.8371293",
"0.7489064",
"0.73771274",
"0.7365106",
"0.7324921",
"0.730443",
"0.7194348",
"0.7193277",
"0.7079255",
"0.70014966",
"0.69934404",
"0.6915084",
"0.691342",
"0.6848425",
"0.68055904",
"0.67810017",
"0.67704403",
"0.67631304",
"0.6691770... | 0.8957478 | 1 |
def test_save_multiple_contact to check if we can save multiple contacts to our contact_list | def test_save_multiple_contact(self):
self.new_contact.save_contact()
# new contact
test_contact = Contact("Test", "user", "0798765432", "test@user.com")
test_contact.save_contact()
self.assertEqual(len(Contact.contact_list), 2) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def test_save_multiple_contacts(self):\n self.new_contact.save_contact() # saving the new contact\n test_contact = Contact(\"Test\", \"User\", 254712345678, \"test@user.com\") # new user\n test_contact.save_contact() # saving the new contact\n self.assertEqual(len(Contact.contact_lis... | [
"0.91369456",
"0.8120368",
"0.80584645",
"0.73653406",
"0.70864254",
"0.70563537",
"0.7039114",
"0.70254576",
"0.6958467",
"0.68221486",
"0.68147147",
"0.6792331",
"0.66435987",
"0.65641314",
"0.6561918",
"0.65477175",
"0.6451238",
"0.6439873",
"0.64368606",
"0.6408157",
"0.6... | 0.9152661 | 0 |
test_delete_contact to test if we can remove a contact from our contact list | def test_delete_contact(self):
self.new_contact.save_contact()
# new contact
test_contact = Contact("Test", "user", "0745639300", "test@usr.com")
# new contact saved
test_contact.save_contact()
# For deleting the new contact
self.new_contact.delete_contact()
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def test_delete_contact(self):\n self.new_contact.save_contact()\n test_contact = Contact(\"Test\", \"User\", 254712345678, \"test@user.com\") # new contact\n test_contact.save_contact()\n self.new_contact.delete_contact() # delete a contact object\n self.assertEqual(len(Contac... | [
"0.87605715",
"0.8085114",
"0.766524",
"0.73715454",
"0.72436273",
"0.7203849",
"0.7119705",
"0.6994788",
"0.69293314",
"0.6898616",
"0.68878806",
"0.6867588",
"0.6844377",
"0.6803209",
"0.678051",
"0.6768761",
"0.67519003",
"0.67358315",
"0.67193764",
"0.66907907",
"0.668907... | 0.88033223 | 0 |
Test to check if we can find a contact by phone nuber and display any information. | def test_find_by_number(self):
self.new_contact.save_contact()
# new contact
test_contact = Contact("Test", "user", "0748363839", "test@user.com")
test_contact.save_contact()
# The number that we find in found_contact should be the same as the one in test_contact for the test to ... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def search_contact():\n if request.method == 'GET':\n tel = request.args.get('tel')\n contact = io_client.get_contacts(urn=['tel:+52' + tel]).all()\n if contact:\n return jsonify({\"existe\": \"Si\"}), 201\n return jsonify({\"existe\": \"No\"}), 404",
"def test_get_conta... | [
"0.712528",
"0.6798059",
"0.65811235",
"0.64409727",
"0.63759893",
"0.62315255",
"0.6139972",
"0.60520345",
"0.60456944",
"0.6019896",
"0.59364927",
"0.5919249",
"0.59148854",
"0.5910279",
"0.5864654",
"0.5852436",
"0.5850235",
"0.58484715",
"0.5841883",
"0.5810253",
"0.58101... | 0.5991998 | 10 |
Test to check if we can return a Boolean if we cannot find the contact. | def test_contact_exists(self):
self.new_contact.save_contact()
# Test user
test_contact = Contact("Test", "user", "0722334455", "test@user.com")
# We save
test_contact.save_contact()
# variable that stores what we expect
contact_exists = Contact.contact_exist("07... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def get_is_workshop_contact(self, obj):\n user = self.context['request'].user\n if not user.is_authenticated:\n return False\n # pylint: disable=no-member\n profile = UserProfile.objects.get(user=user)\n return profile in obj.contacts.all()",
"def found(raise_error: ... | [
"0.6157852",
"0.6054971",
"0.60262066",
"0.5897116",
"0.58594185",
"0.5804995",
"0.5778651",
"0.57772166",
"0.56551945",
"0.563208",
"0.56082284",
"0.5526532",
"0.5509251",
"0.5509251",
"0.55092347",
"0.55092347",
"0.55092347",
"0.5499786",
"0.5489946",
"0.5465567",
"0.546275... | 0.6327621 | 0 |
Method that returns a list of all contacts saved. | def test_display_all_contact(self):
self.assertEqual(Contact.display_contacts(), Contact.contact_list) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def list_contacts(self):\n return self.contacts",
"def ListAllContacts(self):\n feed = self.gd_client.GetContacts()\n self.contacts = self.CleanPhoneNumbers(self.GetContactsInfo(feed))\n return self.contacts",
"def get_contacts(self):\n\n\t\treturn self.__contacts",
"def update_contacts(self)... | [
"0.8201797",
"0.80560666",
"0.78120834",
"0.7591751",
"0.75464964",
"0.7476027",
"0.745762",
"0.74265754",
"0.72620547",
"0.724315",
"0.7199225",
"0.71166533",
"0.70863086",
"0.7026332",
"0.6961944",
"0.6945557",
"0.6881635",
"0.6696314",
"0.66937345",
"0.6691385",
"0.6591449... | 0.60417026 | 44 |
Test to confirm that we are copying the email address from a found contact | def test_copy_email(self):
self.new_contact.save_contact()
Contact.copy_email("0712345678")
self.assertEqual(self.new_contact.email, pyperclip.paste())
# Below we are simply stating that if the module being tested is running we collect the test methods and execute them. | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def test_copy_email(self):\n self.new_contact.save_contact()\n Contact.copy_email(254719702373)\n\n self.assertEqual(self.new_contact.email, pyperclip.paste())",
"def test_copy_email(self):\n\n\n self.new_credential.save_credential()\n Credential.copy_email(\"Chris\")\n\n ... | [
"0.83343744",
"0.7601879",
"0.6900183",
"0.6812739",
"0.6561415",
"0.6468561",
"0.6455767",
"0.64429235",
"0.6356866",
"0.6320259",
"0.62970245",
"0.62465024",
"0.6236399",
"0.6219535",
"0.6197941",
"0.6197167",
"0.6179059",
"0.6178218",
"0.61507607",
"0.6110539",
"0.60834587... | 0.7637972 | 1 |
partial_distance_covariance_test(x, y, z, num_resamples=0, exponent=1, random_state=None) Test of partial distance covariance independence. Compute the test of independence based on the partial distance covariance, for two random vectors conditioned on a third. The test is a permutation test where the null hypothesis i... | def partial_distance_covariance_test(x, y, z, **kwargs):
# pylint:disable=too-many-locals
random_state = _random_state_init(kwargs.pop("random_state", None))
# B
num_resamples = kwargs.pop("num_resamples", 0)
_check_kwargs_empty(kwargs)
# Compute U-centered matrices
u_x = _dcor_internals.... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def test_coeffvar(self):\n self.assertEqual(coeffvar(list1, sample=False), np.std(list1) /\n np.mean(list1))\n self.assertEqual(coeffvar(list1), np.std(list1, ddof=1) /\n np.mean(list1))",
"def test_exact_two_qubit_cnot_decompose_random(self, seed):\n... | [
"0.5698384",
"0.53769475",
"0.5372643",
"0.52613395",
"0.51615024",
"0.5145563",
"0.50757515",
"0.50168383",
"0.4970485",
"0.4894757",
"0.484348",
"0.48419997",
"0.48381978",
"0.48207268",
"0.48052663",
"0.47089332",
"0.470408",
"0.46567678",
"0.463776",
"0.46216598",
"0.4603... | 0.8479564 | 0 |
Creates an SSL keyfile and returns the path. | def CreateKeyFile():
keyfile = tempfile.mkstemp()[1]
cmd = [
'openssl',
'genrsa',
'-out', keyfile,
'2048'
]
_RunCommand(cmd)
return keyfile | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def _keypath(self) -> pathlib.Path:\n home = pathlib.Path.home()\n keyfile = home / \".cmdc\" / \"apikey\"\n keyfile.parent.mkdir(parents=True, exist_ok=True)\n return keyfile",
"def generate_key():\r\n # generating key\r\n key = Fernet.generate_key()\r\n\r\n key_dir = os.pat... | [
"0.6690019",
"0.640222",
"0.63990533",
"0.63100165",
"0.6247914",
"0.6236544",
"0.622373",
"0.61842155",
"0.6159797",
"0.6129716",
"0.6111204",
"0.6094071",
"0.6050029",
"0.60403",
"0.60227233",
"0.6010699",
"0.5991577",
"0.59733444",
"0.59372234",
"0.5916288",
"0.5860859",
... | 0.7345631 | 0 |
Creates an SSL CSR file and returns the path. | def CreateCsrFile(keyfile):
csrfile = tempfile.mkstemp()[1]
cmd = [
'openssl',
'req',
'-new',
'-key', keyfile,
'-out', csrfile,
'-subj', '/C=NA/ST=NA/L=NA/O=Chromium/OU=Test/CN=chromium.org'
]
_RunCommand(cmd)
return csrfile | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def CreateCrtFile(keyfile, csrfile):\n crtfile = tempfile.mkstemp()[1]\n cmd = [\n 'openssl',\n 'x509',\n '-req',\n '-days', '1',\n '-in', csrfile,\n '-signkey', keyfile,\n '-out', crtfile\n ]\n _RunCommand(cmd)\n return crtfile",
"def create_csr(dn):\n tmp_file = f... | [
"0.76157844",
"0.7091698",
"0.682195",
"0.66409546",
"0.64632416",
"0.64031243",
"0.6295008",
"0.6232049",
"0.6201246",
"0.6178768",
"0.61259174",
"0.61010826",
"0.6063991",
"0.5976694",
"0.5963608",
"0.5935446",
"0.58889717",
"0.58795524",
"0.58761525",
"0.5852114",
"0.57947... | 0.7676574 | 0 |
Creates an SSL CRT file and returns the path. | def CreateCrtFile(keyfile, csrfile):
crtfile = tempfile.mkstemp()[1]
cmd = [
'openssl',
'x509',
'-req',
'-days', '1',
'-in', csrfile,
'-signkey', keyfile,
'-out', crtfile
]
_RunCommand(cmd)
return crtfile | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def _retrieve_crt_path(haproxy_base_dir, listener, primary_cn):\n confs_dir = os.path.abspath(os.path.normpath(haproxy_base_dir))\n confs_path = os.path.join(confs_dir, listener.id)\n if haproxy_base_dir and listener.id:\n if not os.path.isdir(confs_path):\n os.makedirs(confs_path, 0o755... | [
"0.6699168",
"0.6504106",
"0.6388449",
"0.6253104",
"0.62328863",
"0.6191254",
"0.6086789",
"0.60492927",
"0.6046661",
"0.5963553",
"0.5953179",
"0.59513456",
"0.57639164",
"0.5744498",
"0.5647329",
"0.56415385",
"0.56214416",
"0.561746",
"0.55993444",
"0.55791825",
"0.553878... | 0.71155643 | 0 |
Creates an SSL PEM file and returns the path. | def CreatePemFile():
keyfile = CreateKeyFile()
csrfile = CreateCsrFile(keyfile)
crtfile = CreateCrtFile(keyfile, csrfile)
pemfile = tempfile.mkstemp()[1]
with open(keyfile) as k:
with open(crtfile) as c:
with open(pemfile, 'wb') as p:
p.write('%s\n%s' % (k.read(), c.read()))
return pemfile | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def ca_file(tmpdir):\n key = rsa.generate_private_key(public_exponent=65537, key_size=2048)\n public_key = key.public_key()\n\n builder = x509.CertificateBuilder()\n builder = builder.subject_name(\n x509.Name([x509.NameAttribute(NameOID.COMMON_NAME, \"pyopenssl.org\")])\n )\n builder = bu... | [
"0.66648823",
"0.6361533",
"0.62127554",
"0.6201686",
"0.61935896",
"0.6074794",
"0.6025097",
"0.5998469",
"0.5896556",
"0.5884485",
"0.5839449",
"0.5786212",
"0.5751437",
"0.57417154",
"0.5737081",
"0.57288885",
"0.57241213",
"0.5713234",
"0.56344074",
"0.55794954",
"0.55756... | 0.7334299 | 0 |
Creates and returns a connection to an SSL RPC server. | def Connect(server, port=common_lib.SERVER_PORT):
addr = 'https://%s:%d' % (server, port)
logging.debug('Connecting to RPC server at %s', addr)
return jsonrpclib.ServerProxy(addr, allow_none=True) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def ConnectSSL(self):\n with open(self.DEFAULT_CLIENT_KEY_FILE, 'rb') as f:\n private_key = f.read()\n with open(self.DEFAULT_CLIENT_CHAIN_FILE, 'rb') as f:\n certificate_chain = f.read()\n with open(self.DEFAULT_ROOT_CERT_FILE, 'rb') as f:\n root_ca = f.read()... | [
"0.7047686",
"0.70328885",
"0.6644007",
"0.64732254",
"0.644927",
"0.62140524",
"0.61953074",
"0.6174031",
"0.6171852",
"0.6162838",
"0.6138797",
"0.61199987",
"0.61196625",
"0.60930616",
"0.6070115",
"0.6068998",
"0.60384196",
"0.60375965",
"0.60001844",
"0.60000044",
"0.599... | 0.65039414 | 3 |
Convenience method to download data from S3 and return it as a string | def get_from_s3(s3_client, s3_url):
url = urlparse(s3_url)
# Split the bucket from the key
bucket_name = urllib2.unquote(url.netloc).decode('utf8')
key_name = urllib2.unquote(url.path[1:]).decode('utf8')
# We're done parsing; start doing some S3 ops
bucket = s3_client.get_bucket(bucket_name, v... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def get_s3_object_text(s3_resource: boto3.session.Session.resource, bucket_name: str, key: str) -> str:\n obj = s3_resource.Object(bucket_name, key)\n return obj.get()['Body'].read().decode('utf-8')",
"def retrieve_s3_contents ( s3_conn, bucket_name, key_name, stored_filename = None ) :\n bucket = s3_con... | [
"0.7161001",
"0.7014146",
"0.6936319",
"0.67600614",
"0.6748984",
"0.67472315",
"0.6715",
"0.667104",
"0.66632414",
"0.66501606",
"0.66501606",
"0.6650045",
"0.6590507",
"0.65865976",
"0.6584135",
"0.65775824",
"0.65639305",
"0.6542722",
"0.6508517",
"0.64936024",
"0.6488956"... | 0.6910201 | 3 |
Creates a j1 float value for head_1_joint FollowJointTrajectoryGoal with the specified goal | def createTTSGoal(text, lang_id='', wait_before_speaking=rospy.Duration(0.0)):
sound_goal = SoundGoal()
sound_goal.text=text
sound_goal.lang_id=lang_id
sound_goal.wait_before_speaking=wait_before_speaking
return sound_goal | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def compute_jerk(joint_trajectory):\r\n joint_vel = np.gradient(joint_trajectory, axis=1)\r\n joint_acc = np.gradient(joint_vel, axis=1)\r\n joint_jerk = np.gradient(joint_acc, axis=1)\r\n jerk = np.linalg.norm(joint_jerk)\r\n return jerk",
"def _get_trajectory_parameters(self, joint_names, goal):... | [
"0.57482255",
"0.5338517",
"0.5250078",
"0.52079666",
"0.5205086",
"0.5158983",
"0.5120888",
"0.5094038",
"0.5089993",
"0.50717366",
"0.5035613",
"0.50216293",
"0.5004459",
"0.4998951",
"0.4990246",
"0.49518824",
"0.49275857",
"0.49016118",
"0.48945734",
"0.4890885",
"0.48699... | 0.0 | -1 |
Add a new connection variable test the connection save the variables | def add(self, name: str):
print("Adding new connection object '{}'...\n".format(name))
drivername = input("Drivername: ")
connector = self._load(drivername)
try:
config = connector.setup()
except KeyboardInterrupt:
return print("Setup cancelled.")
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def add_connection(self, connection):\n self.connections[connection.id] = connection",
"def add_connection(self, connection_id):\n self.connection_load = random.random() * 10 + 1\n self.connection = {connection_id: connection_load}\n self.connections.update(connection)",
"def test_c... | [
"0.63593096",
"0.61824965",
"0.6128532",
"0.6085057",
"0.60615504",
"0.60603815",
"0.6047875",
"0.5987283",
"0.5913636",
"0.5909906",
"0.5907722",
"0.58825845",
"0.5882315",
"0.5880187",
"0.5871605",
"0.58155376",
"0.5778564",
"0.5764854",
"0.5759328",
"0.575695",
"0.57390064... | 0.5462191 | 34 |
Parse a connection string and setup the manager for working with a connection | def connect(self, name: str):
if name in self.config:
config = self.config[name].copy()
drivername = config.pop('drivername')
connector = self._load(drivername)
connection = connector(**config)
else:
raise ValueError("No connection referred t... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def _parse_connection_string(self, connection_string):\n self.host = '127.0.0.1'\n self.port = 3306\n self.db = None\n self.user = None\n self.pwd = None\n for part in connection_string.split(';'):\n part = part.strip()\n if part != '':\n ... | [
"0.7421976",
"0.6754677",
"0.6019895",
"0.5980538",
"0.59241205",
"0.5827837",
"0.5811387",
"0.5772588",
"0.57364815",
"0.5713465",
"0.570279",
"0.5649966",
"0.56399196",
"0.5631981",
"0.5596738",
"0.5589974",
"0.5581357",
"0.55780095",
"0.5566211",
"0.5550092",
"0.55224144",... | 0.0 | -1 |
Transform from one radial coordinate to another. Note that this coordinate conversion is only strictly valid inside of the LCFS. | def rad_coord_transform(x,name_in,name_out, geqdsk):
if name_in == name_out:
return x
if 'r_V' not in geqdsk['fluxSurfaces']['geo']:
R0 = geqdsk['RMAXIS']
eq_vol = geqdsk['fluxSurfaces']['geo']['vol']
r_V = np.sqrt(eq_vol/(2*np.pi**2*R0))
geqdsk['fluxSurfaces']['geo']['r... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def deg2rad_inplace(a):",
"def convert(self, lat, lon):\r\n a = self.a\r\n b = self.b\r\n long0 = self.long0\r\n k0 = self.k0\r\n dx = self.dx\r\n\r\n e = (1 - b ** 2 / a ** 2) ** 0.5\r\n e2 = e ** 2 / (1 - e ** 2)\r\n n = (a - b) / (a + b)\r\n nu = ... | [
"0.6106413",
"0.5955033",
"0.5679703",
"0.5614722",
"0.56037164",
"0.55267453",
"0.54864424",
"0.5467077",
"0.5389721",
"0.5381061",
"0.5360404",
"0.535843",
"0.535422",
"0.5338711",
"0.53266436",
"0.5319456",
"0.53012145",
"0.52922064",
"0.52901214",
"0.52864665",
"0.5284524... | 0.6349656 | 0 |
Gets a JSON file from the PREP, saves it and extracts required data to a dict. | def get_prep(file_name):
headers = {
"User-Agent": "Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:60.0) Gecko/20100101 Firefox/60.0"}
url = "https://rp18.ine.mx/assets/JSON/PRESIDENTE/NACIONAL/Presidente_NACIONAL.json"
with requests.get(url, headers=headers) as response:
# Save a copy for... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def ingest_json_file(request):\n path = save_file(request) \n try:\n with open(path, encoding='utf-8') as f:\n data = json.loads(f.read())\n except Exception as e:\n log.error(log.exc(e))\n return None\n return data",
"def get_relevant_dict(domain: str) -> dict:\n ... | [
"0.6347891",
"0.62267184",
"0.6123482",
"0.6113618",
"0.597682",
"0.5953838",
"0.5900119",
"0.5893709",
"0.5890557",
"0.5878286",
"0.5856924",
"0.584468",
"0.584468",
"0.58373594",
"0.581583",
"0.5804766",
"0.5803907",
"0.57861716",
"0.57676995",
"0.5763947",
"0.57342213",
... | 0.57467836 | 20 |
initialize your data structure here. | def __init__(self):
self.minheap = []
self.maxheap = [] | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def _init_empty(self):\n self._data = []",
"def __init__(self):\n self.data = []\n self.record = {}",
"def __init__(self):\n self.structure = {}",
"def __init__(self):\n self._data = []",
"def __init__(self):\n self._data = []",
"def __init__(self):\n self... | [
"0.7761043",
"0.76102185",
"0.7555967",
"0.7549892",
"0.7549892",
"0.7549892",
"0.7549892",
"0.7549892",
"0.7549892",
"0.752797",
"0.7446006",
"0.7446006",
"0.7446006",
"0.7446006",
"0.7446006",
"0.743338",
"0.743338",
"0.7408609",
"0.7385719",
"0.737986",
"0.737986",
"0.73... | 0.0 | -1 |
Transformation to apply on each notebook. You should return modified nb, resources. If you wish to apply your transform on each cell, you might want to overwrite transform_cell method instead. | def call(self, nb, resources):
self.log.debug("Applying transform: %s", self.__class__.__name__)
try :
for worksheet in nb.worksheets:
for index, cell in enumerate(worksheet.cells):
worksheet.cells[index], resources = self.transform_cell(cell, resources, i... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def transform_cell(self, cell, resources, index):\n\n raise NotImplementedError('should be implemented by subclass')\n return cell, resources",
"def cell_preprocessor(function):\n\n @functools.wraps(function)\n def wrappedfunc(nb: NotebookNode, resources: dict) -> (NotebookNode, dict):\n ... | [
"0.585268",
"0.57084334",
"0.56029147",
"0.5561479",
"0.5502522",
"0.5467713",
"0.5347716",
"0.52935684",
"0.52670693",
"0.5254548",
"0.5215245",
"0.52104896",
"0.51687974",
"0.5122487",
"0.50810003",
"0.50767034",
"0.50586015",
"0.5045944",
"0.4984737",
"0.49372816",
"0.4937... | 0.76527107 | 0 |
Overwrite if you want to apply a transformation on each cell. You should return modified cell and resource dictionary. | def transform_cell(self, cell, resources, index):
raise NotImplementedError('should be implemented by subclass')
return cell, resources | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def call(self, nb, resources):\n self.log.debug(\"Applying transform: %s\", self.__class__.__name__)\n try :\n for worksheet in nb.worksheets:\n for index, cell in enumerate(worksheet.cells):\n worksheet.cells[index], resources = self.transform_cell(cell, ... | [
"0.65440035",
"0.5804093",
"0.57728004",
"0.57344264",
"0.5611276",
"0.5597317",
"0.5579851",
"0.5579851",
"0.5579851",
"0.55642366",
"0.55408597",
"0.54695153",
"0.5432807",
"0.5426063",
"0.53927785",
"0.53927785",
"0.53927785",
"0.53927785",
"0.53927785",
"0.53927785",
"0.5... | 0.70315164 | 0 |
Generate xml representation of self for upload to server. Returns | def _generate_flow_xml(self):
model = self.model
flow_dict = OrderedDict()
flow_dict['oml:flow'] = OrderedDict()
flow_dict['oml:flow']['@xmlns:oml'] = 'http://openml.org/openml'
flow_dict['oml:flow']['oml:name'] = self._get_name()
flow_dict['oml:flow']['oml:external_vers... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def xml(self):\n raise NotImplementedError('must be implemented by all subclasses')",
"def xml(self):\n raise NotImplementedError('This api does not return xml')",
"def get_xml(self):\n return etree.tostring(self.get_etree())",
"def toxml(self) :\n\t\treturn self.doc.toxml()",
"def xml... | [
"0.7834428",
"0.7579679",
"0.7369056",
"0.7199811",
"0.7109393",
"0.7109393",
"0.7021206",
"0.691179",
"0.68817455",
"0.6821038",
"0.66802734",
"0.6664244",
"0.6604715",
"0.66046584",
"0.6604575",
"0.6562038",
"0.6549967",
"0.65493363",
"0.65181774",
"0.6500574",
"0.6483287",... | 0.5766485 | 83 |
Publish flow to OpenML server. Returns | def publish(self):
xml_description = self._generate_flow_xml()
file_elements = {'description': xml_description}
return_code, return_value = _perform_api_call(
"flow/", file_elements=file_elements)
self.flow_id = int(xmltodict.parse(return_value)['oml:upload_flow']['oml:id'])... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def publish(self):\n return",
"def publish():\n pass",
"def publish(self, waypoints): \n lane = Lane()\n lane.header.frame_id = '/world'\n lane.header.stamp = rospy.Time(0)\n lane.waypoints = waypoints\n self.final_waypoints_pub.publish(lane)",
"def _generate_flow... | [
"0.637059",
"0.6307481",
"0.5872563",
"0.5749436",
"0.56772095",
"0.56606215",
"0.5617935",
"0.55418754",
"0.552572",
"0.5460382",
"0.54280865",
"0.54070175",
"0.53559107",
"0.5355898",
"0.5346886",
"0.53458697",
"0.5340997",
"0.53381914",
"0.53381914",
"0.5327639",
"0.529557... | 0.7366736 | 0 |
Checks if a flow exists for the given model and possibly creates it. If the given flow exists on the server, the flowid will simply be returned. Otherwise it will be uploaded to the server. Returns | def _ensure_flow_exists(self):
import sklearn
flow_version = 'sklearn_' + sklearn.__version__
_, _, flow_id = _check_flow_exists(self._get_name(), flow_version)
# TODO add numpy and scipy version!
if int(flow_id) == -1:
return_code, response_xml = self.publish()
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"async def create_flow(self, flow: \"FlowObject\") -> UUID:\n return await self.create_flow_from_name(flow.name)",
"async def create_flow_from_name(self, flow_name: str) -> UUID:\n flow_data = FlowCreate(name=flow_name)\n response = await self._client.post(\n \"/flows/\", json=flow... | [
"0.63103426",
"0.5682208",
"0.5225242",
"0.513043",
"0.49558088",
"0.49539042",
"0.48757178",
"0.4860312",
"0.48489386",
"0.48403105",
"0.4821129",
"0.48097745",
"0.48096967",
"0.4789475",
"0.47876206",
"0.47869292",
"0.47778752",
"0.47659418",
"0.4671119",
"0.46696758",
"0.4... | 0.69185144 | 0 |
Helper function. Can be mocked for testing. | def _get_name(self):
return self.name | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def _test(self):",
"def _test(self):",
"def _test(self):",
"def _test(self):",
"def _test(self):",
"def test_get(self):\n pass",
"def __call__(self) -> None:",
"def test_4_4_1_1(self):\n pass",
"def test_create_unexpected_problem(self):\n pass",
"def unitary_test():",
"def ... | [
"0.61880225",
"0.61880225",
"0.61880225",
"0.61880225",
"0.61880225",
"0.60830206",
"0.6077034",
"0.60485405",
"0.59680647",
"0.59153825",
"0.59080714",
"0.59010756",
"0.59010756",
"0.59010756",
"0.58822715",
"0.58752346",
"0.58752346",
"0.5852382",
"0.5852382",
"0.5852382",
... | 0.0 | -1 |
Returns an app instance. | def create_app(instance_path=None, test_config=None):
# create and configure the bit-wallet
app = Flask(__name__, instance_path=instance_path)
app.jinja_options["autoescape"] = None
app.config.from_mapping(
SECRET_KEY='dev',
UPLOAD_FOLDER='upload',
MYSQL_HOST=os.getenv('MYSQL_HO... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def get_app(self):\n return Application()",
"def get_app(self):\n\n app = APP\n return app",
"def app(self):\n if self._application is None:\n self._application = Application(client=self)\n return self._application",
"def get_app():\n\n global _app\n if _ap... | [
"0.85812575",
"0.8342205",
"0.8175058",
"0.81618136",
"0.8146952",
"0.81320703",
"0.7800049",
"0.77903914",
"0.7774205",
"0.77098906",
"0.765999",
"0.7645297",
"0.76180446",
"0.7616076",
"0.7611414",
"0.7560359",
"0.755171",
"0.7541826",
"0.74648577",
"0.74374753",
"0.7399785... | 0.0 | -1 |
Parse TFExample records and perform simple data augmentation. | def parse_fn(serialized_example):
features = {
'video': tf.io.FixedLenFeature([], tf.string),
'label': tf.io.FixedLenFeature([], tf.int64),
'seq_len': tf.io.FixedLenFeature([], tf.int64),
'height': tf.io.FixedLenFeature([], tf.int64),
'width': tf.io.FixedLenFeature([], tf.in... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def parser(record):\n record_spec = {\n \"input\": tf.FixedLenFeature([seq_len], tf.int64),\n \"labels\": tf.FixedLenFeature([tgt_len], tf.int64),\n \"input_mask\": tf.FixedLenFeature([seq_len],tf.float32),\n \"target_mask\": tf.FixedLenFeature([tgt_len],tf.float32)\n }\n\n # r... | [
"0.68483853",
"0.660834",
"0.66064477",
"0.641451",
"0.6373467",
"0.6352471",
"0.63505834",
"0.6334366",
"0.63030005",
"0.62588114",
"0.6236913",
"0.6209942",
"0.61765295",
"0.61758536",
"0.61287767",
"0.6117243",
"0.611522",
"0.60871506",
"0.6077659",
"0.6074646",
"0.6071809... | 0.5510347 | 95 |
Read the data in from xyz.csv add two new columns, one to calculate dollar flux, and the other to calculate percentage flux return as a list of tuples | def calculate_flux(XYZ: str) -> list:
df = pd.read_csv(XYZ)
df['Dollar Flux'] = df['12/31/20'] - df['12/31/19']
df['Percentage Flux'] = df['12/31/20'] / df['12/31/19'] - 1
return list(tuple(df.loc[i]) for i in range(df.shape[0])) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def calculate_flux(XYZ: str) -> list:\n\n\n data = pd.read_csv(XYZ,dtype={'12/31/2020': int,'12/31/2019': int})\n\n data['dollar_flux'] = data.iloc[:,1].sub(data.iloc[:,2])\n data['pct_flux'] = data.iloc[:,[-2,1]].pct_change(axis=1).dropna(axis=1)\n\n\n return list(data.to_records(index=False))",
"de... | [
"0.685175",
"0.6411039",
"0.62081707",
"0.6109357",
"0.60995525",
"0.5916653",
"0.5815268",
"0.58103406",
"0.5806701",
"0.5740641",
"0.57309264",
"0.571921",
"0.570458",
"0.5695528",
"0.5673751",
"0.56716675",
"0.5653346",
"0.5641983",
"0.5631174",
"0.5611434",
"0.56070626",
... | 0.70332384 | 0 |
Load the list of tuples, iterate through each item and determine if it is above both thresholds. if so, add to the list | def identify_flux(xyz: list) -> list:
flagged_lines = [tup for tup in xyz if abs(tup[3]) > THRESHOLDS[0] and abs(tup[4]) > THRESHOLDS[1]]
return flagged_lines | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def findAlternatives(sortedList):\n #zeroing the data below treshold\n global TRESHOLD\n # if THRESHOLD == 0:\n TRESHOLD = readsHistogram(sortedList)\n afterTresholdData = []\n print(len(sortedList))\n for i in range(len(sortedList)):\n if np.mean(sortedList[i].getSamples()) >= TRESHOLD... | [
"0.61527246",
"0.5832117",
"0.5770874",
"0.5667276",
"0.561511",
"0.55497396",
"0.54834783",
"0.5480274",
"0.5390675",
"0.53718406",
"0.5363759",
"0.53632814",
"0.5358989",
"0.53322583",
"0.53311914",
"0.5315088",
"0.5308043",
"0.5296117",
"0.52910286",
"0.52749586",
"0.52669... | 0.0 | -1 |
Makes sure begin/end pairs have length of at least zero. | def _validate_constants(verbose=False):
d = globals()
for from_key in d:
if not from_key.endswith("_begin"):
continue
to_key = from_key[:-len("_begin")]+"_end"
if not to_key in d:
if verbose:
print "%s has no matching %s" % (from_key, to_ke... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def empty(self):\r\n if len(self.s1)==0 and len(self.s2)==0:\r\n return True",
"def isEmpty(self):\n return self.start == -1 and self.end == -1",
"def empty(self):\n return len(self.a) + len(self.b) == 0",
"def empty(self) -> bool:\n return len(self.a) == 0 and len(self... | [
"0.65438414",
"0.650208",
"0.6418912",
"0.6320043",
"0.6155419",
"0.61419684",
"0.6141011",
"0.61290944",
"0.61186117",
"0.6038338",
"0.6038338",
"0.6029582",
"0.60150236",
"0.599977",
"0.5993547",
"0.5993121",
"0.59815663",
"0.59691274",
"0.5963844",
"0.59615463",
"0.5957896... | 0.0 | -1 |
Run gdal_merge using an external process. | def run_merge(*src, argv=None):
tmpdir = tempfile.mkdtemp()
inputs = []
for i, drv in enumerate(src):
if type(drv) != str:
tmppath = os.path.join(tmpdir, "input_%s.tif" % i)
drv.write(tmppath)
inputs.append(tmppath)
else:
inputs.append(src)
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def call_gdal_util(util_name,\n gdal_path=None,\n src_files='',\n src_band=None,\n dst_file=None,\n options={}):\n # define specific options\n _opt_2b_in_quote = [\"-mo\", \"-co\"]\n\n # get the gdal installed path i... | [
"0.6366613",
"0.6252653",
"0.5960626",
"0.59505725",
"0.5807357",
"0.5765494",
"0.57650673",
"0.5709829",
"0.563321",
"0.5595598",
"0.55921483",
"0.5452208",
"0.5446093",
"0.54422516",
"0.5391504",
"0.5345127",
"0.5292853",
"0.52140045",
"0.5213958",
"0.51817507",
"0.5178978"... | 0.7390473 | 0 |
Create inital launcher with angle 45 degrees and velocity 40 win is the GraphWin to draw the launcher in. | def __init__(self, win):
# draw the base shot of the launcher
base = Circle(Point(0,0), 3)
base.setFill("red")
base.setOutline("red")
base.draw(win)
# save the window and create initial angle and velocity
self.win = win
self.angle = radians(45.0)... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def __init__(self, win): \r\n\r\n # draw the base shot of the launcher \r\n base = Circle(Point(0,0), 3) \r\n base.setFill('red')\r\n base.setOutline('red')\r\n base.draw(win) \r\n\r\n # save the window and create initial angle and velocity\r\n self.win = win \r\n ... | [
"0.73945683",
"0.6352571",
"0.5805394",
"0.579472",
"0.5572521",
"0.55596024",
"0.5541648",
"0.5446335",
"0.54389066",
"0.5437201",
"0.5429614",
"0.54086167",
"0.54053193",
"0.5386864",
"0.5362621",
"0.53455466",
"0.5335464",
"0.53260404",
"0.52860785",
"0.52791184",
"0.52733... | 0.7478532 | 0 |
undraw the arrow and draw a new one for the current values of angle and velocity. | def redraw(self):
self.arrow.undraw()
pt2 = Point(self.vel*cos(self.angle), self.vel*sin(self.angle))
self.arrow = Line(Point(0,0), pt2).draw(self.win)
self.arrow.setArrow("last")
self.arrow.setWidth(3) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def redraw(self): \r\n\r\n self.arrow.undraw() \r\n pt2 = Point(self.vel*cos(self.angle), self.vel*sin(self.angle))\r\n self.arrow = Line(Point(0,0), pt2).draw(self.win) \r\n self.arrow.setArrow('last')\r\n self.arrow.setWidth(3)",
"def get_quiver_arrows(self):\n dif_x =... | [
"0.77334005",
"0.65644336",
"0.6287359",
"0.6213265",
"0.61974335",
"0.6153086",
"0.5998839",
"0.5908423",
"0.5908423",
"0.59016716",
"0.5891196",
"0.58837223",
"0.5872633",
"0.5846972",
"0.58233887",
"0.5820985",
"0.5800393",
"0.57933944",
"0.5788004",
"0.5777631",
"0.575778... | 0.7731802 | 1 |
change angle by amt degrees | def adjAngle(self, amt):
self.angle = self.angle+radians(amt)
self.redraw() | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def adjAngle(self, amt): \r\n\r\n self.angle = self.angle + radians(amt)\r\n self.redraw()",
"def angle(self) -> float:\n ...",
"def angle(self, angle_deg) -> None:\n ...",
"def rotateDegrees(angle):\n rotate(angle *2*math.pi / 360)",
"def angle(self) -> int:",
"def angle(s... | [
"0.8125653",
"0.7635241",
"0.7557885",
"0.75281644",
"0.751763",
"0.7443927",
"0.73215574",
"0.7298224",
"0.72973174",
"0.7293998",
"0.7246493",
"0.72278506",
"0.7201105",
"0.7193929",
"0.7187989",
"0.7185721",
"0.7136344",
"0.71154463",
"0.71035147",
"0.7098545",
"0.7091846"... | 0.79394275 | 1 |
change velocity by amt | def adjVel(self, amt):
self.vel = self.vel + amt
self.redraw() | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def change_velocity(self, delta):\n self.velocity += delta",
"def change_velocity(self, delta):\n self.velocity += delta",
"def adjVel(self, amt):\r\n\r\n self.vel = self.vel + amt \r\n self.redraw()",
"def new_velocity(self):\n self.velocity = self.vafter",
"def update_c... | [
"0.76103216",
"0.76103216",
"0.7526109",
"0.73344684",
"0.7196258",
"0.7111217",
"0.6884669",
"0.6863433",
"0.6834674",
"0.6805781",
"0.67380685",
"0.6668846",
"0.65749025",
"0.65732276",
"0.6555495",
"0.6555495",
"0.6544642",
"0.6541888",
"0.65295243",
"0.64781934",
"0.64715... | 0.71967214 | 4 |
win is the GraphWin to display the shot, angle, velocity, and height are initial projectile parameters. | def __init__(self, win, angle, velocity, height):
self.proj = Projectile(angle, velocity, height)
self.marker = Circle(Point(0,height), 3)
self.marker.setFill("red")
self.marker.setOutline("red")
self.marker.draw(win) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def __init__(self, win):\n \n # draw the base shot of the launcher\n base = Circle(Point(0,0), 3)\n base.setFill(\"red\")\n base.setOutline(\"red\")\n base.draw(win)\n\n # save the window and create initial angle and velocity\n self.win = win\n self.an... | [
"0.61466646",
"0.611178",
"0.60369253",
"0.59023196",
"0.58787185",
"0.58351535",
"0.5771538",
"0.5740812",
"0.5733873",
"0.5672222",
"0.5656955",
"0.5644705",
"0.563213",
"0.55671704",
"0.554327",
"0.54865324",
"0.54692745",
"0.54463905",
"0.5439828",
"0.5418802",
"0.5388303... | 0.61944795 | 0 |
Move the shot dt seconds farther along its flight | def update(self, dt):
self.proj.update(dt)
center = self.marker.getCenter()
dx = self.proj.getX() - center.getX()
dy = self.proj.getY() - center.getY()
self.marker.move(dx,dy) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def move(self, dt):\n dt = dt",
"def move(self,dt):\n raise NotImplementedError(\"Robot.move\")",
"def move(self,dt):\n self.x_pos += self.x_vel*dt\n self.y_pos += self.y_vel*dt",
"def move(self, frames_per_second):\n # tuple_add in one line\n position_delta = tuple(... | [
"0.7594908",
"0.6922004",
"0.6899571",
"0.67924666",
"0.65794265",
"0.6302349",
"0.62913513",
"0.62547195",
"0.6249593",
"0.6245547",
"0.62434554",
"0.6196573",
"0.61463386",
"0.6144526",
"0.6091334",
"0.6084468",
"0.6074786",
"0.6065155",
"0.6053467",
"0.6045457",
"0.6045279... | 0.0 | -1 |
return the current x coordinate of the shot's center | def getX(self):
return self.proj.getX() | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def get_x_position(self):\n return self.rect.x",
"def _get_x(self):\n return self.position.x",
"def centerx(self):\n return self.left + self.width / 2",
"def get_x_position(self):\n return self.actual_coordinates[0]",
"def get_x(self):\n return self.posX",
"def get_x(se... | [
"0.8170842",
"0.79965454",
"0.7950228",
"0.78056806",
"0.7790852",
"0.7761694",
"0.7672446",
"0.7604114",
"0.75850916",
"0.7479844",
"0.74445426",
"0.7407246",
"0.74059206",
"0.7337172",
"0.7303859",
"0.727023",
"0.7150097",
"0.71477306",
"0.71369725",
"0.71034396",
"0.704470... | 0.65873474 | 50 |
return the current y coordinate of the shot's center | def getY(self):
return self.proj.getY() | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def get_y_position(self): \n return self.rect.y",
"def _get_y(self):\n return self.position.y",
"def y(self):\r\n return self.position.y",
"def get_y_position(self):\n return self.actual_coordinates[1]",
"def get_y(self):\n\t\treturn self._collision_rect.y + 25",
"def get_y... | [
"0.7937652",
"0.7730214",
"0.76843345",
"0.76624733",
"0.7574403",
"0.7466444",
"0.7450869",
"0.7435911",
"0.7431255",
"0.73885834",
"0.7357961",
"0.73478985",
"0.7332926",
"0.7316668",
"0.7212563",
"0.71838593",
"0.7172444",
"0.7161277",
"0.7153415",
"0.7126375",
"0.71033573... | 0.68248624 | 30 |
Testing base class with validation method for correct number answer | def test_task_with_one_int_validation_parameter_validate_data(number, expected_value):
assert algo.TaskWithOneIntValidationParameter.validate_data(number) == expected_value | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def test_non_numberic_validation(self):",
"def test_non_numberic_validation(self):",
"def test_validate_answer(self):\r\n problem = self.build_problem(answer=\"42\")\r\n responder = problem.responders.values()[0]\r\n self.assertTrue(responder.validate_answer('23.5'))\r\n self.assert... | [
"0.7708032",
"0.7708032",
"0.7614994",
"0.7284501",
"0.6842716",
"0.6842716",
"0.654897",
"0.6433062",
"0.6420513",
"0.6344961",
"0.63250494",
"0.6312314",
"0.62953454",
"0.62856126",
"0.62712264",
"0.6270192",
"0.6255088",
"0.6236374",
"0.62147146",
"0.6166879",
"0.61328876"... | 0.61860913 | 19 |
Testing base class with validation method for exceptions | def test_task_with_one_int_validation_parameter_validate_exceptions(number, expected_value):
with pytest.raises(expected_value):
algo.TaskWithOneIntValidationParameter.validate_data(number) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def test_validation(self):\n self.validationFails()",
"def test_should_not_be_callable(self):\n with self.assertRaises(NotImplementedError):\n BaseValidator()(\"any-value\")",
"def test_validate(self):\n pass",
"def test_validation(self):\r\n\r\n with self.assertRaises(... | [
"0.7366222",
"0.7237699",
"0.721509",
"0.7119311",
"0.7103784",
"0.70534474",
"0.7048264",
"0.6987562",
"0.6925039",
"0.6916672",
"0.6913254",
"0.6906676",
"0.68661255",
"0.68530154",
"0.68451655",
"0.68323594",
"0.68066764",
"0.6797967",
"0.6775788",
"0.67419225",
"0.6741922... | 0.0 | -1 |
Testing task 86b class main logic (must return sum of digits in number) | def test_task86a_main_logic(number, expected_value):
assert algo.Task86a.main_logic(number) == expected_value | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def sumDigit():",
"def test_hackerrank_sample1(self):\n result = find_digits(12)\n self.assertEquals(result, 2)",
"def test_hackerrank_sample2(self):\n result = find_digits(1012)\n self.assertEquals(result, 3)",
"def test_get_digits():\n assert(get_digits(333) != (0, 0, 0))\n ... | [
"0.77551347",
"0.73732257",
"0.7041684",
"0.68657595",
"0.6788567",
"0.6714662",
"0.66381955",
"0.662325",
"0.65548384",
"0.6548113",
"0.65290594",
"0.64524496",
"0.64524496",
"0.64524496",
"0.6447197",
"0.64175934",
"0.6396727",
"0.63797677",
"0.63792557",
"0.6335239",
"0.63... | 0.0 | -1 |
Testing task 86b class main logic (must return sum of digits in number) | def test_task86b_main_logic(number, expected_value):
assert algo.Task86b.main_logic(number) == expected_value | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def sumDigit():",
"def test_hackerrank_sample1(self):\n result = find_digits(12)\n self.assertEquals(result, 2)",
"def test_hackerrank_sample2(self):\n result = find_digits(1012)\n self.assertEquals(result, 3)",
"def test_get_digits():\n assert(get_digits(333) != (0, 0, 0))\n ... | [
"0.77525055",
"0.73731494",
"0.70414096",
"0.68663913",
"0.67888975",
"0.6712753",
"0.6635667",
"0.6624555",
"0.65572226",
"0.65503895",
"0.65295446",
"0.64538836",
"0.64538836",
"0.64538836",
"0.6445064",
"0.6417594",
"0.63978505",
"0.6378056",
"0.6377258",
"0.6335412",
"0.6... | 0.0 | -1 |
Testing task 330 class dividers func (must return set of all dividers of the number expect number itself) | def test_task330_main_logic(number, expected_value):
assert list(algo.Task330.main_logic(number)) == expected_value | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def GetDivisions(self):\n ...",
"def getDivisors(n):",
"def _find_dividers(num: int) -> List[int]:\r\n\r\n dividers: List[int] = list()\r\n while num != 1:\r\n primes = PrimeHandler.find_all_primes(num)\r\n for prime in reversed(primes):\r\n if num % prime == 0:\r\n ... | [
"0.70083207",
"0.7004219",
"0.69399697",
"0.67529577",
"0.6682449",
"0.66668093",
"0.6562514",
"0.64714795",
"0.6187801",
"0.60311484",
"0.60079634",
"0.60060436",
"0.5940947",
"0.58989966",
"0.583094",
"0.5802245",
"0.5745088",
"0.5736434",
"0.5720355",
"0.5699634",
"0.56498... | 0.0 | -1 |
Testing task 178b class main logic (must find the least number, that is bigger than n and is degree of number 2) | def test_task178b_main_logic(sequence, expected_value):
assert algo.Task178b.main_logic(sequence) == expected_value | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def get_n_best(self):\n pass",
"def gcd1(n1, n2):\n\n best = 1\n\n for i in range(1,n2+1):\n if n1 % i == 0 and n2 % i == 0 and i > best:\n best = i \n \n return best",
"def solution(n: int = 28123) -> int:\n\n nums = range(1, n+1)\n abundant = list... | [
"0.6518122",
"0.6298077",
"0.62705284",
"0.62541515",
"0.6244315",
"0.62386656",
"0.61806613",
"0.61793435",
"0.6156024",
"0.61484855",
"0.61337066",
"0.60931796",
"0.60901713",
"0.60744053",
"0.6061342",
"0.60485005",
"0.60432154",
"0.6038558",
"0.6019028",
"0.601486",
"0.60... | 0.0 | -1 |
Testing task 178c class main logic (must return amount of numbers which are the square of the even number) | def test_task178c_main_logic(sequence, expected_value):
assert algo.Task178c.main_logic(sequence) == expected_value | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def six():\r\n \r\n sum_squared = 0\r\n squared_sum = 0\r\n \r\n for i in range(1, 101):\r\n sum_squared += i**2\r\n squared_sum += i\r\n squared_sum = squared_sum**2\r\n \r\n return squared_sum - sum_squared",
"def test_suite():\n test(sum_of_squares([2, 3, 4]) == 29)\n ... | [
"0.70825744",
"0.6971916",
"0.6837792",
"0.6805783",
"0.6755617",
"0.6698033",
"0.6646547",
"0.66414",
"0.66411245",
"0.66252494",
"0.6544352",
"0.650353",
"0.64722973",
"0.6471484",
"0.6449431",
"0.644104",
"0.64404243",
"0.64325464",
"0.6417926",
"0.6417473",
"0.64026",
"... | 0.0 | -1 |
Testing task 178d class main logic (find amount of elements, which satisfy the condition\nAk < (Ak1 + Ak+1) / 2.) | def test_task178d(input_value, expected_value):
assert algo.Task178d.main_logic(input_value) == expected_value | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def test_suite():\n test(sum_all_elements([1,3,1,4,3,8]) == 5)\n test(sum_all_elements([1,3,5,7]) == 16)\n test(sum_all_elements([1, -7, 10, 23]) == -6)\n test(sum_all_elements(range(1,555,2)) == 76729)",
"def test_3_basic(self):\n plan = list(astar(self.mapp_1_s,\n la... | [
"0.623159",
"0.6213991",
"0.613622",
"0.6096122",
"0.6004598",
"0.59835726",
"0.59410703",
"0.591825",
"0.5910919",
"0.5905688",
"0.58777785",
"0.58679324",
"0.58545166",
"0.5842208",
"0.58124423",
"0.5808205",
"0.5807517",
"0.5783203",
"0.5782953",
"0.5779589",
"0.5765961",
... | 0.0 | -1 |
Testing task 178e class main logic (find amount of elements, which satisfy the condition\n2k < Ak < k!) | def test_task178e(input_value, expected_value):
assert algo.Task178e.main_logic(input_value) == expected_value | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def test_suite():\n test(sum_all_elements([1,3,1,4,3,8]) == 5)\n test(sum_all_elements([1,3,5,7]) == 16)\n test(sum_all_elements([1, -7, 10, 23]) == -6)\n test(sum_all_elements(range(1,555,2)) == 76729)",
"def main():\n LIMIT = 600\n GOAL = 1000\n for i in range(1, LIMIT + 1):\n for j... | [
"0.61493313",
"0.60819286",
"0.6049005",
"0.6046813",
"0.6008328",
"0.6006641",
"0.59959704",
"0.5975238",
"0.5971036",
"0.5952314",
"0.5950891",
"0.59478694",
"0.5946964",
"0.5891142",
"0.5890752",
"0.5879602",
"0.58724064",
"0.5866288",
"0.58557177",
"0.58525246",
"0.583461... | 0.0 | -1 |
Testing task 555 class main logic (build first n rows of Pascal's triangle) | def test_task555(input_value, expected_value):
assert list(algo.Task555.main_logic(input_value)) == expected_value | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def pascal_triangle(n):\n if n > 0:\n triangle_rows = [[1]]\n for i in range(1, n):\n middle_numbers_list = []\n for pair in zip(triangle_rows[-1], triangle_rows[-1][1:]):\n middle_numbers_list.append(sum(pair))\n triangle_rows.append([1] + middle_nu... | [
"0.74002606",
"0.72939163",
"0.7154903",
"0.70932907",
"0.70524055",
"0.7048367",
"0.69987327",
"0.6942326",
"0.68898964",
"0.682261",
"0.6699336",
"0.66957605",
"0.6665082",
"0.6664991",
"0.65769607",
"0.6509134",
"0.6398329",
"0.6390257",
"0.6361467",
"0.63577336",
"0.63531... | 0.0 | -1 |
Testing task 554 class main logic (must return list of pythagorean triplets) | def test_task554_main_logic(number, expected_value):
assert algo.Task554.main_logic(number + 1) == expected_value | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def main():\n # Since a < b < c, we have a + b + c = 1000 > a + a + a, making a < 334.\n for a in range(1, 334):\n # Then b + c = 1000 - a > b + b, making b < 500 - a/2.\n for b in range(a + 1, 501 - a // 2):\n c = 1000 - a - b\n\n # check for Pythagorean triplet\n ... | [
"0.80820906",
"0.7876407",
"0.765679",
"0.7482243",
"0.7481747",
"0.7405778",
"0.7372898",
"0.72456163",
"0.7105896",
"0.70815045",
"0.7053278",
"0.7037538",
"0.68017954",
"0.67534345",
"0.673594",
"0.66925913",
"0.66410345",
"0.6318562",
"0.62769186",
"0.62421864",
"0.620507... | 0.0 | -1 |
Testing task 107 class main logic (must return the largest integer k, at which 4 ^k < m) | def test_task107_main_logic(number, expected_value):
assert algo.Task107.main_logic(number) == expected_value | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def main() -> int:\n\n a = None\n for n, g in enumerate(gen_primes(100000, 1000000)):\n repeat, indices = check_if_has_3_repeated_digits(str(g))\n if repeat:\n a = check_for_family_of_primes(repeat, indices, list(str(g)))\n if len(a) > 7 and min(a) > 100000:\n ... | [
"0.6825895",
"0.67128354",
"0.6694615",
"0.6600402",
"0.659205",
"0.65894896",
"0.65685385",
"0.64729345",
"0.6467728",
"0.64583665",
"0.6435412",
"0.6422708",
"0.6354484",
"0.6291198",
"0.624428",
"0.62414813",
"0.62265134",
"0.62159485",
"0.618845",
"0.61884433",
"0.6183926... | 0.0 | -1 |
Testing task 243a class main logic (must return True if there are two numbers (x, y) that x ^2 + y ^2 = n) | def test_task243a_main_logic(number, expected_value):
assert algo.Task243a.main_logic(number) == expected_value | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def sat(nums: List[int]):\n a, b, c, n = nums\n return (a ** n + b ** n == c ** n) and min(a, b, c) > 0 and n > 2",
"def test():\n Z = func.evaluate_circuit(F, e_x, e_y, e_xor)\n if Z == d[0]:\n return 0\n elif Z == d[1]:\n return 1",
"def pythagorean_triples(n):\n pass"... | [
"0.6706456",
"0.66754526",
"0.6513662",
"0.6498251",
"0.6456267",
"0.6443523",
"0.64273536",
"0.64265066",
"0.639999",
"0.6359324",
"0.6353393",
"0.63304996",
"0.6319994",
"0.6313225",
"0.6308553",
"0.63083005",
"0.62622416",
"0.6259431",
"0.6248913",
"0.62471896",
"0.6246515... | 0.0 | -1 |
Testing task 243a class main logic (must return True if there are two numbers (x, y) that x ^2 + y ^2 = n) | def test_task243b_main_logic(number, expected_value):
assert algo.Task243b.main_logic(number) == expected_value | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def sat(nums: List[int]):\n a, b, c, n = nums\n return (a ** n + b ** n == c ** n) and min(a, b, c) > 0 and n > 2",
"def test():\n Z = func.evaluate_circuit(F, e_x, e_y, e_xor)\n if Z == d[0]:\n return 0\n elif Z == d[1]:\n return 1",
"def pythagorean_triples(n):\n pass"... | [
"0.67070174",
"0.6674726",
"0.6514928",
"0.65001607",
"0.64590937",
"0.6443379",
"0.643019",
"0.6427951",
"0.6402992",
"0.6362123",
"0.635343",
"0.6330218",
"0.63233894",
"0.63132364",
"0.63102883",
"0.630757",
"0.62614566",
"0.62584585",
"0.6249293",
"0.6248185",
"0.62469304... | 0.0 | -1 |
Testing task 108 class main logic ( must return the least number, that is bigger than n and is degree of number 2) | def test_task108_main_logic(number, expected_value):
assert algo.Task108.main_logic(number) == expected_value | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def pollard(N) :\n\tleft = right = seed\n\td = 1\n\twhile d == 1: \n\t\tleft = pseudo(left,N)\n\t\tright = pseudo(pseudo(right,N),N)\n\t\td = gcd(abs(left-right),N)\n\t\tif PRINT_TRACE : \n\t\t\tprint(left,right,d)\n\tif d == N : \n\t\tprint(\"Failure\")\n\telse :\n\t\tprint(\"non trivial factor is %d\"%d)",
"de... | [
"0.6351067",
"0.6322759",
"0.62906826",
"0.6278602",
"0.6233129",
"0.62023616",
"0.6182629",
"0.6170508",
"0.61595374",
"0.6153705",
"0.6142571",
"0.6103457",
"0.6080529",
"0.60778254",
"0.6067927",
"0.6057732",
"0.60488695",
"0.60452557",
"0.60165286",
"0.60158545",
"0.60100... | 0.0 | -1 |
Testing task 331a class main logic ( must return the sum of 3 integers in power 2, that is equal to n) | def test_task331a_main_logic(number, expected_value):
assert algo.Task331a.main_logic(number) == expected_value | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def sum_of_three_squares(n):\n special = {1:(1, 0, 0), 2:(1, 1, 0), 3:(1, 1, 1), 10: (1, 3, 0), 34: (3, 3, 4), 58:(3, 7, 0),\n 85:(6, 7, 0), 130:(3, 11, 0), 214:(3, 6, 13), 226:(8, 9, 9), 370:(8, 9, 15),\n 526:(6, 7, 21), 706:(15, 15, 16), 730:(1, 27, 0), 1414:(6, 17, 33), 1906:(13, 21, 36),\n ... | [
"0.71092266",
"0.69121766",
"0.6900263",
"0.6852991",
"0.68254423",
"0.6779459",
"0.6768679",
"0.6742208",
"0.66945046",
"0.66854495",
"0.66733605",
"0.6636726",
"0.65705687",
"0.6565622",
"0.65579176",
"0.6534161",
"0.65196925",
"0.650806",
"0.64977133",
"0.6482399",
"0.6475... | 0.0 | -1 |
Testing task 331b class main logic ( must return the array of sums of 3 integers in power 2, that is equal to n) | def test_task331b_main_logic(number, expected_value):
assert algo.Task331b.main_logic(number) == expected_value | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def sum_of_three_squares(n):\n special = {1:(1, 0, 0), 2:(1, 1, 0), 3:(1, 1, 1), 10: (1, 3, 0), 34: (3, 3, 4), 58:(3, 7, 0),\n 85:(6, 7, 0), 130:(3, 11, 0), 214:(3, 6, 13), 226:(8, 9, 9), 370:(8, 9, 15),\n 526:(6, 7, 21), 706:(15, 15, 16), 730:(1, 27, 0), 1414:(6, 17, 33), 1906:(13, 21, 36),\n ... | [
"0.6796521",
"0.67540747",
"0.6711268",
"0.67015684",
"0.6571917",
"0.6558617",
"0.65404266",
"0.650606",
"0.64722335",
"0.64675075",
"0.645329",
"0.6389222",
"0.63783646",
"0.63763386",
"0.6341474",
"0.633265",
"0.63314736",
"0.63301826",
"0.6326787",
"0.6307143",
"0.6287321... | 0.0 | -1 |
Testing base class with validation method for exceptions | def test_task_with_two_int_validation_parameters_validate_exceptions_task87(data, expected_value):
with pytest.raises(expected_value):
algo.Task87.validate_data(data) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def test_validation(self):\n self.validationFails()",
"def test_should_not_be_callable(self):\n with self.assertRaises(NotImplementedError):\n BaseValidator()(\"any-value\")",
"def test_validate(self):\n pass",
"def test_validation(self):\r\n\r\n with self.assertRaises(... | [
"0.7366222",
"0.7237699",
"0.721509",
"0.7119311",
"0.7103784",
"0.70534474",
"0.7048264",
"0.6987562",
"0.6925039",
"0.6916672",
"0.6913254",
"0.6906676",
"0.68661255",
"0.68530154",
"0.68451655",
"0.68323594",
"0.68066764",
"0.6797967",
"0.6775788",
"0.67419225",
"0.6741922... | 0.0 | -1 |
Testing task 87 class main logic | def test_task87_main_logic(number, quantity, expected_value):
assert algo.Task87.main_logic(number, quantity) == expected_value | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def task():",
"def task5(self):\n\n pass",
"def task(self):",
"def task(self):",
"def test_solve_task(self):\n pass",
"def task4(self):\n\n pass",
"def task1(self):\n \n pass",
"def task3(self):\n\n pass",
"def test_get_run(self):\n pass",
"def tas... | [
"0.76041514",
"0.7486486",
"0.74503386",
"0.74503386",
"0.7376307",
"0.73466694",
"0.7306746",
"0.7189935",
"0.7185765",
"0.71620274",
"0.7104699",
"0.7092412",
"0.7092412",
"0.7046849",
"0.70468414",
"0.70148546",
"0.69969004",
"0.69918513",
"0.69918513",
"0.69721514",
"0.69... | 0.0 | -1 |
Testing base class with validation method for exceptions | def test_task_with_two_int_validation_parameters_validate_exceptions_task226(data, expected_value):
with pytest.raises(expected_value):
algo.TaskWithTwoIntValidationParameters.validate_data(data) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def test_validation(self):\n self.validationFails()",
"def test_should_not_be_callable(self):\n with self.assertRaises(NotImplementedError):\n BaseValidator()(\"any-value\")",
"def test_validate(self):\n pass",
"def test_validation(self):\r\n\r\n with self.assertRaises(... | [
"0.7366222",
"0.7237699",
"0.721509",
"0.7119311",
"0.7103784",
"0.70534474",
"0.7048264",
"0.6987562",
"0.6925039",
"0.6916672",
"0.6913254",
"0.6906676",
"0.68661255",
"0.68530154",
"0.68451655",
"0.68323594",
"0.68066764",
"0.6797967",
"0.6775788",
"0.67419225",
"0.6741922... | 0.0 | -1 |
Testing task 226 class main logic | def test_task226_main_logic(number1, number2, expected_value):
assert algo.Task226.main_logic(number1, number2) == expected_value | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def task():",
"def test_get_task_output(self):\n pass",
"def task(self):",
"def task(self):",
"def task():\n pass",
"def task():\n pass",
"def task():\n\n\tprint('Example task executed.')",
"def test_get_run(self):\n pass",
"def setUp(self):\n self.t = Task()",
"def set... | [
"0.7679905",
"0.75751007",
"0.74822515",
"0.74822515",
"0.7291026",
"0.7291026",
"0.7206594",
"0.71457916",
"0.71280587",
"0.71280587",
"0.6997051",
"0.6974356",
"0.69725513",
"0.69159216",
"0.6897864",
"0.6865529",
"0.6863298",
"0.6853657",
"0.6784358",
"0.6762433",
"0.67399... | 0.0 | -1 |
Testing base class with validation method for exceptions | def test_task_with_two_int_validation_parameters_validate_exceptions_task559(data, expected_value):
with pytest.raises(expected_value):
algo.TaskWithOneIntValidationParameter.validate_data(data) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def test_validation(self):\n self.validationFails()",
"def test_should_not_be_callable(self):\n with self.assertRaises(NotImplementedError):\n BaseValidator()(\"any-value\")",
"def test_validate(self):\n pass",
"def test_validation(self):\r\n\r\n with self.assertRaises(... | [
"0.7366222",
"0.7237699",
"0.721509",
"0.7119311",
"0.7103784",
"0.70534474",
"0.7048264",
"0.6987562",
"0.6925039",
"0.6916672",
"0.6913254",
"0.6906676",
"0.68661255",
"0.68530154",
"0.68451655",
"0.68323594",
"0.68066764",
"0.6797967",
"0.6775788",
"0.67419225",
"0.6741922... | 0.0 | -1 |
Testing eratosthenes function in task 559 | def test_task559_eratosthenes(number, expected_value):
assert algo.Task559.eratosthenes(number) == expected_value | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def eratosthenes(x):\n multiples = []\n for i in range(2, x+1):\n if i not in multiples:\n print (i)\n for j in range(i*i, x+1, i):\n multiples.append(j)",
"def main():\n doctest.testmod()\n print(eratosthenes(2))",
"def eratosthenes2(n):\n multiples =... | [
"0.7555729",
"0.7525924",
"0.7279653",
"0.7068233",
"0.6793754",
"0.6754159",
"0.6716757",
"0.66996837",
"0.66710955",
"0.657833",
"0.6571549",
"0.6510445",
"0.64366025",
"0.6392734",
"0.62452984",
"0.62227535",
"0.6184394",
"0.6181353",
"0.61811525",
"0.61747223",
"0.616319"... | 0.7610841 | 0 |
Testing mersen_numbers function in task 559 | def test_task559_mersen_number(number, expected_value):
assert algo.Task559.mersen_numbers(number) == expected_value | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def test_numbers(number):\n print(\"\\nRunning test_numbers with {}\".format(number))",
"def test_numbers(self):\n \n result = gen_expansion(sym.pi, 2)\n self.assertEqual(result, '14')\n result = gen_expansion(sym.exp(1), 2)\n self.assertEqual(result, '72')",
"def test_angl... | [
"0.5994305",
"0.58658266",
"0.5729014",
"0.56989163",
"0.5615644",
"0.5593863",
"0.5531031",
"0.55126804",
"0.54742104",
"0.5439089",
"0.543804",
"0.54284734",
"0.54218674",
"0.54073083",
"0.5352614",
"0.5331817",
"0.53211087",
"0.5284186",
"0.5279782",
"0.52637136",
"0.52580... | 0.7466113 | 0 |
Testing task 559 class main logic | def test_task559_main_logic(number, expected_value):
assert algo.Task559.main_logic(number) == expected_value | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def task5(self):\n\n pass",
"def task():",
"def task4(self):\n\n pass",
"def runtest(self):",
"def test_get_run(self):\n pass",
"def task(self):",
"def task(self):",
"def task4_1(self):\n\n pass",
"def task1(self):\n \n pass",
"def task3(self):\n\n ... | [
"0.76807034",
"0.73960394",
"0.7371841",
"0.7336318",
"0.73260546",
"0.7267288",
"0.7267288",
"0.71438813",
"0.71006924",
"0.70854497",
"0.70318955",
"0.698589",
"0.69634557",
"0.6915204",
"0.6915204",
"0.6915204",
"0.6888586",
"0.6873803",
"0.68686956",
"0.6868453",
"0.68684... | 0.0 | -1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.