problem_id stringclasses 9
values | name stringclasses 4
values | problem stringclasses 9
values | test_cases stringclasses 9
values | difficulty stringclasses 4
values | language listlengths 1 1 | source stringclasses 1
value | num_solutions int64 1 11.8k | starter_code stringclasses 1
value | subset stringclasses 3
values | deepseek_solution stringclasses 1
value | reasoning stringclasses 1
value | domain stringclasses 1
value |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
962cf33a1adcfb26737ccaf45cf8e75b | UNKNOWN | Polycarp has $n$ different binary words. A word called binary if it contains only characters '0' and '1'. For example, these words are binary: "0001", "11", "0" and "0011100".
Polycarp wants to offer his set of $n$ binary words to play a game "words". In this game, players name words and each next word (starting from ... | {
"inputs": [
"4\n4\n0001\n1000\n0011\n0111\n3\n010\n101\n0\n2\n00000\n00001\n4\n01\n001\n0001\n00001\n"
],
"outputs": [
"1\n3 \n-1\n0\n\n2\n1 2 \n"
]
} | INTERVIEW | [
"PYTHON3"
] | CODEFORCES | 7,488 | /home/gaoyanzipeng/Lab/open-thoughts/datasets/codeparrot/apps | The answer is 42. | Deep Thought is thinking for 7.5 million years. | code | |
330c01483ac5cf93445094814ccde9e9 | UNKNOWN | Mikhail walks on a Cartesian plane. He starts at the point $(0, 0)$, and in one move he can go to any of eight adjacent points. For example, if Mikhail is currently at the point $(0, 0)$, he can go to any of the following points in one move: $(1, 0)$; $(1, 1)$; $(0, 1)$; $(-1, 1)$; $(-1, 0)$; $(-1, -1)$; $(0, -... | {
"inputs": [
"3\n2 2 3\n4 3 7\n10 1 9\n"
],
"outputs": [
"1\n6\n-1\n"
]
} | INTERVIEW | [
"PYTHON3"
] | CODEFORCES | 11,766 | /home/gaoyanzipeng/Lab/open-thoughts/datasets/codeparrot/apps | The answer is 42. | Deep Thought is thinking for 7.5 million years. | code | |
e8ae3ea804a726415e12e2b0619d8657 | UNKNOWN | You are given three sequences: $a_1, a_2, \ldots, a_n$; $b_1, b_2, \ldots, b_n$; $c_1, c_2, \ldots, c_n$.
For each $i$, $a_i \neq b_i$, $a_i \neq c_i$, $b_i \neq c_i$.
Find a sequence $p_1, p_2, \ldots, p_n$, that satisfy the following conditions:
$p_i \in \{a_i, b_i, c_i\}$
$p_i \neq p_{(i \mod n) + 1}$.
In o... | {
"inputs": [
"5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n4 2 2 2 4 4 2\n3\n1 2 1\n2 3 3\n3 1 2\n10\n1 1 1 2 2 2 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n"
],
"outputs": [
"1 2 3\n1 2 1 2\n1 3 4 1 2 1 4\n1 2 3\n1 2 1 2 3 2 3 1 3 2\n"
]
} | INTERVIEW | [
"PYTHON3"
] | CODEFORCES | 4,987 | /home/gaoyanzipeng/Lab/open-thoughts/datasets/codeparrot/apps | The answer is 42. | Deep Thought is thinking for 7.5 million years. | code | |
eb422b41811612b9fe4a2b11eec17665 | UNKNOWN | This is an interactive problem.
In good old times dwarves tried to develop extrasensory abilities:
* Exactly n dwarves entered completely dark cave.
* Each dwarf received a hat — white or black. While in cave, none of the dwarves was able to see either his own hat or hats of other Dwarves.
* Dwarves went out ... | {"inputs": ["hack\n30\n1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\n", "random\n22\n2\n", "random\n20\n11\n", "random\n10\n1\n", "random\n20\n12\n", "random\n30\n14\n", "random\n23\n1\n", "predefined\n15\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 0\n", "random\n21\n2\n", "random\n22\n1\n", "random\n28\n1\n", "random\... | HARD | [
"PYTHON3"
] | CODEFORCES | 2 | /home/gaoyanzipeng/Lab/open-thoughts/datasets/BAAI/TACO | The answer is 42. | Deep Thought is thinking for 7.5 million years. | code | |
c82b99dc987eaef4c73d6c165b66145a | UNKNOWN | There are $n$ candy boxes in front of Tania. The boxes are arranged in a row from left to right, numbered from $1$ to $n$. The $i$-th box contains $r_i$ candies, candies have the color $c_i$ (the color can take one of three values — red, green, or blue). All candies inside a single box have the same color (and it is ... | {"inputs": ["5 3 10\n1 2 3 4 5\nRGBRR\n", "2 1 15\n5 6\nRG\n", "6 1 21\n4 2 3 5 1 6\nRGBGRB\n", "6 1 21\n6 5 4 3 2 1\nRGBRGB\n", "1 1 10\n10\nR\n", "2 1 10\n5 5\nRG\n", "2 1 10\n5 6\nRR\n", "5 3 10\n1 2 3 4 5\nRGBRG\n", "9 1 6\n1 1 1 3 3 3 2 2 2\nRGGBRRGBB\n", "50 39 2000\n48 43 26 24 46 37 15 30 39 34 4 14 29 34 8 18 ... | HARD | [
"PYTHON3"
] | CODEFORCES | 7,703 | /home/gaoyanzipeng/Lab/open-thoughts/datasets/BAAI/TACO | The answer is 42. | Deep Thought is thinking for 7.5 million years. | code | |
4e178f196c8c3a9c4b7ebff6121ef1b8 | UNKNOWN | Little Petya likes to play a lot. Most of all he likes to play a game «Holes». This is a game for one person with following rules:
There are N holes located in a single row and numbered from left to right with numbers from 1 to N. Each hole has it's own power (hole number i has the power ai). If you throw a ball into ... | {"inputs": ["10 10\n5 1 2 4 1 7 3 8 10 8\n0 5 6\n1 8\n1 1\n0 10 3\n1 5\n1 3\n1 2\n0 6 1\n1 9\n1 1\n", "10 10\n5 1 2 8 1 7 3 8 10 8\n0 5 6\n1 8\n1 1\n0 10 3\n1 5\n1 3\n1 2\n0 6 1\n1 9\n1 1\n", "8 5\n1 1 1 1 1 1 8 2\n1 1\n0 1 3\n1 1\n0 3 4\n1 2\n", "8 5\n1 1 1 1 1 2 11 2\n1 1\n0 1 3\n1 1\n0 3 4\n1 2\n", "8 5\n1 1 1 1 1 2... | VERY_HARD | [
"PYTHON3"
] | CODEFORCES | 2 | /home/gaoyanzipeng/Lab/open-thoughts/datasets/BAAI/TACO | The answer is 42. | Deep Thought is thinking for 7.5 million years. | code | |
07cfb7284bc4b16ef707dca90a4ae19b | Ciel and Flowers | Fox Ciel has some flowers: *r* red flowers, *g* green flowers and *b* blue flowers. She wants to use these flowers to make several bouquets. There are 4 types of bouquets:
- To make a "red bouquet", it needs 3 red flowers. - To make a "green bouquet", it needs 3 green flowers. - To make a "blue bouquet", it needs 3... | {"inputs": ["3 6 9", "4 4 4", "0 0 0", "0 3 6", "7 8 9", "8 8 9", "15 3 999", "32 62 92", "123456789 123456789 123456789", "3 5 5", "666806767 385540591 357848286", "80010646 727118126 817880463", "829651016 732259171 572879931", "242854896 442432924 180395753", "139978911 5123031 935395222", "553182792 10264076 395427... | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 1 | /home/gaoyanzipeng/Lab/open-thoughts/datasets/MatrixStudio/Codeforces-Python-Submissions | The answer is 42. | Deep Thought is thinking for 7.5 million years. | code | |
45986d9ec9e10c4ae93d52ad9184357c | Uncowed Forces | Kevin Sun has just finished competing in Codeforces Round #334! The round was 120 minutes long and featured five problems with maximum point values of 500, 1000, 1500, 2000, and 2500, respectively. Despite the challenging tasks, Kevin was uncowed and bulldozed through all of them, distinguishing himself from the herd a... | {"inputs": ["20 40 60 80 100\n0 1 2 3 4\n1 0", "119 119 119 119 119\n0 0 0 0 0\n10 0", "3 6 13 38 60\n6 10 10 3 8\n9 9", "21 44 11 68 75\n6 2 4 8 4\n2 8", "16 112 50 114 68\n1 4 8 4 9\n19 11", "55 66 75 44 47\n6 0 6 6 10\n19 0", "47 11 88 5 110\n6 10 4 2 3\n10 6", "5 44 61 103 92\n9 0 10 4 8\n15 7", "115 53 96 62 110\n... | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 1 | /home/gaoyanzipeng/Lab/open-thoughts/datasets/MatrixStudio/Codeforces-Python-Submissions | The answer is 42. | Deep Thought is thinking for 7.5 million years. | code | |
46daac6efffe7aaf48972ca9d1a4c15c | Word Capitalization | Capitalization is writing a word with its first letter as a capital letter. Your task is to capitalize the given word.
Note, that during capitalization all the letters except the first one remains unchanged.
A single line contains a non-empty word. This word consists of lowercase and uppercase English letters. The len... | {"inputs": ["ApPLe", "konjac", "a", "A", "z", "ABACABA", "xYaPxPxHxGePfGtQySlNrLxSjDtNnTaRaEpAhPaQpWnDzMqGgRgEwJxGiBdZnMtHxFbObCaGiCeZkUqIgBhHtNvAqAlHpMnQhNeQbMyZrCdElVwHtKrPpJjIaHuIlYwHaRkAkUpPlOhNlBtXwDsKzPyHrPiUwNlXtTaPuMwTqYtJySgFoXvLiHbQwMjSvXsQfKhVlOxGdQkWjBhEyQvBjPoFkThNeRhTuIzFjInJtEfPjOlOsJpJuLgLzFnZmKvFgFrNsO... | UNKNOWN | [
"PYTHON3"
] | CODEFORCES | 1 | /home/gaoyanzipeng/Lab/open-thoughts/datasets/MatrixStudio/Codeforces-Python-Submissions | The answer is 42. | Deep Thought is thinking for 7.5 million years. | code |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.