task_id stringlengths 9 23 | seed int64 0 2 | instruction stringlengths 59 431 | files listlengths 1 5 | reference_answer stringlengths 1 1.86k |
|---|---|---|---|---|
swe-fix-function@1 | 0 | lib.py is a small module of 3 functions, each documented by its docstring. Users report wrong results; test_lib.py shows one failing case, but the hidden tests check every function thoroughly. Make every function meet its docstring. Submit the complete corrected contents of lib.py as the answer. Reward 1 if every hidde... | [
{
"name": "lib.py",
"content": "\"\"\"Small utility module. Each function documents its contract.\"\"\"\n\nVALUES = {\"I\": 1, \"V\": 5, \"X\": 10, \"L\": 50, \"C\": 100, \"D\": 500, \"M\": 1000}\n\n\ndef roman_to_int(numeral):\n \"\"\"Convert a valid Roman numeral (I, V, X, L, C, D, M, with subtractive ... | """Small utility module. Each function documents its contract."""
VALUES = {"I": 1, "V": 5, "X": 10, "L": 50, "C": 100, "D": 500, "M": 1000}
def roman_to_int(numeral):
"""Convert a valid Roman numeral (I, V, X, L, C, D, M, with subtractive pairs such as IV, IX, XL, XC, CD, CM) to an int."""
total = 0
for... |
swe-fix-function@1 | 1 | lib.py is a small module of 3 functions, each documented by its docstring. Users report wrong results; test_lib.py shows one failing case, but the hidden tests check every function thoroughly. Make every function meet its docstring. Submit the complete corrected contents of lib.py as the answer. Reward 1 if every hidde... | [
{
"name": "lib.py",
"content": "\"\"\"Small utility module. Each function documents its contract.\"\"\"\n\ndef paginate(items, page_size, page):\n \"\"\"Return the items on 1-based page `page` when items are split into pages of `page_size`. Return [] if page_size <= 0, page < 1 or the page is past the en... | """Small utility module. Each function documents its contract."""
def paginate(items, page_size, page):
"""Return the items on 1-based page `page` when items are split into pages of `page_size`. Return [] if page_size <= 0, page < 1 or the page is past the end."""
if page_size <= 0 or page < 1:
return ... |
swe-fix-function@1 | 2 | lib.py is a small module of 3 functions, each documented by its docstring. Users report wrong results; test_lib.py shows one failing case, but the hidden tests check every function thoroughly. Make every function meet its docstring. Submit the complete corrected contents of lib.py as the answer. Reward 1 if every hidde... | [
{
"name": "lib.py",
"content": "\"\"\"Small utility module. Each function documents its contract.\"\"\"\n\ndef merge_intervals(intervals):\n \"\"\"Merge overlapping or touching closed intervals given as [start, end] lists. Return a new list of [start, end] lists sorted by start. Intervals that share an e... | """Small utility module. Each function documents its contract."""
def merge_intervals(intervals):
"""Merge overlapping or touching closed intervals given as [start, end] lists. Return a new list of [start, end] lists sorted by start. Intervals that share an endpoint (e.g. [1, 3] and [3, 5]) are merged. Input may b... |
swe-fix-function@2 | 0 | lib.py is a small module of 4 functions, each documented by its docstring. Users report wrong results; test_lib.py shows one failing case, but the hidden tests check every function thoroughly. Make every function meet its docstring. Submit the complete corrected contents of lib.py as the answer. Reward 1 if every hidde... | [
{
"name": "lib.py",
"content": "\"\"\"Small utility module. Each function documents its contract.\"\"\"\n\ndef moving_average(values, k):\n \"\"\"Return the averages of every window of k consecutive values (n - k + 1 windows), each rounded to 3 decimals. Return [] if k <= 0 or k > len(values).\"\"\"\n ... | """Small utility module. Each function documents its contract."""
def moving_average(values, k):
"""Return the averages of every window of k consecutive values (n - k + 1 windows), each rounded to 3 decimals. Return [] if k <= 0 or k > len(values)."""
if k <= 0 or k > len(values):
return []
return ... |
swe-fix-function@2 | 1 | lib.py is a small module of 4 functions, each documented by its docstring. Users report wrong results; test_lib.py shows one failing case, but the hidden tests check every function thoroughly. Make every function meet its docstring. Submit the complete corrected contents of lib.py as the answer. Reward 1 if every hidde... | [
{
"name": "lib.py",
"content": "\"\"\"Small utility module. Each function documents its contract.\"\"\"\n\ndef merge_intervals(intervals):\n \"\"\"Merge overlapping or touching closed intervals given as [start, end] lists. Return a new list of [start, end] lists sorted by start. Intervals that share an e... | """Small utility module. Each function documents its contract."""
def merge_intervals(intervals):
"""Merge overlapping or touching closed intervals given as [start, end] lists. Return a new list of [start, end] lists sorted by start. Intervals that share an endpoint (e.g. [1, 3] and [3, 5]) are merged. Input may b... |
swe-fix-function@2 | 2 | lib.py is a small module of 4 functions, each documented by its docstring. Users report wrong results; test_lib.py shows one failing case, but the hidden tests check every function thoroughly. Make every function meet its docstring. Submit the complete corrected contents of lib.py as the answer. Reward 1 if every hidde... | [
{
"name": "lib.py",
"content": "\"\"\"Small utility module. Each function documents its contract.\"\"\"\n\ndef paginate(items, page_size, page):\n \"\"\"Return the items on 1-based page `page` when items are split into pages of `page_size`. Return [] if page_size <= 0, page < 1 or the page is past the en... | """Small utility module. Each function documents its contract."""
def paginate(items, page_size, page):
"""Return the items on 1-based page `page` when items are split into pages of `page_size`. Return [] if page_size <= 0, page < 1 or the page is past the end."""
if page_size <= 0 or page < 1:
return ... |
swe-implement-spec@1 | 0 | Implement paginate(items, page_size, page), parse_duration(text) as described in spec.md (lib.py holds stubs). Submit the complete contents of lib.py as the answer; only the standard library is available. Reward 1 if every function passes all hidden tests, else 0. | [
{
"name": "lib.py",
"content": "def paginate(items, page_size, page):\n raise NotImplementedError\n\n\ndef parse_duration(text):\n raise NotImplementedError\n"
},
{
"name": "spec.md",
"content": "# paginate(items, page_size, page)\n\nReturn the items on 1-based page `page` when items are s... | def paginate(items, page_size, page):
if page_size <= 0 or page < 1:
return []
start = (page - 1) * page_size
return items[start:start + page_size]
import re
UNITS = {"d": 86400, "h": 3600, "m": 60, "s": 1}
def parse_duration(text):
total = 0
for value, unit in re.findall(r"(\d+)([dhms]... |
swe-implement-spec@1 | 1 | Implement is_balanced(text), moving_average(values, k) as described in spec.md (lib.py holds stubs). Submit the complete contents of lib.py as the answer; only the standard library is available. Reward 1 if every function passes all hidden tests, else 0. | [
{
"name": "lib.py",
"content": "def is_balanced(text):\n raise NotImplementedError\n\n\ndef moving_average(values, k):\n raise NotImplementedError\n"
},
{
"name": "spec.md",
"content": "# is_balanced(text)\n\nReturn True if every bracket among (), [] and {} is closed by the matching type i... | PAIRS = {")": "(", "]": "[", "}": "{"}
def is_balanced(text):
stack = []
for ch in text:
if ch in "([{":
stack.append(ch)
elif ch in PAIRS:
if not stack or stack.pop() != PAIRS[ch]:
return False
return not stack
def moving_average(values, k):
i... |
swe-implement-spec@1 | 2 | Implement roman_to_int(numeral), moving_average(values, k) as described in spec.md (lib.py holds stubs). Submit the complete contents of lib.py as the answer; only the standard library is available. Reward 1 if every function passes all hidden tests, else 0. | [
{
"name": "lib.py",
"content": "def roman_to_int(numeral):\n raise NotImplementedError\n\n\ndef moving_average(values, k):\n raise NotImplementedError\n"
},
{
"name": "spec.md",
"content": "# roman_to_int(numeral)\n\nConvert a valid Roman numeral (I, V, X, L, C, D, M, with subtractive pair... | VALUES = {"I": 1, "V": 5, "X": 10, "L": 50, "C": 100, "D": 500, "M": 1000}
def roman_to_int(numeral):
total = 0
for i, ch in enumerate(numeral):
value = VALUES[ch]
if i + 1 < len(numeral) and VALUES[numeral[i + 1]] > value:
total -= value
else:
total += value
... |
swe-implement-spec@2 | 0 | Implement top_k_words(text, k), paginate(items, page_size, page), is_balanced(text) as described in spec.md (lib.py holds stubs). Submit the complete contents of lib.py as the answer; only the standard library is available. Reward 1 if every function passes all hidden tests, else 0. | [
{
"name": "lib.py",
"content": "def top_k_words(text, k):\n raise NotImplementedError\n\n\ndef paginate(items, page_size, page):\n raise NotImplementedError\n\n\ndef is_balanced(text):\n raise NotImplementedError\n"
},
{
"name": "spec.md",
"content": "# top_k_words(text, k)\n\nLowercase... | import re
from collections import Counter
def top_k_words(text, k):
counts = Counter(re.findall(r"[a-z]+", text.lower()))
ranked = sorted(counts.items(), key=lambda item: (-item[1], item[0]))
return [word for word, _ in ranked[:k]]
def paginate(items, page_size, page):
if page_size <= 0 or page < 1:... |
swe-implement-spec@2 | 1 | Implement moving_average(values, k), paginate(items, page_size, page), roman_to_int(numeral) as described in spec.md (lib.py holds stubs). Submit the complete contents of lib.py as the answer; only the standard library is available. Reward 1 if every function passes all hidden tests, else 0. | [
{
"name": "lib.py",
"content": "def moving_average(values, k):\n raise NotImplementedError\n\n\ndef paginate(items, page_size, page):\n raise NotImplementedError\n\n\ndef roman_to_int(numeral):\n raise NotImplementedError\n"
},
{
"name": "spec.md",
"content": "# moving_average(values, k... | def moving_average(values, k):
if k <= 0 or k > len(values):
return []
return [round(sum(values[i:i + k]) / k, 3) for i in range(len(values) - k + 1)]
def paginate(items, page_size, page):
if page_size <= 0 or page < 1:
return []
start = (page - 1) * page_size
return items[start:st... |
swe-implement-spec@2 | 2 | Implement moving_average(values, k), rle_encode(text), roman_to_int(numeral) as described in spec.md (lib.py holds stubs). Submit the complete contents of lib.py as the answer; only the standard library is available. Reward 1 if every function passes all hidden tests, else 0. | [
{
"name": "lib.py",
"content": "def moving_average(values, k):\n raise NotImplementedError\n\n\ndef rle_encode(text):\n raise NotImplementedError\n\n\ndef roman_to_int(numeral):\n raise NotImplementedError\n"
},
{
"name": "spec.md",
"content": "# moving_average(values, k)\n\nReturn the ... | def moving_average(values, k):
if k <= 0 or k > len(values):
return []
return [round(sum(values[i:i + k]) / k, 3) for i in range(len(values) - k + 1)]
def rle_encode(text):
if not text:
return ""
out = []
current, count = text[0], 1
for ch in text[1:]:
if ch == current:... |
swe-crash-triage@1 | 0 | Running main.py crashes. Find the innermost frame where the exception is raised and the order record that triggers it. Answer format: file:line:ExceptionType:record_id (e.g. util.py:12:IndexError:ORD-1-0). Each of the four parts is worth 0.25. | [
{
"name": "billing.py",
"content": "\"\"\"Order pricing helpers.\"\"\"\n\nTAX_RATE = 0.2\n\n\ndef quantity(order):\n return int(order[\"qty\"])\n\n\ndef order_total(order):\n qty = quantity(order)\n price = unit_price(order)\n return round(qty * price - qty * pack_discount(order), 2)\n\n\ndef pa... | billing.py:34:TypeError:ORD-34921-25 |
swe-crash-triage@1 | 1 | Running main.py crashes. Find the innermost frame where the exception is raised and the order record that triggers it. Answer format: file:line:ExceptionType:record_id (e.g. util.py:12:IndexError:ORD-1-0). Each of the four parts is worth 0.25. | [
{
"name": "main.py",
"content": "import json\n\nfrom pricing import order_total\nfrom report import summarize\n\n\ndef main():\n with open(\"orders.json\") as f:\n orders = json.load(f)\n totals = [order_total(o) for o in orders]\n print(summarize(totals))\n\n\nif __name__ == \"__main__\":\n... | pricing.py:15:KeyError:ORD-10174-11 |
swe-crash-triage@1 | 2 | Running main.py crashes. Find the innermost frame where the exception is raised and the order record that triggers it. Answer format: file:line:ExceptionType:record_id (e.g. util.py:12:IndexError:ORD-1-0). Each of the four parts is worth 0.25. | [
{
"name": "costs.py",
"content": "\"\"\"Order pricing helpers.\"\"\"\n\nTAX_RATE = 0.07\n\n\ndef quantity(order):\n return int(order[\"qty\"])\n\n\ndef order_total(order):\n qty = quantity(order)\n price = unit_price(order)\n return round(qty * price - qty * pack_discount(order), 2)\n\n\ndef pac... | costs.py:17:ZeroDivisionError:ORD-41442-15 |
swe-crash-triage@2 | 0 | Running main.py crashes on the first bad order, but there are more. For every order in orders.json that order_total() would fail on by itself, give its id and the exception type it raises, as id:ExceptionType comma-separated in file order (e.g. ORD-1-0:KeyError,ORD-7-3:ValueError). | [
{
"name": "main.py",
"content": "import json\n\nfrom pricing import order_total\nfrom report import summarize\n\n\ndef main():\n with open(\"orders.json\") as f:\n orders = json.load(f)\n totals = [order_total(o) for o in orders]\n print(summarize(totals))\n\n\nif __name__ == \"__main__\":\n... | ORD-70615-11:KeyError,ORD-31455-14:ValueError,ORD-96113-19:TypeError,ORD-26751-26:ValueError |
swe-crash-triage@2 | 1 | Running main.py crashes on the first bad order, but there are more. For every order in orders.json that order_total() would fail on by itself, give its id and the exception type it raises, as id:ExceptionType comma-separated in file order (e.g. ORD-1-0:KeyError,ORD-7-3:ValueError). | [
{
"name": "billing.py",
"content": "\"\"\"Order pricing helpers.\"\"\"\n\nTAX_RATE = 0.2\n\n\ndef order_total(order):\n qty = quantity(order)\n price = unit_price(order)\n return round(qty * price - qty * pack_discount(order), 2)\n\n\ndef pack_discount(order):\n return order[\"discount_per_pack\... | ORD-81731-4:TypeError,ORD-69080-9:ValueError,ORD-49241-11:ZeroDivisionError,ORD-39362-12:KeyError,ORD-16780-15:ZeroDivisionError |
swe-crash-triage@2 | 2 | Running main.py crashes on the first bad order, but there are more. For every order in orders.json that order_total() would fail on by itself, give its id and the exception type it raises, as id:ExceptionType comma-separated in file order (e.g. ORD-1-0:KeyError,ORD-7-3:ValueError). | [
{
"name": "main.py",
"content": "import json\n\nfrom pricing import order_total\nfrom report import summarize\n\n\ndef main():\n with open(\"orders.json\") as f:\n orders = json.load(f)\n totals = [order_total(o) for o in orders]\n print(summarize(totals))\n\n\nif __name__ == \"__main__\":\n... | ORD-56108-3:ValueError,ORD-55247-11:TypeError,ORD-28471-14:KeyError,ORD-64502-19:ZeroDivisionError |
ind-vibration-alarm@1 | 0 | sensors.csv holds per-minute pump readings; limits.txt defines the alarm rule. List every pump that alarms with the minute of its first alarm, as pump@minute comma-separated and sorted by pump number (e.g. P2@57,P5@88), or none. | [
{
"name": "limits.txt",
"content": "ALARM RULE (rev 9)\nA pump alarms when vibration_mm_s is strictly greater than its limit for its required number of consecutive readings (one reading per minute).\nThe alarm time is the minute of the last reading that completes the run. Only the first alarm per pump matte... | P1@74,P4@39 |
ind-vibration-alarm@1 | 1 | sensors.csv holds per-minute pump readings; limits.txt defines the alarm rule. List every pump that alarms with the minute of its first alarm, as pump@minute comma-separated and sorted by pump number (e.g. P2@57,P5@88), or none. | [
{
"name": "limits.txt",
"content": "ALARM RULE (rev 6)\nA pump alarms when vibration_mm_s is strictly greater than its limit for its required number of consecutive readings (one reading per minute).\nThe alarm time is the minute of the last reading that completes the run. Only the first alarm per pump matte... | P2@100 |
ind-vibration-alarm@1 | 2 | sensors.csv holds per-minute pump readings; limits.txt defines the alarm rule. List every pump that alarms with the minute of its first alarm, as pump@minute comma-separated and sorted by pump number (e.g. P2@57,P5@88), or none. | [
{
"name": "limits.txt",
"content": "ALARM RULE (rev 6)\nA pump alarms when vibration_mm_s is strictly greater than its limit for its required number of consecutive readings (one reading per minute).\nThe alarm time is the minute of the last reading that completes the run. Only the first alarm per pump matte... | P1@77 |
ind-vibration-alarm@2 | 0 | sensors.csv holds per-minute pump readings; limits.txt defines the alarm rule. List every pump that alarms with the minute of its first alarm, as pump@minute comma-separated and sorted by pump number (e.g. P2@57,P5@88), or none. | [
{
"name": "limits.txt",
"content": "ALARM RULE (rev 7)\nA pump alarms when vibration_mm_s is strictly greater than its limit for its required number of consecutive readings (one reading per minute).\nThe alarm time is the minute of the last reading that completes the run. Only the first alarm per pump matte... | P7@35,P9@92 |
ind-vibration-alarm@2 | 1 | sensors.csv holds per-minute pump readings; limits.txt defines the alarm rule. List every pump that alarms with the minute of its first alarm, as pump@minute comma-separated and sorted by pump number (e.g. P2@57,P5@88), or none. | [
{
"name": "limits.txt",
"content": "ALARM RULE (rev 9)\nA pump alarms when vibration_mm_s is strictly greater than its limit for its required number of consecutive readings (one reading per minute).\nThe alarm time is the minute of the last reading that completes the run. Only the first alarm per pump matte... | P1@27,P2@109,P6@44 |
ind-vibration-alarm@2 | 2 | sensors.csv holds per-minute pump readings; limits.txt defines the alarm rule. List every pump that alarms with the minute of its first alarm, as pump@minute comma-separated and sorted by pump number (e.g. P2@57,P5@88), or none. | [
{
"name": "limits.txt",
"content": "ALARM RULE (rev 8)\nA pump alarms when vibration_mm_s is strictly greater than its limit for its required number of consecutive readings (one reading per minute).\nThe alarm time is the minute of the last reading that completes the run. Only the first alarm per pump matte... | P4@88,P5@87 |
ind-tank-balance@1 | 0 | Simulate the tank in model.txt with schedule.csv. Answer overflow_minute,level_at_minute_63 (litres for the level), e.g. 131,4520. Each part counts equally. | [
{
"name": "model.txt",
"content": "Tank capacity: 11100 L. Level at minute 0: 3425 L.\nMinute t covers the interval (t-1, t]. A segment with start=a and end=b is active in every minute t with a <= t <= b and moves `rate_l_per_min` litres during that minute (kind=in adds, kind=out removes).\nLevel after minu... | 211,2065 |
ind-tank-balance@1 | 1 | Simulate the tank in model.txt with schedule.csv. Answer overflow_minute,level_at_minute_30 (litres for the level), e.g. 131,4520. Each part counts equally. | [
{
"name": "model.txt",
"content": "Tank capacity: 10100 L. Level at minute 0: 4315 L.\nMinute t covers the interval (t-1, t]. A segment with start=a and end=b is active in every minute t with a <= t <= b and moves `rate_l_per_min` litres during that minute (kind=in adds, kind=out removes).\nLevel after minu... | 102,4315 |
ind-tank-balance@1 | 2 | Simulate the tank in model.txt with schedule.csv. Answer overflow_minute,level_at_minute_45 (litres for the level), e.g. 131,4520. Each part counts equally. | [
{
"name": "model.txt",
"content": "Tank capacity: 8500 L. Level at minute 0: 3185 L.\nMinute t covers the interval (t-1, t]. A segment with start=a and end=b is active in every minute t with a <= t <= b and moves `rate_l_per_min` litres during that minute (kind=in adds, kind=out removes).\nLevel after minut... | 154,2300 |
ind-tank-balance@2 | 0 | Simulate the tank in model.txt with schedule.csv. Answer overflow_minute,level_at_minute_123,minutes_valve_A_was_scheduled_open_but_forced_shut (litres for the level), e.g. 131,4520,7. Each part counts equally. | [
{
"name": "model.txt",
"content": "Tank capacity: 11000 L. Level at minute 0: 4530 L.\nMinute t covers the interval (t-1, t]. A segment with start=a and end=b is active in every minute t with a <= t <= b and moves `rate_l_per_min` litres during that minute (kind=in adds, kind=out removes).\nLevel after minu... | 178,5679,6 |
ind-tank-balance@2 | 1 | Simulate the tank in model.txt with schedule.csv. Answer overflow_minute,level_at_minute_49,minutes_valve_A_was_scheduled_open_but_forced_shut (litres for the level), e.g. 131,4520,7. Each part counts equally. | [
{
"name": "model.txt",
"content": "Tank capacity: 4900 L. Level at minute 0: 1395 L.\nMinute t covers the interval (t-1, t]. A segment with start=a and end=b is active in every minute t with a <= t <= b and moves `rate_l_per_min` litres during that minute (kind=in adds, kind=out removes).\nLevel after minut... | 51,4521,38 |
ind-tank-balance@2 | 2 | Simulate the tank in model.txt with schedule.csv. Answer overflow_minute,level_at_minute_167,minutes_valve_A_was_scheduled_open_but_forced_shut (litres for the level), e.g. 131,4520,7. Each part counts equally. | [
{
"name": "model.txt",
"content": "Tank capacity: 5900 L. Level at minute 0: 2915 L.\nMinute t covers the interval (t-1, t]. A segment with start=a and end=b is active in every minute t with a <= t <= b and moves `rate_l_per_min` litres during that minute (kind=in adds, kind=out removes).\nLevel after minut... | 219,2965,17 |
ind-oee@1 | 0 | Using definitions.txt, compute the OEE of line L1 for this shift as a percentage with one decimal (e.g. 63.4). | [
{
"name": "breaks.csv",
"content": "line,start_min,end_min\nL1,240,270\nL1,360,375\nL2,120,135\nL2,200,220\nL3,360,375\nL3,120,135\n"
},
{
"name": "definitions.txt",
"content": "OEE = Availability x Performance x Quality\nPlanned production time = shift_minutes minus planned breaks (breaks.csv).... | 60.5 |
ind-oee@1 | 1 | Using definitions.txt, compute the OEE of line L4 for this shift as a percentage with one decimal (e.g. 63.4). | [
{
"name": "breaks.csv",
"content": "line,start_min,end_min\nL1,360,375\nL1,240,270\nL2,120,135\nL2,360,375\nL3,120,135\nL3,240,270\nL4,120,135\nL4,240,270\n"
},
{
"name": "definitions.txt",
"content": "OEE = Availability x Performance x Quality\nPlanned production time = shift_minutes minus plan... | 44.5 |
ind-oee@1 | 2 | Using definitions.txt, compute the OEE of line L3 for this shift as a percentage with one decimal (e.g. 63.4). | [
{
"name": "breaks.csv",
"content": "line,start_min,end_min\nL1,240,270\nL1,120,135\nL2,200,220\nL2,240,270\nL3,120,135\nL3,240,270\n"
},
{
"name": "definitions.txt",
"content": "OEE = Availability x Performance x Quality\nPlanned production time = shift_minutes minus planned breaks (breaks.csv).... | 60.1 |
ind-oee@2 | 0 | Using definitions.txt, find the line with the lowest OEE this shift and the plant OEE, as line,percent with one decimal (e.g. L2,61.8). Each part is worth 0.5. | [
{
"name": "breaks.csv",
"content": "line,start_min,end_min\nL1,360,375\nL1,240,270\nL2,360,375\nL2,200,220\nL3,120,135\nL3,360,375\nL4,120,135\nL4,200,220\n"
},
{
"name": "definitions.txt",
"content": "OEE = Availability x Performance x Quality\nPlanned production time = shift_minutes minus plan... | L2,62.7 |
ind-oee@2 | 1 | Using definitions.txt, find the line with the lowest OEE this shift and the plant OEE, as line,percent with one decimal (e.g. L2,61.8). Each part is worth 0.5. | [
{
"name": "breaks.csv",
"content": "line,start_min,end_min\nL1,240,270\nL1,120,135\nL2,120,135\nL2,360,375\nL3,200,220\nL3,120,135\nL4,120,135\nL4,360,375\n"
},
{
"name": "definitions.txt",
"content": "OEE = Availability x Performance x Quality\nPlanned production time = shift_minutes minus plan... | L3,61.7 |
ind-oee@2 | 2 | Using definitions.txt, find the line with the lowest OEE this shift and the plant OEE, as line,percent with one decimal (e.g. L2,61.8). Each part is worth 0.5. | [
{
"name": "breaks.csv",
"content": "line,start_min,end_min\nL1,120,135\nL1,200,220\nL2,200,220\nL2,240,270\nL3,360,375\nL3,240,270\n"
},
{
"name": "definitions.txt",
"content": "OEE = Availability x Performance x Quality\nPlanned production time = shift_minutes minus planned breaks (breaks.csv).... | L2,67.0 |
sci-longest-orf@1 | 0 | sequence.fasta is a DNA forward strand; codon_table.txt maps codons to amino acids (* = stop). Find the longest open reading frame on this strand only, in any of the three frames: it starts at ATG and ends at the first in-frame stop codon. Answer its protein in one-letter code, starting with M and without the stop. | [
{
"name": "codon_table.txt",
"content": "AAA K\nAAC N\nAAG K\nAAT N\nACA T\nACC T\nACG T\nACT T\nAGA R\nAGC S\nAGG R\nAGT S\nATA I\nATC I\nATG M\nATT I\nCAA Q\nCAC H\nCAG Q\nCAT H\nCCA P\nCCC P\nCCG P\nCCT P\nCGA R\nCGC R\nCGG R\nCGT R\nCTA L\nCTC L\nCTG L\nCTT L\nGAA E\nGAC D\nGAG E\nGAT D\nGCA A\nGCC A\nG... | MSDLEGIATTCFARMYQSLSRRKTGAALTAPNTVPTVSSKNTWSLPMRLSEYYVIANAGLRRARKSSAQ |
sci-longest-orf@1 | 1 | sequence.fasta is a DNA forward strand; codon_table.txt maps codons to amino acids (* = stop). Find the longest open reading frame on this strand only, in any of the three frames: it starts at ATG and ends at the first in-frame stop codon. Answer its protein in one-letter code, starting with M and without the stop. | [
{
"name": "codon_table.txt",
"content": "AAA K\nAAC N\nAAG K\nAAT N\nACA T\nACC T\nACG T\nACT T\nAGA R\nAGC S\nAGG R\nAGT S\nATA I\nATC I\nATG M\nATT I\nCAA Q\nCAC H\nCAG Q\nCAT H\nCCA P\nCCC P\nCCG P\nCCT P\nCGA R\nCGC R\nCGG R\nCGT R\nCTA L\nCTC L\nCTG L\nCTT L\nGAA E\nGAC D\nGAG E\nGAT D\nGCA A\nGCC A\nG... | MRAHFFRLWMQKGLVQQMYNWASQQNFISLTISCRTIRIRPTTIDVNTSSRASKQ |
sci-longest-orf@1 | 2 | sequence.fasta is a DNA forward strand; codon_table.txt maps codons to amino acids (* = stop). Find the longest open reading frame on this strand only, in any of the three frames: it starts at ATG and ends at the first in-frame stop codon. Answer its protein in one-letter code, starting with M and without the stop. | [
{
"name": "codon_table.txt",
"content": "AAA K\nAAC N\nAAG K\nAAT N\nACA T\nACC T\nACG T\nACT T\nAGA R\nAGC S\nAGG R\nAGT S\nATA I\nATC I\nATG M\nATT I\nCAA Q\nCAC H\nCAG Q\nCAT H\nCCA P\nCCC P\nCCG P\nCCT P\nCGA R\nCGC R\nCGG R\nCGT R\nCTA L\nCTC L\nCTG L\nCTT L\nGAA E\nGAC D\nGAG E\nGAT D\nGCA A\nGCC A\nG... | MPGRTATTSQVLGGYQPPHAMLVLQHPGRDHFVAMWRSISSSPYWCQYWHTRMPQQSHTS |
sci-longest-orf@2 | 0 | sequence.fasta is one strand of a DNA molecule; codon_table.txt maps codons to amino acids (* = stop). Find the longest open reading frame on either strand (the given strand '+' or its reverse complement '-'), any frame: it starts at ATG and ends at the first in-frame stop codon; reading frames without a stop do not co... | [
{
"name": "codon_table.txt",
"content": "AAA K\nAAC N\nAAG K\nAAT N\nACA T\nACC T\nACG T\nACT T\nAGA R\nAGC S\nAGG R\nAGT S\nATA I\nATC I\nATG M\nATT I\nCAA Q\nCAC H\nCAG Q\nCAT H\nCCA P\nCCC P\nCCG P\nCCT P\nCGA R\nCGC R\nCGG R\nCGT R\nCTA L\nCTC L\nCTG L\nCTT L\nGAA E\nGAC D\nGAG E\nGAT D\nGCA A\nGCC A\nG... | +,MCLTFKSRGLSSCMGAVVAYQAALVLPEKVIRITDHLTTAHRALRIGTHTGQLAHGAKTPGQFRDQEARAVAESLM |
sci-longest-orf@2 | 1 | sequence.fasta is one strand of a DNA molecule; codon_table.txt maps codons to amino acids (* = stop). Find the longest open reading frame on either strand (the given strand '+' or its reverse complement '-'), any frame: it starts at ATG and ends at the first in-frame stop codon; reading frames without a stop do not co... | [
{
"name": "codon_table.txt",
"content": "AAA K\nAAC N\nAAG K\nAAT N\nACA T\nACC T\nACG T\nACT T\nAGA R\nAGC S\nAGG R\nAGT S\nATA I\nATC I\nATG M\nATT I\nCAA Q\nCAC H\nCAG Q\nCAT H\nCCA P\nCCC P\nCCG P\nCCT P\nCGA R\nCGC R\nCGG R\nCGT R\nCTA L\nCTC L\nCTG L\nCTT L\nGAA E\nGAC D\nGAG E\nGAT D\nGCA A\nGCC A\nG... | -,MSHPKSTGNSPLTGGTTQIKVPGVGRFNQRGGQGRIRMPSQLPLGWIHWGLQATRIMHLGAYKNK |
sci-longest-orf@2 | 2 | sequence.fasta is one strand of a DNA molecule; codon_table.txt maps codons to amino acids (* = stop). Find the longest open reading frame on either strand (the given strand '+' or its reverse complement '-'), any frame: it starts at ATG and ends at the first in-frame stop codon; reading frames without a stop do not co... | [
{
"name": "codon_table.txt",
"content": "AAA K\nAAC N\nAAG K\nAAT N\nACA T\nACC T\nACG T\nACT T\nAGA R\nAGC S\nAGG R\nAGT S\nATA I\nATC I\nATG M\nATT I\nCAA Q\nCAC H\nCAG Q\nCAT H\nCCA P\nCCC P\nCCG P\nCCT P\nCGA R\nCGC R\nCGG R\nCGT R\nCTA L\nCTC L\nCTG L\nCTT L\nGAA E\nGAC D\nGAG E\nGAT D\nGCA A\nGCC A\nG... | +,MNVFTDCESTMRKACNSLTWVVGFPNMAEFLDPAFVIVSILRARYFMCKEASSTLQPRWPAGLMPQYWGNLLTGIRTLTNSLYPA |
sci-limiting-reagent@1 | 0 | Using lab_notes.txt and atomic_masses.csv, identify the limiting reactant and the grams of H2O actually isolated (2 decimals). Answer formula,grams e.g. O2,12.34. Each part is worth 0.5; grams within 0.5% count. | [
{
"name": "atomic_masses.csv",
"content": "element,g_per_mol\nAl,26.982\nC,12.011\nCa,40.078\nCl,35.45\nFe,55.845\nH,1.008\nMg,24.305\nN,14.007\nNa,22.99\nO,15.999\nS,32.06\n"
},
{
"name": "lab_notes.txt",
"content": "Reaction: CaCO3 + 2 HCl -> CaCl2 + H2O + CO2\nCharged CaCO3: 201.8 g\nCharged ... | HCl,19.50 |
sci-limiting-reagent@1 | 1 | Using lab_notes.txt and atomic_masses.csv, identify the limiting reactant and the grams of CO2 actually isolated (2 decimals). Answer formula,grams e.g. O2,12.34. Each part is worth 0.5; grams within 0.5% count. | [
{
"name": "atomic_masses.csv",
"content": "element,g_per_mol\nAl,26.982\nC,12.011\nCa,40.078\nCl,35.45\nFe,55.845\nH,1.008\nMg,24.305\nN,14.007\nNa,22.99\nO,15.999\nS,32.06\n"
},
{
"name": "lab_notes.txt",
"content": "Reaction: Fe2O3 + 3 CO -> 2 Fe + 3 CO2\nCharged Fe2O3: 78.04 g\nCharged CO: 13... | Fe2O3,64.52 |
sci-limiting-reagent@1 | 2 | Using lab_notes.txt and atomic_masses.csv, identify the limiting reactant and the grams of Al2O3 actually isolated (2 decimals). Answer formula,grams e.g. O2,12.34. Each part is worth 0.5; grams within 0.5% count. | [
{
"name": "atomic_masses.csv",
"content": "element,g_per_mol\nAl,26.982\nC,12.011\nCa,40.078\nCl,35.45\nFe,55.845\nH,1.008\nMg,24.305\nN,14.007\nNa,22.99\nO,15.999\nS,32.06\n"
},
{
"name": "lab_notes.txt",
"content": "Reaction: 4 Al + 3 O2 -> 2 Al2O3\nCharged Al: 249.02 g\nCharged O2: 200.36 g\n... | O2,319.22 |
sci-limiting-reagent@2 | 0 | Using lab_notes.txt and atomic_masses.csv, identify the limiting reactant and the grams of H2O actually isolated (2 decimals). Answer formula,grams e.g. O2,12.34. Each part is worth 0.5; grams within 0.5% count. | [
{
"name": "atomic_masses.csv",
"content": "element,g_per_mol\nAl,26.982\nC,12.011\nCa,40.078\nCl,35.45\nFe,55.845\nH,1.008\nMg,24.305\nN,14.007\nNa,22.99\nO,15.999\nS,32.06\n"
},
{
"name": "lab_notes.txt",
"content": "Reaction: C3H8 + 5 O2 -> 3 CO2 + 4 H2O\nCharged C3H8: 108.86 g of 80% purity (... | O2,18.08 |
sci-limiting-reagent@2 | 1 | Using lab_notes.txt and atomic_masses.csv, identify the limiting reactant and the grams of H2O actually isolated (2 decimals). Answer formula,grams e.g. O2,12.34. Each part is worth 0.5; grams within 0.5% count. | [
{
"name": "atomic_masses.csv",
"content": "element,g_per_mol\nAl,26.982\nC,12.011\nCa,40.078\nCl,35.45\nFe,55.845\nH,1.008\nMg,24.305\nN,14.007\nNa,22.99\nO,15.999\nS,32.06\n"
},
{
"name": "lab_notes.txt",
"content": "Reaction: C3H8 + 5 O2 -> 3 CO2 + 4 H2O\nCharged C3H8: 216.32 g of 98.5% purity... | O2,78.32 |
sci-limiting-reagent@2 | 2 | Using lab_notes.txt and atomic_masses.csv, identify the limiting reactant and the grams of MgO actually isolated (2 decimals). Answer formula,grams e.g. O2,12.34. Each part is worth 0.5; grams within 0.5% count. | [
{
"name": "atomic_masses.csv",
"content": "element,g_per_mol\nAl,26.982\nC,12.011\nCa,40.078\nCl,35.45\nFe,55.845\nH,1.008\nMg,24.305\nN,14.007\nNa,22.99\nO,15.999\nS,32.06\n"
},
{
"name": "lab_notes.txt",
"content": "Reaction: 2 Mg + O2 -> 2 MgO\nCharged Mg: 88.75 g of 100% purity (by mass)\nCh... | Mg,147.17 |
sci-dilution-series@1 | 0 | From protocol.txt and absorbance.csv, compute the analyte concentration in the original stock in mM (Beer-Lambert, blank-corrected means). Answer a number; within 1% counts. | [
{
"name": "absorbance.csv",
"content": "well,replicate,A\nblank,1,0.032\nblank,2,0.041\nblank,3,0.058\nsample,1,0.747\nsample,2,0.757\nsample,3,0.752\n"
},
{
"name": "protocol.txt",
"content": "Analyte: bilirubin. Molar absorptivity 18300 L/(mol*cm). Cuvette path 0.5 cm.\nSerial dilution of the ... | 4252 |
sci-dilution-series@1 | 1 | From protocol.txt and absorbance.csv, compute the analyte concentration in the original stock in mM (Beer-Lambert, blank-corrected means). Answer a number; within 1% counts. | [
{
"name": "absorbance.csv",
"content": "well,replicate,A\nblank,1,0.053\nblank,2,0.044\nblank,3,0.059\nsample,1,0.527\nsample,2,0.525\nsample,3,0.54\n"
},
{
"name": "protocol.txt",
"content": "Analyte: riboflavin. Molar absorptivity 12200 L/(mol*cm). Cuvette path 1.0 cm.\nSerial dilution of the ... | 1.099 |
sci-dilution-series@1 | 2 | From protocol.txt and absorbance.csv, compute the analyte concentration in the original stock in mM (Beer-Lambert, blank-corrected means). Answer a number; within 1% counts. | [
{
"name": "absorbance.csv",
"content": "well,replicate,A\nblank,1,0.058\nblank,2,0.036\nblank,3,0.047\nsample,1,0.505\nsample,2,0.51\nsample,3,0.498\n"
},
{
"name": "protocol.txt",
"content": "Analyte: riboflavin. Molar absorptivity 33000 L/(mol*cm). Cuvette path 1.0 cm.\nSerial dilution of the ... | 5.405 |
sci-dilution-series@2 | 0 | From protocol.txt and readings.csv, compute the analyte concentration in the original stock in mM. Answer a number; within 1% counts. | [
{
"name": "protocol.txt",
"content": "Analyte: riboflavin.\nSerial dilution of the stock (each step uses the previous tube):\n Step 1: transfer 2.0 mL into 19.0 mL diluent and mix.\n Step 2: transfer 0.5 mL into 9.0 mL diluent and mix.\n Step 3: transfer 5.0 mL into 4.5 mL diluent and mix.\n Step 4: tra... | 149.86 |
sci-dilution-series@2 | 1 | From protocol.txt and readings.csv, compute the analyte concentration in the original stock in mM. Answer a number; within 1% counts. | [
{
"name": "protocol.txt",
"content": "Analyte: methylene blue.\nSerial dilution of the stock (each step uses the previous tube):\n Step 1: transfer 0.5 mL into 45.0 mL diluent and mix.\n Step 2: transfer 5.0 mL into 45.0 mL diluent and mix.\n Step 3: transfer 2.5 mL into 4.5 mL diluent and mix.\nThe fina... | 129.39 |
sci-dilution-series@2 | 2 | From protocol.txt and readings.csv, compute the analyte concentration in the original stock in mM. Answer a number; within 1% counts. | [
{
"name": "protocol.txt",
"content": "Analyte: methylene blue.\nSerial dilution of the stock (each step uses the previous tube):\n Step 1: transfer 2.0 mL into 19.0 mL diluent and mix.\n Step 2: transfer 2.5 mL into 4.5 mL diluent and mix.\n Step 3: transfer 5.0 mL into 18.0 mL diluent and mix.\nThe fina... | 8.8335 |
off-meeting-slot@1 | 0 | Find the earliest 45-minute slot this week (Mon-Fri) when Amara, Bruno, Freya, Emeka are all free and inside everyone's local working hours. Calendars are in calendars/; slots start on a quarter hour in UTC. Answer the UTC start as Day HH:MM, e.g. Tue 13:45. | [
{
"name": "calendars/amara.txt",
"content": "# Amara - timezone UTC+01:00 - working hours 09:00-17:00 local\n# busy blocks in local time\nMon 09:00-09:30 call\nMon 12:00-12:30 review\nMon 13:45-15:45 standup\nMon 16:15-17:00 standup\nTue 09:30-10:00 call\nTue 09:45-10:30 standup\nTue 13:00-13:30 standup\nTu... | Mon 09:00 |
off-meeting-slot@1 | 1 | Find the earliest 45-minute slot this week (Mon-Fri) when Freya, Amara, Chen, Bruno are all free and inside everyone's local working hours. Calendars are in calendars/; slots start on a quarter hour in UTC. Answer the UTC start as Day HH:MM, e.g. Tue 13:45. | [
{
"name": "calendars/amara.txt",
"content": "# Amara - timezone UTC+00:00 - working hours 09:00-17:00 local\n# busy blocks in local time\nMon 16:15-17:00 focus\nTue 12:15-13:15 review\nTue 16:15-17:00 focus\nWed 12:15-12:45 focus\nWed 12:30-13:30 1:1\nWed 13:15-14:00 focus\nWed 13:45-14:15 call\nThu 13:00-1... | Mon 09:30 |
off-meeting-slot@1 | 2 | Find the earliest 45-minute slot this week (Mon-Fri) when Hana, Emeka, Chen are all free and inside everyone's local working hours. Calendars are in calendars/; slots start on a quarter hour in UTC. Answer the UTC start as Day HH:MM, e.g. Tue 13:45. | [
{
"name": "calendars/chen.txt",
"content": "# Chen - timezone UTC+02:00 - working hours 09:00-17:00 local\n# busy blocks in local time\nMon 12:15-13:45 1:1\nMon 12:30-14:00 1:1\nMon 13:30-15:00 standup\nMon 16:00-17:00 1:1\nTue 10:00-10:30 standup\nTue 12:45-13:15 call\nTue 15:45-16:15 standup\nWed 11:00-11... | Mon 13:00 |
off-meeting-slot@2 | 0 | Find the earliest 30-minute slot this week (Mon-Fri) when Freya, Dalia, Amara, Chen are all free and inside everyone's local working hours, following scheduling_rules.md. Calendars are in calendars/; slots start on a quarter hour in UTC. Answer the UTC start as Day HH:MM, e.g. Tue 13:45. | [
{
"name": "calendars/amara.txt",
"content": "# Amara - timezone UTC+04:00 - working hours 09:00-17:00 local\n# busy blocks in local time\nMon 10:15-10:45 call\nMon 14:30-16:30 focus\nTue 10:00-10:30 1:1\nTue 10:30-11:30 standup\nTue 15:00-16:00 review\nWed 09:15-11:15 focus\nThu 13:15-14:15 call\nFri 13:30-... | Tue 09:00 |
off-meeting-slot@2 | 1 | Find the earliest 60-minute slot this week (Mon-Fri) when Amara, Bruno, Emeka, Dalia are all free and inside everyone's local working hours, following scheduling_rules.md. Calendars are in calendars/; slots start on a quarter hour in UTC. Answer the UTC start as Day HH:MM, e.g. Tue 13:45. | [
{
"name": "calendars/amara.txt",
"content": "# Amara - timezone UTC+03:00 - working hours 09:00-17:00 local\n# busy blocks in local time\nMon 10:00-11:30 call\nTue 11:30-12:00 review\nTue 14:00-14:45 focus\nWed 14:30-15:00 focus\nWed 14:45-15:15 1:1\nThu 10:15-11:00 standup\nFri 09:15-09:45 focus\nFri 15:45... | Tue 12:00 |
off-meeting-slot@2 | 2 | Find the earliest 45-minute slot this week (Mon-Fri) when Dalia, Emeka, Goran are all free and inside everyone's local working hours, following scheduling_rules.md. Calendars are in calendars/; slots start on a quarter hour in UTC. Answer the UTC start as Day HH:MM, e.g. Tue 13:45. | [
{
"name": "calendars/dalia.txt",
"content": "# Dalia - timezone UTC+03:00 - working hours 09:00-17:00 local\n# busy blocks in local time\nMon 14:15-14:45 standup\nMon 16:00-16:45 1:1\nTue 09:00-09:30 standup\nWed 14:15-14:45 standup\nWed 14:45-16:15 review\nWed 15:30-16:00 call\nWed 16:15-17:00 1:1\nThu 09:... | Mon 11:00 |
off-expense-audit@1 | 0 | Audit expenses.csv against policy.md. Answer the ids of every non-compliant line, comma-separated in ascending order (e.g. X103,X117), or none. | [
{
"name": "expenses.csv",
"content": "id,employee,date,category,amount,currency,attendees,nights,receipt\nX101,Hana,2026-09-23,hotel,391.68,EUR,1,2,yes\nX102,Hana,2026-09-07,office,57.01,EUR,1,,yes\nX103,Hana,2026-09-12,taxi,93.69,EUR,1,,yes\nX104,Goran,2026-09-11,meal,149.69,USD,2,,yes\nX105,Amara,2026-09-... | X101,X104,X109,X110,X113,X117,X118,X121,X124,X125,X126,X128,X130 |
off-expense-audit@1 | 1 | Audit expenses.csv against policy.md. Answer the ids of every non-compliant line, comma-separated in ascending order (e.g. X103,X117), or none. | [
{
"name": "expenses.csv",
"content": "id,employee,date,category,amount,currency,attendees,nights,receipt\nX101,Goran,2026-09-27,taxi,117.81,USD,1,,yes\nX102,Emeka,2026-09-13,office,83.57,EUR,1,,yes\nX103,Goran,2026-09-13,meal,28.25,USD,1,,yes\nX104,Chen,2026-09-02,office,92.32,EUR,1,,yes\nX105,Emeka,2026-09... | X106,X110,X111,X113,X114,X124,X125,X130 |
off-expense-audit@1 | 2 | Audit expenses.csv against policy.md. Answer the ids of every non-compliant line, comma-separated in ascending order (e.g. X103,X117), or none. | [
{
"name": "expenses.csv",
"content": "id,employee,date,category,amount,currency,attendees,nights,receipt\nX101,Hana,2026-09-27,taxi,70.43,USD,1,,yes\nX102,Hana,2026-09-15,meal,25.33,EUR,1,,yes\nX103,Freya,2026-09-25,office,85.99,EUR,1,,yes\nX104,Bruno,2026-09-14,meal,50,USD,1,,yes\nX105,Bruno,2026-09-08,hot... | X105,X106,X110,X113,X125 |
off-expense-audit@2 | 0 | Audit expenses.csv against policy.md. Answer the ids of every non-compliant line, comma-separated in ascending order (e.g. X103,X117), or none. | [
{
"name": "expenses.csv",
"content": "id,employee,date,category,amount,currency,attendees,nights,receipt\nX101,Chen,2026-09-13,meal,55.05,USD,2,,yes\nX102,Goran,2026-09-27,hotel,349.94,USD,1,2,yes\nX103,Goran,2026-09-27,taxi,69.08,EUR,1,,no\nX104,Emeka,2026-09-05,office,82.48,USD,1,,yes\nX105,Chen,2026-09-1... | X101,X103,X108,X110,X111,X117,X119,X120,X124,X125,X126 |
off-expense-audit@2 | 1 | Audit expenses.csv against policy.md. Answer the ids of every non-compliant line, comma-separated in ascending order (e.g. X103,X117), or none. | [
{
"name": "expenses.csv",
"content": "id,employee,date,category,amount,currency,attendees,nights,receipt\nX101,Hana,2026-09-17,office,79.22,USD,1,,yes\nX102,Freya,2026-09-16,hotel,400,USD,1,2,yes\nX103,Chen,2026-09-26,taxi,52.4,EUR,1,,yes\nX104,Freya,2026-09-16,meal,60,USD,1,,yes\nX105,Hana,2026-09-08,offic... | X105,X108,X109,X112,X113,X116,X117,X119 |
off-expense-audit@2 | 2 | Audit expenses.csv against policy.md. Answer the ids of every non-compliant line, comma-separated in ascending order (e.g. X103,X117), or none. | [
{
"name": "expenses.csv",
"content": "id,employee,date,category,amount,currency,attendees,nights,receipt\nX101,Emeka,2026-09-16,meal,11.93,EUR,1,,yes\nX102,Hana,2026-09-26,meal,204.66,USD,5,,yes\nX103,Emeka,2026-09-16,meal,11.93,EUR,1,,yes\nX104,Hana,2026-09-26,meal,204.66,USD,5,,yes\nX105,Amara,2026-09-29,... | X102,X103,X104,X105,X109,X110,X111,X116,X117,X118,X121,X123,X125,X126,X127,X129,X130,X132 |
off-regional-revenue@1 | 0 | Using orders.csv and customers.csv, find the region with the highest Q2 2026 revenue, excluding cancelled and refunded orders (calendar quarters). Answer region,total with 2 decimals, e.g. APAC,10450.25. Each part is worth 0.5. | [
{
"name": "customers.csv",
"content": "customer_id,region\nC200,DACH\nC201,NA\nC202,ANZ\nC203,NA\nC204,LATAM\nC205,NA\nC206,LATAM\nC207,NA\nC208,LATAM\nC209,DACH\nC210,LATAM\nC211,ANZ\nC212,ANZ\nC213,DACH\nC214,DACH\nC215,NA\nC216,ANZ\nC217,NA\nC218,DACH\nC219,DACH\nC220,LATAM\nC221,LATAM\n"
},
{
"n... | NA,15409.77 |
off-regional-revenue@1 | 1 | Using orders.csv and customers.csv, find the region with the highest Q2 2026 revenue, excluding cancelled and refunded orders (calendar quarters). Answer region,total with 2 decimals, e.g. APAC,10450.25. Each part is worth 0.5. | [
{
"name": "customers.csv",
"content": "customer_id,region\nC200,EMEA\nC201,EMEA\nC202,NA\nC203,EMEA\nC204,LATAM\nC205,EMEA\nC206,DACH\nC207,NA\nC208,EMEA\nC209,NA\nC210,LATAM\nC211,NA\nC212,DACH\nC213,LATAM\nC214,NA\nC215,DACH\nC216,NA\nC217,NA\nC218,EMEA\nC219,EMEA\nC220,DACH\nC221,EMEA\n"
},
{
"na... | LATAM,13525.96 |
off-regional-revenue@1 | 2 | Using orders.csv and customers.csv, find the region with the highest Q2 2026 revenue, excluding cancelled and refunded orders (calendar quarters). Answer region,total with 2 decimals, e.g. APAC,10450.25. Each part is worth 0.5. | [
{
"name": "customers.csv",
"content": "customer_id,region\nC200,DACH\nC201,APAC\nC202,DACH\nC203,DACH\nC204,NA\nC205,EMEA\nC206,DACH\nC207,EMEA\nC208,NA\nC209,EMEA\nC210,APAC\nC211,DACH\nC212,DACH\nC213,NA\nC214,NA\nC215,APAC\nC216,EMEA\nC217,APAC\nC218,APAC\nC219,NA\nC220,NA\nC221,APAC\n"
},
{
"nam... | DACH,10779.12 |
off-regional-revenue@2 | 0 | Using orders.csv, customers.csv, fx.csv and refunds.csv, find the region with the highest Q1 2026 net revenue in USD, excluding cancelled and refunded orders (calendar quarters). Convert each order at its order month's rate; partial refunds in refunds.csv are in the order's currency and reduce that order's revenue. Ans... | [
{
"name": "customers.csv",
"content": "customer_id,region\nC200,NA\nC201,APAC\nC202,LATAM\nC203,NA\nC204,LATAM\nC205,APAC\nC206,APAC\nC207,ANZ\nC208,APAC\nC209,APAC\nC210,LATAM\nC211,LATAM\nC212,APAC\nC213,LATAM\nC214,NA\nC215,NA\nC216,NA\nC217,APAC\nC218,APAC\n"
},
{
"name": "fx.csv",
"content"... | APAC,15870.44 |
off-regional-revenue@2 | 1 | Using orders.csv, customers.csv, fx.csv and refunds.csv, find the region with the highest Q4 2026 net revenue in USD, excluding cancelled and refunded orders (calendar quarters). Convert each order at its order month's rate; partial refunds in refunds.csv are in the order's currency and reduce that order's revenue. Ans... | [
{
"name": "customers.csv",
"content": "customer_id,region\nC200,NA\nC201,NA\nC202,APAC\nC203,LATAM\nC204,APAC\nC205,ANZ\nC206,NA\nC207,ANZ\nC208,NA\nC209,NA\nC210,LATAM\nC211,ANZ\nC212,APAC\nC213,NA\nC214,NA\nC215,NA\n"
},
{
"name": "fx.csv",
"content": "month,currency,usd_per_unit\n1,EUR,1.0872... | NA,16819.52 |
off-regional-revenue@2 | 2 | Using orders.csv, customers.csv, fx.csv and refunds.csv, find the region with the highest Q4 2026 net revenue in USD, excluding cancelled and refunded orders (calendar quarters). Convert each order at its order month's rate; partial refunds in refunds.csv are in the order's currency and reduce that order's revenue. Ans... | [
{
"name": "customers.csv",
"content": "customer_id,region\nC200,LATAM\nC201,LATAM\nC202,ANZ\nC203,NA\nC204,NA\nC205,ANZ\nC206,NA\nC207,NA\nC208,LATAM\nC209,ANZ\nC210,ANZ\nC211,LATAM\nC212,DACH\nC213,LATAM\nC214,DACH\nC215,DACH\nC216,DACH\nC217,LATAM\nC218,ANZ\nC219,NA\n"
},
{
"name": "fx.csv",
"... | ANZ,14141.40 |
fin-loan-balance@1 | 0 | Using loan.txt and extra_payments.csv, compute the outstanding balance at the end of month 95. Answer the amount with 2 decimals; within 0.05 counts. | [
{
"name": "extra_payments.csv",
"content": "month,extra_principal\n8,12000\n52,9500\n67,2500\n"
},
{
"name": "loan.txt",
"content": "Principal: 99000.00\nInitial APR: 4.5% nominal, compounded monthly (monthly rate = APR/12)\nTerm: 240 months\nRate reset: from month 56 on, the APR is 3.75%. At th... | 46675.98 |
fin-loan-balance@1 | 1 | Using loan.txt and extra_payments.csv, compute the outstanding balance at the end of month 97. Answer the amount with 2 decimals; within 0.05 counts. | [
{
"name": "extra_payments.csv",
"content": "month,extra_principal\n38,13000\n63,16500\n84,4000\n"
},
{
"name": "loan.txt",
"content": "Principal: 175000.00\nInitial APR: 5.125% nominal, compounded monthly (monthly rate = APR/12)\nTerm: 240 months\nRate reset: from month 30 on, the APR is 3.625%.... | 82630.29 |
fin-loan-balance@1 | 2 | Using loan.txt and extra_payments.csv, compute the outstanding balance at the end of month 84. Answer the amount with 2 decimals; within 0.05 counts. | [
{
"name": "extra_payments.csv",
"content": "month,extra_principal\n8,3500\n9,19000\n31,3000\n56,12000\n"
},
{
"name": "loan.txt",
"content": "Principal: 512000.00\nInitial APR: 5.125% nominal, compounded monthly (monthly rate = APR/12)\nTerm: 120 months\nRate reset: from month 23 on, the APR is ... | 152058.52 |
fin-loan-balance@2 | 0 | Using loan.txt and extra_payments.csv, compute the outstanding balance at the end of month 73. Answer the amount with 2 decimals; within 0.05 counts. | [
{
"name": "extra_payments.csv",
"content": "month,extra_principal\n10,16000\n40,19000\n47,1000\n71,17000\n"
},
{
"name": "loan.txt",
"content": "Principal: 137000.00\nInitial APR: 3.25% nominal, compounded monthly (monthly rate = APR/12)\nTerm: 120 months\nRate reset: from month 18 on, the APR i... | 15417.84 |
fin-loan-balance@2 | 1 | Using loan.txt and extra_payments.csv, compute the outstanding balance at the end of month 90. Answer the amount with 2 decimals; within 0.05 counts. | [
{
"name": "extra_payments.csv",
"content": "month,extra_principal\n11,19500\n17,2500\n64,14000\n84,9000\n"
},
{
"name": "loan.txt",
"content": "Principal: 497000.00\nInitial APR: 5.125% nominal, compounded monthly (monthly rate = APR/12)\nTerm: 180 months\nRate reset: from month 58 on, the APR i... | 257586.22 |
fin-loan-balance@2 | 2 | Using loan.txt and extra_payments.csv, compute the outstanding balance at the end of month 90. Answer the amount with 2 decimals; within 0.05 counts. | [
{
"name": "extra_payments.csv",
"content": "month,extra_principal\n33,12500\n78,16000\n"
},
{
"name": "loan.txt",
"content": "Principal: 184000.00\nInitial APR: 5.75% nominal, compounded monthly (monthly rate = APR/12)\nTerm: 240 months\nRate reset: from month 33 on, the APR is 4.25%. At the sta... | 105762.08 |
fin-npv-ranking@1 | 0 | Rank the projects in cashflows.csv by NPV using memo.txt, projects.csv and rates.csv. Answer the project with the highest NPV and its NPV in USD rounded to whole dollars, e.g. Atlas,12345. Each part is worth 0.5; NPV within 1 counts. | [
{
"name": "cashflows.csv",
"content": "project,year,amount,currency,status\nDune,7,3670,EUR,booked\nDune,7,17559,EUR,booked\nDune,7,10771,EUR,booked\nCobalt,4,7767,EUR,booked\nCobalt,5,-1450,EUR,booked\nCobalt,5,-9550,EUR,booked\nEmber,4,50454,USD,booked\nDune,5,13921,EUR,booked\nDune,6,76652,EUR,booked\nAt... | Cobalt,173467 |
fin-npv-ranking@1 | 1 | Rank the projects in cashflows.csv by NPV using memo.txt, projects.csv and rates.csv. Answer the project with the highest NPV and its NPV in USD rounded to whole dollars, e.g. Atlas,12345. Each part is worth 0.5; NPV within 1 counts. | [
{
"name": "cashflows.csv",
"content": "project,year,amount,currency,status\nCobalt,7,4425,EUR,booked\nEmber,1,55793,USD,booked\nFjord,2,48533,USD,booked\nCobalt,3,11207,EUR,booked\nCobalt,3,48793,EUR,booked\nCobalt,2,144,EUR,booked\nDune,5,-19000,EUR,booked\nFjord,3,135000,USD,booked\nDune,3,106000,EUR,book... | Dune,176655 |
fin-npv-ranking@1 | 2 | Rank the projects in cashflows.csv by NPV using memo.txt, projects.csv and rates.csv. Answer the project with the highest NPV and its NPV in USD rounded to whole dollars, e.g. Atlas,12345. Each part is worth 0.5; NPV within 1 counts. | [
{
"name": "cashflows.csv",
"content": "project,year,amount,currency,status\nDune,0,-63806,EUR,booked\nFjord,3,4940,EUR,booked\nGarnet,3,135000,EUR,booked\nDune,2,70107,EUR,booked\nBorealis,4,-17995,EUR,booked\nDune,3,68000,EUR,cancelled\nCobalt,1,6596,EUR,booked\nBorealis,3,9182,EUR,booked\nCobalt,5,29000,E... | Dune,150573 |
fin-npv-ranking@2 | 0 | Rank the projects in cashflows.csv by NPV using memo.txt, projects.csv and rates.csv. Answer the project with the highest NPV and its NPV in USD rounded to whole dollars, e.g. Atlas,12345. Each part is worth 0.5; NPV within 1 counts. | [
{
"name": "cashflows.csv",
"content": "project,year,amount,currency,status\nGarnet,2,3398,EUR,booked\nGarnet,2,34136,EUR,booked\nGarnet,0,-152891,EUR,booked\nBorealis,6,-10131,EUR,booked\nDune,3,17000,USD,booked\nEmber,1,10026,EUR,booked\nGarnet,1,1221,EUR,booked\nGarnet,0,-172109,EUR,booked\nCobalt,2,41146... | Ember,168990 |
fin-npv-ranking@2 | 1 | Rank the projects in cashflows.csv by NPV using memo.txt, projects.csv and rates.csv. Answer the project with the highest NPV and its NPV in USD rounded to whole dollars, e.g. Atlas,12345. Each part is worth 0.5; NPV within 1 counts. | [
{
"name": "cashflows.csv",
"content": "project,year,amount,currency,status\nCobalt,4,305,EUR,booked\nCobalt,2,143000,EUR,booked\nFjord,0,-309544,USD,booked\nCobalt,4,-996,EUR,booked\nCobalt,5,3147,EUR,booked\nCobalt,3,58000,EUR,booked\nEmber,4,49125,USD,booked\nCobalt,6,35994,EUR,booked\nFjord,4,44000,USD,b... | Cobalt,239649 |
fin-npv-ranking@2 | 2 | Rank the projects in cashflows.csv by NPV using memo.txt, projects.csv and rates.csv. Answer the project with the highest NPV and its NPV in USD rounded to whole dollars, e.g. Atlas,12345. Each part is worth 0.5; NPV within 1 counts. | [
{
"name": "cashflows.csv",
"content": "project,year,amount,currency,status\nFjord,6,7520,USD,booked\nFjord,6,-10792,USD,booked\nCobalt,2,4000,EUR,booked\nCobalt,0,-8872,EUR,booked\nFjord,5,5392,USD,booked\nFjord,4,17005,USD,booked\nEmber,3,60033,EUR,booked\nEmber,2,38803,EUR,booked\nCobalt,6,84367,EUR,booke... | Cobalt,210359 |
fin-portfolio-value@1 | 0 | Value the portfolio built by trades.csv at the close of 2026-09-22 in USD, using prices.csv and fx.csv (see README.txt). Answer the value with 2 decimals; within 0.50 counts. | [
{
"name": "README.txt",
"content": "prices.csv holds closing prices in each instrument's own currency. fx.csv gives USD per one unit of currency on that date. Trades on the valuation date settle before the close.\n"
},
{
"name": "fx.csv",
"content": "date,currency,usd_per_unit\n2026-09-01,EUR,1.... | 58443.64 |
fin-portfolio-value@1 | 1 | Value the portfolio built by trades.csv at the close of 2026-09-23 in USD, using prices.csv and fx.csv (see README.txt). Answer the value with 2 decimals; within 0.50 counts. | [
{
"name": "README.txt",
"content": "prices.csv holds closing prices in each instrument's own currency. fx.csv gives USD per one unit of currency on that date. Trades on the valuation date settle before the close.\n"
},
{
"name": "fx.csv",
"content": "date,currency,usd_per_unit\n2026-09-01,EUR,1.... | 41660.68 |
fin-portfolio-value@1 | 2 | Value the portfolio built by trades.csv at the close of 2026-09-18 in USD, using prices.csv and fx.csv (see README.txt). Answer the value with 2 decimals; within 0.50 counts. | [
{
"name": "README.txt",
"content": "prices.csv holds closing prices in each instrument's own currency. fx.csv gives USD per one unit of currency on that date. Trades on the valuation date settle before the close.\n"
},
{
"name": "fx.csv",
"content": "date,currency,usd_per_unit\n2026-09-01,EUR,1.... | 44774.52 |
fin-portfolio-value@2 | 0 | Value the portfolio built by trades.csv at the close of 2026-09-17 in USD, using prices.csv and fx.csv (see README.txt). Answer the value with 2 decimals; within 0.50 counts. | [
{
"name": "README.txt",
"content": "prices.csv holds closing prices in each instrument's own currency. fx.csv gives USD per one unit of currency on that date. Trades on the valuation date settle before the close.\nCorporate action: ACME split 3-for-1 effective 2026-09-08 (before that day's trading). Prices ... | 23790.84 |
fin-portfolio-value@2 | 1 | Value the portfolio built by trades.csv at the close of 2026-09-15 in USD, using prices.csv and fx.csv (see README.txt). Answer the value with 2 decimals; within 0.50 counts. | [
{
"name": "README.txt",
"content": "prices.csv holds closing prices in each instrument's own currency. fx.csv gives USD per one unit of currency on that date. Trades on the valuation date settle before the close.\nCorporate action: DYNA split 3-for-1 effective 2026-09-07 (before that day's trading). Prices ... | 44249.78 |
fin-portfolio-value@2 | 2 | Value the portfolio built by trades.csv at the close of 2026-09-18 in USD, using prices.csv and fx.csv (see README.txt). Answer the value with 2 decimals; within 0.50 counts. | [
{
"name": "README.txt",
"content": "prices.csv holds closing prices in each instrument's own currency. fx.csv gives USD per one unit of currency on that date. Trades on the valuation date settle before the close.\nCorporate action: ACME split 1.5-for-1 effective 2026-09-10 (before that day's trading). Price... | 64302.08 |
math-grid-paths@1 | 0 | grid.txt is a map ('.' open, '#' blocked). Count the paths from the top-left cell to the bottom-right cell that move only one cell right or down at a time and never enter a blocked cell. Answer the exact integer. | [
{
"name": "grid.txt",
"content": ".......\n.......\n....#.#\n.......\n.#.#...\n..##...\n.#.....\n.##....\n.......\n"
}
] | 457 |
math-grid-paths@1 | 1 | grid.txt is a map ('.' open, '#' blocked). Count the paths from the top-left cell to the bottom-right cell that move only one cell right or down at a time and never enter a blocked cell. Answer the exact integer. | [
{
"name": "grid.txt",
"content": "..#...\n......\n...#..\n..#..#\n......\n......\n......\n#....#\n...#..\n"
}
] | 116 |
math-grid-paths@1 | 2 | grid.txt is a map ('.' open, '#' blocked). Count the paths from the top-left cell to the bottom-right cell that move only one cell down or right at a time and never enter a blocked cell. Answer the exact integer. | [
{
"name": "grid.txt",
"content": "......\n......\n#.....\n......\n...#..\n......\n.#....\n......\n......\n"
}
] | 420 |
math-grid-paths@2 | 0 | grid.txt is a map ('.' open, '#' blocked, 'C' checkpoint). Count the paths from the top-left cell to the bottom-right cell that move one cell right, down, or diagonally down-right at a time, never enter a blocked cell, and pass through C. Answer the exact integer. | [
{
"name": "grid.txt",
"content": "............\n...#....#...\n#..##.......\n........#...\n#..C..#.#...\n.......###..\n..##.#..###.\n.#........#.\n............\n............\n..#........#\n.#.....#....\n.#....#....#\n.##.........\n"
}
] | 6731680 |
math-grid-paths@2 | 1 | grid.txt is a map ('.' open, '#' blocked, 'C' checkpoint). Count the paths from the top-left cell to the bottom-right cell that move one cell right, down, or diagonally down-right at a time, never enter a blocked cell, and pass through C. Answer the exact integer. | [
{
"name": "grid.txt",
"content": "........#.........\n#.##..#.#.........\n......#......#....\n........#...##....\n.#..###...........\n#........#........\n..#.....#...#.....\n....#.#..#...#..##\n#.#.#...#...#.....\n..................\n.....#.......C.#.#\n....#......#......\n.......#....#..#.#\n.......#......... | 13217472 |
math-grid-paths@2 | 2 | grid.txt is a map ('.' open, '#' blocked, 'C' checkpoint). Count the paths from the top-left cell to the bottom-right cell that move one cell right, down, or diagonally down-right at a time, never enter a blocked cell, and pass through C. Answer the exact integer. | [
{
"name": "grid.txt",
"content": ".............\n.....#....#..\n......#...#..\n...........#.\n#............\n...#.........\n...........#.\n.#...........\n.......##....\n..#.#........\n...#.........\n..#....#.....\n.......C...#.\n....#........\n.....#.....#.\n....#........\n"
}
] | 17938336 |
math-number-theory@1 | 0 | Solve the problem in problem.txt. Answer the exact integer. | [
{
"name": "problem.txt",
"content": "Let S be the sum of the decimal digits of 7^611. What is S mod 97?\n"
}
] | 93 |
math-number-theory@1 | 1 | Solve the problem in problem.txt. Answer the exact integer. | [
{
"name": "problem.txt",
"content": "How many integers n with 1 <= n <= 2239228 are divisible by 7 or 12 but not by 11?\n"
}
] | 436214 |
math-number-theory@1 | 2 | Solve the problem in problem.txt. Answer the exact integer. | [
{
"name": "problem.txt",
"content": "Let S be the sum of the decimal digits of 11^920. What is S mod 1000000007?\n"
}
] | 4153 |
math-number-theory@2 | 0 | Solve the problem in problem.txt. Answer the exact integer. | [
{
"name": "problem.txt",
"content": "How many integers k with 1 <= k <= 8189152026092 have decimal digit sum exactly 66?\n"
}
] | 227041573647 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.