context listlengths 1 1 | gen_kwargs dict | repeat_idx int64 0 9 | request_idx int64 0 514 | task_name stringclasses 9
values | metadata dict | model_outputs stringlengths 8 174k |
|---|---|---|---|---|---|---|
[
{
"content": "Generate an executable Python function generated from the given prompt. The function should take stdin as input and print the output. Simply call the function after the definition.There are N competitive programmers numbered person 1, person 2, \\ldots, and person N.\nThere is a relation called su... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 256 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": "",
"subject": null,
"type": null
} | def determine_strongest_programmer():
import sys
input = sys.stdin.read
N, M = map(int, input().split())
graph = [[] for _ in range(N)]
for _ in range(M):
A, B = map(int, input().split())
graph[A-1].append(B-1)
indegree = [0] * N
for i in range(N):
indegree[i] = len(g... |
[
{
"content": "In this problem, the final will be a numeric value. Give the numerical answer correct upto the 2nd decimal digit. Give a detailed solution and end the solution with the final answer. Mark your solution with \\boxed\nAnswer:\n\nProblem: 2 mol of $\\mathrm{Hg}(g)$ is combusted in a fixed volume bomb... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 2,
"temperature": 0.7
} | 2 | 400 | JEEBench | {
"expected_answer": "90.39",
"problem_id": "37",
"reference_solution": null,
"subject": "chem",
"type": "Numeric"
} | To determine the standard molar enthalpy of formation (\(\Delta H_f^\circ\)) of \(\mathrm{HgO}(s)\), we start by analyzing the given chemical reaction and the provided data.
The reaction is:
\[
\mathrm{Hg}(g) + \frac{1}{2} \mathrm{O}_2(g) \rightarrow \mathrm{HgO}(s)
\]
Given:
- 2 mol of \(\mathrm{Hg}(g)\) is combusted... |
[
{
"content": "You are a coding expert. Given a competition-level coding problem, you need to write a Python program to solve it. You may start by outlining your thought process. In the end, please provide the complete code in a code block enclosed with ``` ```. The code should take stdin as input and print the ... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 1,
"temperature": 0.7
} | 1 | 363 | CodeForces | {
"expected_answer": "",
"problem_id": "",
"reference_solution": "",
"subject": null,
"type": null
} | **Thought Process:**
To maximize the number of points Kevin earns, we need to analyze how the operations work. Each time Kevin adds an integer \(a_i\) to the sum \(s\), if \(s\) becomes even, he divides it by 2 repeatedly until it's odd. He earns a point each time he does this. The goal is to rearrange the array \(a\... |
[
{
"content": "Return your final response within \\boxed{} and only include the letter choice (A, B, C, or D) as your final response.\nProblem: How many of the stars listed below would be detectable using the ESPRESSO spectrograph, when it is coupled with one of the 8m VLT telescopes at the Paranal Observatory? ... | {
"do_sample": true,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 186 | GPQADiamond | {
"expected_answer": "",
"problem_id": "",
"reference_solution": "",
"subject": null,
"type": null
} | \boxed{C} |
[
{
"content": "You are a coding expert. Given a competition-level coding problem, you need to write a Python program to solve it. You may start by outlining your thought process. In the end, please provide the complete code in a code block enclosed with ``` ```. The code should take stdin as input and print the ... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 321 | CodeForces | {
"expected_answer": "",
"problem_id": "",
"reference_solution": "",
"subject": null,
"type": null
} | To solve this problem, I need to track the possible positions of the joker after each operation. The key insight is that each operation can be handled by considering how the card at position \(a_i\) moves, which affects the joker's possible positions.
First, let's break down the possible scenarios when moving a card ... |
[
{
"content": "Generate an executable Python function generated from the given prompt. Return the function body without invoking it at the final solution.You are given a 0-indexed array of positive integers nums.\nA subarray of nums is called incremovable if nums becomes strictly increasing on removing the subar... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 2,
"temperature": 0.7
} | 2 | 167 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": "",
"subject": null,
"type": null
} | def count_incremovable_subarrays(nums: list) -> int:
n = len(nums)
result = 0
for start in range(n):
for end in range(start + 1, n + 1):
subarray = nums[start:end]
if is_strictly_increasing(nums, subarray):
result += 1
return result
def is_strictly_increa... |
[
{
"content": "\"You are a coding expert. Given a competition-level coding problem, you need to write a Python program to solve it. You may start by outlining your thought process. In the end, please provide the complete code in a code block enclosed with ``` ```. The code should take stdin as input and print th... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 2,
"temperature": 0.7
} | 2 | 152 | CodeElo | {
"expected_answer": "",
"problem_id": "",
"reference_solution": "",
"subject": null,
"type": null
} | ```python
from math import gcd
from functools import reduce
from sys import stdin, stdout
# Read input
T = int(stdin.readline())
for _ in range(T):
n, k = map(int, stdin.readline().split())
a = list(map(int, stdin.readline().split()))
# Sort the times
a.sort()
# Compute the least common multi... |
[
{
"content": "\"You are a coding expert. Given a competition-level coding problem, you need to write a Python program to solve it. You may start by outlining your thought process. In the end, please provide the complete code in a code block enclosed with ``` ```. The code should take stdin as input and print th... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 31 | CodeElo | {
"expected_answer": "",
"problem_id": "",
"reference_solution": "",
"subject": null,
"type": null
} | <think>
Okay, so I need to solve this problem where I have a tree with vertices colored either black or white, and I need to process queries to toggle the color of certain vertices. After each query, I have to check if all the black vertices form a chain. Hmm, let's break this down.
First, what's a chain of black vert... |
[
{
"content": "Generate an executable Python function generated from the given prompt. The function should take stdin as input and print the output. Simply call the function after the definition.There is a grid with N rows and N columns, where N is an odd number at most 45.\nLet (i,j) denote the cell at the i-th... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 1,
"temperature": 0.7
} | 1 | 359 | LiveCodeBench | {
"expected_answer": "",
"problem_id": "",
"reference_solution": "",
"subject": null,
"type": null
} | def solve():
import sys
input = sys.stdin.read
N = int(input().strip())
grid = [[0] * N for _ in range(N)]
parts = [(i, j) for i in range(N) for j in range(N) if (i + j) % 2 == 0]
parts.remove((N // 2, N // 2))
parts = parts[1:]
for i in range(1, N**2):
grid[parts[i-1][0]][parts[... |
[
{
"content": "Problem: Rectangle $ABCD$ has center $O$ and $AB/AD=k$. A point is randomly chosen from the interior of rectangle $ABCD$. What is the probability that it is closer to $O$ than to any of the four vertices? [asy]\nsize(200);\ndraw((-250,100)--(250,100)--(250,-100)--(-250,-100)--cycle);\ndot((0,0));... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 0,
"temperature": 0.7
} | 0 | 444 | MATH500 | {
"expected_answer": "",
"problem_id": "",
"reference_solution": "",
"subject": null,
"type": null
} | To determine the probability that a randomly chosen point inside rectangle \(ABCD\) is closer to the center \(O\) than to any of the vertices, we need to analyze the geometric regions where this condition holds.
First, recall that the center \(O\) of the rectangle is the midpoint of both diagonals. The rectangle has v... |
[
{
"content": "In this problem, multiple options can be correct. Give a detailed solution and end the solution with the final answer. Mark your solution, which should be one or more multiple-choice letter(s), with \\boxed\nAnswer:\n\nProblem: For $x \\in \\mathbb{R}$, let the function $y(x)$ be the solution of t... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 2,
"temperature": 0.7
} | 2 | 425 | JEEBench | {
"expected_answer": "C",
"problem_id": "14",
"reference_solution": null,
"subject": "math",
"type": "MCQ(multiple)"
} | To solve the given differential equation \(\frac{d y}{d x} + 12y = \cos\left(\frac{\pi}{12}x\right)\) with the initial condition \(y(0)=0\), we need to find the general solution and then determine the specific solution that satisfies the initial condition.
First, we solve the homogeneous equation \(\frac{d y}{d x} + ... |
[
{
"content": "You are a coding expert. Given a competition-level coding problem, you need to write a Python program to solve it. You may start by outlining your thought process. In the end, please provide the complete code in a code block enclosed with ``` ```. The code should take stdin as input and print the ... | {
"do_sample": false,
"max_new_tokens": 32768,
"seed": 2,
"temperature": 0.7
} | 2 | 165 | CodeForces | {
"expected_answer": "",
"problem_id": "",
"reference_solution": "",
"subject": null,
"type": null
} | ```python
def max_passable_checks():
import sys
input = sys.stdin.read
data = input().split()
n, m = int(data[0]), int(data[1])
records = list(map(int, data[2:]))
points = sum(records)
dp = [0] * (points + 1)
for record in records:
if record == 0:
dp[points] = max(dp[... |
End of preview. Expand in Data Studio
YAML Metadata Warning:empty or missing yaml metadata in repo card
Check out the documentation for more information.
mlfoundations-dev/a1_science_biology_standardized_eval_636d
Precomputed model outputs for evaluation.
Evaluation Results
Summary
| Metric | AIME24 | AMC23 | MATH500 | MMLUPro | JEEBench | GPQADiamond | LiveCodeBench | CodeElo | CodeForces |
|---|---|---|---|---|---|---|---|---|---|
| Accuracy | 7.7 | 45.8 | 70.4 | 22.4 | 30.7 | 11.4 | 0.9 | 3.4 | 5.0 |
AIME24
- Average Accuracy: 7.67% ± 0.95%
- Number of Runs: 10
| Run | Accuracy | Questions Solved | Total Questions |
|---|---|---|---|
| 1 | 10.00% | 3 | 30 |
| 2 | 13.33% | 4 | 30 |
| 3 | 6.67% | 2 | 30 |
| 4 | 10.00% | 3 | 30 |
| 5 | 6.67% | 2 | 30 |
| 6 | 6.67% | 2 | 30 |
| 7 | 6.67% | 2 | 30 |
| 8 | 3.33% | 1 | 30 |
| 9 | 3.33% | 1 | 30 |
| 10 | 10.00% | 3 | 30 |
AMC23
- Average Accuracy: 45.75% ± 2.00%
- Number of Runs: 10
| Run | Accuracy | Questions Solved | Total Questions |
|---|---|---|---|
| 1 | 47.50% | 19 | 40 |
| 2 | 45.00% | 18 | 40 |
| 3 | 40.00% | 16 | 40 |
| 4 | 57.50% | 23 | 40 |
| 5 | 45.00% | 18 | 40 |
| 6 | 40.00% | 16 | 40 |
| 7 | 40.00% | 16 | 40 |
| 8 | 42.50% | 17 | 40 |
| 9 | 57.50% | 23 | 40 |
| 10 | 42.50% | 17 | 40 |
MATH500
- Accuracy: 70.40%
Accuracy Questions Solved Total Questions 70.40% 352 500
MMLUPro
- Average Accuracy: 22.40% ± 0.00%
- Number of Runs: 1
| Run | Accuracy | Questions Solved | Total Questions |
|---|---|---|---|
| 1 | 22.40% | 112 | 500 |
JEEBench
- Average Accuracy: 30.68% ± 0.27%
- Number of Runs: 3
| Run | Accuracy | Questions Solved | Total Questions |
|---|---|---|---|
| 1 | 30.68% | 158.0 | 515 |
| 2 | 30.10% | 155.0 | 515 |
| 3 | 31.26% | 161.0 | 515 |
GPQADiamond
- Average Accuracy: 11.45% ± 1.59%
- Number of Runs: 3
| Run | Accuracy | Questions Solved | Total Questions |
|---|---|---|---|
| 1 | 8.59% | 17 | 198 |
| 2 | 10.61% | 21 | 198 |
| 3 | 15.15% | 30 | 198 |
LiveCodeBench
- Average Accuracy: 0.91% ± 0.13%
- Number of Runs: 3
| Run | Accuracy | Questions Solved | Total Questions |
|---|---|---|---|
| 1 | 0.78% | 4 | 511 |
| 2 | 0.78% | 4 | 511 |
| 3 | 1.17% | 6 | 511 |
CodeElo
- Average Accuracy: 3.41% ± 0.67%
- Number of Runs: 3
| Run | Accuracy | Questions Solved | Total Questions |
|---|---|---|---|
| 1 | 2.30% | 9 | 391 |
| 2 | 3.32% | 13 | 391 |
| 3 | 4.60% | 18 | 391 |
CodeForces
- Average Accuracy: 5.00% ± 0.45%
- Number of Runs: 3
| Run | Accuracy | Questions Solved | Total Questions |
|---|---|---|---|
| 1 | 4.19% | 19 | 453 |
| 2 | 5.74% | 26 | 453 |
| 3 | 5.08% | 23 | 453 |
- Downloads last month
- 5