Datasets:

winglian
/

codeforces-cot-16k-context-topk64-prepared

Modalities:

Formats:

Size:

Libraries:

Dataset card Data Studio Files Files and versions

Dataset Viewer (First 5GB)

Auto-converted to Parquet Duplicate

Split (1)

train · ~19.7k rows (showing the first 300)

id stringlengths 4 7	messages listlengths 2 2	input_ids sequencelengths 1.73k 16.4k	attention_mask sequencelengths 1.73k 16.4k	labels sequencelengths 1.73k 16.4k	position_ids sequencelengths 1.73k 16.4k	target_mask sequencelengths 1.73k 16.4k	target_token_ids sequencelengths 1.73k 16.4k	target_logprobs sequencelengths 1.73k 16.4k	target_logits sequencelengths 1.73k 16.4k	length int64 1.73k 16.4k
1991/A	[{"content":"You will be given a competitive programming problem. Please reason step by step about t(...TRUNCATED)	[151644,8948,198,2610,525,1207,16948,11,3465,553,54364,14817,13,1446,525,264,10950,17847,13,151645,1(...TRUNCATED)	[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1(...TRUNCATED)	[-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100(...TRUNCATED)	[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,29,30,31,32,33,34,35,3(...TRUNCATED)	[[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,(...TRUNCATED)	[[8948,1849,198,15,2320,82,739,17687,220,287,25,322,72448,330,7791,5942,46487,46006,715,40293,36648,(...TRUNCATED)	[[-1.9073486328125e-6,-13.062501907348633,-14.562501907348633,-17.312501907348633,-17.62500190734863(...TRUNCATED)	[[28.125,15.0625,13.5625,10.8125,10.5,10.3125,10.1875,9.4375,9.375,8.8125,8.6875,8.6875,8.5625,8.5,8(...TRUNCATED)	3,394
1991/A	[{"content":"You will be given a competitive programming problem. Please reason step by step about t(...TRUNCATED)	[151644,8948,198,2610,525,1207,16948,11,3465,553,54364,14817,13,1446,525,264,10950,17847,13,151645,1(...TRUNCATED)	[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1(...TRUNCATED)	[-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100(...TRUNCATED)	[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,29,30,31,32,33,34,35,3(...TRUNCATED)	[[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,(...TRUNCATED)	[[8948,1849,198,15,2320,82,739,17687,220,287,25,322,72448,330,7791,5942,46487,46006,715,40293,36648,(...TRUNCATED)	[[-1.9073486328125e-6,-13.062501907348633,-14.562501907348633,-17.312501907348633,-17.62500190734863(...TRUNCATED)	[[28.125,15.0625,13.5625,10.8125,10.5,10.3125,10.1875,9.4375,9.375,8.8125,8.6875,8.6875,8.5625,8.5,8(...TRUNCATED)	4,366
1991/A	[{"content":"You will be given a competitive programming problem. Please reason step by step about t(...TRUNCATED)	[151644,8948,198,2610,525,1207,16948,11,3465,553,54364,14817,13,1446,525,264,10950,17847,13,151645,1(...TRUNCATED)	[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1(...TRUNCATED)	[-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100(...TRUNCATED)	[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,29,30,31,32,33,34,35,3(...TRUNCATED)	[[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,(...TRUNCATED)	[[8948,1849,198,15,2320,82,739,17687,220,287,25,322,72448,330,7791,5942,46487,46006,715,40293,36648,(...TRUNCATED)	[[-1.9073486328125e-6,-13.062501907348633,-14.562501907348633,-17.312501907348633,-17.62500190734863(...TRUNCATED)	[[28.125,15.0625,13.5625,10.8125,10.5,10.3125,10.1875,9.4375,9.375,8.8125,8.6875,8.6875,8.5625,8.5,8(...TRUNCATED)	3,149
1991/A	[{"content":"You will be given a competitive programming problem. Please reason step by step about t(...TRUNCATED)	[151644,8948,198,2610,525,1207,16948,11,3465,553,54364,14817,13,1446,525,264,10950,17847,13,151645,1(...TRUNCATED)	[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1(...TRUNCATED)	[-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100(...TRUNCATED)	[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,29,30,31,32,33,34,35,3(...TRUNCATED)	[[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,(...TRUNCATED)	[[8948,1849,198,15,2320,82,739,17687,220,287,25,322,72448,330,7791,5942,46487,46006,715,40293,36648,(...TRUNCATED)	[[-1.9073486328125e-6,-13.062501907348633,-14.562501907348633,-17.312501907348633,-17.62500190734863(...TRUNCATED)	[[28.125,15.0625,13.5625,10.8125,10.5,10.3125,10.1875,9.4375,9.375,8.8125,8.6875,8.6875,8.5625,8.5,8(...TRUNCATED)	2,873
1991/A	[{"content":"You will be given a competitive programming problem. Please reason step by step about t(...TRUNCATED)	[151644,8948,198,2610,525,1207,16948,11,3465,553,54364,14817,13,1446,525,264,10950,17847,13,151645,1(...TRUNCATED)	[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1(...TRUNCATED)	[-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100(...TRUNCATED)	[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,29,30,31,32,33,34,35,3(...TRUNCATED)	[[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,(...TRUNCATED)	[[8948,1849,198,15,2320,82,739,17687,220,287,25,322,72448,330,7791,5942,46487,46006,715,40293,36648,(...TRUNCATED)	[[-1.9073486328125e-6,-13.062501907348633,-14.562501907348633,-17.312501907348633,-17.62500190734863(...TRUNCATED)	[[28.125,15.0625,13.5625,10.8125,10.5,10.3125,10.1875,9.4375,9.375,8.8125,8.6875,8.6875,8.5625,8.5,8(...TRUNCATED)	4,750
21/B	[{"content":"You will be given a competitive programming problem. Please reason step by step about t(...TRUNCATED)	[151644,8948,198,2610,525,1207,16948,11,3465,553,54364,14817,13,1446,525,264,10950,17847,13,151645,1(...TRUNCATED)	[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1(...TRUNCATED)	[-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100(...TRUNCATED)	[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,29,30,31,32,33,34,35,3(...TRUNCATED)	[[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,(...TRUNCATED)	[[8948,1849,198,15,2320,82,739,17687,220,287,25,322,72448,330,7791,5942,46487,46006,715,40293,36648,(...TRUNCATED)	[[-1.9073486328125e-6,-13.062501907348633,-14.562501907348633,-17.312501907348633,-17.62500190734863(...TRUNCATED)	[[28.125,15.0625,13.5625,10.8125,10.5,10.3125,10.1875,9.4375,9.375,8.8125,8.6875,8.6875,8.5625,8.5,8(...TRUNCATED)	6,126
21/B	[{"content":"You will be given a competitive programming problem. Please reason step by step about t(...TRUNCATED)	[151644,8948,198,2610,525,1207,16948,11,3465,553,54364,14817,13,1446,525,264,10950,17847,13,151645,1(...TRUNCATED)	[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1(...TRUNCATED)	[-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100(...TRUNCATED)	[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,29,30,31,32,33,34,35,3(...TRUNCATED)	[[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,(...TRUNCATED)	[[8948,1849,198,15,2320,82,739,17687,220,287,25,322,72448,330,7791,5942,46487,46006,715,40293,36648,(...TRUNCATED)	[[-1.9073486328125e-6,-13.062501907348633,-14.562501907348633,-17.312501907348633,-17.62500190734863(...TRUNCATED)	[[28.125,15.0625,13.5625,10.8125,10.5,10.3125,10.1875,9.4375,9.375,8.8125,8.6875,8.6875,8.5625,8.5,8(...TRUNCATED)	6,829
21/B	[{"content":"You will be given a competitive programming problem. Please reason step by step about t(...TRUNCATED)	[151644,8948,198,2610,525,1207,16948,11,3465,553,54364,14817,13,1446,525,264,10950,17847,13,151645,1(...TRUNCATED)	[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1(...TRUNCATED)	[-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100(...TRUNCATED)	[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,29,30,31,32,33,34,35,3(...TRUNCATED)	[[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,(...TRUNCATED)	[[8948,1849,198,15,2320,82,739,17687,220,287,25,322,72448,330,7791,5942,46487,46006,715,40293,36648,(...TRUNCATED)	[[-1.9073486328125e-6,-13.062501907348633,-14.562501907348633,-17.312501907348633,-17.62500190734863(...TRUNCATED)	[[28.125,15.0625,13.5625,10.8125,10.5,10.3125,10.1875,9.4375,9.375,8.8125,8.6875,8.6875,8.5625,8.5,8(...TRUNCATED)	7,291
21/B	[{"content":"You will be given a competitive programming problem. Please reason step by step about t(...TRUNCATED)	[151644,8948,198,2610,525,1207,16948,11,3465,553,54364,14817,13,1446,525,264,10950,17847,13,151645,1(...TRUNCATED)	[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1(...TRUNCATED)	[-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100(...TRUNCATED)	[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,29,30,31,32,33,34,35,3(...TRUNCATED)	[[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,(...TRUNCATED)	[[8948,1849,198,15,2320,82,739,17687,220,287,25,322,72448,330,7791,5942,46487,46006,715,40293,36648,(...TRUNCATED)	[[-1.9073486328125e-6,-13.062501907348633,-14.562501907348633,-17.312501907348633,-17.62500190734863(...TRUNCATED)	[[28.125,15.0625,13.5625,10.8125,10.5,10.3125,10.1875,9.4375,9.375,8.8125,8.6875,8.6875,8.5625,8.5,8(...TRUNCATED)	6,700
21/B	[{"content":"You will be given a competitive programming problem. Please reason step by step about t(...TRUNCATED)	[151644,8948,198,2610,525,1207,16948,11,3465,553,54364,14817,13,1446,525,264,10950,17847,13,151645,1(...TRUNCATED)	[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1(...TRUNCATED)	[-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100(...TRUNCATED)	[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,29,30,31,32,33,34,35,3(...TRUNCATED)	[[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,(...TRUNCATED)	[[8948,1849,198,15,2320,82,739,17687,220,287,25,322,72448,330,7791,5942,46487,46006,715,40293,36648,(...TRUNCATED)	[[-1.9073486328125e-6,-13.062501907348633,-14.562501907348633,-17.312501907348633,-17.62500190734863(...TRUNCATED)	[[28.125,15.0625,13.5625,10.8125,10.5,10.3125,10.1875,9.4375,9.375,8.8125,8.6875,8.6875,8.5625,8.5,8(...TRUNCATED)	9,050

End of preview. Expand in Data Studio

README.md exists but content is empty.

Downloads last month: 48

Size of the auto-converted Parquet files (First 5GB):

Number of rows (First 5GB):

Estimated number of rows:

Models trained or fine-tuned on winglian/codeforces-cot-16k-context-topk64-prepared

winglian/qwen-2.5-codeforces-cot-kd-v1

Text Generation • 8B • Updated Mar 17, 2025 • 3

winglian/codeforces-cot-distill-7b-v0

Text Generation • 8B • Updated May 23, 2025 • 1

winglian/codeforces-cot-distill-7b-v1

Text Generation • 8B • Updated May 23, 2025