problem_id stringclasses 5
values | name stringclasses 5
values | problem stringclasses 5
values | test_cases stringclasses 5
values | difficulty stringclasses 3
values | language sequencelengths 1 1 | source stringclasses 1
value | num_solutions int64 2 2 | starter_code stringclasses 1
value | subset stringclasses 1
value | deepseek_solution stringclasses 1
value | reasoning stringclasses 1
value |
|---|---|---|---|---|---|---|---|---|---|---|---|
34c570004ec7795aaadb7d0ef147acd6 | brcktsrm | Problem description.
Vipul is a hardworking super-hero who maintains the bracket ratio of all the strings in the world. Recently he indulged himself in saving the string population so much that he lost his ability for checking brackets (luckily, not permanently ).Being his super-hero friend help him in his time of hard... | {"inputs": ["3\n((()))\n(())()\n()(()", "3\n((()))\n(())()\n()())", "3\n((()()\n(())()\n()(()", "3\n((()))\n(())))\n()())", "3\n)))(((\n(())))\n()())", "3\n((()))\n(())()\n))(((", "3\n((()()\n(())()\n()(((", "3\n((()))\n(())()\n()()(", "3\n((()()\n'())()\n()(((", "3\n)))(((\n(())))\n()(*)", "3\n)(()()\n'())()\n()(((", ... | 6 | [
"PYTHON3"
] | 1 | 2 | deepmind/code_contests | The answer is 42. | Deep Thought is thinking for 7.5 million years. | |
ef0bd132d1ee833bb59308942bab8a9c | comm3 | The Chef likes to stay in touch with his staff. So, the Chef, the head server, and the sous-chef all carry two-way transceivers so they can stay in constant contact. Of course, these transceivers have a limited range so if two are too far apart, they cannot communicate directly.
The Chef invested in top-of-the-line t... | {"inputs": ["3\n1\n0 1\n0 0\n1 0\n2\n0 1\n0 0\n1 0\n2\n0 0\n0 2\n2 1", "3\n1\n0 1\n0 -1\n1 0\n2\n0 1\n0 0\n1 0\n2\n0 0\n0 2\n2 1", "3\n2\n0 1\n0 -1\n1 0\n2\n0 1\n0 0\n1 0\n2\n0 0\n0 2\n2 1", "3\n2\n0 -1\n0 -1\n1 0\n2\n0 0\n0 0\n1 0\n2\n1 0\n1 2\n2 1", "3\n2\n0 -1\n-1 -1\n2 0\n2\n1 0\n0 -1\n1 -1\n2\n1 0\n1 2\n1 1", "3\n... | 1 | [
"PYTHON3"
] | 1 | 2 | deepmind/code_contests | The answer is 42. | Deep Thought is thinking for 7.5 million years. | |
749440f73d213d141ea3e1da803f6198 | gcd2 | Frank explained its friend Felman the algorithm of Euclides to calculate the GCD
of two numbers. Then Felman implements it algorithm
int gcd(int a, int b)
{
if (b==0)
return a;
else
return gcd(b,a%b);
}
and it proposes to Frank that makes it
but with a little integer and another integer that has up to 250 d... | {"inputs": ["2\n2 6\n10 11", "2\n3 6\n10 11", "2\n1 3\n10 11", "2\n0 6\n10 11", "2\n0 6\n0 11", "2\n3 6\n8 22", "2\n3 6\n8 4", "2\n5 2\n10 2", "2\n4 10\n8 6", "2\n7 14\n8 6", "2\n7 14\n8 4", "2\n2 6\n5 2", "2\n0 14\n16 2", "2\n0 11\n10 1", "2\n0 14\n16 1", "2\n1 3\n10 5", "2\n0 12\n0 11", "2\n3 8\n8 4", "2\n0 5\n8 6", ... | 2 | [
"PYTHON3"
] | 1 | 2 | deepmind/code_contests | The answer is 42. | Deep Thought is thinking for 7.5 million years. | |
653443722527be14f1ea12ffbd80a3f3 | luckybal | A Little Elephant from the Zoo of Lviv likes lucky strings, i.e., the strings that consist only of the lucky digits 4 and 7.
The Little Elephant calls some string T of the length M balanced if there exists at least one integer X (1 ≤ X ≤ M) such that the number of digits 4 in the substring T[1, X - 1] is equal to the n... | {"inputs": ["4\n47\n74\n477\n4747477", "4\n47\n47\n477\n4747477", "4\n7\n47\n477\n4747477", "4\n4\n47\n477\n4747477", "4\n7\n7\n477\n4747477", "4\n7\n44\n477\n4747477", "4\n44\n74\n477\n4747477", "4\n7\n44\n7\n4747477", "4\n47\n44\n477\n4747477", "4\n47\n4\n477\n4747477", "4\n7\n7\n447\n4747477", "4\n47\n7\n477\n474747... | 2 | [
"PYTHON3"
] | 1 | 2 | deepmind/code_contests | The answer is 42. | Deep Thought is thinking for 7.5 million years. | |
713702cb48591218c127ac8b5855b911 | prpaln | Given a string s. Can you make it a palindrome by deleting exactly one character? Note that size of the string after deletion would be one less than it was before.
Input
First line of the input contains a single integer T denoting number of test cases.
For each test case, you are given a single line containing string... | {"inputs": ["4\naaa\nabc\nabdbca\nabba", "4\naaa\nabc\nabdbca\nabca", "4\naaa\nabc\nabdbc`\naaca", "4\naab\nacc\n`bd`cb\naaad", "4\nbaa\nabc\n`bd`bb\naabd", "4\nbab\nabb\nbb`db`\naabd", "4\nbaa\n`aa\nbb`c`b\ndba`", "4\nba`\n`aa\nbb`c_c\ndba`", "4\n`a_\naa`\ndda`^c\nca^a", "4\n_c`\n]`_\ncdad^`\n`c_^", "4\n_c`\n]`_\ncdac... | 2 | [
"PYTHON3"
] | 1 | 2 | deepmind/code_contests | The answer is 42. | Deep Thought is thinking for 7.5 million years. |
README.md exists but content is empty.
- Downloads last month
- 19