problem string | deepseek_reasoning string | deepseek_solution string | ground_truth_solution null | domain string | source string | test_cases string | starter_code string | messages list | num_tokens int64 | generation string | level_num int64 | token_length int64 | avg_tokens_per_line float64 | norm_level float64 | norm_len float64 | norm_line float64 | final_score float64 | __index_level_0__ int64 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
"A young boy John is playing with eight triangular panels. These panels are all regular triangles of(...TRUNCATED) | "Okay, I need to solve this problem where I have to count the number of distinct octahedra that can (...TRUNCATED) | "To solve this problem, we need to determine the number of distinct octahedra that can be formed usi(...TRUNCATED) | null | code | code_contests | "{\"inputs\": [\"blue blue blue blue blue blue blue blue\\nred blue blue blue blue blue blue blue\\n(...TRUNCATED) | [{"content":"A young boy John is playing with eight triangular panels. These panels are all regular (...TRUNCATED) | 32,412 | "Okay, I need to solve this problem where I have to count the number of distinct octahedra that can (...TRUNCATED) | 5 | 23,912 | 25.411265 | 1 | 1 | 0.003295 | 0.900329 | 1,437 | |
"Sasha lives in a big happy family. At the Man's Day all the men of the family gather to celebrate i(...TRUNCATED) | "Okay, let's try to solve this problem. Hmm. So the problem is about constructing a list of candidat(...TRUNCATED) | "To solve this problem, we need to generate a list of candidates such that each man in Sasha's famil(...TRUNCATED) | null | code | code_contests | "{\"inputs\": [\"3 2\\n1 2\\n2 3\\n1 2 1\\n\", \"4 2\\n1 2\\n3 4\\n1 2 3 3\\n\", \"1 0\\n1\\n\", \"4(...TRUNCATED) | [{"content":"Sasha lives in a big happy family. At the Man's Day all the men of the family gather to(...TRUNCATED) | 25,628 | "Okay, let's try to solve this problem. Hmm. So the problem is about constructing a list of candidat(...TRUNCATED) | 5 | 19,423 | 24.15796 | 1 | 0.810742 | 0.003102 | 0.862459 | 915 | |
"Two thieves (who strongly “recommended” us not to reveal their names) has broken into the centr(...TRUNCATED) | "Okay, let's see. I need to solve this problem where two thieves are splitting the loot, and I have (...TRUNCATED) | "To solve this problem, we need to determine the minimum value of loot that two thieves must leave b(...TRUNCATED) | null | code | taco | "{\"inputs\": [\"4\\n0 2 0 1\\n\", \"5\\n1000000 1 1 1 1\\n\", \"5\\n3 3 3 3 3\\n\"], \"outputs\": [(...TRUNCATED) | [{"content":"Two thieves (who strongly “recommended” us not to reveal their names) has broken in(...TRUNCATED) | 28,774 | "Okay, let's see. I need to solve this problem where two thieves are splitting the loot, and I have (...TRUNCATED) | 5 | 19,303 | 19.61687 | 1 | 0.805683 | 0.002405 | 0.861377 | 9,499 | |
"In Burger Town new burger restaurants will be opened! Concretely, $N$ restaurants will open in $N$ (...TRUNCATED) | "Okay, let's try to understand the problem here. So Tim is trying to maximize his happiness by choos(...TRUNCATED) | "To solve this problem, we need to determine the maximum happiness Tim can achieve by visiting burge(...TRUNCATED) | null | code | taco | "{\"inputs\": [\" 3\\n 2 -5 1\\n 1 5 1\\n 3 5 1\\n\", \" 4\\n 4 10 0\\n 1 -5 0\\n 3 0 10\\n 2 10 0\\(...TRUNCATED) | [{"content":"In Burger Town new burger restaurants will be opened! Concretely, $N$ restaurants will (...TRUNCATED) | 28,123 | "Okay, let's try to understand the problem here. So Tim is trying to maximize his happiness by choos(...TRUNCATED) | 5 | 19,170 | 21.15894 | 1 | 0.800076 | 0.002642 | 0.860279 | 9,873 | |
"Read problem statements in [Hindi], [Bengali], [Mandarin Chinese], [Russian], and [Vietnamese] as w(...TRUNCATED) | "Okay, let's try to tackle this problem. Hmm. So the problem is about finding the number of possible(...TRUNCATED) | "To solve this problem, we need to determine the number of possible initial sequences `a` such that (...TRUNCATED) | null | code | taco | "{\"inputs\": [\"4\\n1\\n-1 1\\n1\\n0 0\\n2\\n4 3 1 4\\n3\\n5 3 7 10 5 10\"], \"outputs\": [\"0\\n1\(...TRUNCATED) | [{"content":"Read problem statements in [Hindi], [Bengali], [Mandarin Chinese], [Russian], and [Viet(...TRUNCATED) | 28,222 | "Okay, let's try to tackle this problem. Hmm. So the problem is about finding the number of possible(...TRUNCATED) | 5 | 18,356 | 13.111429 | 1 | 0.765757 | 0.001406 | 0.853292 | 12,151 | |
"The Autonomous Car Manufacturer (ACM) needs to design algorithms to control their cars. One particu(...TRUNCATED) | "Okay, let's tackle this problem. Hmm, the task is to find the maximum safety factor when the ACM ca(...TRUNCATED) | "To solve this problem, we need to determine the maximum achievable safety factor for an autonomous (...TRUNCATED) | null | code | taco | "{\"inputs\": [\"4 5 100\\n0 10 10\\n1 10 5\\n1 20 35\\n2 2 18\\n2 40 50\\n\", \"4 5 100\\n0 30 10\\(...TRUNCATED) | [{"content":"The Autonomous Car Manufacturer (ACM) needs to design algorithms to control their cars.(...TRUNCATED) | 26,341 | "Okay, let's tackle this problem. Hmm, the task is to find the maximum safety factor when the ACM ca(...TRUNCATED) | 5 | 18,326 | 29.558065 | 1 | 0.764493 | 0.003931 | 0.853292 | 9,572 | |
"Once, two trees forgot their place and started to grow into each other. One of the trees grew from (...TRUNCATED) | "Okay, so I need to solve this programming problem. Let's read the problem carefully.\n\nThe problem(...TRUNCATED) | "To solve this problem, we need to determine if the given edges can be partitioned into two trees: a(...TRUNCATED) | null | code | taco | "{\"inputs\": [\"5\\n1 2\\n2 5\\n2 3\\n1 3\\n3 5\\n4 5\\n3 4\\n1 3\\n\", \"3\\n1 2\\n1 2\\n1 3\\n1 3(...TRUNCATED) | [{"content":"Once, two trees forgot their place and started to grow into each other. One of the tree(...TRUNCATED) | 25,395 | "Okay, so I need to solve this programming problem. Let's read the problem carefully.\n\nThe problem(...TRUNCATED) | 5 | 18,262 | 15.489398 | 1 | 0.761794 | 0.001771 | 0.852536 | 12,698 | |
"Pasha is a young technician, nevertheless, he has already got a huge goal: to assemble a PC. The fi(...TRUNCATED) | "Okay, let's try to figure out how to solve this problem. So, the task is to find the minimal number(...TRUNCATED) | "To solve this problem, we need to determine the minimum number of horizontal (red) and vertical (bl(...TRUNCATED) | null | code | code_contests | "{\"inputs\": [\"4\\n2 1\\n3 2\\n2 3\\n1 2\\n\", \"4\\n2 2\\n2 4\\n4 2\\n4 4\\n\", \"4\\n2 1\\n3 2\\(...TRUNCATED) | [{"content":"Pasha is a young technician, nevertheless, he has already got a huge goal: to assemble (...TRUNCATED) | 25,609 | "Okay, let's try to figure out how to solve this problem. So, the task is to find the minimal number(...TRUNCATED) | 5 | 18,188 | 21.860577 | 1 | 0.758674 | 0.002749 | 0.85201 | 4,436 | |
"Every modern car has an odometer. It measures how far the car has traveled, and is used, among othe(...TRUNCATED) | "Okay, I need to solve this problem. Let's read the problem statement carefully.\n\nThe task is to c(...TRUNCATED) | "To solve this problem, we need to determine if the odometer of a car has been tampered with based o(...TRUNCATED) | null | code | taco | "{\"inputs\": [\"3\\n2017 4 0\\n2017 8 12000\\n2018 8 42000\\n\", \"3\\n2017 4 0\\n2017 8 12000\\n20(...TRUNCATED) | [{"content":"Every modern car has an odometer. It measures how far the car has traveled, and is used(...TRUNCATED) | 30,589 | "Okay, I need to solve this problem. Let's read the problem statement carefully.\n\nThe task is to c(...TRUNCATED) | 5 | 17,875 | 12.86897 | 1 | 0.745478 | 0.001369 | 0.849233 | 11,433 | |
"Alice is playing a game with permutations of size N. \n\nShe selects a random *permutation* P of s(...TRUNCATED) | "Okay, I need to solve this problem where Alice plays a game with permutations, and we have to find (...TRUNCATED) | "To solve this problem, we need to determine the expected number of indices Alice will visit in a pe(...TRUNCATED) | null | code | taco | {"inputs": ["3\n1\n2\n3\n"], "outputs": ["1\n250000003\n388888893\n"]} | [{"content":"Alice is playing a game with permutations of size N. \n\nShe selects a random *permuta(...TRUNCATED) | 29,677 | "Okay, I need to solve this problem where Alice plays a game with permutations, and we have to find (...TRUNCATED) | 5 | 17,755 | 23.673333 | 1 | 0.740419 | 0.003028 | 0.848387 | 14,050 |
End of preview. Expand
in Data Studio
README.md exists but content is empty.
- Downloads last month
- 8