idx int64 0 9k | env stringclasses 18
values | gt stringlengths 1 21 | recs listlengths 2 2 | text listlengths 2 2 | ids listlengths 2 2 |
|---|---|---|---|---|---|
0 | BannedPointSupersetPathCounting | 22 | [
{
"reward": -1,
"accuracy": 0,
"format_score": 0,
"len": 1024,
"finish": "length",
"closed_think": false
},
{
"reward": -1,
"accuracy": 0,
"format_score": 0,
"len": 1024,
"finish": "length",
"closed_think": false
}
] | [
"<think>\nOkay, so I need to figure out how many distinct valid paths there are from (0,0,0) to (4,6,2) in three-dimensional space, following these specific movement rules and avoiding the forbidden point (0,6,2). The answer has to be modulo 2879. Let me start by understanding the problem step by step.\n\nFirst, th... | [
[
151667,
198,
32313,
11,
773,
358,
1184,
311,
7071,
700,
1246,
1657,
12460,
2697,
12716,
1052,
525,
504,
320,
15,
11,
15,
11,
15,
8,
311,
320,
19,
11,
21,
11,
17,
8,
304,
2326... |
1 | BannedPointSupersetPathCounting | 5 | [
{
"reward": -1,
"accuracy": 0,
"format_score": 0,
"len": 1024,
"finish": "length",
"closed_think": false
},
{
"reward": -1,
"accuracy": 0,
"format_score": 0,
"len": 1024,
"finish": "length",
"closed_think": false
}
] | [
"<think>\nOkay, let's try to figure out how to solve this problem. So, we need to count the number of distinct valid paths from (0,0,0) to (2,0,6) in 3D space, following specific movement rules and avoiding the forbidden point (2,0,0). The answer should be modulo 5291. \n\nFirst, let me understand the movement rule... | [
[
151667,
198,
32313,
11,
1077,
594,
1430,
311,
7071,
700,
1246,
311,
11625,
419,
3491,
13,
2055,
11,
582,
1184,
311,
1760,
279,
1372,
315,
12460,
2697,
12716,
504,
320,
15,
11,
15,
... |
2 | BannedPointSupersetPathCounting | 0 | [
{
"reward": -1,
"accuracy": 0,
"format_score": 0,
"len": 1024,
"finish": "length",
"closed_think": false
},
{
"reward": -1,
"accuracy": 0,
"format_score": 0,
"len": 1024,
"finish": "length",
"closed_think": false
}
] | [
"<think>\nOkay, so I need to figure out how many valid paths there are from (0,0,0) to (3,1,0) in three-dimensional space, following certain movement rules and avoiding some forbidden points. Let me start by understanding the problem step by step.\n\nFirst, the movement rules. At each step, from a point (x, y, z), ... | [
[
151667,
198,
32313,
11,
773,
358,
1184,
311,
7071,
700,
1246,
1657,
2697,
12716,
1052,
525,
504,
320,
15,
11,
15,
11,
15,
8,
311,
320,
18,
11,
16,
11,
15,
8,
304,
2326,
32420... |
3 | BannedPointSupersetPathCounting | 0 | [
{
"reward": -1,
"accuracy": 0,
"format_score": 0,
"len": 1024,
"finish": "length",
"closed_think": false
},
{
"reward": -1,
"accuracy": 0,
"format_score": 0,
"len": 1024,
"finish": "length",
"closed_think": false
}
] | [
"<think>\nOkay, so I need to figure out the number of distinct valid paths from (0,0,0) to (6,1,0) in three-dimensional space, following certain movement rules and avoiding some forbidden points. Let me start by understanding the problem step by step.\n\nFirst, the movement rules. From any point (x, y, z), I can mo... | [
[
151667,
198,
32313,
11,
773,
358,
1184,
311,
7071,
700,
279,
1372,
315,
12460,
2697,
12716,
504,
320,
15,
11,
15,
11,
15,
8,
311,
320,
21,
11,
16,
11,
15,
8,
304,
2326,
32420... |
4 | BannedPointSupersetPathCounting | 90 | [
{
"reward": -1,
"accuracy": 0,
"format_score": 0,
"len": 1024,
"finish": "length",
"closed_think": false
},
{
"reward": -1,
"accuracy": 0,
"format_score": 0,
"len": 1024,
"finish": "length",
"closed_think": false
}
] | [
"<think>\nOkay, so I need to figure out how many valid paths there are from (0,0,0) to (4,3,5) in three-dimensional space, following certain movement rules and avoiding some forbidden points. Let me start by understanding the problem step by step.\n\nFirst, the movement rules. At each step, from a point (x,y,z), I ... | [
[
151667,
198,
32313,
11,
773,
358,
1184,
311,
7071,
700,
1246,
1657,
2697,
12716,
1052,
525,
504,
320,
15,
11,
15,
11,
15,
8,
311,
320,
19,
11,
18,
11,
20,
8,
304,
2326,
32420... |
5 | BannedPointSupersetPathCounting | 9 | [
{
"reward": -1,
"accuracy": 0,
"format_score": 0,
"len": 1024,
"finish": "length",
"closed_think": false
},
{
"reward": -1,
"accuracy": 0,
"format_score": 0,
"len": 1024,
"finish": "length",
"closed_think": false
}
] | [
"<think>\nOkay, so I need to figure out how many distinct valid paths there are from (0,0,0) to (6,6,4) in three-dimensional space, following specific movement rules and avoiding certain forbidden points. The answer should be modulo 2001. Let me try to break this down step by step.\n\nFirst, let me understand the m... | [
[
151667,
198,
32313,
11,
773,
358,
1184,
311,
7071,
700,
1246,
1657,
12460,
2697,
12716,
1052,
525,
504,
320,
15,
11,
15,
11,
15,
8,
311,
320,
21,
11,
21,
11,
19,
8,
304,
2326... |
6 | BannedPointSupersetPathCounting | 1 | [
{
"reward": -1,
"accuracy": 0,
"format_score": 0,
"len": 1024,
"finish": "length",
"closed_think": false
},
{
"reward": -1,
"accuracy": 0,
"format_score": 0,
"len": 1024,
"finish": "length",
"closed_think": false
}
] | [
"<think>\nOkay, let's try to figure out how to count the number of valid paths from (0,0,0) to (1,0,1) without visiting the forbidden point (0,0,1). The movement rules are a bit specific, so I need to understand them first.\n\nSo, each move has to be along one of the three axes (x, y, or z), and the new coordinate ... | [
[
151667,
198,
32313,
11,
1077,
594,
1430,
311,
7071,
700,
1246,
311,
1760,
279,
1372,
315,
2697,
12716,
504,
320,
15,
11,
15,
11,
15,
8,
311,
320,
16,
11,
15,
11,
16,
8,
2041,... |
7 | BannedPointSupersetPathCounting | 17 | [
{
"reward": -1,
"accuracy": 0,
"format_score": 0,
"len": 1024,
"finish": "length",
"closed_think": false
},
{
"reward": -1,
"accuracy": 0,
"format_score": 0,
"len": 1024,
"finish": "length",
"closed_think": false
}
] | [
"<think>\nOkay, let's try to figure out how to solve this problem. So, we need to count the number of distinct valid paths from (0,0,0) to (2,6,2) in 3D space, avoiding certain forbidden points. Each move has to follow the given rules involving the bitwise AND operation. Let me start by understanding the movement r... | [
[
151667,
198,
32313,
11,
1077,
594,
1430,
311,
7071,
700,
1246,
311,
11625,
419,
3491,
13,
2055,
11,
582,
1184,
311,
1760,
279,
1372,
315,
12460,
2697,
12716,
504,
320,
15,
11,
15,
... |
8 | BannedPointSupersetPathCounting | 20 | [
{
"reward": -1,
"accuracy": 0,
"format_score": 0,
"len": 1024,
"finish": "length",
"closed_think": false
},
{
"reward": -1,
"accuracy": 0,
"format_score": 0,
"len": 1024,
"finish": "length",
"closed_think": false
}
] | [
"<think>\nOkay, so I need to figure out how many valid paths there are from (0,0,0) to (1,3,3) in three-dimensional space, following certain movement rules and avoiding some forbidden points. Let me start by understanding the problem step by step.\n\nFirst, the movement rules. At each step, you can move in one of t... | [
[
151667,
198,
32313,
11,
773,
358,
1184,
311,
7071,
700,
1246,
1657,
2697,
12716,
1052,
525,
504,
320,
15,
11,
15,
11,
15,
8,
311,
320,
16,
11,
18,
11,
18,
8,
304,
2326,
32420... |
9 | BannedPointSupersetPathCounting | 4 | [
{
"reward": -1,
"accuracy": 0,
"format_score": 0,
"len": 1024,
"finish": "length",
"closed_think": false
},
{
"reward": -1,
"accuracy": 0,
"format_score": 0,
"len": 1024,
"finish": "length",
"closed_think": false
}
] | [
"<think>\nOkay, let's try to figure out how to count the number of valid paths from (0,0,0) to (2,1,2) under the given movement rules, avoiding the forbidden point (0,1,2). Hmm, the movement rules are a bit tricky. Let me first understand what they mean.\n\nThe allowed moves are such that when you change one coordi... | [
[
151667,
198,
32313,
11,
1077,
594,
1430,
311,
7071,
700,
1246,
311,
1760,
279,
1372,
315,
2697,
12716,
504,
320,
15,
11,
15,
11,
15,
8,
311,
320,
17,
11,
16,
11,
17,
8,
1212,... |
10 | BannedPointSupersetPathCounting | 24 | [
{
"reward": -1,
"accuracy": 0,
"format_score": 0,
"len": 1024,
"finish": "length",
"closed_think": false
},
{
"reward": -1,
"accuracy": 0,
"format_score": 0,
"len": 1024,
"finish": "length",
"closed_think": false
}
] | [
"<think>\nOkay, so I need to figure out how many distinct valid paths there are from (0,0,0) to (4,5,2) in three-dimensional space, following specific movement rules and avoiding the forbidden point (4,1,2). The answer should be modulo 897. Let me start by understanding the problem thoroughly.\n\nFirst, the movemen... | [
[
151667,
198,
32313,
11,
773,
358,
1184,
311,
7071,
700,
1246,
1657,
12460,
2697,
12716,
1052,
525,
504,
320,
15,
11,
15,
11,
15,
8,
311,
320,
19,
11,
20,
11,
17,
8,
304,
2326... |
11 | BannedPointSupersetPathCounting | 0 | [
{
"reward": -1,
"accuracy": 0,
"format_score": 0,
"len": 1024,
"finish": "length",
"closed_think": false
},
{
"reward": -1,
"accuracy": 0,
"format_score": 0,
"len": 1024,
"finish": "length",
"closed_think": false
}
] | [
"<think>\nOkay, so I need to figure out the number of distinct valid paths from (0,0,0) to (1,4,4) in three-dimensional space, following certain movement rules and avoiding some forbidden points. Let me start by understanding the problem step by step.\n\nFirst, the movement rules. At each step, you can move in one ... | [
[
151667,
198,
32313,
11,
773,
358,
1184,
311,
7071,
700,
279,
1372,
315,
12460,
2697,
12716,
504,
320,
15,
11,
15,
11,
15,
8,
311,
320,
16,
11,
19,
11,
19,
8,
304,
2326,
32420... |
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.
RLVE × Qwen3-32B, K=1024 采样(SFT 数据)
Qwen3-32B 在 RLVE 训练集 9000 道题上采样, 每题 2 条, 每条上限 1024 token。 共 18000 条。
采样设置
与本项目所有 RLVE 评测逐项一致, 以避免训练/评测的 prompt 错配:
- prompt:
tokenizer.apply_chat_template(msgs, add_generation_prompt=True), 不传enable_thinking(即 Qwen3 默认开启 thinking) - temperature 0.7, top_p 0.9, top_k -1, n=2, max_tokens 1024
使用前必读:这批数据全部是截断的
含 </think> |
0 / 18000 (0.0%) |
含 \boxed{} |
0 / 18000 (0.0%) |
| response 字符数 | 中位 3818 / 均值 3708 / 最大 5049 |
1024 token 装不下 Qwen3-32B 在这些题上的完整推理, 没有一条写到了
</think> 或答案。所以拿它做 SFT, 学到的是"推理的前 1024 个 token 该怎么写",
学不到如何收尾或给出答案。
这是刻意为之: 它是 ROSE(K=1024)的离线对照 —— teacher 预算相同, 差别只在 前缀由谁生成。想要能教会"收尾"的数据, 需要把 teacher 预算放大到能自然结束。
文件
sft_32b_k1024.parquet— 两列question/response, 18000 行, 可直接喂 SFTrollouts_shard_a.jsonl/rollouts_shard_b.jsonl— 原始输出, 每行一道题, 含recs(verifier 打分、finish 原因、是否闭合 think)和text(N=2 条)
- Downloads last month
- 42