Run Detail
completedministral-8b-251230 answersRecorded for these videos
Provider
openrouter
Challenge Version
v1.0
Turns
30
Duration
20.8s
Total Tokens
7,747
Input Tokens
3,786
Output Tokens
3,961
Reasoning Effort
default
Cached Input Tokens
256
Est. Cost
$0.0011
Started
11/4/2026, 11:11:23 PM
OR Provider
Mistral
Finish Reason
stop
Generation ID
gen-1793833902-GSEEUzGUSY2K0Den3EFZ
Turns (30)
Turn #1Raw score: 1
78 in49 out127 total0.9s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write is_leap(year: int) -> bool to return whether year is a leap year in the Gregorian calendar.
assistant
def is_leap(year: int) -> bool:
return (year % 4 == 0 and year % 100 != 0) or (year % 400 == 0)
Turn #2Raw score: 1
78 in61 out139 total1.1s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write is_leap(year: int) -> bool to return whether year is a leap year in the Gregorian calendar.
assistant
def is_leap(year: int) -> bool:
if year % 4 != 0:
return False
elif year % 100 != 0:
return True
else:
return year % 400 == 0
Turn #3Raw score: 1
78 in61 out139 total1.0s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write is_leap(year: int) -> bool to return whether year is a leap year in the Gregorian calendar.
assistant
def is_leap(year: int) -> bool:
if year % 4 != 0:
return False
elif year % 100 != 0:
return True
else:
return year % 400 == 0
Turn #4Raw score: 1
115 in105 out220 total17.3s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write rle(s: str) -> str to perform run-length encoding on s. Replace each run of consecutive identical characters with that character followed by the run length. rle("aaabcc") returns "a3b1c2" and rle("") returns "".
assistant
def rle(s: str) -> str:
if not s:
return ""
result = []
current_char = s[0]
count = 1
for char in s[1:]:
if char == current_char:
count += 1
else:
result.append(f"{current_char}{count}")
current_char = char
count = 1
result.append(f"{current_char}{count}")
return "".join(result)
Turn #5Raw score: 1
115 in105 out220 total1.7s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write rle(s: str) -> str to perform run-length encoding on s. Replace each run of consecutive identical characters with that character followed by the run length. rle("aaabcc") returns "a3b1c2" and rle("") returns "".
assistant
def rle(s: str) -> str:
if not s:
return ""
result = []
current_char = s[0]
count = 1
for char in s[1:]:
if char == current_char:
count += 1
else:
result.append(f"{current_char}{count}")
current_char = char
count = 1
result.append(f"{current_char}{count}")
return "".join(result)
Turn #6Raw score: 1
115 in105 out220 total1.5s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write rle(s: str) -> str to perform run-length encoding on s. Replace each run of consecutive identical characters with that character followed by the run length. rle("aaabcc") returns "a3b1c2" and rle("") returns "".
assistant
def rle(s: str) -> str:
if not s:
return ""
result = []
current_char = s[0]
count = 1
for char in s[1:]:
if char == current_char:
count += 1
else:
result.append(f"{current_char}{count}")
current_char = char
count = 1
result.append(f"{current_char}{count}")
return "".join(result)
Turn #7Raw score: 1
113 in102 out215 total1.7s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write chunks(items, n: int) -> list[list]. items is an iterable, which may be a generator. Return consecutive lists of n elements, where the last list may be shorter. Raise ValueError when n is less than 1.
assistant
from collections.abc import Iterable
def chunks(items: Iterable, n: int) -> list[list]:
if n < 1:
raise ValueError("n must be a positive integer")
result = []
current_chunk = []
for item in items:
current_chunk.append(item)
if len(current_chunk) == n:
result.append(current_chunk)
current_chunk = []
if current_chunk:
result.append(current_chunk)
return result
Turn #8Raw score: 0
113 in78 out191 total1.4s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write chunks(items, n: int) -> list[list]. items is an iterable, which may be a generator. Return consecutive lists of n elements, where the last list may be shorter. Raise ValueError when n is less than 1.
assistant
def chunks(items, n: int) -> list[list]:
if n < 1:
raise ValueError("n must be at least 1")
return [list(itertools.islice(items, i * n, (i + 1) * n)) for i in range((len(items) + n - 1) // n)]
Turn #9Raw score: 0
113 in76 out189 total1.3s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write chunks(items, n: int) -> list[list]. items is an iterable, which may be a generator. Return consecutive lists of n elements, where the last list may be shorter. Raise ValueError when n is less than 1.
assistant
from collections.abc import Iterable
def chunks(items: Iterable, n: int) -> list[list]:
if n < 1:
raise ValueError("n must be at least 1")
return [list(itertools.islice(items, i, i + n)) for i in range(0, len(list(items)), n)]
Turn #10Raw score: 0
152 in206 out358 total2.9s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write round_half_up(value: str, digits: int) -> str. The string value represents a decimal number. Round it to digits decimal places, rounding exact ties away from zero based on the exact value written in value. Return a string with exactly digits decimal places, and omit the decimal point when digits is 0. round_half_up("2.675", 2) returns "2.68".
assistant
import re
def round_half_up(value: str, digits: int) -> str:
if '.' in value:
integer_part, fractional_part = value.split('.', 1)
if len(fractional_part) <= digits:
return value
rounded = int(fractional_part[:digits + 1])
remainder = int(fractional_part[digits + 1:])
if remainder > 0 or (remainder == 0 and fractional_part[digits] > '4'):
rounded += 1
rounded_str = str(rounded).zfill(digits + 1)
return f"{integer_part}.{rounded_str[:digits]}"
else:
if digits == 0:
return value
rounded = int(value) * (10 ** digits)
rounded_str = str(rounded)
return f"{rounded_str[:-digits]}.{rounded_str[-digits:]}"
Turn #11Raw score: 0
152 in323 out475 total3.9s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write round_half_up(value: str, digits: int) -> str. The string value represents a decimal number. Round it to digits decimal places, rounding exact ties away from zero based on the exact value written in value. Return a string with exactly digits decimal places, and omit the decimal point when digits is 0. round_half_up("2.675", 2) returns "2.68".
assistant
def round_half_up(value: str, digits: int) -> str:
if '.' in value:
integer_part, fractional_part = value.split('.', 1)
else:
integer_part, fractional_part = value, ''
if digits == 0:
rounded = round(float(value))
return str(rounded)
if len(fractional_part) <= digits:
return value
fractional_part = fractional_part.ljust(digits + 1, '0')
if len(fractional_part) > digits + 1:
fractional_part = fractional_part[:digits + 1]
if len(fractional_part) == digits + 1:
if fractional_part[digits] >= '5':
carry = 1
for i in reversed(range(digits)):
if carry == 0:
break
digit = int(fractional_part[i])
digit += 1
if digit == 10:
digit = 0
carry = 1
else:
carry = 0
fractional_part = fractional_part[:i] + str(digit) + fractional_part[i+1:]
if carry:
integer_part = str(int(integer_part) + 1)
fractional_part = '0' * digits
else:
fractional_part = fractional_part[:digits]
result = integer_part + '.' + fractional_part[:digits]
if digits == 0:
result = integer_part
return result
Turn #12Raw score: 0
152 in280 out432 total7.1s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write round_half_up(value: str, digits: int) -> str. The string value represents a decimal number. Round it to digits decimal places, rounding exact ties away from zero based on the exact value written in value. Return a string with exactly digits decimal places, and omit the decimal point when digits is 0. round_half_up("2.675", 2) returns "2.68".
assistant
import math
def round_half_up(value: str, digits: int) -> str:
if '.' in value:
num, frac = value.split('.', 1)
frac = frac.ljust(digits + 1, '0')[:digits + 1]
if len(frac) == digits + 1:
last_digit = frac[digits]
if last_digit == '5':
if len(frac) > digits + 1 or (digits == 0 and last_digit == '5'):
num = str(int(num) + 1)
else:
num = str(int(num) + (1 if int(num) % 2 != 0 else 0))
if len(frac) > digits + 1:
frac = frac[:digits]
else:
frac = frac[:digits]
else:
frac = frac.ljust(digits, '0')
result = f"{num}.{frac}" if digits > 0 else num
else:
if digits == 0:
return value
num = value
result = f"{num}.0" * (digits > 0)
return result[:result.find('.') + digits + 1] if '.' in result else result
Turn #13Raw score: 0
144 in106 out250 total1.7s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write parse_kv(line: str) -> dict[str, str]. The string line contains key=value pairs separated by one or more spaces. A value may be enclosed in double quotes; if so, it may contain spaces and =, and the quotes are not included in the parsed value. A value may be empty, as in c=. If a key repeats, use the last value. Return {} for an empty line.
assistant
import re
def parse_kv(line: str) -> dict[str, str]:
if not line.strip():
return {}
pattern = re.compile(r'([^=\s]+)=("([^"]*)"|([^\s]+))?')
result = {}
for match in pattern.finditer(line):
key = match.group(1)
value = match.group(3) or match.group(5) or ''
result[key] = value
return result
Turn #14Raw score: 0
144 in122 out128 cached266 total3.1s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write parse_kv(line: str) -> dict[str, str]. The string line contains key=value pairs separated by one or more spaces. A value may be enclosed in double quotes; if so, it may contain spaces and =, and the quotes are not included in the parsed value. A value may be empty, as in c=. If a key repeats, use the last value. Return {} for an empty line.
assistant
import re
def parse_kv(line: str) -> dict[str, str]:
if not line.strip():
return {}
pattern = re.compile(r'([^= \t]+)=([^\s"]*|"(?:\\"|[^"])*")')
matches = pattern.findall(line)
result = {}
for key, value in matches:
if value.startswith('"') and value.endswith('"'):
value = value[1:-1].replace('\\"', '"')
result[key] = value
return result
Turn #15Raw score: 0
144 in104 out248 total1.4s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write parse_kv(line: str) -> dict[str, str]. The string line contains key=value pairs separated by one or more spaces. A value may be enclosed in double quotes; if so, it may contain spaces and =, and the quotes are not included in the parsed value. A value may be empty, as in c=. If a key repeats, use the last value. Return {} for an empty line.
assistant
import re
def parse_kv(line: str) -> dict[str, str]:
if not line.strip():
return {}
pattern = re.compile(r'([^=\s]+)=("([^"]*)"|([^=\s]+))')
result = {}
for match in pattern.finditer(line):
key = match.group(1)
value = match.group(3) or match.group(4)
result[key] = value
return result
Turn #16Raw score: 1
130 in148 out278 total2.9s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write merge_intervals(intervals: list[tuple[int, int]]) -> list[tuple[int, int]]. The input intervals may be in any order. Merge intervals that overlap or touch, so (1, 2) and (2, 3) become (1, 3). Return the merged intervals as tuples sorted by start, and leave the input list unchanged.
assistant
def merge_intervals(intervals: list[tuple[int, int]]) -> list[tuple[int, int]]:
if not intervals:
return []
sorted_intervals = sorted(intervals, key=lambda x: x[0])
merged = [sorted_intervals[0]]
for current_start, current_end in sorted_intervals[1:]:
last_start, last_end = merged[-1]
if current_start <= last_end:
new_start = last_start
new_end = max(last_end, current_end)
merged[-1] = (new_start, new_end)
else:
merged.append((current_start, current_end))
return merged
Turn #17Raw score: 1
130 in148 out278 total3.3s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write merge_intervals(intervals: list[tuple[int, int]]) -> list[tuple[int, int]]. The input intervals may be in any order. Merge intervals that overlap or touch, so (1, 2) and (2, 3) become (1, 3). Return the merged intervals as tuples sorted by start, and leave the input list unchanged.
assistant
def merge_intervals(intervals: list[tuple[int, int]]) -> list[tuple[int, int]]:
if not intervals:
return []
sorted_intervals = sorted(intervals, key=lambda x: x[0])
merged = [sorted_intervals[0]]
for current_start, current_end in sorted_intervals[1:]:
last_start, last_end = merged[-1]
if current_start <= last_end:
new_start = last_start
new_end = max(last_end, current_end)
merged[-1] = (new_start, new_end)
else:
merged.append((current_start, current_end))
return merged
Turn #18Raw score: 1
130 in127 out257 total1.6s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write merge_intervals(intervals: list[tuple[int, int]]) -> list[tuple[int, int]]. The input intervals may be in any order. Merge intervals that overlap or touch, so (1, 2) and (2, 3) become (1, 3). Return the merged intervals as tuples sorted by start, and leave the input list unchanged.
assistant
def merge_intervals(intervals: list[tuple[int, int]]) -> list[tuple[int, int]]:
if not intervals:
return []
sorted_intervals = sorted(intervals, key=lambda x: x[0])
merged = [sorted_intervals[0]]
for current in sorted_intervals[1:]:
last = merged[-1]
if current[0] <= last[1]:
merged[-1] = (last[0], max(last[1], current[1]))
else:
merged.append(current)
return merged
Turn #19Raw score: 0
105 in129 out234 total2.0s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write add_months(d: datetime.date, months: int) -> datetime.date to add months calendar months to d. months may be negative. If the day does not exist in the target month, use the last day of that month.
assistant
from datetime import date, timedelta
def add_months(d: date, months: int) -> date:
year = d.year + months // 12
month = d.month + months % 12
if month < 1:
month += 12
year -= 1
elif month > 12:
month -= 12
year += 1
last_day = (date(year, month + 1, 1) - timedelta(days=1)).day
return date(year, month, last_day)
Turn #20Raw score: 0
105 in150 out255 total1.8s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write add_months(d: datetime.date, months: int) -> datetime.date to add months calendar months to d. months may be negative. If the day does not exist in the target month, use the last day of that month.
assistant
from datetime import date, timedelta
def add_months(d: date, months: int) -> date:
year = d.year + months // 12
month = d.month + months % 12
if month < 1:
year -= 1
month += 12
elif month > 12:
year += 1
month -= 12
try:
return date(year, month, d.day)
except ValueError:
last_day = date(year, month, 1) + timedelta(days=32)
return date(last_day.year, last_day.month, last_day.day - 1)
Turn #21Raw score: 0
105 in130 out235 total1.7s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write add_months(d: datetime.date, months: int) -> datetime.date to add months calendar months to d. months may be negative. If the day does not exist in the target month, use the last day of that month.
assistant
import datetime
def add_months(d: datetime.date, months: int) -> datetime.date:
year = d.year + months // 12
month = d.month + months % 12
if month > 12:
year += 1
month -= 12
elif month < 1:
year -= 1
month += 12
last_day = (datetime.date(year, month + 1, 1) - datetime.timedelta(days=1)).day
return datetime.date(year, month, last_day)
Turn #22Raw score: 1
126 in111 out237 total2.2s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write top_k_words(text: str, k: int) -> list[tuple[str, int]]. A word is a maximal sequence of ASCII letters and apostrophes. Words compare case-insensitively and are returned in lowercase. Return the k most frequent words as (word, count) tuples, sorted by highest count first, breaking ties alphabetically by word.
assistant
import re
from collections import defaultdict
def top_k_words(text: str, k: int) -> list[tuple[str, int]]:
words = re.findall(r"[a-zA-Z']+", text)
counts = defaultdict(int)
for word in words:
lower_word = word.lower()
counts[lower_word] += 1
sorted_words = sorted(counts.items(), key=lambda item: (-item[1], item[0]))
return sorted_words[:k]
Turn #23Raw score: 1
126 in111 out237 total1.9s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write top_k_words(text: str, k: int) -> list[tuple[str, int]]. A word is a maximal sequence of ASCII letters and apostrophes. Words compare case-insensitively and are returned in lowercase. Return the k most frequent words as (word, count) tuples, sorted by highest count first, breaking ties alphabetically by word.
assistant
import re
from collections import defaultdict
def top_k_words(text: str, k: int) -> list[tuple[str, int]]:
words = re.findall(r"[a-zA-Z']+", text)
counts = defaultdict(int)
for word in words:
lower_word = word.lower()
counts[lower_word] += 1
sorted_words = sorted(counts.items(), key=lambda item: (-item[1], item[0]))
return sorted_words[:k]
Turn #24Raw score: 1
126 in111 out237 total1.6s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write top_k_words(text: str, k: int) -> list[tuple[str, int]]. A word is a maximal sequence of ASCII letters and apostrophes. Words compare case-insensitively and are returned in lowercase. Return the k most frequent words as (word, count) tuples, sorted by highest count first, breaking ties alphabetically by word.
assistant
import re
from collections import defaultdict
def top_k_words(text: str, k: int) -> list[tuple[str, int]]:
words = re.findall(r"[a-zA-Z']+", text)
counts = defaultdict(int)
for word in words:
lower_word = word.lower()
counts[lower_word] += 1
sorted_words = sorted(counts.items(), key=lambda item: (-item[1], item[0]))
return sorted_words[:k]
Turn #25Raw score: 0
167 in210 out377 total2.6s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write flatten(obj: dict, sep: str = ".") -> dict. Flatten nested dicts and lists into a single level, joining keys with sep and using list indices as keys. Keep an empty dict or empty list as the value at its key. flatten({"a": {"b": 1}, "c": [{"d": 2}, 3], "e": {}}) returns {"a.b": 1, "c.0.d": 2, "c.1": 3, "e": {}}.
assistant
from typing import Any
def flatten(obj: dict, sep: str = ".") -> dict:
result = {}
def _flatten(item: Any, key_prefix: str = "") -> None:
if isinstance(item, dict):
for k, v in item.items():
new_key = f"{key_prefix}{sep}{k}" if key_prefix else k
if isinstance(v, (dict, list)):
_flatten(v, new_key)
else:
result[new_key] = v
elif isinstance(item, list):
for i, v in enumerate(item):
new_key = f"{key_prefix}{sep}{i}"
if isinstance(v, (dict, list)):
_flatten(v, new_key)
else:
result[new_key] = v
for k, v in obj.items():
if isinstance(v, (dict, list)):
_flatten(v, k)
else:
result[k] = v
return result
Turn #26Raw score: 0
167 in193 out360 total3.9s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write flatten(obj: dict, sep: str = ".") -> dict. Flatten nested dicts and lists into a single level, joining keys with sep and using list indices as keys. Keep an empty dict or empty list as the value at its key. flatten({"a": {"b": 1}, "c": [{"d": 2}, 3], "e": {}}) returns {"a.b": 1, "c.0.d": 2, "c.1": 3, "e": {}}.
assistant
def flatten(obj: dict, sep: str = ".") -> dict:
result = {}
def _flatten(current, prefix):
if isinstance(current, dict):
for key, value in current.items():
new_prefix = f"{prefix}{sep}{key}" if prefix else key
if isinstance(value, (dict, list)):
_flatten(value, new_prefix)
else:
result[new_prefix] = value
elif isinstance(current, list):
for index, item in enumerate(current):
new_prefix = f"{prefix}{sep}{index}"
if isinstance(item, (dict, list)):
_flatten(item, new_prefix)
else:
result[new_prefix] = item
for key, value in obj.items():
if isinstance(value, (dict, list)):
_flatten(value, key)
else:
result[key] = value
return result
Turn #27Raw score: 0
167 in178 out128 cached345 total2.1s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write flatten(obj: dict, sep: str = ".") -> dict. Flatten nested dicts and lists into a single level, joining keys with sep and using list indices as keys. Keep an empty dict or empty list as the value at its key. flatten({"a": {"b": 1}, "c": [{"d": 2}, 3], "e": {}}) returns {"a.b": 1, "c.0.d": 2, "c.1": 3, "e": {}}.
assistant
def flatten(obj: dict, sep: str = ".") -> dict:
result = {}
def _flatten(current, key_prefix):
if isinstance(current, dict):
for k, v in current.items():
new_key = f"{key_prefix}{sep}{k}" if key_prefix else k
if isinstance(v, (dict, list)):
_flatten(v, new_key)
else:
result[new_key] = v
elif isinstance(current, list):
for i, item in enumerate(current):
new_key = f"{key_prefix}{sep}{i}"
if isinstance(item, (dict, list)):
_flatten(item, new_key)
else:
result[new_key] = item
else:
result[key_prefix] = current
_flatten(obj, "")
return result
Turn #28Raw score: 1
132 in108 out240 total1.8s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write lru(maxsize: int), a decorator factory that caches a function's results by its positional arguments without using functools.lru_cache or functools.cache. It stores at most maxsize results. When the cache is full, evict the least recently used result. A cache hit counts as a use. The decorated function must preserve its original __name__.
assistant
from collections import OrderedDict
def lru(maxsize: int):
def decorator(func):
cache = OrderedDict()
def wrapper(*args):
if args in cache:
cache.move_to_end(args)
return cache[args]
result = func(*args)
if len(cache) >= maxsize:
cache.popitem(last=False)
cache[args] = result
return result
wrapper.__name__ = func.__name__
return wrapper
return decorator
Turn #29Raw score: 0
132 in116 out248 total1.6s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write lru(maxsize: int), a decorator factory that caches a function's results by its positional arguments without using functools.lru_cache or functools.cache. It stores at most maxsize results. When the cache is full, evict the least recently used result. A cache hit counts as a use. The decorated function must preserve its original __name__.
assistant
from collections import OrderedDict
def lru(maxsize: int):
def decorator(func):
cache = OrderedDict()
func.__name__ = func.__name__
def wrapper(*args):
nonlocal cache
key = args
if key in cache:
cache.move_to_end(key)
return cache[key]
if len(cache) >= maxsize:
cache.popitem(last=False)
result = func(*args)
cache[key] = result
return result
return wrapper
return decorator
Turn #30Raw score: 1
132 in108 out240 total1.7s
user
Write Python 3.13 code. Answer with one ```python code block that defines the function described below. Use only the standard library. Do not include explanations, examples, tests, input() calls, or print() calls.
Write lru(maxsize: int), a decorator factory that caches a function's results by its positional arguments without using functools.lru_cache or functools.cache. It stores at most maxsize results. When the cache is full, evict the least recently used result. A cache hit counts as a use. The decorated function must preserve its original __name__.
assistant
from collections import OrderedDict
def lru(maxsize: int):
def decorator(func):
cache = OrderedDict()
def wrapper(*args):
if args in cache:
cache.move_to_end(args)
return cache[args]
result = func(*args)
if len(cache) >= maxsize:
cache.popitem(last=False)
cache[args] = result
return result
wrapper.__name__ = func.__name__
return wrapper
return decorator