Run Detail
completedernie-5.5-flash-preview:free30 answersRecorded for these videos
Provider
openrouter
Challenge Version
v1.0
Turns
30
Duration
46.1s
Total Tokens
53,672
Input Tokens
4,335
Output Tokens
49,337
Reasoning Tokens
45,790
Reasoning Effort
default
Est. Cost
$0.0000
Started
11/11/2026, 3:05:11 PM
OR Provider
Baidu
Finish Reason
stop
Generation ID
gen-1794409515-U6K3M8HYLRGmLepTO4M9
Turns (30)
Turn #1Raw score: 1
98 in106 out63 reasoning204 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 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
98 in107 out64 reasoning205 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 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 #3Raw score: 1
98 in70 out27 reasoning168 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 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 #4Raw score: 1
135 in166 out67 reasoning301 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 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 = []
prev = s[0]
count = 1
for ch in s[1:]:
if ch == prev:
count += 1
else:
result.append(f"{prev}{count}")
prev = ch
count = 1
result.append(f"{prev}{count}")
return "".join(result)
Turn #5Raw score: 1
135 in142 out45 reasoning277 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 ""
parts = []
current = s[0]
count = 1
for ch in s[1:]:
if ch == current:
count += 1
else:
parts.append(current + str(count))
current = ch
count = 1
parts.append(current + str(count))
return "".join(parts)
Turn #6Raw score: 1
135 in140 out41 reasoning275 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 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 ""
parts = []
current = s[0]
count = 1
for ch in s[1:]:
if ch == current:
count += 1
else:
parts.append(f"{current}{count}")
current = ch
count = 1
parts.append(f"{current}{count}")
return "".join(parts)
Turn #7Raw score: 1
128 in165 out70 reasoning293 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
from itertools import islice
def chunks(items: Iterable, n: int) -> list[list]:
if n < 1:
raise ValueError("n must be at least 1")
it = iter(items)
result: list[list] = []
while True:
chunk = list(islice(it, n))
if not chunk:
break
result.append(chunk)
return result
Turn #8Raw score: 1
128 in138 out47 reasoning266 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 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
from itertools import islice
def chunks(items: Iterable, n: int) -> list[list]:
if n < 1:
raise ValueError("n must be at least 1")
it = iter(items)
result = []
while True:
chunk = list(islice(it, n))
if not chunk:
break
result.append(chunk)
return result
Turn #9Raw score: 1
128 in142 out48 reasoning270 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
from itertools import islice
from typing import Iterable
def chunks(items: Iterable, n: int) -> list[list]:
if n < 1:
raise ValueError("n must be at least 1")
it = iter(items)
result: list[list] = []
while True:
chunk = list(islice(it, n))
if not chunk:
break
result.append(chunk)
return result
Turn #10Raw score: 1
165 in9,299 out9,138 reasoning9,464 total38.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 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
from decimal import Decimal, ROUND_HALF_UP, localcontext
def round_half_up(value: str, digits: int) -> str:
d = Decimal(value)
with localcontext() as ctx:
# Ensure enough precision so quantize never overflows the context.
ctx.prec = max(d.adjusted() + 1, 0) + digits + 16
quantum = Decimal((0, (1,), -digits)) # 10 ** (-digits)
result = d.quantize(quantum, rounding=ROUND_HALF_UP)
# Normalize negative zero (e.g. "-0.00" -> "0.00").
if result.is_zero():
result = abs(result)
return format(result, "f")
Turn #11Raw score: 1
165 in8,481 out8,361 reasoning8,646 total33.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 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
from decimal import Decimal, ROUND_HALF_UP, localcontext
def round_half_up(value: str, digits: int) -> str:
d = Decimal(value)
quant = Decimal((0, (1,), -digits))
with localcontext() as ctx:
ctx.prec = max(d.adjusted() + digits + 10, digits + 10, 28)
result = d.quantize(quant, rounding=ROUND_HALF_UP)
if not result:
result = abs(result)
return format(result, 'f')
Turn #12Raw score: 1
165 in7,155 out7,012 reasoning7,320 total27.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
from decimal import Decimal, ROUND_HALF_UP, localcontext
def round_half_up(value: str, digits: int) -> str:
d = Decimal(value.strip())
q = Decimal((0, (1,), -digits))
with localcontext() as ctx:
ctx.prec = max(d.adjusted() + 1, 1) + digits + 5
r = d.quantize(q, rounding=ROUND_HALF_UP)
s = format(r, 'f')
if s[0] == '-' and not any(c in '123456789' for c in s):
s = s[1:]
return s
Turn #13Raw score: 1
161 in4,419 out4,305 reasoning4,580 total17.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 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]:
result: dict[str, str] = {}
for m in re.finditer(r'([^\s=]+)=("[^"]*"|\S*)', line):
key = m.group(1)
value = m.group(2)
if len(value) >= 2 and value[0] == '"' and value[-1] == '"':
value = value[1:-1]
result[key] = value
return result
Turn #14Raw score: 1
161 in1,762 out1,518 reasoning1,923 total7.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 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
def parse_kv(line: str) -> dict[str, str]:
result: dict[str, str] = {}
i = 0
n = len(line)
while i < n:
while i < n and line[i] == ' ':
i += 1
if i >= n:
break
key_start = i
while i < n and line[i] not in '= ':
i += 1
key = line[key_start:i]
if i < n and line[i] == '=':
i += 1
if i < n and line[i] == '"':
i += 1
val_start = i
while i < n and line[i] != '"':
i += 1
value = line[val_start:i]
if i < n and line[i] == '"':
i += 1
else:
val_start = i
while i < n and line[i] != ' ':
i += 1
value = line[val_start:i]
result[key] = value
return result
Turn #15Raw score: 1
161 in2,709 out2,473 reasoning2,870 total9.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
def parse_kv(line: str) -> dict[str, str]:
result: dict[str, str] = {}
i = 0
n = len(line)
while i < n:
while i < n and line[i] == ' ':
i += 1
if i >= n:
break
key_start = i
while i < n and line[i] not in '= ':
i += 1
key = line[key_start:i]
if i < n and line[i] == '=':
i += 1
if i < n and line[i] == '"':
i += 1
value_start = i
while i < n and line[i] != '"':
i += 1
value = line[value_start:i]
if i < n:
i += 1
else:
value_start = i
while i < n and line[i] != ' ':
i += 1
value = line[value_start:i]
result[key] = value
return result
Turn #16Raw score: 1
149 in202 out71 reasoning351 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 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 []
ordered = sorted(intervals, key=lambda iv: (iv[0], iv[1]))
merged: list[tuple[int, int]] = [ordered[0]]
for start, end in ordered[1:]:
last_start, last_end = merged[-1]
if start <= last_end:
merged[-1] = (last_start, max(last_end, end))
else:
merged.append((start, end))
return merged
Turn #17Raw score: 1
149 in211 out85 reasoning360 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 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 []
ordered = sorted(intervals, key=lambda interval: interval[0])
merged: list[tuple[int, int]] = [ordered[0]]
for start, end in ordered[1:]:
last_start, last_end = merged[-1]
if start <= last_end:
merged[-1] = (last_start, max(last_end, end))
else:
merged.append((start, end))
return merged
Turn #18Raw score: 1
149 in199 out73 reasoning348 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 []
ordered = sorted(intervals, key=lambda iv: iv[0])
merged: list[tuple[int, int]] = [ordered[0]]
for start, end in ordered[1:]:
last_start, last_end = merged[-1]
if start <= last_end:
merged[-1] = (last_start, max(last_end, end))
else:
merged.append((start, end))
return merged
Turn #19Raw score: 1
126 in528 out432 reasoning654 total2.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 calendar
import datetime
def add_months(d: datetime.date, months: int) -> datetime.date:
total = (d.month - 1) + months
year = d.year + total // 12
month = total % 12 + 1
last_day = calendar.monthrange(year, month)[1]
day = min(d.day, last_day)
return datetime.date(year, month, day)
Turn #20Raw score: 1
126 in150 out56 reasoning276 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 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
import calendar
def add_months(d: datetime.date, months: int) -> datetime.date:
total = d.month - 1 + months
year = d.year + total // 12
month = total % 12 + 1
last_day = calendar.monthrange(year, month)[1]
day = min(d.day, last_day)
return datetime.date(year, month, day)
Turn #21Raw score: 1
126 in481 out378 reasoning607 total2.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 calendar
import datetime
def add_months(d: datetime.date, months: int) -> datetime.date:
total_months = d.year * 12 + (d.month - 1) + months
year, month_zero_based = divmod(total_months, 12)
month = month_zero_based + 1
last_day = calendar.monthrange(year, month)[1]
return datetime.date(year, month, min(d.day, last_day))
Turn #22Raw score: 1
146 in1,265 out1,169 reasoning1,411 total5.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 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 Counter
def top_k_words(text: str, k: int) -> list[tuple[str, int]]:
if k <= 0:
return []
words = re.findall(r"[A-Za-z']+", text)
counts = Counter(word.lower() for word in words)
ordered = sorted(counts.items(), key=lambda item: (-item[1], item[0]))
return ordered[:k]
Turn #23Raw score: 1
146 in1,181 out1,091 reasoning1,327 total4.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 Counter
def top_k_words(text: str, k: int) -> list[tuple[str, int]]:
words = re.findall(r"[A-Za-z']+", text)
counts = Counter(word.lower() for word in words)
ordered = sorted(counts.items(), key=lambda item: (-item[1], item[0]))
return ordered[:max(k, 0)]
Turn #24Raw score: 1
146 in2,319 out2,228 reasoning2,465 total9.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 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 Counter
def top_k_words(text: str, k: int) -> list[tuple[str, int]]:
if k <= 0:
return []
counts = Counter(word.lower() for word in re.findall(r"[A-Za-z']+", text))
ranked = sorted(counts.items(), key=lambda item: (-item[1], item[0]))
return ranked[:k]
Turn #25Raw score: 1
186 in1,726 out1,551 reasoning1,912 total5.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 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(item, prefix):
if isinstance(item, dict):
if not item:
if prefix:
result[prefix] = {}
return
for k, v in item.items():
new_key = f"{prefix}{sep}{k}" if prefix else str(k)
_flatten(v, new_key)
elif isinstance(item, list):
if not item:
if prefix:
result[prefix] = []
return
for i, v in enumerate(item):
new_key = f"{prefix}{sep}{i}" if prefix else str(i)
_flatten(v, new_key)
else:
result[prefix] = item
_flatten(obj, "")
return result
Turn #26Raw score: 1
186 in1,653 out1,471 reasoning1,839 total5.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 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: dict = {}
def _flatten(item, prefix: str) -> None:
if isinstance(item, dict):
if not item:
if prefix:
result[prefix] = {}
else:
for key, value in item.items():
new_key = f"{prefix}{sep}{key}" if prefix else str(key)
_flatten(value, new_key)
elif isinstance(item, list):
if not item:
if prefix:
result[prefix] = []
else:
for index, value in enumerate(item):
new_key = f"{prefix}{sep}{index}" if prefix else str(index)
_flatten(value, new_key)
else:
result[prefix] = item
_flatten(obj, "")
return result
Turn #27Raw score: 1
186 in1,370 out1,187 reasoning1,556 total4.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 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: dict = {}
def _flatten(item, prefix):
if isinstance(item, dict):
if not item:
result[prefix] = {}
return
for k, v in item.items():
new_key = f"{prefix}{sep}{k}" if prefix else str(k)
_flatten(v, new_key)
elif isinstance(item, list):
if not item:
result[prefix] = []
return
for i, v in enumerate(item):
new_key = f"{prefix}{sep}{i}" if prefix else str(i)
_flatten(v, new_key)
else:
result[prefix] = item
if isinstance(obj, dict) and not obj:
return {}
_flatten(obj, "")
return result
Turn #28Raw score: 1
151 in603 out496 reasoning754 total3.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 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
import functools
from collections import OrderedDict
def lru(maxsize: int):
def decorator(func):
cache = OrderedDict()
@functools.wraps(func)
def wrapper(*args):
if args in cache:
cache.move_to_end(args)
return cache[args]
result = func(*args)
cache[args] = result
if len(cache) > maxsize:
cache.popitem(last=False)
return result
return wrapper
return decorator
Turn #29Raw score: 1
151 in663 out556 reasoning814 total3.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 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
import functools
from collections import OrderedDict
def lru(maxsize: int):
def decorator(func):
cache = OrderedDict()
@functools.wraps(func)
def wrapper(*args):
if args in cache:
cache.move_to_end(args)
return cache[args]
result = func(*args)
cache[args] = result
if len(cache) > maxsize:
cache.popitem(last=False)
return result
return wrapper
return decorator
Turn #30Raw score: 1
151 in1,785 out1,667 reasoning1,936 total7.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 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
from functools import wraps
def lru(maxsize: int):
def decorator(func):
cache: OrderedDict = OrderedDict()
@wraps(func)
def wrapper(*args, **kwargs):
key = args
if key in cache:
cache.move_to_end(key)
return cache[key]
result = func(*args, **kwargs)
cache[key] = result
if len(cache) > maxsize:
cache.popitem(last=False)
return result
return wrapper
return decorator