year int64 | day string | problem_name string | problem_id string | target_subtask string | instruction_seed string | generation string | uuid string | metadata dict | finish_reason string | code string | code_compiles bool | target_subtask_score float64 | target_subtask_status string | all_subtasks_points float64 | all_subtasks_results list | messages list | embedding sequence |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2,021 | practice | Jelly Flavours | jelly | 06-full | "You are an expert competitive programmer. You will be given a problem statement, test case constrai(...TRUNCATED) | "<think>\nOkay, let's see. I need to find the maximum number of unique jelly flavors Amy can buy by (...TRUNCATED) | e10e6fb8-ccf0-4d09-ba9c-a5ecd06f61cb | {
"completion_tokens": 18889,
"prompt_tokens": 912,
"prompt_tokens_details": null,
"total_tokens": 19801
} | stop | "#include <bits/stdc++.h>\n#include \"jelly.h\"\n#include <vector>\n#include <algorithm>\n#include <(...TRUNCATED) | true | 0 | TLE | 35 | [{"points":0,"problem":"jelly","score":1.0,"score_precision":2,"status":"AC","subtask":"00-samples",(...TRUNCATED) | [{"content":"You are an expert competitive programmer. You will be given a problem statement, test c(...TRUNCATED) | [-0.02890568971633911,-0.007084240205585957,-0.003405269468203187,0.008566492237150669,0.02907630987(...TRUNCATED) |
2,021 | practice | Jelly Flavours | jelly | 06-full | "You are an expert competitive programmer. You will be given a problem statement, test case constrai(...TRUNCATED) | "<think>\nOkay, let's see. The problem is to find the maximum number of unique jelly flavors Amy can(...TRUNCATED) | 491dbebb-92e7-42b7-93d5-8da21ca8fcfd | {
"completion_tokens": 17074,
"prompt_tokens": 912,
"prompt_tokens_details": null,
"total_tokens": 17986
} | stop | "#include <bits/stdc++.h>\n#include \"jelly.h\"\n#include <vector>\n#include <algorithm>\nusing name(...TRUNCATED) | true | 0 | TLE | 20 | [{"points":0,"problem":"jelly","score":1.0,"score_precision":2,"status":"AC","subtask":"00-samples",(...TRUNCATED) | [{"content":"You are an expert competitive programmer. You will be given a problem statement, test c(...TRUNCATED) | [-0.029051046818494797,-0.0075883823446929455,-0.003526969812810421,0.008487379178404808,0.029447454(...TRUNCATED) |
2,021 | practice | Jelly Flavours | jelly | 06-full | "You are an expert competitive programmer. You will be given a problem statement, test case constrai(...TRUNCATED) | "<think>\nOkay, let's see. We need to find the maximum number of unique jelly flavors Amy can buy, g(...TRUNCATED) | e32613db-c94f-4f25-910a-c0cbf89bb37d | {
"completion_tokens": 18553,
"prompt_tokens": 912,
"prompt_tokens_details": null,
"total_tokens": 19465
} | stop | "#include <bits/stdc++.h>\n#include \"jelly.h\"\n#include <vector>\n#include <algorithm>\nusing name(...TRUNCATED) | true | 0 | WA | 0 | [{"points":0,"problem":"jelly","score":1.0,"score_precision":2,"status":"AC","subtask":"00-samples",(...TRUNCATED) | [{"content":"You are an expert competitive programmer. You will be given a problem statement, test c(...TRUNCATED) | [-0.028614982962608337,-0.007791208103299141,-0.00335553172044456,0.008265763521194458,0.02912495285(...TRUNCATED) |
2,021 | practice | Jelly Flavours | jelly | 06-full | "You are an expert competitive programmer. You will be given a problem statement, test case constrai(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where Amy wants to buy as many unique jelly flavors as (...TRUNCATED) | 3a61a52b-268b-4b99-b0ab-a57476c46a50 | {
"completion_tokens": 17318,
"prompt_tokens": 912,
"prompt_tokens_details": null,
"total_tokens": 18230
} | stop | "#include <bits/stdc++.h>\n#include \"jelly.h\"\n#include <vector>\n#include <climits>\n#include <al(...TRUNCATED) | true | 0 | TLE | 35 | [{"points":0,"problem":"jelly","score":1.0,"score_precision":2,"status":"AC","subtask":"00-samples",(...TRUNCATED) | [{"content":"You are an expert competitive programmer. You will be given a problem statement, test c(...TRUNCATED) | [-0.029069727286696434,-0.0072674318216741085,-0.0034619467332959175,0.008599085733294487,0.02955138(...TRUNCATED) |
2,021 | practice | Jelly Flavours | jelly | 06-full | "You are an expert competitive programmer. You will be given a problem statement, test case constrai(...TRUNCATED) | "<think>\nOkay, I need to solve this problem where Amy wants to buy the maximum number of unique jel(...TRUNCATED) | c4a9ae32-37bb-4b4b-8e8d-8dcd69131476 | {
"completion_tokens": 15009,
"prompt_tokens": 912,
"prompt_tokens_details": null,
"total_tokens": 15921
} | stop | "#include <bits/stdc++.h>\n#include <vector>\n#include <algorithm>\n#include \"jelly.h\"\n\nusing na(...TRUNCATED) | true | 0 | TLE | 20 | [{"points":0,"problem":"jelly","score":1.0,"score_precision":2,"status":"AC","subtask":"00-samples",(...TRUNCATED) | [{"content":"You are an expert competitive programmer. You will be given a problem statement, test c(...TRUNCATED) | [-0.02906784787774086,-0.007366121280938387,-0.00347411772236228,0.0086976895108819,0.02935115993022(...TRUNCATED) |
2,021 | practice | Jelly Flavours | jelly | 06-full | "You are an expert competitive programmer. You will be given a problem statement, test case constrai(...TRUNCATED) | "<think>\nOkay, let's see. I need to find the maximum number of unique jelly flavors Amy can buy, gi(...TRUNCATED) | 580a8e7f-33df-4152-9408-007b616c7d41 | {
"completion_tokens": 16228,
"prompt_tokens": 912,
"prompt_tokens_details": null,
"total_tokens": 17140
} | stop | "#include <bits/stdc++.h>\n#include \"jelly.h\"\n#include <vector>\n#include <algorithm>\nusing name(...TRUNCATED) | true | 0 | WA | 0 | [{"points":0,"problem":"jelly","score":1.0,"score_precision":2,"status":"AC","subtask":"00-samples",(...TRUNCATED) | [{"content":"You are an expert competitive programmer. You will be given a problem statement, test c(...TRUNCATED) | [-0.029202952980995178,-0.007123707793653011,-0.0033759719226509333,0.008858607150614262,0.029202952(...TRUNCATED) |
2,021 | practice | Jelly Flavours | jelly | 06-full | "You are an expert competitive programmer. You will be given a problem statement, test case constrai(...TRUNCATED) | "<think>\nOkay, let's see. The problem is to find the maximum number of unique jelly flavors Amy can(...TRUNCATED) | ce820935-3fba-4aa3-a9f3-867a0e45d735 | {
"completion_tokens": 17644,
"prompt_tokens": 912,
"prompt_tokens_details": null,
"total_tokens": 18556
} | stop | "#include <bits/stdc++.h>\n#include \"jelly.h\"\n#include <vector>\n#include <algorithm>\n#include <(...TRUNCATED) | true | 0 | WA | 14 | [{"points":0,"problem":"jelly","score":1.0,"score_precision":2,"status":"AC","subtask":"00-samples",(...TRUNCATED) | [{"content":"You are an expert competitive programmer. You will be given a problem statement, test c(...TRUNCATED) | [-0.028818218037486076,-0.0075904494151473045,-0.00346774491481483,0.008326835930347443,0.0295404437(...TRUNCATED) |
2,021 | practice | Jelly Flavours | jelly | 06-full | "You are an expert competitive programmer. You will be given a problem statement, test case constrai(...TRUNCATED) | "<think>\nOkay, let's see. The problem is to find the maximum number of unique jelly flavors Amy can(...TRUNCATED) | de49ca96-313d-4710-9831-93a4b5ac6ebb | {
"completion_tokens": 15046,
"prompt_tokens": 912,
"prompt_tokens_details": null,
"total_tokens": 15958
} | stop | "#include <bits/stdc++.h>\n#include \"jelly.h\"\n#include <vector>\n#include <unordered_map>\n#inclu(...TRUNCATED) | true | 0 | TLE | 11 | [{"points":0,"problem":"jelly","score":1.0,"score_precision":2,"status":"AC","subtask":"00-samples",(...TRUNCATED) | [{"content":"You are an expert competitive programmer. You will be given a problem statement, test c(...TRUNCATED) | [-0.028750188648700714,-0.007555775810033083,-0.0034255918581038713,0.008440941572189331,0.029599947(...TRUNCATED) |
2,021 | practice | Jelly Flavours | jelly | 06-full | "You are an expert competitive programmer. You will be given a problem statement, test case constrai(...TRUNCATED) | "<think>\nOkay, let's see. I need to solve this problem where Amy wants to buy as many unique jelly (...TRUNCATED) | 24ea6490-8f7e-4794-946f-9058f4cb9589 | {
"completion_tokens": 17717,
"prompt_tokens": 912,
"prompt_tokens_details": null,
"total_tokens": 18629
} | stop | "#include <bits/stdc++.h>\n#include \"jelly.h\"\n#include <vector>\n#include <unordered_map>\n#inclu(...TRUNCATED) | true | 0 | TLE | 35 | [{"points":0,"problem":"jelly","score":1.0,"score_precision":2,"status":"AC","subtask":"00-samples",(...TRUNCATED) | [{"content":"You are an expert competitive programmer. You will be given a problem statement, test c(...TRUNCATED) | [-0.028797393664717674,-0.007595772854983807,-0.0034156201872974634,0.008331989869475365,0.029618559(...TRUNCATED) |
2,021 | practice | Jelly Flavours | jelly | 06-full | "You are an expert competitive programmer. You will be given a problem statement, test case constrai(...TRUNCATED) | "<think>\nOkay, let's see. We need to find the maximum number of unique jelly flavors Amy can buy, g(...TRUNCATED) | 10c6ed60-8fa5-4ef0-920b-242b9f61bf22 | {
"completion_tokens": 16787,
"prompt_tokens": 912,
"prompt_tokens_details": null,
"total_tokens": 17699
} | stop | "#include <bits/stdc++.h>\n#include \"jelly.h\"\n#include <vector>\n#include <algorithm>\nusing name(...TRUNCATED) | true | 0 | TLE | 44 | [{"points":0,"problem":"jelly","score":1.0,"score_precision":2,"status":"AC","subtask":"00-samples",(...TRUNCATED) | [{"content":"You are an expert competitive programmer. You will be given a problem statement, test c(...TRUNCATED) | [-0.029045142233371735,-0.007395753636956215,-0.003391784615814686,0.00841488130390644,0.02989441528(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 4