gpt-4.1-mini-2025-04-14· OpenAI
WildChat-4.8M (AI2)
generate many (1+/-1) not shorter than 20 lines codes in many independent code blocks…
- User
generate many (1+/-1) not shorter than 20 lines codes in many independent code blocks wrapped in this chat.
- Assistant
# Python: Check if a number is a power of two using bitwise operations def is_power_of_two(n): if n <= 0: return False return (n & (n - 1)) == 0 for i in range(1, 33): print(f"{i}: {is_power_of_two(i)}")# Python: Print Fibonacci sequence up to n terms (at least 20) def fibonacci(n): a, b = 0, 1 result = [] while len(result) < n: result.append(a) a, b = b, a + b return result fib_sequence = fibonacci(20) print(fib_sequence)# Python: Simple bubble sort implementation with at least 20 lines def bubble_sort(arr): n = len(arr) for i in range(n): swapped = False for j in range(0, n - i - 1): if arr[j] > arr[j + 1]: arr[j], arr[j + 1] = arr[j + 1], arr[j] swapped = True if not swapped: break return arr unsorted = [64, 34, 25, 12, 22, 11, 90, 88, 2, 0, -1, 45, 67, 33, 19, 91, 83, 67, 30, 27] print(bubble_sort(unsorted))# Python: Find prime numbers within a range (20 lines or more) def is_prime(num): if num <= 1: return False if num <= 3: return True if num % 2 == 0 or num % 3 == 0: return False i = 5 while i * i <= num: if num % i == 0 or num % (i + 2) == 0: return False i += 6 return True primes = [] for number in range(1, 51): if is_prime(number): primes.append(number) print(primes)# Python: Compute factorial recursively for numbers up to n (at least 20 lines counting) def factorial(n): if n == 0 or n == 1: return 1 return n * factorial(n - 1) for i in range(1, 21): print(f"{i}! = {factorial(i)}")# Python: Count vowels in a given sentence def count_vowels(text): vowels = "aeiouAEIOU" count = 0 for char in text: if char in vowels: count += 1 return count sentence = "This is a sample sentence to count vowels in it properly." print(f"Number of vowels: {count_vowels(sentence)}")# Python: Generate multiplication table for a number up to 10 def multiplication_table(n): result = [] for i in range(1, 11): result.append(f"{n} x {i} = {n * i}") return "\n".join(result) print(multiplication_table(7))# Python: Find the largest element in a list without using built-in max() def find_largest(lst): largest = lst[0] for num in lst: if num > largest: largest = num return largest sample_list = [23, 56, 1, -9, 78, 34, 12, 90, 44, 67] print(f"Largest element is {find_largest(sample_list)}")# Python: Merge two sorted lists into a single sorted list def merge_sorted_lists(lst1, lst2): i, j = 0, 0 merged = [] while i < len(lst1) and j < len(lst2): if lst1[i] < lst2[j]: merged.append(lst1[i]) i += 1 else: merged.append(lst2[j]) j += 1 while i < len(lst1): merged.append(lst1[i]) i += 1 while j < len(lst2): merged.append(lst2[j]) j += 1 return merged list1 = [1, 3, 5, 7, 9] list2 = [2, 4, 6, 8, 10] print(merge_sorted_lists(list1, list2))# Python: Convert decimal to binary without using bin() def decimal_to_binary(n): if n == 0: return "0" bits = [] while n > 0: bits.append(str(n % 2)) n //= 2 bits.reverse() return "".join(bits) for num in range(16): print(f"{num} in binary is {decimal_to_binary(num)}")
Other models, same or similar prompt
Responses were produced in different, uncontrolled contexts (system prompts, settings, prior turns). This is not a benchmark.
Identical first prompt
- gpt-4.1-mini-2025-04-14Compare side by side →
- gpt-4.1-mini-2025-04-14Compare side by side →
- gpt-4.1-mini-2025-04-14Compare side by side →
- gpt-4.1-mini-2025-04-14Compare side by side →
- gpt-4.1-mini-2025-04-14Compare side by side →
- gpt-4.1-mini-2025-04-14Compare side by side →
- gpt-4.1-mini-2025-04-14Compare side by side →
- gpt-4.1-mini-2025-04-14Compare side by side →
- gpt-4.1-mini-2025-04-14Compare side by side →
- gpt-4.1-mini-2025-04-14Compare side by side →
- gpt-4.1-mini-2025-04-14Compare side by side →