Datasets:
question stringlengths 514 5.71k | answer stringclasses 1
value | question_id stringlengths 32 32 | ocr2_id stringlengths 32 32 | language_split stringclasses 2
values | source_dataset stringclasses 1
value | source_split stringclasses 2
values | source_platform stringclasses 1
value | difficulty stringdate 1900-01-01 00:00:00 3500-01-01 00:00:00 | judgement stringclasses 1
value | pass_rate stringclasses 72
values | solution stringclasses 1
value | qwq_critique stringclasses 1
value | source_index stringlengths 1 5 | input_ids listlengths 4.44k 187k | reply stringlengths 14.5k 605k | sample_idx int64 0 0 | original_index int64 0 499 | claims listlengths 189 7.8k | verified listlengths 189 7.8k |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
"Arthur owns a ski resort on a mountain. There are n landing spots on the mountain numbered from 1 t(...TRUNCATED) | aaf7b7ea051db7ebebecc77c63408b08 | 829df77971430ea99e518852a698e82c | python | code_contests | train | codeforces | 2500 | right | 0.0 | 7729 | [0,250018,5671,256,54705,1222,4778,4920,38,2211,31417,2204,8506,1245,1919,44766,6719,44766,108490,52(...TRUNCATED) | "We need to solve the problem described: Given a DAG (one-directional tracks all descending index wi(...TRUNCATED) | 0 | 0 | [{"aligned_token_ids":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23],"claim_text":"(...TRUNCATED) | [null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null(...TRUNCATED) | |||
"You are given an array a_1, a_2, ..., a_n. All a_i are pairwise distinct.\n\nLet's define function (...TRUNCATED) | 5243682906dc6806d5dbc0884dd153e9 | 397c784a9e13c36d300def6acfd896bc | python | code_contests | train | codeforces | 2300 | right | 1.0 | 9281 | [0,250018,5671,256,54705,1222,4778,4920,38,2211,31417,2204,8506,1245,1919,44766,6719,44766,108490,52(...TRUNCATED) | "We need sum over all subsegments (subarrays) of f(l,r), where f(l,r) is the sum of sorted subarray (...TRUNCATED) | 0 | 1 | [{"aligned_token_ids":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,(...TRUNCATED) | [null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null(...TRUNCATED) | |||
"You are given an integer n from 1 to 10^{18} without leading zeroes.\n\nIn one move you can swap an(...TRUNCATED) | d0d6b21da715f9a948cf95c6245415da | c35088ddf60ab7295b28104312783d28 | python | code_contests | train | codeforces | 2100 | right | 0.9 | 5379 | [0,250018,5671,256,54705,1222,4778,4920,38,2211,31417,2204,8506,1245,1919,44766,6719,44766,108490,52(...TRUNCATED) | "We are given an integer n (as a decimal string) up to length 19 digits (since n ≤ 10^18). Actuall(...TRUNCATED) | 0 | 2 | [{"aligned_token_ids":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23],"claim_text":"(...TRUNCATED) | [null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null(...TRUNCATED) | |||
"The crowdedness of the discotheque would never stop our friends from having fun, but a bit more spa(...TRUNCATED) | a791bf16c4674794d022cd2b5c8d4c66 | 4343056fd4e987758dd78f55910d6997 | python | code_contests | train | codeforces | 2000 | right | 0.46 | 1521 | [0,250018,5671,256,54705,1222,4778,4920,38,2211,31417,2204,8506,1245,1919,44766,6719,44766,108490,52(...TRUNCATED) | "We have an interesting problem: we have n dancers with circular movement ranges (disks). They can b(...TRUNCATED) | 0 | 3 | [{"aligned_token_ids":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23],"claim_text":"(...TRUNCATED) | [null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null(...TRUNCATED) | |||
"Boy Dima gave Julian a birthday present — set B consisting of positive integers. However, he didn(...TRUNCATED) | 0823ef3ce73f71c507e9e58d06f195db | f2351b20573037dc38a94e5febc2e689 | python | code_contests | train | codeforces | 1900 | right | 0.96 | 10846 | [0,250018,5671,256,54705,1222,4778,4920,38,2211,31417,2204,8506,1245,1919,44766,6719,44766,108490,52(...TRUNCATED) | "We need to solve this problem. Let's restate:\n\nGiven a set B of positive integers (size n up to 2(...TRUNCATED) | 0 | 4 | [{"aligned_token_ids":[0,1,2,3,4,5,6,7],"claim_text":"We need to solve this problem.","sentence":"We(...TRUNCATED) | [null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null(...TRUNCATED) | |||
"On the board, Bob wrote n positive integers in [base](https://en.wikipedia.org/wiki/Positional_nota(...TRUNCATED) | e87cbb097a65b8b734d98ee3b2eced9e | 579ba8bdf3f9b45e42ab6cd778c588b4 | python | code_contests | valid | codeforces | 2000 | right | 0.08 | 95 | [0,250018,5671,256,54705,1222,4778,4920,38,2211,31417,2204,8506,1245,1919,44766,6719,44766,108490,52(...TRUNCATED) | "We need to understand the problem fully. Bob writes n positive integers (in base 10) whose sum equa(...TRUNCATED) | 0 | 5 | [{"aligned_token_ids":[0,1,2,3,4,5,6,7,8,9],"claim_text":"We need to understand the problem fully.",(...TRUNCATED) | [null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null(...TRUNCATED) | |||
"You are given an array a_1, a_2, ..., a_n. You can perform the following operation any number of ti(...TRUNCATED) | 0d05ce91e5fbfbdd812c17b48c17f24f | 11dc394188b1a67f4f76d68c5075d89d | python | code_contests | train | codeforces | 2100 | right | 1.0 | 4917 | [0,250018,5671,256,54705,1222,4778,4920,38,2211,31417,2204,8506,1245,1919,44766,6719,44766,108490,52(...TRUNCATED) | "We need to solve the problem: given an array a[1..n] with elements up to 1000, n up to 500. Operati(...TRUNCATED) | 0 | 6 | [{"aligned_token_ids":[0,1,2,3,4,5,6,7,8,9,10,11,12,13],"claim_text":"We need to solve the problem: (...TRUNCATED) | [null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null(...TRUNCATED) | |||
"The government of Berland decided to improve network coverage in his country. Berland has a unique (...TRUNCATED) | e21b0d26bb9ffbfc74dc52bfaf8901a6 | 1374d24b05b2a099bb48093445a6350e | python | code_contests | train | codeforces | 2400 | right | 1.0 | 9604 | [0,250018,5671,256,54705,1222,4778,4920,38,2211,31417,2204,8506,1245,1919,44766,6719,44766,108490,52(...TRUNCATED) | "We need to solve the described problem and produce the answer in the given format.\n\nWe need to an(...TRUNCATED) | 0 | 7 | [{"aligned_token_ids":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25],"claim_t(...TRUNCATED) | [null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null(...TRUNCATED) | |||
"Polycarp is making a quest for his friends. He has already made n tasks, for each task the boy eval(...TRUNCATED) | aa8c320b16891d6d9570562cfadec8b5 | d8e4318417351a0abb1be7aa203323c1 | python | code_contests | train | codeforces | 2100 | right | 1.0 | 11919 | [0,250018,5671,256,54705,1222,4778,4920,38,2211,31417,2204,8506,1245,1919,44766,6719,44766,108490,52(...TRUNCATED) | "We need to interpret the problem precisely and find an algorithm.\n\nWe have n tasks, each with int(...TRUNCATED) | 0 | 8 | [{"aligned_token_ids":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15],"claim_text":"We need to interpret the(...TRUNCATED) | [null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null(...TRUNCATED) | |||
"Dima took up the biology of bacteria, as a result of his experiments, he invented k types of bacter(...TRUNCATED) | 08cfc541b501482be83ba54e54301dbb | f4e9657d1f3120f83e477841dbcc8f94 | python | code_contests | train | codeforces | 2000 | right | 0.8125 | 8788 | [0,250018,5671,256,54705,1222,4778,4920,38,2211,31417,2204,8506,1245,1919,44766,6719,44766,108490,52(...TRUNCATED) | "We need to understand the problem statement precisely. There's a summary: Dima invented k types of (...TRUNCATED) | 0 | 9 | [{"aligned_token_ids":[0,1,2,3,4,5,6,7,8,9,10,11,12,13],"claim_text":"We need to understand the prob(...TRUNCATED) | [null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null(...TRUNCATED) |
End of preview. Expand in Data Studio
GPT-5.5 Medium Reannotation of Qwen3.5-Positive OCR2 Coding Steps
This dataset follows the same 500-row parquet layout as JingweiNi/ocr2_cf1900_k2_qwen35_fp8_10k_seed20260513 and contains GPT-5.5 medium-reasoning reannotations for the 1,536 Qwen3.5-positive error steps.
Summary
- Source dataset:
JingweiNi/ocr2_cf1900_k2_qwen35_fp8_10k_seed20260513 - Source rows: 500 K2-Think Codeforces traces
- Source manifest-selected Qwen3.5 labels: 10,000 steps
- GPT-5.5 reannotated Qwen3.5-positive steps: 1,536
- GPT-5.5 confirmed errors: 730
- Qwen3.5 positives filtered as false positives by GPT-5.5: 806
- Invalid GPT-5.5 labels: 0
The verified column contains GPT-5.5 labels only for the 1,536 reannotated Qwen3.5-positive steps. All other claim positions are NaN.
Metadata files under metadata/ include the source 10K manifest, selected Qwen-positive manifest, GPT-5.5 run summary, and OpenRouter usage summary.
- Downloads last month
- 54